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