Optimizing and improving of the C-to-R method for solving complex symmetric linear systems (Q1642092)

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 6891860
Language Label Description Also known as
default for all languages
No label defined
    English
    Optimizing and improving of the C-to-R method for solving complex symmetric linear systems
    scientific article; zbMATH DE number 6891860

      Statements

      Optimizing and improving of the C-to-R method for solving complex symmetric linear systems (English)
      0 references
      0 references
      0 references
      0 references
      20 June 2018
      0 references
      The authors are concerned with the numerical solution of complex symmetric linear systems of equations, written in a real $2 \times 2$ block form. They reconsider a C-to-R method, previously proposed by \textit{O. Axelsson} and \textit{A. Kucherov} [Numer. Linear Algebra Appl. 7, No. 4, 197--218 (2000; Zbl 1051.65025)], for which they design and analyse an optimized preconditioner. This leads to better eigenvalue bounds for the preconditioned matrix, which implies that the preconditioner is more robust and efficient than some existing methods.
      0 references
      preconditioner
      0 references
      optimal parameter
      0 references
      complex symmetric linear system
      0 references
      spectral radius
      0 references
      0 references

      Identifiers

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