scientific article; zbMATH DE number 833700

zbMATH Open0836.65036MaRDI QIDQ4860189FDOQ4860189

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

Publication date: 12 May 1996

Title of this publication is not available (Why is that?)

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
• Publication:4860191
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Block-Cholesky for parallel processing

zbMATH Keywords

performanceCholesky factorizationalgorithmstrong scalabilitydistributed memory parallel machineslarge banded 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) Numerical computation of matrix norms, conditioning, scaling (65F35)

Cited In (4)

• An Algorithm-by-Blocks for SuperMatrix Band Cholesky Factorization
• A note on the parallel Cholesky factorization of wide banded matrices
• Efficient and optimal parallel algorithms for Cholesky decomposition
• 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)