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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Iterative methods for simultaneous inclusion of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weierstrass formula and zero-finding methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some methods for the simultaneous determination of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial approximations in Euler-Chebyshev's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Divergent Starting Points for Weierstrass Type Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on Dvorcuk's root-finding method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4332144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two observations on Durand-Kerner's root-finding method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of Smale's point estimation and its applications / rank
 
Normal rank

Latest revision as of 10:46, 27 May 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