Weighted FOM and GMRES for solving nonsymmetric linear systems

DOI10.1023/A:1019177600806zbMath0926.65036MaRDI QIDQ1281791

Publication date: 22 November 1999

Published in: Numerical Algorithms (Search for Journal in Brave)

numerical examples; iterative methods; GMRES; sparse matrices; nonsymmetric linear systems; full orthogonal method; generalized minimal residual algorithm; FOM

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65F10: Iterative numerical methods for linear systems

Related Items

On the Spectrum of Deflated Matrices with Applications to the Deflated Shifted Laplace Preconditioner for the Helmholtz Equation, On adaptively accelerated Arnoldi method for computing PageRank, Domain decomposition preconditioning for the high-frequency time-harmonic Maxwell equations with absorption, Recent Results on Domain Decomposition Preconditioning for the High-Frequency Helmholtz Equation Using Absorption, Weighted Inner Products for GMRES and GMRES-DR, Accelerate weighted GMRES by augmenting error approximations, GMRES implementations and residual smoothing techniques for solving ill-posed linear systems, Some observations on weighted GMRES, A new restarting method in the Lanczos algorithm for generalized eigenvalue problem, A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices, Weighted versions of Gl-FOM and Gl-GMRES for solving general coupled linear matrix equations, A new computational GMRES method, Restarted weighted full orthogonalization method for shifted linear systems, Weighted FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A, B), Optimal left and right additive Schwarz preconditioning for minimal residual methods with Euclidean and energy norms, Can coercive formulations lead to fast and accurate solution of the Helmholtz equation?, Global FOM and GMRES algorithms for a class of complex matrix equations, A note on weighted FOM and GMRES for solving nonsymmetric linear systems, Analysis of the SORAS domain decomposition preconditioner for non-self-adjoint or indefinite problems, Acceleration of an adaptive generalized Arnoldi method for computing PageRank, A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations, Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides, An adaptive Power-GArnoldi algorithm for computing PageRank, Analysis of a Helmholtz preconditioning problem motivated by uncertainty quantification, Efficient implementations of the modified Gram-Schmidt orthogonalization with a non-standard inner product, Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations, Minimal polynomial and reduced rank extrapolation methods are related, FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A,B), A simple strategy for varying the restart parameter in GMRES\((m)\), On the choice of preconditioner for minimum residual methods for non-Hermitian matrices, Approximating the weighted pseudospectra of large matrices, Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix, Matrix Krylov subspace methods for linear systems with multiple right-hand sides, GMRES algorithms over 35 years, Domain decomposition preconditioning for high-frequency Helmholtz problems with absorption, Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems, Unnamed Item, A Weighted Block GMRES method for solving linear systems with multiple right-hand sides, Improving the convergence behaviour of BiCGSTAB by applying <i>D</i>-norm minimization