A recursive formulation of Cholesky factorization of a matrix in packed storage

DOI10.1145/383738.383741zbMath1070.65524OpenAlexW1986334759WikidataQ113309792 ScholiaQ113309792MaRDI QIDQ5460997

Jerzy Wasniewski, B. S. Andersen, Fred G. Gustavson

Publication date: 20 July 2005

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/383738.383741

Mathematics Subject Classification ID

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

Related Items (2)

Linear Systems Solvers for Distributed-Memory Machines with GPU Accelerators ⋮ Recursive formulation of the matrix Padé approximation in packed storage

Uses Software

• ATLAS
• LAPACK
• GEMM
• BLAS
• mctoolbox
• PHiPAC

This page was built for publication: A recursive formulation of Cholesky factorization of a matrix in packed storage