Improving the Run Time and Quality of Nested Dissection Ordering

DOI10.1137/S1064827596300656zbMath0922.65018OpenAlexW2068683191MaRDI QIDQ4210424

Edward Rothberg, Bruce A. Hendrickson

Publication date: 21 September 1998

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

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

zbMATH Keywords

numerical examplessparse matrix factorizationminimum degreenested dissectionsparse matrix ordering

Mathematics Subject Classification ID

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

Related Items

Parallel preconditioners for monolithic solution of shear bands ⋮ Decomposition in multidimensional Boolean-optimization problems with sparse matrices ⋮ Domain decomposition based \({\mathcal H}\)-LU preconditioning ⋮ A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices ⋮ On sparse matrix orderings in interior point methods ⋮ A fast direct solver for elliptic problems on general meshes in 2D ⋮ Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices ⋮ Solving a Bernoulli type free boundary problem with random diffusion ⋮ The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures ⋮ Dual multilevel optimization ⋮ A survey of direct methods for sparse linear systems ⋮ Optimal block-tridiagonalization of matrices for coherent charge transport ⋮ The impact of high-performance computing in the solution of linear systems: Trends and problems ⋮ PMORSy: parallel sparse matrix ordering software for fill-in minimization ⋮ $\mathcal{H}$-Matrix Based Second Moment Analysis for Rough Random Fields and Finite Element Discretizations

Uses Software

• Harwell-Boeing sparse matrix collection