Convergence of the two-point Weierstrass root-finding method (Q403839): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Two-point iterative methods for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified majorizing sequences for Traub-type multipoint iterative procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certain modifications of Newton's method for the approximate solution of algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A biparametric family of inverse-free multipoint iterations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-finder methods derived from Obreshkov's techniques / 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: On some families of multi-point iterative methods for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simultaneous approximation of polynomial roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point estimation of root finding methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between different types of initial conditions for simultaneous root finding methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of multipoint iterations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the determination of the safe initial approximation for the Durand- Kerner algorithm / rank
 
Normal rank

Latest revision as of 22:57, 8 July 2024

scientific article
Language Label Description Also known as
English
Convergence of the two-point Weierstrass root-finding method
scientific article

    Statements

    Convergence of the two-point Weierstrass root-finding method (English)
    0 references
    0 references
    0 references
    29 August 2014
    0 references
    Let \((\mathbb{K},|\cdot|)\) denotes an arbitrary normed field and \(\mathbb{K}[z]\) denotes the ring of polynomials (in one variable) over \(\mathbb{K}\). Let \(f \in \mathbb{K}[z]\) be a polynomial of degree \(n \geq 2\) which has \(n\) simple zeros in \(\mathbb{K}\). A new local and semilocal convergence theorems for two--point Weierstrass method for the simultaneous computation of polynomial zeros given in the article. Three numerical examples presented.
    0 references
    two--point Weierstrass method
    0 references
    simultaneous methods
    0 references
    polynomial zeros
    0 references
    local convergence
    0 references
    semilocal convergence
    0 references
    error estimates
    0 references

    Identifiers

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