Inexact Krylov Subspace Methods for Linear Systems
From MaRDI portal
Publication:4650985
DOI10.1137/S0895479802403459zbMath1079.65036OpenAlexW2108291106MaRDI QIDQ4650985
Gerard L. G. Sleijpen, Jasper van den Eshof
Publication date: 21 February 2005
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479802403459
numerical experimentsGMRESKrylov subspace methodsrounding errors analysisinexact matrix-vector product
Related Items
A Krylov subspace type method for Electrical Impedance Tomography, Variants of the groupwise update strategy for short-recurrence Krylov subspace methods, A maximal projection solution of ill-posed linear system in a column subspace, better than the least squares solution, Mixed precision algorithms in numerical linear algebra, An efficient, memory-saving approach for the Loewner framework, The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology, An algorithm with \(m\)-step residual history for solving linear equations: data interpolation by a multi-shape-factors RBF, Analysis and practical use of flexible biCGStab, SPMR: A Family of Saddle-Point Minimum Residual Solvers, A double optimal descent algorithm for iteratively solving ill-posed linear inverse problems, Abstract perturbed Krylov methods, The Adaptive $s$-Step Conjugate Gradient Method, Inexact GMRES iterations and relaxation strategies with fast-multipole boundary element method, A Note on Inexact Inner Products in GMRES, An efficient Newton-Krylov implementation of the constrained runs scheme for initializing on a slow manifold, On the structured backward error of inexact Arnoldi methods for (skew)-Hermitian and (skew)-symmetric eigenvalue problems, Evaluation of the performance of inexact GMRES, Erasure Coding for Fault-Oblivious Linear System Solvers, GMRES algorithms over 35 years, Computing the smallest singular triplets of a large matrix, Inexact methods for the low rank solution to large scale Lyapunov equations, Optimal algorithms in a Krylov subspace for solving linear inverse problems by MFS, On expansion of search subspaces for large non-Hermitian eigenproblems, Analysis of inexact Krylov subspace methods for approximating the matrix exponential, A wavelet-based nested iteration-inexact conjugate gradient algorithm for adaptively solving elliptic PDEs, Inexact uniformization and GMRES methods for large Markov chains, On the convergence of Krylov methods with low-rank truncations, Lossy compression for PDE-constrained optimization: adaptive error control, The deflated conjugate gradient method: convergence, perturbation and accuracy, Inexact GMRES for singular linear systems, A variant of IDRstab with reliable update strategies for solving sparse linear systems, Limiting accuracy of segregated solution methods for nonsymmetric saddle point problems, Relaxation strategies for nested Krylov methods, Variants of residual smoothing with a small residual gap, Fast iterative solution of elliptic control problems in wavelet discretization, Inexact rational Krylov method for evolution equations, Two-Grid and Multiple-Grid Arnoldi for Eigenvalues, A doubly optimized solution of linear equations system expressed in an affine Krylov subspace, Multigrid preconditioning for the overlap operator in lattice QCD, Krylov subspace exponential time domain solution of Maxwell's equations in photonic crystal modeling, Flexible Krylov Methods for $\ell_p$ Regularization, On the Numerical Behavior of Matrix Splitting Iteration Methods for Solving Linear Systems, An optimal adaptive wavelet method without coarsening of the iterands, Regularization by Inexact Krylov Methods with Applications to Blind Deblurring, Randomized Gram--Schmidt Process with Application to GMRES, Inexact Hessian-vector products in reduced-space differential-equation constrained optimization
Uses Software
