The Minimum Degree Ordering with Constraints
From MaRDI portal
Publication:4733299
DOI10.1137/0910069zbMath0683.65025OpenAlexW2066818671MaRDI QIDQ4733299
Publication date: 1989
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0910069
sensitivityGaussian eliminationreorderingminimum degree algorithmmatrix orderingsymmetric sparse matricesparallel eliminationconstrained minimum degree ordering scheme
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry ⋮ A survey of direct methods for sparse linear systems ⋮ Efficient Covariance Approximations for Large Sparse Precision Matrices
This page was built for publication: The Minimum Degree Ordering with Constraints
