On the preconditioned AOR iterative method for \(Z\)-matrices (Q2398133)

From MaRDI portal
Revision as of 06:06, 10 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: reviewed by (P1447): Item:Q171973)
scientific article
Language Label Description Also known as
English
On the preconditioned AOR iterative method for \(Z\)-matrices
scientific article

    Statements

    On the preconditioned AOR iterative method for \(Z\)-matrices (English)
    0 references
    0 references
    15 August 2017
    0 references
    Given the linear system \(A x = b\) with \(A=I-L-U\), \(L\geq 0\) and \(U\geq 0\) the accelerated overrelaxation (AOR) iterative method is considered as iterative solver. For this methods the authors consider the preconditioned system \( PA x = Pb \) with \(P = I + \tilde L + \tilde U\), \(0\leq \tilde L \leq L\) and \(0\leq \tilde U \leq U\). The authors prove that the preconditioner \(P=I+L+U\), i.e., \(\tilde L=L\) and \(\tilde U=U\) is the best preconditioner in this class.
    0 references
    preconditioner
    0 references
    \(Z\)-matrix
    0 references
    accelerated overrelaxation iterative method
    0 references

    Identifiers