An incomplete Cholesky factorization for dense symmetric positive definite matrices
From MaRDI portal
Recommendations
- Parallel Processing and Applied Mathematics
- Incomplete Cholesky Factorizations with Limited Memory
- MODIFLED INCOMPLETE CHOLESKY FACTORIZATION PRECONDITIONERS FOR A SYMMETRIC POSITIVE DEFINITE MATRIX
- Low-density incomplete \(LDL^T\) factorizations
- On the incomplete Cholesky decomposition of a class of perturbed matrices
Cited in
(15)- Low-density incomplete \(LDL^T\) factorizations
- Preconditioning techniques for large linear systems: A survey
- Partitioned solver for strongly coupled fluid-structure interaction
- Convex optimization techniques in compliant assembly simulation
- Parallel Processing and Applied Mathematics
- On the stability of the incomplete Cholesky decomposition for a singular perturbed problem, where the coefficient matrix is not an M‐matrix
- A kernel-based core growing clustering method
- An efficient computation of the inverse of the single layer matrix for the resolution of the linear elasticity problem in BEM
- Cholesky decomposition of a positive semidefinite matrix with known kernel
- The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- On the incomplete Cholesky decomposition of a class of perturbed matrices
- A projected gradient algorithm for solving the maxcut SDP relaxation
- On partial Cholesky factorization and a variant of quasi-Newton preconditioners for symmetric positive definite matrices
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
This page was built for publication: An incomplete Cholesky factorization for dense symmetric positive definite matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587315)
