Patch-adaptive multilevel iteration

DOI10.1007/BF02510250MaRDI QIDQ1371678zbMATH OpenOpenAlexFDO

Authors H. Lötzbeyer, Ulrich Rüde

Publication date 14 April 1998

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02510250

zbMATH Keywords

adaptive mesh refinementalgorithmdomain decompositioniterative methodsnumerical examplespatch-adaptive multigrid method

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Review text

The present paper is devoted to an adaptive mesh construction for elliptic differential equations. The authors introduce virtual global grids as a systematic way to view the adaptive mesh refinement. These ideas are modified and extended to obtain a practical highly efficient implementation, to construct an adaptive system with as few restrictions as possible, and to stay as close as possible to the performance which can be obtained on a uniform mesh data structure. The basic idea of the proposed technique is based on using patches, and the constructed patch-adaptive multigrid method is intended to be a compromise between rigid uniform mesh multigrid and adaptive multigrid based on unstructured grids. The idea of patch-adaptive multigrid is the partitioning of the grid layers in a number of non-overlapping subgrids, called patches. Each patch has its own uniform mesh of grid points. Within the patch this permits a dense storage format for all grid points in arrays such that numerical algorithms can run efficiently. Some computational experiments are demonstrated on a model problem to illustrate the features of the proposed method. Experiments show that the patch-adaptive approach requires less points when the patch-size become smaller (or, by extrapolation, when an unstructured grid is used), but this advantage is only significant for a small problem size, when accuracy is low.

Recommendations

• Optimal Multilevel Iterative Methods for Adaptive Grids
• scientific article; zbMATH DE number 1069510
• scientific article; zbMATH DE number 1759987
• Multiscale algorithm with patches of finite elements

Cites work

• Adaptive mesh refinement for hyperbolic partial differential equations
• CACHING IN WITH MULTIGRID ALGORITHMS: PROBLEMS IN TWO DIMENSIONS
• scientific article; zbMATH DE number 434719 (Why is no real title available?)
• scientific article; zbMATH DE number 3958638 (Why is no real title available?)
• scientific article; zbMATH DE number 46300 (Why is no real title available?)
• scientific article; zbMATH DE number 735221 (Why is no real title available?)
• scientific article; zbMATH DE number 736320 (Why is no real title available?)
• Iterative Methods by Space Decomposition and Subspace Correction
• Multi-Level Adaptive Solutions to Boundary-Value Problems

Cited in

(5)

• Contractive local adaptive smoothing based on Dörfler's marking in a-posteriori-steered \(p\)-robust multigrid solvers
• Residual error based adaptive mesh refinement with the non-intrusive patch algorithm
• scientific article; zbMATH DE number 1069510 (Why is no real title available?)
• A patch/subdomain iteration framework and algorithm class for error indicator and mesh reliability calculations
• Multiscale algorithm with patches of finite elements

This page was built for publication: Patch-adaptive multilevel iteration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1371678)