A parameterized splitting iteration method for complex symmetric linear systems (Q403837)

From MaRDI portal
Revision as of 22:57, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A parameterized splitting iteration method for complex symmetric linear systems
scientific article

    Statements

    A parameterized splitting iteration method for complex symmetric linear systems (English)
    0 references
    0 references
    0 references
    29 August 2014
    0 references
    The paper introduces and tests a parametrized splitting method (PS) to solve complex symmetric systems \((W + iT)x = b \in \mathbb C^n\) with positive (semi-)definite real symmetric matrices \(W\) and \(T\). The spectral radius of the iteration matrix is explicitly computed in terms of specific Raleigh quotients for \(W\) and \(TW^{-1}T\). This allows finding the optimal iteration parameter in terms of the extreme real eigenvalues of \(W\) and \(TW^{-1}T\). The PS method is further sped up by using preconditioned Krylov methods and restarts. Various such preconditioners are tested in conjunction with PS and give excellent results for sparse complex symmetric systems.
    0 references
    0 references
    complex symmetric linear equations
    0 references
    parametrized splitting iteration
    0 references
    spectral radius
    0 references
    preconditioning
    0 references
    sparse matrix
    0 references
    Raleigh quotient
    0 references
    Krylov method
    0 references

    Identifiers

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