A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
From MaRDI portal
Publication:4016797
DOI10.1137/0613050zbMath0757.65035OpenAlexW2117949169MaRDI QIDQ4016797
Noël M. Nachtigal, Lloyd N. Threfethen, Lothar Reichel
Publication date: 16 January 1993
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d300c65a5fe6e77945c9a58096020573bc30237c
convergencenumerical examplesiterative methodGMREShybrid algorithmspseudospectrumKrylov subspaceCGNRCGSlarge nonsymmetric systemsgeneralized minimum residual algorithm
Related Items
A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations, A generalized ADI iterative method, BiCGstab(\(l\)) and other hybrid Bi-CG methods, Polynomial Preconditioned GMRES and GMRES-DR, A polynomial preconditioner for the GMRES algorithm, GMRES-Accelerated ADMM for Quadratic Objectives, Locally optimal and heavy ball GMRES methods, BACKWARD PERTURBATION ANALYSIS AND RELATIVE ALGORITHMS FOR NONSYMMETRIC LINEAR SYSTEMS WITH MULTIPLE RIGHT-HAND SIDES, A hybrid iterative method for symmetric positive definite linear systems, Harmonic projection methods for large non-symmetric eigenvalue problems, A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides, Pseudospectra for the wave equation with an absorbing boundary, Restarted GMRES preconditioned by deflation, Preconditioned cg‐like methods for solving non‐linear convection—diffusion equations, Ritz and pseudo-Ritz values using matrix polynomials, Unnamed Item, Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem, Coarsest-level improvements in multigrid for lattice QCD on large-scale computers, Pseudoeigenvector bases and deflated GMRES for highly nonnormal matrices, Usage of the convergence test of the residual norm in the Tsuno-Nodera version of the GMRES algorithm, A survey of subspace recycling iterative methods, GMRES implementations and residual smoothing techniques for solving ill-posed linear systems, On the generation of Krylov subspace bases, GMRES algorithms over 35 years, Eigenvalues and pseudo-eigenvalues of Toeplitz matrices, Iterative methods for solving \(Ax=b\), GMRES/FOM versus QMR/BiCG, The use of the CADNA library for validating the numerical results of the hybrid GMRES algorithm, Krylov-subspace methods for the Sylvester equation, Quasi-kernel polynomials and their use in non-Hermitian matrix iterations, On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems, An adaptive method for solving nonsymmetric linear systems involving applications of SCPACK, A condition for the superiority of the (2, 2)-step methods over the related Chebyshev method, Block minimum perturbation algorithm based on block Arnoldi process for nonsymmetric linear systems with multiple right-hand sides, The superiority of a new type (2,2)-step iterative method over the related Chebyshev method, An interpolatory approximation of the matrix exponential based on Faber polynomials, Complementary cycles of restarted GMRES, A note on the spectral distribution of symmetrized Toeplitz sequences, Is a Chebyshev method optimal for an elliptic region also optimal for a nearly elliptic region?, The GMRES method improved by securing fast wave propagation, Three-dimensional preconditioned FM-IBEM solution to broadband-frequency seismic wave scattering in a layered sedimentary basin, Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems, On the residual norms, the Ritz values and the harmonic Ritz values that can be generated by restarted GMRES, Leja, Fejér-Leja and \(\mathfrak{R}\)-Leja sequences for Richardson iteration, Convergence properties of block GMRES and matrix polynomials, On the numerical solution of \(AX-XB=C\), A hybrid iterative method for symmetric indefinite linear systems, Proxy-GMRES: Preconditioning via GMRES in Polynomial Space, Polynomial Preconditioned Arnoldi with Stability Control, The application of Leja points to Richardson iteration and polynomial preconditioning, Yet another polynomial preconditioner for the conjugate gradient algorithm, Experiments with Krylov subspace methods on a massively parallel computer
