Parallel Cholesky factorization on orthogonal multiprocessors

DOI10.1016/0167-8191(92)90080-QzbMath0746.65030OpenAlexW2091390750MaRDI QIDQ1186181

Przemysław Stpiczyński

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90080-q

zbMATH Keywords

asymptotic efficiencytime complexitydata allocation strategiesorthogonal multiprocessorsparallel Cholesky factorization algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

Near optimal Cholesky factorization on orthogonal multiprocessors.

This page was built for publication: Parallel Cholesky factorization on orthogonal multiprocessors