On the Convergence of Restarted Krylov Subspace Methods
From MaRDI portal
Publication:2706266
DOI10.1137/S0895479898348507zbMath0969.65023MaRDI QIDQ2706266
Publication date: 19 March 2001
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
performanceconvergencenumerical experimentsGMRES methodKrylov subspace iterative methodlarge nonsymmetric linear systemsfull orthogonal methodrestarted iterative methodFOM methodsminimum perturbation methods
Related Items (15)
On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems ⋮ Abstract perturbed Krylov methods ⋮ IDR(\(s\)) for solving shifted nonsymmetric linear systems ⋮ An accelerated subspaces recycling strategy for the deflation of parametric linear systems based on model order reduction ⋮ A survey of subspace recycling iterative methods ⋮ AN APPROXIMATE MATRIX INVERSION PROCEDURE BY PARALLELIZATION OF THE SHERMAN–MORRISON FORMULA ⋮ Restarted weighted full orthogonalization method for shifted linear systems ⋮ The effect of non-optimal bases on the convergence of Krylov subspace methods ⋮ A restarted Lanczos approximation to functions of a symmetric matrix ⋮ Randomized flexible GMRES with deflated restarting ⋮ Simultaneous solution of large-scale linear systems and eigenvalue problems with a parallel GMRES method ⋮ Restarted GMRES augmented with harmonic Ritz vectors for shifted linear systems ⋮ Restarted Gmres Augmented With Eigenvectors For Shifted Linear Systems * Supported by the National Natural Science Foundation of China and the Science and Technology Developing Foundation of University in Shanghai of China ⋮ Some iterative approaches for Sylvester tensor equations. I: A tensor format of truncated loose simpler GMRES ⋮ On the residual norms, the Ritz values and the harmonic Ritz values that can be generated by restarted GMRES
This page was built for publication: On the Convergence of Restarted Krylov Subspace Methods
