The scalability of parallel computers for sparse QR factorisation

MaRDI QIDQ2730482zbMATH OpenFDO

Authors David J. Miron

Publication date 8 August 2001

Published in The ANZIAM Journal (Search for Journal in Brave)

zbMATH Keywords

multifrontal methodparallel computationQR factorizationsparse linear systems

Mathematics Subject Classification ID

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

Recommendations

• Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
• scientific article; zbMATH DE number 1226271
• scientific article; zbMATH DE number 991427
• scientific article; zbMATH DE number 4184919
• scientific article; zbMATH DE number 1163095

Cited in

(2)

• The impact of high-performance computing in the solution of linear systems: Trends and problems
• Analyzing scalability of Neville elimination

This page was built for publication: The scalability of parallel computers for sparse QR factorisation

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