A new preconditioning technique for solving large sparse linear systems
From MaRDI portal
Publication:808620
DOI10.1016/0024-3795(91)90383-8zbMATH Open0732.65030OpenAlexW1986310461WikidataQ127932335 ScholiaQ127932335MaRDI QIDQ808620FDOQ808620
Authors: Miron Tismenetsky 
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
Recommendations
- scientific article; zbMATH DE number 176166
- scientific article; zbMATH DE number 3850364
- Preconditioned techniques for solving large sparse linear systems arising from the discretization of the elliptic partial differential equations
- Iterative methods and preconditioning for large and sparse linear systems with applications
- scientific article; zbMATH DE number 2051077
- Preconditioning techniques for large linear systems: A survey
- Iterative methods for solving sparse linear systems with a parallel preconditioner
- Numerical performance of preconditioning techniques for the solution of complex sparse linear systems
- Sparse Preconditioned Iterative Methods for Dense Linear Systems
- scientific article; zbMATH DE number 4092656
efficiencysparsitycomparisonNumerical experimentssymmetric positive definite matricesreorderingapproximate LDU factorizationconjugate gradient method with preconditioning
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Inertia characteristics of self-adjoint matrix polynomials
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- The effect of ordering on preconditioned conjugate gradients
- A class of first order factorization methods
- Title not available (Why is that?)
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- A numerical study of various algorithms related to the preconditioned conjugate gradient method
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- A robust incomplete Choleski-conjugate gradient algorithm
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical comparison of preconditionings for large sparse finite element problems
- An iterative method for large systems of linear structural equations
Cited In (25)
- A Two-step Preconditioning Method for Solving Dense Linear Systems
- Inexact Newton method for the solution of eigenproblems arising in hydrodynamic temporal stability analysis
- Preconditioning techniques for large linear systems: A survey
- Rational approximation preconditioners for sparse linear systems.
- Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics
- New preconditioners applied to linear programming and the compressive sensing problems
- Title not available (Why is that?)
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- An algebraic solver for the Oseen problem with application to hemodynamics
- A new preconditioning ILUCG method for solving sparse ill-conditioned linear equations
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
- Title not available (Why is that?)
- Combination of numerical and structured approaches to the construction of a second-order incomplete triangular factorization in parallel preconditioning methods
- ILU preconditioners for nonsymmetric saddle-point matrices with application to the incompressible Navier-Stokes equations
- Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices
- Title not available (Why is that?)
- On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
- A robust ILU with pivoting based on monitoring the growth of the inverse factors
- Title not available (Why is that?)
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- MPI+OpenMP parallel implementation of conjugate gradient method with factored implicit preconditioners
- The preconditioned variational methods for solving large linear systems
- A Rational Function Preconditioner For Indefinite Sparse Linear Systems
- Two-level block preconditioners for contact problems
- An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
This page was built for publication: A new preconditioning technique for solving large sparse linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808620)
