Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
From MaRDI portal
Publication:3880191
DOI10.1145/355887.355893zbMath0438.65035MaRDI QIDQ3880191
Publication date: 1980
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355887.355893
preconditioning; linear equations; conjugate gradients; sparse; positive definite; fixed space factorization; numerical drop tolerance modification
15A23: Factorization of matrices
15B57: Hermitian, skew-Hermitian, and related matrices
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
Related Items
Efficient Solution of a Sparse Non-symmetric System of Linear Equations, A robust ILU with pivoting based on monitoring the growth of the inverse factors, 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-…, Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors, The use of second degree normalized implicit conjugate gradient methods for solving large sparse systems of linear equations, Solving linear finite element systems by normalized approximate matrix factorization semi-direct methods, Generalized extended to the limit sparse factorization techniques for solving unsymmetric finite element systems, A survey of the advances in the exploitation of the sparsity in the solution of large problems, Towards a cost-effective ILU preconditioner with high level fill, A chordal preconditioner for large-scale optimization, Implementation strategies for block recursive factorizations, Construction and efficient implementation of implicit preconditioning methods. II, Construction and efficient implementation of implicit preconditioning methods. I, Explicit preconditioned iterative methods for solving large unsymmetric finite element systems, Experimental study of ILU preconditioners for indefinite matrices, Explicit approximate inverse preconditioning techniques, \(LU\)-decomposition and numerical structure for solving large sparse nonsymmetric linear systems, An efficient method for constructing an ILU preconditioner for solving large sparse nonsymmetric linear systems by the GMRES method, Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization, Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods, Unnamed Item, Optimization of unconstrained functions with sparse hessian matrices-newton-type methods, Specifying a Gaussian Markov Random Field by a Sparse Cholesky Triangle, Implementing cholesky factorization for interior point methods of linear programming, Drop tolerance preconditioning for incompressible viscous flow
