Concurrent banded Cholesky factorization on workstation networks using PVM

DOI10.1016/0167-8191(94)00079-PMaRDI QIDQ673940zbMATH OpenOpenAlexFDO

Authors Pasqua D'Ambra, G. Giunta

Publication date 28 February 1997

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)00079-p

zbMATH Keywords

Cholesky factorizationPVMBanded matricesBlock algorithmsLinear AlgebraParallel programmingWorkstation networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 278837
• Concurrent Cholesky factorization of positive definite banded Hermitian-matrices
• The design, implementation, and evaluation of a symmetric banded linear solver for distributed-memory parallel computers
• Parallel sparse Cholesky factorization on a shared memory multiprocessor

Cited in

(2)

• Concurrent Cholesky factorization of positive definite banded Hermitian-matrices
• Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming.

Describes a project that uses

Uses Software

• PVM

This page was built for publication: Concurrent banded Cholesky factorization on workstation networks using PVM

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