Parallel algorithms for solving linear systems with sparse triangular matrices
DOI10.1007/s00607-009-0066-3zbMath1179.65038OpenAlexW2045618500MaRDI QIDQ1044221
Publication date: 11 December 2009
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://publikationen.bibliothek.kit.edu/1000009203/420966
numerical examplespreconditioningparallel computationalgorithms shared memory architecturedistributed memory architecturesmultilevel incomplete LU factorizationsparse triangular matrices
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- A new pivoting strategy for Gaussian elimination
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
- Preconditioning Highly Indefinite and Nonsymmetric Matrices
- The university of Florida sparse matrix collection
- A multilevel Crout ILU preconditioner with pivoting and row permutation
- Symmetric Permutations for I-matrices to Delay and Avoid Small Pivots During Factorization
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Crout Versions of ILU for General Sparse Matrices
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- Multilevel ILU With Reorderings for Diagonal Dominance
- Multilevel Preconditioners Constructed From Inverse-Based ILUs