scientific article; zbMATH DE number 176382
From MaRDI portal
Publication:4035530
[For the entire collection see Zbl 0753.00017.] A method for solving triangular systems of algebraic equations with a sparse matrix structure is presented. The partitioning principle is adopted with introducing a best ordering. The optimality of the algorithm for the case when the inverse is represented as a product of a few sparse factors is proved. The solver is applied to several problems where sparse solvers occur. The algorithm is implemented on a Connection Machine.
Recommendations
- Optimal Parallel Solution of Sparse Triangular Systems
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
- A Fast Reordering Algorithm for Parallel Sparse Triangular Solution
- Parallel algorithms for solving linear systems with sparse triangular matrices
- scientific article; zbMATH DE number 554768
Cited in
(17)- Parallel ICCG on a hierarchical memory multiprocessor -- Addressing the triangular solve bottleneck
- A synchronization-free algorithm for parallel sparse triangular solves
- Improving the numerical stability and the performance of a parallel sparse solver
- A parallel multithreaded sparse triangular linear system solver
- Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors
- scientific article; zbMATH DE number 434542 (Why is no real title available?)
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
- Fast Gauss-Doolittle matrix triangulation
- An algorithm for solving certain large scale sparse linear systems
- A Fast Reordering Algorithm for Parallel Sparse Triangular Solution
- A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS – II TRIANGULAR SYSTEM SOLVERS AND MATRIX MULTIPLICATION
- Fast and Efficient Parallel Solution of Sparse Linear Systems
- Stability of the Partitioned Inverse Method for Parallel Solution of Sparse Triangular Systems
- scientific article; zbMATH DE number 554768 (Why is no real title available?)
- Triangular Decomposition Methods for Solving Reducible Nonlinear Systems of Equations
- Efficient parallel Gauss-Doolittle matrix triangulation
- Optimal Parallel Solution of Sparse Triangular Systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035530)