Parallel ordering using edge contraction

DOI10.1016/S0167-8191(97)00018-5zbMath0896.65028OpenAlexW2001509766MaRDI QIDQ1391204

Padma Raghavan

Publication date: 22 July 1998

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(97)00018-5

zbMATH Keywords

performanceorderingparallel algorithmssparse linear systemssparse matrix factorizationfill-innested dissectionparallel nested dissection

Mathematics Subject Classification ID

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

Related Items (2)

A survey of direct methods for sparse linear systems ⋮ The impact of high-performance computing in the solution of linear systems: Trends and problems

This page was built for publication: Parallel ordering using edge contraction