Sökning: "Rigorous computations"
Visar resultat 1 - 5 av 8 avhandlingar innehållade orden Rigorous computations.
1. Computational dynamics – real and complex
Sammanfattning : The PhD thesis considers four topics in dynamical systems and is based on one paper and three manuscripts.In Paper I we apply methods of interval analysis in order to compute the rigorous enclosure of rotation number. LÄS MER
2. The Lorenz attractor exists
Sammanfattning : We prove that the Lorenz equations support a strange attractor, as conjectured by Edward Lorenz in 1963. We also prove that the attractor is robust, i.e., it persists under small perturbations of the coefficients in the underlying differential equations. LÄS MER
3. Mining for Meaning : using computational text analysis for social inquiry
Sammanfattning : People interpret their surroundings through associations, determining what they perceive as belonging or not belonging together. For instance, one individual may view immigrants as a beneficial addition to the domestic labor market, while another may perceive them as a threat to job opportunities for native citizens. LÄS MER
4. A proof of a resolvent estimate for plane flow by new analytical and numerical techniques
Sammanfattning : This thesis concerns stability of plane Couette flow in three space dimensions for the incompressible Navier-Stokes equations. We present new results for the resolvent corresponding to this flow. Previously, analytical bounds of the resolvent have been derived in parts of the unstable half-plane. LÄS MER
5. A Numerical Study of the Lorenz and Lorenz-Stenflo Systems
Sammanfattning : In 1998 the Swedish mathematician Warwick Tucker used rigorous interval arithmetic and normal form theory to prove the existence of a strange attractor in the Lorenz system. In large parts, that proof consists of computations implemented and performed on a computer. LÄS MER
