Collocation coarse approximation in multigrid

DOI10.1137/08074461XMaRDI QIDQ3162124zbMATH OpenOpenAlexFDO

Authors Roman Wienands, Irad Yavneh

Publication date 19 October 2010

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/08074461x

zbMATH Keywords

algorithmscomputational complexitynumerical experimentsfinite volume methoditerative methodsmultigriddiscontinuous coefficientsPetrov-Galerkin methoddiffusion problemscoarse approximation

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Boundary value problems for second-order elliptic equations (35J25) PDEs with low regular coefficients and/or low regular data (35R05) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite volume methods for boundary value problems involving PDEs (65N08)

Recommendations

• Coarse spaces by algebraic multigrid: multigrid convergence and upscaling error estimates
• Coarse-Grid Correction for Nonelliptic and Singular Perturbation Problems
• General highly accurate algebraic coarsening
• Coarse-grid selection using simulated annealing
• scientific article; zbMATH DE number 1254443

Cited in

(4)

• Collocation on uniform grids
• Reducing parallel communication in algebraic multigrid through sparsification
• A practical framework for the construction of prolongation operators for multigrid based on canonical basis functions
• Reducing operator complexity of Galerkin coarse-grid operators with machine learning

This page was built for publication: Collocation coarse approximation in multigrid

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