Search for dissertations about: "Adaptive Grid Methods"
Showing result 1 - 5 of 35 swedish dissertations containing the words Adaptive Grid Methods.
-
1. Duality-based adaptive finite element methods with application to time-dependent problems
Abstract : To simulate real world problems modeled by differential equations, it is often not sufficient to consider and tackle a single equation. Rather, complex phenomena are modeled by several partial dierential equations that are coupled to each other. READ MORE
-
2. Iterative and Adaptive PDE Solvers for Shared Memory Architectures
Abstract : Scientific computing is used frequently in an increasing number of disciplines to accelerate scientific discovery. Many such computing problems involve the numerical solution of partial differential equations (PDE). READ MORE
-
3. Online trajectory planning and observer based control
Abstract : The main body of this thesis consists of four appended papers. The first two consider different aspects of the trajectory planning problem, while the last two deal with observer design for mobile robotic and Euler-Lagrange systems respectively. READ MORE
-
4. On Cooperative Surveillance, Online Trajectory Planning and Observer Based Control
Abstract : The main body of this thesis consists of six appended papers. In the first two, different cooperative surveillance problems are considered. The second two consider different aspects of the trajectory planning problem, while the last two deal with observer design for mobile robotic and Euler-Lagrange systems respectively. READ MORE
-
5. Efficient Partitioning of Dynamic Structured Grid Hierarchies
Abstract : This thesis aims at decreasing execution time for large-scale structured adaptive mesh refinement (SAMR) applications executing on general parallel computers. The key contributions are (1) A conceptual dynamically adaptive meta-partitioner able to select and configure an appropriate partitioning technique, based on application and computer state, and (2) A characterization of new and existing domain-based partitioners, enabling a mapping from application and computer state onto appropriate partitioners, and (3) Sketched scalable solutions, expressed in terms of natural regions and expert algorithms, for the problem to efficiently partition large-scale SAMR applications with deep grid hierarchies executing on general parallel computers, and (4) A software partitioning tool Nature+Fable, implementing the greater parts of these sketched scalable solutions and engineered as part of the meta-partitioner. READ MORE