The self-validated method for polynomial zeros of high efficiency (Q1034672): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cam.2009.09.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975241546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular arithmetic and the determination of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some improved inclusion methods for polynomial roots with Weierstrass' corrections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5627593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3345690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur iterativen Auflösung algebraischer Gleichungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A posteriori error bounds for the zeros of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified Newton method for polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration Methods for Finding all Zeros of a Polynomial Simultaneously / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3223805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative methods for simultaneous inclusion of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halley-like method with corrections for the inclusion of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Laguerre iterations: The complex case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung / 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: On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational efficiency of some combined methods for polynomial equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 786: multiple-precision complex arithmetic and functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: MPFR / rank
 
Normal rank

Latest revision as of 04:01, 2 July 2024

scientific article
Language Label Description Also known as
English
The self-validated method for polynomial zeros of high efficiency
scientific article

    Statements

    The self-validated method for polynomial zeros of high efficiency (English)
    0 references
    6 November 2009
    0 references
    An improved iterative method of Newton type for the simultaneous approximation of all complex zeros of a polynomial having only single roots is proposed. If \(P(z)=\prod_{j=1}^{n}(z-\zeta_{j})\) and \(z_{1},\dots,z_{n}\) are distinct approximations to the zeros, the method reads \[ \widehat{z}_{i}=z_{i}-\frac{1}{\frac{1}{u(z_{i})}-\sum^{n}_{{j=1 j\neq i}}\frac{1}{z_{i}-z_{j}} }\qquad (i\in \mathbf{I}_{n}). \] Here \(\widehat{z}_{i}\) is a new approximation to the zero \(\zeta_{i}\) and \[ u(z)=(\sum_{j=1}^{n}\frac{1}{z-\zeta_{j}})^{-1}. \] This leads to the 4th order method \[ \widehat{z}_{i}=z_{i}-\frac{1}{\frac{1}{u(z_{i})}-\sum^{n}_{{j=1 j\neq i}}\frac{1}{z_{i}-z_{j}+u(z_{j})}} \qquad (i\in \mathbf{I}_{n}). \] If we start instead of \(u(z)\) from Ostrowski's correction \[ \psi(z)=u(z)\frac{P(z-u(z))-P(z)}{2} \] we get the 6th order iterative method: \[ \widehat{z}_{i}=z_{i}-\frac{1}{\frac{1}{u(z_{i})}-\sum^{n}_{{j=1 j\neq i}}\frac{1}{z_{i}-z_{j}+\psi(z_{j})}} \qquad (i\in \mathbf{I}_{n}). \] As before \(\mathbf{I}_{n}=\{1,2,\dots,n\}.\)
    0 references
    zeros of polynomials
    0 references
    iterative methods
    0 references
    Ostrowski's corrections
    0 references
    convergence
    0 references
    Newton method
    0 references
    self-validated method
    0 references
    inclusion methods
    0 references
    circular interval arithmetic
    0 references
    acceleration of convergence
    0 references
    computational efficiency
    0 references
    complex zeros
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers