Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations

DOI10.2478/s11533-013-0248-2zbMath1273.65046OpenAlexW2072360788WikidataQ114041289 ScholiaQ114041289MaRDI QIDQ360337

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

zbMATH Keywords

numerical resultsiterative methodsGaussian eliminationpreconditionerssystems of linear equationsapproximate LU-factorizationsKrylov subspace algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05) Preconditioners for iterative methods (65F08)

Related Items (1)

Explicit Runge-Kutta methods combined with advanced versions of the Richardson extrapolation

Uses Software

• mctoolbox
• CGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of some GMRES-like methods
• A new family of block methods
• Estimates in quadratic formulas
• Matrices, moments and quadrature. II: How to compute the norm of the error iterative 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
• Recent computational developments in Krylov subspace methods for linear systems
• The Lanczos and conjugate gradient algorithms in finite precision arithmetic
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique
• Use of Iterative Refinement in the Solution of Sparse 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
• Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems

This page was built for publication: Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations