Motivations and realizations of Krylov subspace methods for large sparse linear systems
DOI10.1016/j.cam.2015.01.025zbMath1311.65032OpenAlexW2066152591MaRDI QIDQ2018488
Publication date: 24 March 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.01.025
linear systempreconditioningiterative methoddirect methodKrylov subspace methodgeneralized minimal residual (GMRES) method
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 (86)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
- New subclasses of block \(H\)-matrices with applications to parallel decomposition-type relaxation methods
- A note on the convergence of the AOR method
- The design and use of a sparse direct solver for skew symmetric matrices
- Modified incomplete orthogonal factorization methods using Givens rotations
- On the convergence of some generalized iterative methods
- Algebraic multilevel preconditioning methods. I
- Parallel hybrid algebraic multilevel iterative methods
- Sharp error bounds of some Krylov subspace methods for non-Hermitian linear systems
- Successive overrelaxation (SOR) and related methods
- A unified framework for the construction of various algebraic multilevel preconditioning methods
- Preconditioning techniques for large linear systems: A survey
- A class of hybrid algebraic multilevel preconditioning methods
- A new image thresholding method based on Gaussian mixture model
- The Idea behind Krylov Methods
- GMRES Convergence for Perturbed Coefficient Matrices, with Application to Approximate Deflation Preconditioning
- Fast Solvers for Cahn--Hilliard Inpainting
- On successive-overrelaxation acceleration of the Hermitian and skew-Hermitian splitting iterations
- Implementation of the GMRES Method Using Householder Transformations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- Iterative Solution Methods
- Parallel Preconditioning with Sparse Approximate Inverses
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems
- Erratum
- Multigrid based preconditioners for the numerical solution of two-dimensional heterogeneous problems in geophysics
- GMRES convergence bounds that depend on the right-hand-side vector
- Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
- Advances in Neural Networks – ISNN 2005
- A class of incomplete orthogonal factorization methods. I: Methods and theories
- Parallel multilevel iterative methods
This page was built for publication: Motivations and realizations of Krylov subspace methods for large sparse linear systems