Premium
Hierarchical hybrid grids: data structures and core algorithms for multigrid
Author(s) -
Bergen Benjamin Karl,
Hülsemann Frank
Publication year - 2004
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/nla.382
Subject(s) - multigrid method , grid , computer science , computational science , hierarchy , flexibility (engineering) , algorithm , unstructured grid , data structure , core (optical fiber) , theoretical computer science , parallel computing , mathematics , partial differential equation , geometry , mathematical analysis , telecommunications , statistics , economics , market economy , programming language
For many scientific and engineering applications, it is often desirable to use unstructured grids to represent complex geometries. Unfortunately, the data structures required to represent discretizations on such grids typically result in extremely inefficient performance on current high‐performance architectures. Here, we introduce a grid framework using patch‐wise, regular refinement that retains the flexibility of unstructured grids, while achieving performance comparable to that seen with purely structured grids. This approach leads to a grid hierarchy suitable for use with geometric multigrid methods, thus combining asymptotically optimal algorithms with extremely efficient data structures to obtain a powerful technique for large scale simulations. Copyright © 2004 John Wiley & Sons, Ltd.