On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
Publication:5317648
DOI10.1137/S0895479803386354zbMath1097.65046WikidataQ114073909 ScholiaQ114073909MaRDI QIDQ5317648
Chuen-Liang Chen, Wen-Yang Lin
Publication date: 19 September 2005
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
comparison of methodsnumerical examplesparallel computationelimination treeparallel Cholesky factorizationfill-preserving sparse matrixJess-Kees algorithmminimum completion cost
Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (1)
Uses Software
This page was built for publication: On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations