A flexible CMRH algorithm for nonsymmetric linear systems (Q2511445)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6325326
Language Label Description Also known as
default for all languages
No label defined
    English
    A flexible CMRH algorithm for nonsymmetric linear systems
    scientific article; zbMATH DE number 6325326

      Statements

      A flexible CMRH algorithm for nonsymmetric linear systems (English)
      0 references
      0 references
      0 references
      5 August 2014
      0 references
      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.
      0 references
      0 references
      changing minimal residual method based on the Heisenberg process
      0 references
      flexible preconditioning
      0 references
      flexible GMRES
      0 references
      Krylov subspace method
      0 references
      numerical experiment
      0 references
      boundary value problem
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references