Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization
From MaRDI portal
Publication:1402303
DOI10.1023/A:1022032830105zbMath1030.65018OpenAlexW1603047746MaRDI QIDQ1402303
Publication date: 20 August 2003
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022032830105
parallel computingelimination treesparse matrix orderingfill-reducing orderingCholesky factorizetioncolumn task graph
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)