Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
From MaRDI portal
Publication:3880191
Cited in
(36)- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Matrix reordering using multilevel graph coarsening for ILU preconditioning
- ParILUT---A New Parallel Threshold ILU Factorization
- Enhancing performance and robustness of ILU preconditioners by blocking and selective transposition
- LU-decomposition and numerical structure for solving large sparse nonsymmetric linear systems
- Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Implementing cholesky factorization for interior point methods of linear programming
- Avoiding breakdown in incomplete factorizations in low precision arithmetic
- Drop tolerance preconditioning for incompressible viscous flow
- Generalized extended to the limit sparse factorization techniques for solving unsymmetric finite element systems
- Experimental study of ILU preconditioners for indefinite matrices
- Implementation strategies for block recursive factorizations
- A chordal preconditioner for large-scale optimization
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
- Efficient Solution of a Sparse Non-symmetric System of Linear Equations
- Construction and efficient implementation of implicit preconditioning methods. II
- Construction and efficient implementation of implicit preconditioning methods. I
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
- Specifying a Gaussian Markov Random Field by a Sparse Cholesky Triangle
- Local Procrustes for manifold embedding: a measure of embedding quality and embedding algorithms
- Diagonal threshold techniques in robust multi-level ILU preconditioners for general sparse linear systems
- An efficient method for constructing an ILU preconditioner for solving large sparse nonsymmetric linear systems by the GMRES method
- Solving linear finite element systems by normalized approximate matrix factorization semi-direct methods
- Some ways of parallel implementation of the conjugate gradient method with an implicit factorized preconditioner
- The importance of structure in incomplete factorization preconditioners
- The use of second degree normalized implicit conjugate gradient methods for solving large sparse systems of linear equations
- Towards a cost-effective ILU preconditioner with high level fill
- A multiplicative Schwarz method with active subdomains for transient convection-diffusion problems
- A robust ILU with pivoting based on monitoring the growth of the inverse factors
- Explicit preconditioned iterative methods for solving large unsymmetric finite element systems
- Explicit approximate inverse preconditioning techniques
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- MPI+OpenMP parallel implementation of conjugate gradient method with factored implicit preconditioners
- Splitting dense columns of constraint matrix in interior point methods for large scale linear programming11The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France$ef:22A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-…
This page was built for publication: Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3880191)
