Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing

Authors:
Valeria Simoncini;Daniel B. Szyld
Affiliations:
-;-
Venue:
SIAM Journal on Scientific Computing
Year:
2003

Citing 0
Cited 21

Parallel multigrid methods for the calculation of unsteady flows on unstructured grids: algorithmic aspects and parallel performances on clusters of PCs

Parallel Computing
Relaxation strategies for nested Krylov methods

Journal of Computational and Applied Mathematics
Linear multifrequency-grey acceleration recast for preconditioned Krylov iterations

Journal of Computational Physics
Limiting accuracy of segregated solution methods for nonsymmetric saddle point problems

Journal of Computational and Applied Mathematics
Algorithm 881: A Set of Flexible GMRES Routines for Real and Complex Arithmetics on High-Performance Computers

ACM Transactions on Mathematical Software (TOMS)
Constraint Schur complement preconditioners for nonsymmetric saddle point problems

Applied Numerical Mathematics
Comparing Some Methods and Preconditioners for Hydropower Plant Flow Simulations

High Performance Computing for Computational Science - VECPAR 2008
An Efficient Newton-Krylov Implementation of the Constrained Runs Scheme for Initializing on a Slow Manifold

Journal of Scientific Computing
Relaxation strategies for nested Krylov methods

Journal of Computational and Applied Mathematics
Block triangular Schur complement preconditioners for saddle point problems and application to the Oseen equations

Applied Numerical Mathematics
Optical computing for fast light transport analysis

ACM SIGGRAPH Asia 2010 papers
Shift-Invert Arnoldi's Method with Preconditioned Iterative Solves

SIAM Journal on Matrix Analysis and Applications
Evaluation of the performance of inexact GMRES

Journal of Computational and Applied Mathematics
An Inner-Outer Iteration for Computing PageRank

SIAM Journal on Scientific Computing
Shift-Invert Arnoldi Approximation to the Toeplitz Matrix Exponential

SIAM Journal on Scientific Computing
Analysis of Block Parareal Preconditioners for Parabolic Optimal Control Problems

SIAM Journal on Scientific Computing
Stochastic computing: embracing errors in architectureand design of processors and applications

CASES '11 Proceedings of the 14th international conference on Compilers, architectures and synthesis for embedded systems
Restarted GMRES with inexact matrix–vector products

NAA'04 Proceedings of the Third international conference on Numerical Analysis and its Applications
Cooperative Application/OS DRAM fault recovery

Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing - Volume 2
A Flexible Generalized Conjugate Residual Method with Inner Orthogonalization and Deflated Restarting

SIAM Journal on Matrix Analysis and Applications
Self-stabilizing iterative solvers

ScalA '13 Proceedings of the Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

We provide a general framework for the understanding of inexact Krylov subspace methods for the solution of symmetric and nonsymmetric linear systems of equations, as well as for certain eigenvalue calculations. This framework allows us to explain the empirical results reported in a series of CERFACS technical reports by Bouras, Frayssé, and Giraud in 2000. Furthermore, assuming exact arithmetic, our analysis can be used to produce computable criteria to bound the inexactness of the matrix-vector multiplication in such a way as to maintain the convergence of the Krylov subspace method. The theory developed is applied to several problems including the solution of Schur complement systems, linear systems which depend on a parameter, and eigenvalue problems. Numerical experiments for some of these scientific applications are reported.