Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations
DOI10.2478/S11533-013-0248-2zbMATH Open1273.65046OpenAlexW2072360788WikidataQ114041289 ScholiaQ114041289MaRDI QIDQ360337FDOQ360337
Krassimir Georgiev, Zahari Zlatev
Publication date: 26 August 2013
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s11533-013-0248-2
Recommendations
- Preconditioners for least squares problems by LU factorization
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- scientific article; zbMATH DE number 1911052
- A Purely Algebraic Approach to Preconditioning Based on Hierarchical LU Factorizations
- Iterative Methods and Preconditioners for Systems of Linear Equations
- Preconditioned iterative methods for solving linear least squares problems
- Multiple solution of systems of linear algebraic equations by an iterative method with recomputed preconditioners
- Solving linear systems. An analysis of matrix prefactorization iterative methods
- scientific article; zbMATH DE number 1254370
- Iterative ILU preconditioners for linear systems and eigenproblems
Gaussian eliminationnumerical resultsiterative methodspreconditionersapproximate LU-factorizationsKrylov subspace algorithmssystems of linear equations
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)
Cites Work
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Accuracy and Stability of Numerical Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- A new family of block methods
- Estimates in quadratic formulas
- Recent computational developments in Krylov subspace methods for linear systems
- Title not available (Why is that?)
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
- A comparison of some GMRES-like methods
- The computation of bounds for the norm of the error in the conjugate gradient algorithm
- A stopping criterion for the conjugate gradient algorithm in a finite element method framework
- Stopping criteria for iterations in finite element methods
- Accelerating with rank-one updates
- On error estimation in the conjugate gradient method and why it works in finite precision computations
- Numerical experiments in computing bounds for the norm of the error in the preconditioned conjugate gradient algorithm
- Error estimation in preconditioned conjugate gradients
- Stopping criteria for iterative methods: applications to PDE's
- On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique
- Use of Iterative Refinement in the Solution of Sparse Linear Systems
- Title not available (Why is that?)
- Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations
Cited In (4)
- Explicit Runge-Kutta methods combined with advanced versions of the Richardson extrapolation
- Title not available (Why is that?)
- Generalized augmented matrix preconditioning approach and its application to iterative solution of ill-conditioned algebraic systems
- Preconditioners for least squares problems by LU factorization
Uses Software
This page was built for publication: Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360337)
