scientific article; zbMATH DE number 176382

MaRDI QIDQ4035530zbMATHFDO

Authors Fernando L. Alvarado, Robert Schreiber

Publication date 18 May 1993

zbMATH Keywords

sparse matrixparallel algorithmstriangular systemsbest ordering

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

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

(13)

• Fast and Efficient Parallel Solution of Sparse Linear Systems
• Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors
• Triangular Decomposition Methods for Solving Reducible Nonlinear Systems of Equations
• A synchronization-free algorithm for parallel sparse triangular solves
• Parallel ICCG on a hierarchical memory multiprocessor -- Addressing the triangular solve bottleneck
• Fast Gauss-Doolittle matrix triangulation
• scientific article; zbMATH DE number 434542 (Why is no real title available?)
• Efficient parallel Gauss-Doolittle matrix triangulation
• A parallel multithreaded sparse triangular linear system solver
• Improving the numerical stability and the performance of a parallel sparse solver
• A Fast Reordering Algorithm for Parallel Sparse Triangular Solution
• An algorithm for solving certain large scale sparse linear systems
• scientific article; zbMATH DE number 554768 (Why is no real title available?)

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)