Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization

DOI10.1137/S0895479897319313zbMath0937.65032MaRDI QIDQ4702236

Padma Raghavan, Esmond G. Ng

Publication date: 24 November 1999

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

zbMATH Keywords

performancenumerical examplesGaussian eliminationsparse Cholesky factorizationminimum degreesparse matrix orderingminimum deficiencygreedy ordering

Mathematics Subject Classification ID

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

Related Items

Flexible incomplete Cholesky factorization with multi‐parameters to control the number of nonzero elements in preconditioners