A new convergence theorem for successive overrelaxation iterations (Q1300637)

From MaRDI portal
Revision as of 11:05, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A new convergence theorem for successive overrelaxation iterations
scientific article

    Statements

    A new convergence theorem for successive overrelaxation iterations (English)
    0 references
    20 March 2000
    0 references
    The authors propose convergence criteria (sufficient conditions) on the successive overrelaxation iterations for systems of linear real equation. Tight bounds for the relaxation parameter are given which guarantee convergence of the method. These bounds depend on the positive real roots of an \(n\)th degree polynomial. To get simple estimates to the roots, quadratic or linear approximations to that polynomial around zero may be used. A sequence of convergence tests in ascending order of computational complexity is presented. All these theoretical results, combined with reordering equations techniques to accelerate the convergence, are demonstrated by numerical examples.
    0 references
    convergence acceleration
    0 references
    iteration methods
    0 references
    convergence order
    0 references
    reordering techniques
    0 references
    numerical examples
    0 references
    successive overrelaxation
    0 references

    Identifiers