Loading...
Please wait, while we are loading the content...
Similar Documents
A dynamic data model for parallel adaptive pde solvers (1995).
| Content Provider | CiteSeerX |
|---|---|
| Author | Hertzberger, B. Serazzi, G. Birken, Klaus Helf, Clemens |
| Abstract | . A general method for designing parallel PDE solvers on dynamic data structures is presented. The method is validated by the parallelization of a real-world example code, a finite-volume Euler solver based on arbitrary polyhedral control volumes with adaptive remeshing. The resulting grid database is highly dynamic throughout the solution process, which enforces a layer-based strategy to handle complex, distributed data structures. The positive impacts of the object-oriented paradigm for (parallel) numeric computing are shown, although the general parallelization method is not restricted to OO programs. An example computation will be presented. 1 Parallel Adaptive Algorithms Adaptive algorithms for the numerical solution of PDE problems using unstructured grids require complex, dynamic data structures [2]. References provide a common technique for representing the connectivity relations between certain data objects (e.g. triangles and nodes in a finite-element context). The actual im... |
| File Format | |
| Publisher Date | 1995-01-01 |
| Access Restriction | Open |
| Subject Keyword | Dynamic Data Model Parallel Adaptive Pde Solver Dynamic Data Structure Finite-volume Euler Solver Arbitrary Polyhedral Control Volume Connectivity Relation Common Technique Numerical Solution Object-oriented Paradigm Certain Data Object General Parallelization Method Data Structure Parallel Pde Solver General Method Unstructured Grid Positive Impact Adaptive Remeshing Finite-element Context Pde Problem Example Computation Solution Process Oo Program Parallel Adaptive Algorithm Adaptive Algorithm Grid Database Layer-based Strategy Real-world Example Code Actual Im |
| Content Type | Text |
