New factorization codes for sparse, symmetric and positive definite matrices

DOI10.1007/BF01931221MaRDI QIDQ4181188zbMATH OpenFDO

Authors Niels Munksgaard

Publication date 1979

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01931221

zbMATH Keywords

Computational EfficiencyExecution TimeFactorizationSparse Symmetric and Positive Definite MatricesStorage Requirements

Mathematics Subject Classification ID

Factorization of matrices (15A23) Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Some Design Features of a Sparse Matrix Code
• The elimination form of the inverse and its application to linear programming

Cited in

(1)

• Detection of near-singularity in Cholesky and LDL^ T factorizations

Describes a project that uses

Uses Software

• MA28

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4181188)