On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity (Q1697274): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10092-017-0225-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2610390111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous point estimates for Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the total, or partial, factorization of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel square-root iterations for multiple roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some generalizations of the Chebyshev method for simultaneous determination of all roots of polynomial equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of Chebyshev's method for multiple polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously / rank
 
Normal rank
Property / cites work
 
Property / cites work: A basic family of iteration functions for polynomial root finding and its characterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods for roots of polynomials. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Polynomial Equation: Some History and Recent Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point estimation of root finding methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some higher-order methods for the simultaneous approximation of multiple polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: General local convergence theory for a class of iterative processes and its applications to Newton's method / 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: A unified theory of cone metric spaces and its applications to the fixed point theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: General convergence theorems for iterative processes and applications to the Weierstrass root-finding method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the local convergence of Ehrlich method for numerical computation of polynomial zeros / 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: Q5253782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5497198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of Halley's method for multiple polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of Halley's method for simultaneous computation of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the two-point Weierstrass root-finding method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a family of Weierstrass-type root-finding methods with accelerated convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new simultaneous method of fourth order for finding complex zeros in circular interval arithmetic / rank
 
Normal rank

Latest revision as of 04:25, 15 July 2024

scientific article
Language Label Description Also known as
English
On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
scientific article

    Statements

    On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 February 2018
    0 references
    A general theorem for iteration functions in a cone normed space over \(\mathbb{R}^n\) is given. A local convergence theorem with a priori and a posteriori error estimates as well as a theorem under computationally verifiable initial conditions for the Schröder's iterative method considered as a method for simultaneous computation of polynomial zeros of unknown multiplicity are derived. Results of numerical examples are presented.
    0 references
    0 references
    Schröder's method
    0 references
    polynomial zeros
    0 references
    multiple zeros
    0 references
    local convergence
    0 references
    semilocal convergence
    0 references
    error estimates
    0 references
    cone normed space
    0 references
    numerical example
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references