Nested-Dissection Orderings for Sparse LU with Partial Pivoting

DOI10.1137/S0895479801385037zbMath1011.65012MaRDI QIDQ2784394

Igor Brainman, Sivan Toledo

Publication date: 23 April 2002

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

zbMATH Keywords

algorithmnumerical examplessparse matricesGaussian eliminationLU factorizationpartial pivotingvertex separatorsfill-minimization ordering techniquenested-dissectionwide separators

Mathematics Subject Classification ID

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

Related Items (9)

Domain decomposition based \({\mathcal H}\)-LU preconditioning ⋮ Accelerating implicit integration in multi-body dynamics using GPU computing ⋮ Solving a Bernoulli type free boundary problem with random diffusion ⋮ Computing the null space of finite element problems ⋮ Hierarchical matrix techniques for a domain decomposition algorithm ⋮ Dual multilevel optimization ⋮ A survey of direct methods for sparse linear systems ⋮ Factoring matrices with a tree-structured sparsity pattern ⋮ $\mathcal{H}$-Matrix Based Second Moment Analysis for Rough Random Fields and Finite Element Discretizations

Uses Software

• SPOOLES

This page was built for publication: Nested-Dissection Orderings for Sparse LU with Partial Pivoting