On the development of PSBLAS-based parallel two-level Schwarz preconditioners
DOI10.1016/j.apnum.2007.01.006zbMath1123.65029OpenAlexW1991540805WikidataQ58832851 ScholiaQ58832851MaRDI QIDQ2382749
Daniela di Serafino, Salvatore Filippone, Pasqua D'Ambra
Publication date: 4 October 2007
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2007.01.006
numerical examplesmultilevel algorithmsSchwarz preconditionerssmoothed aggregationparallel softwarecomputational kernelssparse BLAS
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15)
Related Items
Uses Software
Cites Work
- \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
- Why restricted additive Schwarz converges faster than additive Schwarz
- Sparse matrix multiplication package (SMMP)
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- A black-box iterative solver based on a two-level Schwarz method
- An Algebraic Convergence Theory for Restricted Additive Schwarz Methods Using Weighted Max Norms
- Algebraic Multigrid Domain and Range Decomposition (AMG-DD/AMG-RD)
- Level 3 basic linear algebra subprograms for sparse matrices
- Domain Decomposition Algorithms for Indefinite Elliptic Problems
- PSBLAS
- A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems
- Algorithm 832
- An overview of the sparse basic linear algebra subprograms
- An arbitrary Lagrangian-Eulerian computing method for all flow speeds
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item