scientific article; zbMATH DE number 440657

MaRDI QIDQ3140816zbMATH OpenFDO

Authors Ilan Bar-On

Publication date 28 November 1993

zbMATH Keywords

Cholesky decompositiondivide and conquer parallel algorithmGram-Schmidt processiterative methodparallel computersQR factorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Recommendations

• Efficient logarithmic time parallel algorithms for the Cholesky decomposition and Gram-Schmidt process
• Highly Parallel Sparse Cholesky Factorization
• scientific article; zbMATH DE number 641618
• Parallel complexities and computations of cholesky's decomposition and QR factorization
• A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices

Cited in

(6)

• Efficient logarithmic time parallel algorithms for the Cholesky decomposition and Gram-Schmidt process
• On the Gauss, Cholesky and Householder algorithms
• On the Cholesky factorization of the Gram matrix of multivariate functions
• Parallel complexities and computations of cholesky's decomposition and QR factorization
• Optimal algorithms of Gram-Schmidt type
• Divide-and-conquer strategy with Cholesky's factorization for inverting symmetric positive definite matrices

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