scientific article; zbMATH DE number 4202054

MaRDI QIDQ3351171zbMATH OpenFDO

Authors Alex Pothen, Chunguangh Sun

Publication date 1990

zbMATH Keywords

Cholesky factorcompact data structuresfilled graphsskeleton clique treesparse, symmetric positive definite matrix

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Data structures (68P05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35)

Recommendations

• A compact row storage scheme for Cholesky factors using elimination trees
• scientific article; zbMATH DE number 554762
• scientific article; zbMATH DE number 4109938
• Elimination Structures for Unsymmetric Sparse LU Factors
• A Tree Model for Sparse Symmetric Indefinite Matrix Factorization

Cited in

(4)

• Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
• COSMO: a conic operator splitting method for convex conic problems
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 554765 (Why is no real title available?)

This page was built for publication:

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