A Greedy Strategy for Coarse-Grid Selection
DOI10.1137/060654062zbMath1154.65016OpenAlexW2113448328MaRDI QIDQ3525943
Publication date: 23 September 2008
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060654062
performancealgorithmnumerical experimentsiterative methodsalgebraic multigridincomplete LU factorizationgeneralized minimal residual methodalgebraic preconditionersalgebraic recursive multilevel solvermultilevel block factorization
Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items
Uses Software