A new preconditioning technique for solving large sparse linear systems
From MaRDI portal
Publication:808620
DOI10.1016/0024-3795(91)90383-8zbMath0732.65030OpenAlexW1986310461WikidataQ127932335 ScholiaQ127932335MaRDI QIDQ808620
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(91)90383-8
comparisonefficiencysymmetric positive definite matricesNumerical experimentsreorderingsparsityapproximate LDU factorizationconjugate gradient method with preconditioning
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Two-Level Block Preconditioners for Contact Problems, Combination of numerical and structured approaches to the construction of a second-order incomplete triangular factorization in parallel preconditioning methods, Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices, ILU Preconditioners for Nonsymmetric Saddle-Point Matrices with Application to the Incompressible Navier--Stokes Equations, Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives, MPI+OpenMP реализация метода сопряженных градиентов с факторизованными неявными предобусловливателями, Inexact Newton method for the solution of eigenproblems arising in hydrodynamic temporal stability analysis, Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics, A robust ILU with pivoting based on monitoring the growth of the inverse factors, Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization, An Algebraic Solver for the Oseen Problem with Application to Hemodynamics, Preconditioning techniques for large linear systems: A survey, An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
Cites Work
- Inertia characteristics of self-adjoint matrix polynomials
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- The effect of ordering on preconditioned conjugate gradients
- A robust incomplete Choleski-conjugate gradient algorithm
- A numerical study of various algorithms related to the preconditioned conjugate gradient method
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- A class of first order factorization methods
- Numerical comparison of preconditionings for large sparse finite element problems
- An iterative method for large systems of linear structural equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
