Parallel algorithms for solving linear systems with sparse triangular matrices

DOI10.1007/S00607-009-0066-3MaRDI QIDQ1044221zbMATH OpenOpenAlexFDO

Authors Jan Mayer

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

zbMATH Keywords

numerical examplespreconditioningparallel computationalgorithms shared memory architecturedistributed memory architecturesmultilevel incomplete LU factorizationsparse triangular matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
• Optimal Parallel Solution of Sparse Triangular Systems
• Parallel Solution of Triangular Systems on Distributed-Memory Multiprocessors
• scientific article; zbMATH DE number 554768
• Parallel algorithms for sparse triangular system solution

Cites work

• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A multilevel Crout ILU preconditioner with pivoting and row permutation
• A new pivoting strategy for Gaussian elimination
• Crout Versions of ILU for General Sparse Matrices
• Multilevel ILU With Reorderings for Diagonal Dominance
• Multilevel Preconditioners Constructed From Inverse-Based ILUs
• On algorithms for permuting large entries to the diagonal of a sparse matrix
• Preconditioning highly indefinite and nonsymmetric matrices
• Symmetric Permutations for I-matrices to Delay and Avoid Small Pivots During Factorization
• The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
• The University of Florida sparse matrix collection

Cited in

(13)

• Fine-grained parallel incomplete LU factorization
• A survey of direct methods for sparse linear systems
• scientific article; zbMATH DE number 176382 (Why is no real title available?)
• Linear algebra software for large-scale accelerated multicore computing
• A Fast Reordering Algorithm for Parallel Sparse Triangular Solution
• A parallel multithreaded sparse triangular linear system solver
• Static Scheduling with Load Balancing for Solving Triangular Band Linear Systems on Multicore Processors
• Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors
• Parallel ICCG on a hierarchical memory multiprocessor -- Addressing the triangular solve bottleneck
• scientific article; zbMATH DE number 434542 (Why is no real title available?)
• Efficient parallel Gauss-Doolittle matrix triangulation
• A hybrid multithreaded direct sparse triangular solver
• Factors impacting performance of multithreaded sparse triangular solve

Describes a project that uses

Uses Software

• ILU++
• ILUPACK
• SparseMatrix
• METIS

This page was built for publication: Parallel algorithms for solving linear systems with sparse triangular matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044221)