A flexible CMRH algorithm for nonsymmetric linear systems
The paper deals with the non-symmetric linear systems \[ Ax = b, \] where \(A\in \mathbb R^{n \times n}\) is non-singular and \(b,x\in \mathbb R^n\). The changing minimal residual method based on the Hessenberg (CMRH) process is studied and its flexibile version is presented (FCMRH). The flexibility means to apply variable preconditioners. Relations between these two methods are analyzed by the corresponding residual norms. The paper is concluded by numerical experiments performed in Matlab. As examples, the linear systems arising from the finite difference discretization of boundary value problems for ordinary or partial differential euqatons of second order are solved. The respective matrices exhibit a special tri-diagonal or tensor product structure. Numerical experiments show that the studied method is promising, at least for the presented examples.
- Algorithms for the CMRH method for dense linear systems
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- A new look at CMRH and its relation to GMRES
- The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- A new implementation of the CMRH method for solving dense linear systems
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A new implementation of the CMRH method for solving dense linear systems
- A new look at CMRH and its relation to GMRES
- A parallel implementation of the CMRH method for dense linear systems
- Block Stationary Methods for Nonsymmetric Cyclically Reduced Systems Arising from Three-Dimensional Elliptic Equations
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Flexible BiCG and flexible Bi-CGSTAB for nonsymmetric linear systems
- Flexible conjugate gradients
- Flexible Inner-Outer Krylov Subspace Methods
- FQMR: A flexible quasi-minimal residual method with inexact preconditioning
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- GMRESR: a family of nested GMRES methods
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2113718 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
- Matrix Krylov subspace methods for linear systems with multiple right-hand sides
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Recent computational developments in Krylov subspace methods for linear systems
- Steepest Descent and Conjugate Gradient Methods with Variable Preconditioning
- The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
- Heavy ball restarted CMRH methods for linear systems
- Restarted Hessenberg method for solving shifted nonsymmetric linear systems
- Extended and rational Hessenberg methods for the evaluation of matrix functions
- Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously
- Flexible BiCG and flexible Bi-CGSTAB for nonsymmetric linear systems
- scientific article; zbMATH DE number 6671720 (Why is no real title available?)
- A new look at CMRH and its relation to GMRES
- Augmented and deflated CMRH method for solving nonsymmetric linear systems
- A modified CMRH method for solving large nonsymmetric linear systems
- GP-CMRH: an inner product free iterative method for block two-by-two nonsymmetric linear systems
This page was built for publication: A flexible CMRH algorithm for nonsymmetric linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2511445)
