Efficient logarithmic time parallel algorithms for the Cholesky decomposition and Gram-Schmidt process

DOI10.1016/S0167-8191(05)80144-9zbMath0737.65017MaRDI QIDQ1179241

Bar-On Ilan

Publication date: 26 June 1992

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmQR factorizationGram-Schmidt methodCholesky decompositionsymmetric positive definite matrix

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)

Related Items (1)

On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver

This page was built for publication: Efficient logarithmic time parallel algorithms for the Cholesky decomposition and Gram-Schmidt process