New conditions for non-stagnation of minimal residual methods
The authors deal with the problem of conditions guaranteeing that a minimal residual Krylov subspace method makes progress, i.e. that it does not stagnate. In the literature a condition was already proved which establishes that, for a given linear system, the symmetric part of the coefficient matrix has to be positive definite. However this condition provides a bound for convergence which appears too pessimistic. This remarkable paper presents new more general conditions for non-stagnation which involve both the symmetric part of the coefficient matrix and its skew-symmetric part. The effectiveness of these conditions are enlightened by some significant examples.
- A generalized conjugate gradient, least square method
- A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations
- Acceleration of Relaxation Methods for Non-Hermitian Linear Systems
- Analysis of the convergence of the minimal and the orthogonal residual methods
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Complete stagnation of GMRES
- Computable Convergence Bounds for GMRES
- Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems
- Generalization of convergence conditions for a restarted GMRES
- Geometric aspects of the theory of Krylov subspace methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 3537155 (Why is no real title available?)
- scientific article; zbMATH DE number 740107 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1953446 (Why is no real title available?)
- scientific article; zbMATH DE number 2113718 (Why is no real title available?)
- Minimum residual methods for augmented systems
- Numerical solution of saddle point problems
- On arason's theory of galois cohomology
- On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems
- Optimal left and right additive Schwarz preconditioning for minimal residual methods with Euclidean and energy norms
- Recent computational developments in Krylov subspace methods for linear systems
- Schwarz domain decomposition preconditioners for discontinuous Galerkin approximations of elliptic problems: non-overlapping case
- Some observations on the l2 convergence of the additive Schwarz preconditioned GMRES method
- Some Remarks on the Elman Estimate for GMRES
- The polynomial numerical hulls of Jordan blocks and related matrices.
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- A safeguard approach to detect stagnation of GMRES(\(m\)) with applications in Newton-Krylov methods
- Complete stagnation of GMRES for normal matrices
- Necessary and sufficient conditions for GMRES complete and partial stagnation
- GMRES algorithms over 35 years
- Any admissible cycle-convergence behavior is possible for restarted GMRES at its initial cycles.
- An improved two-grid preconditioner for the solution of three-dimensional Helmholtz problems in heterogeneous media.
- Multiplicative Schwarz Methods for Discontinuous Galerkin Approximations of Elliptic Problems
- An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems
- Minimal Residual Method Stronger than Polynomial Preconditioning
- A GMRES convergence analysis for localized invariant subspace ill-conditioning
- On a non-stagnation condition for GMRES and application to saddle point matrices
- On the residual norms, the Ritz values and the harmonic Ritz values that can be generated by restarted GMRES
- On the field of values of oblique projections
This page was built for publication: New conditions for non-stagnation of minimal residual methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q929360)
