Sökning: "stable algorithm"
Visar resultat 1 - 5 av 107 avhandlingar innehållade orden stable algorithm.
1. Stable iterated function systems
Sammanfattning : The purpose of this thesis is to generalize the growing theory of iterated function systems (IFSs). Earlier, hyperbolic IFSs with finitely many functions have been studied extensively. Also, hyperbolic IFSs with infinitely many functions have been studied. In this thesis, more general IFSs are studied. LÄS MER
2. High Order Local Radial Basis Function Methods for Atmospheric Flow Simulations
Sammanfattning : Since the introduction of modern computers, numerical methods for atmospheric simulations have routinely been applied for weather prediction, and in the last fifty years, there has been a steady improvement in the accuracy of forecasts. Accurate numerical models of the atmosphere are also becoming more important as researchers rely on global climate simulations to assess and understand the impact of global warming. LÄS MER
3. Brownian Dynamics Simulations of Macromolecules : Algorithm Development and Polymers under Confinement
Sammanfattning : In this thesis I have used computer simulations to study the structure and dynamics of grafted polymers during confinement. These systems are of importance for understanding e.g. colloidal stability and surface coatings. LÄS MER
4. Stable FEM-FDTD Hybrid Method for Maxwell's Equations
Sammanfattning : In this thesis edge elements are applied to solve several problems in computational electromagnetics. In particular, a hybrid scheme joining the Finite Element Method (FEM) and the Finite-Difference Time-Domain (FDTD) algorithm is developed, tested and exploited. LÄS MER
5. Snarks : Generation, coverings and colourings
Sammanfattning : For a number of unsolved problems in graph theory such as the cycle double cover conjecture, Fulkerson's conjecture and Tutte's 5-flow conjecture it is sufficient to prove them for a family of graphs called snarks. Named after the mysterious creature in Lewis Carroll's poem, a \emph{snark} is a cyclically 4-edge connected 3-regular graph of girth at least 5 which cannot be properly edge coloured using three colours. LÄS MER