Name
Abstract | ||
|---|---|---|
Amongst other properties, PDE solvers for large scale problems should be flexible, as they are time consuming to write, and obviously run time efficient. We report on the experiences with a regularity centred approach for grid based PDE software that aims to combine geometric flexibility with run time efficiency. An unstructured coarse grid that describes the problem geometry is repeatedly subdivided in a regular fashion to yield a hierarchy of grids on which the approximation is sought. By construction, the grid hierarchy is well suited for multilevel methods. The gain in run time performance that results from the exploitation of the patch wise regularity of the refined grids over standard implementations will be illustrated. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/11558958_107 | PARA |
Keywords | Field | DocType |
pde solvers,patch wise regularity,pde software,unstructured coarse grid,refined grid,run time efficiency,grid hierarchy,run time performance,efficient pde solvers,regularity centred approach,time consuming | Computer science,Parallel algorithm,Unstructured grid,Parallel computing,Theoretical computer science,Implementation,Software,Memory access pattern,Hierarchy,Poisson problem,Grid | Conference |
Volume | ISSN | ISBN |
3732 | 0302-9743 | 3-540-29067-2 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frank Hülsemann | 1 | 41 | 6.72 |
| Benjamin Bergen | 2 | 3 | 1.01 |