scientific article; zbMATH DE number 833700

MaRDI QIDQ4860189zbMATH OpenFDO

Authors Ramesh C. Agarwal, Fred G. Gustavson, Mahesh V. Joshi, Mohammad Zubair

Publication date 12 May 1996

zbMATH Keywords

algorithmCholesky factorizationdistributed memory parallel machineslarge banded matricesperformancestrong scalability

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• An Algorithm-by-Blocks for SuperMatrix Band Cholesky Factorization
• The design, implementation, and evaluation of a symmetric banded linear solver for distributed-memory parallel computers
• scientific article; zbMATH DE number 833702
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Block-Cholesky for parallel processing

Cited in

(6)

• A note on the parallel Cholesky factorization of wide banded matrices
• Efficient and optimal parallel algorithms for Cholesky decomposition
• Supercomputer environment for recursive matrix algorithms
• An Algorithm-by-Blocks for SuperMatrix Band Cholesky Factorization
• The design, implementation, and evaluation of a symmetric banded linear solver for distributed-memory parallel computers
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization

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 Q4860189)