Reducing Complexity in Parallel Algebraic Multigrid Preconditioners
DOI10.1137/040615729zbMath1102.65034MaRDI QIDQ5470508
Jeffrey J. Heys, Hans De Sterck, Ulrike Meier Yang
Publication date: 31 May 2006
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc891614/
computational complexity; finite difference method; numerical examples; Poisson equation; Krylov subspace methods; large unstructured sparse linear systems; parallel coarsening algorithms
65N55: Multigrid methods; domain decomposition for boundary value problems involving PDEs
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
35J05: Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation
65Y05: Parallel numerical computation
65N06: Finite difference methods for boundary value problems involving PDEs
Related Items
Uses Software