Computing row and column counts for sparse \(QR\) and \(LU\) factorization

DOI10.1023/A:1021943902025zbMath0992.65016OpenAlexW1510491715MaRDI QIDQ5960909

No author found.

Publication date: 19 September 2002

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021943902025

zbMATH Keywords

algorithmssparse matrixLU factorizationsparse Cholesky factorizationQR factorizationpartial pivotingcolumn elimination treedisjoint set unionrow and column counts

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

An efficient analyse phase for element problems ⋮ On the row merge tree for sparse LU factorization with partial pivoting ⋮ A survey of direct methods for sparse linear systems

This page was built for publication: Computing row and column counts for sparse \(QR\) and \(LU\) factorization