S+: Efficient 2D Sparse LU Factorization on Parallel Machines

DOI10.1137/S0895479898337385zbMath0967.65037OpenAlexW1981404639MaRDI QIDQ2706257

Tao Yang, Kai Shen, Xiangmin Jiao

Publication date: 19 March 2001

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479898337385

zbMATH Keywords

parallel computationsparse matricesLU factorizationGaussian elimination with partial pivotingelimination forestsasynchronous computation schedulingsupernode amalgamation and partitioning

Mathematics Subject Classification ID

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

Related Items (2)

On the row merge tree for sparse LU factorization with partial pivoting ⋮ A survey of direct methods for sparse linear systems

This page was built for publication: S⁺: Efficient 2D Sparse LU Factorization on Parallel Machines