Algorithm 695

DOI10.1145/114697.116806MaRDI QIDQ4371763zbMATH OpenOpenAlexFDO

Authors Elizabeth Eskow, Robert B. Schnabel

Publication date 18 March 1998

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toms/1991-17/

zbMATH Keywords

Cholesky factorizationGerschgorin boundsnonpositive definitesoftware

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Packaged methods for numerical algorithms (65Y15)

Cited in

(4)

• A method for constrained multiobjective optimization based on SQP techniques
• A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
• Developing robust incomplete Cholesky factorizations in half precision arithmetic
• Distribution modeling and simulation of gene expression data

Describes a project that uses

Uses Software

• Algorithm 695

This page was built for publication: Algorithm 695

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