Collocation Coarse Approximation in Multigrid

DOI10.1137/08074461XzbMath1200.65101OpenAlexW2005789613MaRDI QIDQ3162124

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 complexityfinite volume methoddiscontinuous coefficientsnumerical experimentsiterative methodsmultigridPetrov-Galerkin methoddiffusion problemscoarse approximation

Mathematics Subject Classification ID

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

Related Items (2)

A practical framework for the construction of prolongation operators for multigrid based on canonical basis functions ⋮ Reducing Parallel Communication in Algebraic Multigrid through Sparsification

This page was built for publication: Collocation Coarse Approximation in Multigrid