New factorization codes for sparse, symmetric and positive definite matrices

DOI10.1007/BF01931221zbMath0397.65026MaRDI QIDQ4181188

Niels Munksgaard

Publication date: 1979

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

FactorizationComputational EfficiencyExecution TimeSparse Symmetric and Positive Definite MatricesStorage Requirements

Mathematics Subject Classification ID

Related Items (1)

Detection of near-singularity in Cholesky and \(LDL^ T\) factorizations

Uses Software

• MA28

Cites Work

• Unnamed Item
• The Elimination form of the Inverse and its Application to Linear Programming
• Some Design Features of a Sparse Matrix Code

This page was built for publication: New factorization codes for sparse, symmetric and positive definite matrices