The behaviour of approximations of the SOR Weierstrass method (Q1352773): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0898-1221(96)00160-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998103765 / rank
 
Normal rank

Revision as of 19:58, 19 March 2024

scientific article
Language Label Description Also known as
English
The behaviour of approximations of the SOR Weierstrass method
scientific article

    Statements

    The behaviour of approximations of the SOR Weierstrass method (English)
    0 references
    19 February 1997
    0 references
    The Weierstrass method is one of the most efficient methods for the simultaneous approximation of the simple roots of a polynomial. The choice of initial approximations plays a crucial role in the applications. Practical experience shows that the method converges for almost all distinct initial values. This paper deals with the successive overrelaxation (SOR) Weierstrass method with acceleration parameter. It is shown that for a given polynomial and acceleration parameter, there exists a unique divergence point from \(\mathbb{C}\). This is a very interesting result.
    0 references
    divergence sets
    0 references
    convergence
    0 references
    Weierstrass method
    0 references
    roots of a polynomial
    0 references
    successive overrelaxation
    0 references
    0 references
    0 references
    0 references

    Identifiers