An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization

DOI10.1137/S0895479892236921zbMath0810.65023OpenAlexW2089790965MaRDI QIDQ4313366

John R. Gilbert, Barry W. Peyton, Esmond G. Ng

Publication date: 16 November 1994

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

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

zbMATH Keywords

graph algorithmdisjoint set unionstorage allocationCholesky factorsparse matrix factorizationssparse symmetric positive definite matrixrow and column count algorithmzero/nonzero structure

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

An efficient analyse phase for element problems, A survey of direct methods for sparse linear systems, Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes, PCx: an interior-point code for linear programming, On constructing the elimination tree