Incomplete Cholesky Factorizations with Limited Memory
From MaRDI portal
conjugate gradient iterationsincomplete Cholesky factorizationlarge-scale trust region subproblemsmemory constraintsnumerical resultspositive definite systemspreconditionerssparse matrices
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Recommendations
Cited in
(56)- A comparison of projective and direct solvers for finite elements in elastostatics
- An incomplete Cholesky factorization for dense symmetric positive definite matrices
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Preconditioning complex symmetric linear systems
- Scalable algorithms for three-field mixed finite element coupled poromechanics
- A supernodal block factorized sparse approximate inverse for non-symmetric linear systems
- Preconditioning techniques for large linear systems: A survey
- A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems
- Preconditioning regularized least squares problems arising from high-resolution image reconstruction from low-resolution frames
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Block preconditioning for fault/fracture mechanics saddle-point problems
- A robust adaptive algebraic multigrid linear solver for structural mechanics
- Volumetric density-equalizing reference map with applications
- Enhanced relaxed physical factorization preconditioner for coupled poromechanics
- Scalable preconditioning for the stabilized contact mechanics problem
- Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming
- The image-based multiscale multigrid solver, preconditioner, and reduced order model
- A high performance level-block approximate LU factorization preconditioner algorithm
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- A solution procedure for constrained eigenvalue problems and its application within the structural finite-element code NOSA-ITACA
- Fast methods for computing centroidal Voronoi tessellations
- Interior-point solver for large-scale quadratic programming problems with bound constraints
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- On the capabilities of the polynomial chaos expansion method within SFE analysis -- an overview
- Low-density incomplete \(LDL^T\) factorizations
- A scalable preconditioning framework for stabilized contact mechanics with hydraulically active fractures
- Parallel Jacobi-Davidson with block FSAI preconditioning and controlled inner iterations.
- Two-level block preconditioners for contact problems
- An active set truncated Newton method for large-scale bound constrained optimization
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- Implementing a smooth exact penalty function for equality-constrained nonlinear optimization
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- Multi-level incomplete factorizations for the iterative solution of nonlinear finite element problems
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- GMRES-accelerated ADMM for quadratic objectives
- A novel algebraic multigrid approach based on adaptive smoothing and prolongation for ill-conditioned systems
- Flexible incomplete Cholesky factorization with multi-parameters to control the number of nonzero elements in preconditioners
- Dependence on the reaction in porous convection
- A simple geometric method for navigating the energy landscape of centroidal Voronoi tessellations
- An adjoint approach to identification in electromyography: modeling and first order optimality conditions
- Efficient preconditioned iterative linear solvers for 3-D magnetostatic problems using edge elements
- A relaxed physical factorization preconditioner for mixed finite element coupled poromechanics
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
- Parallel Processing and Applied Mathematics
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- An efficient implementation of the ensemble Kalman filter based on an iterative Sherman-Morrison formula
- Efficient solution for Galerkin-based polynomial chaos expansion systems
- A new numerical \textit{mesoscopic scale} one-domain approach solver for free fluid/porous medium interaction
- The importance of structure in incomplete factorization preconditioners
- Insertion of triangulated surfaces into a meccano tetrahedral discretization by means of mesh refinement and optimization procedures
- Avoiding breakdown in incomplete factorizations in low precision arithmetic
- A multigrid reduction framework for domains with symmetries
- Numerical solution of an identification problem in electromyography
- Developing robust incomplete Cholesky factorizations in half precision arithmetic
- Leveraging GPU batching for scalable nonlinear programming through massive Lagrangian decomposition
- A preconditioned iteration method for solving saddle point problems
Describes a project that uses
Uses Software
This page was built for publication: Incomplete Cholesky Factorizations with Limited Memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702369)
