Fast and Efficient Parallel Solution of Sparse Linear Systems

DOI10.1137/0222073zbMath0790.65018OpenAlexW1994602871MaRDI QIDQ4277539

Pan, Victor Y., John H. Reif

Publication date: 23 June 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

sequential algorithmsparse linear systemsparallel algorithmparallel complexitygraph separatorsgeneralized nested dissection

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Minimum Cuts in Surface Graphs, Maximum matchings in planar graphs via Gaussian elimination, Parallel computation of a Krylov matrix for a sparse and structured input, Additive preconditioning and aggregation in matrix computations, Transformations of matrix structures work again, Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs, Randomized preprocessing of homogeneous linear systems of equations, Efficient parallel factorization and solution of structured and unstructured linear systems