On the Minimum FLOPs Problem in the Sparse Cholesky Factorization

DOI10.1137/130912438zbMath1298.65047arXiv1303.1754OpenAlexW3098043076WikidataQ57558433 ScholiaQ57558433MaRDI QIDQ2877076

Robert Luce, Esmond G. Ng

Publication date: 21 August 2014

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

Full work available at URL: https://arxiv.org/abs/1303.1754

zbMATH Keywords

computational complexitysparse Cholesky factorizationminimum operation countminimum fill

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (4)

Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations ⋮ Reordering Strategy for Blocking Optimization in Sparse Linear Solvers ⋮ A survey of direct methods for sparse linear systems ⋮ Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work

This page was built for publication: On the Minimum FLOPs Problem in the Sparse Cholesky Factorization