Sparsity-Preserving Difference of Positive Semidefinite Matrix Representation of Indefinite Matrices
From MaRDI portal
Abstract: We consider the problem of writing an arbitrary symmetric matrix as the difference of two positive semidefinite matrices. We start with simple ideas such as eigenvalue decomposition. Then, we develop a simple adaptation of the Cholesky that returns a difference-of-Cholesky representation of indefinite matrices. Heuristics that promote sparsity can be applied directly to this modification.
This page was built for publication: Sparsity-Preserving Difference of Positive Semidefinite Matrix Representation of Indefinite Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6277799)
