Improvement of convergence of an iterative method for finding polynomial factors of analytic functions
From MaRDI portal
Publication:1602809
DOI10.1016/S0377-0427(01)00524-6zbMath1048.65051MaRDI QIDQ1602809
Tetsuya Sakurai, Sugiura, Hiroshi
Publication date: 24 June 2002
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
numerical examples; iterative method; analytic functions; polynomial zeros; complex interval arithmetic; reliable method
65G30: Interval and finite arithmetic
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65H05: Numerical computation of solutions to single equations
Related Items
A verified method for bounding clusters of zeros of analytic functions, Enclosing clusters of zeros of polynomials, An error analysis of two related quadrature methods for computing zeros of analytic functions.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical factorization of a polynomial by rational Hermite interpolation
- Polynomkerne und Iterationsverfahren
- Detection and validation of clusters of polynomial zeros
- Simultaneous factorization of a polynomial by rational approximation
- On some simultaneous methods based on Weierstrass' correction
- On locating clusters of zeros of analytic functions
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- On Samelson's iteration for factoring polynomials
- ICIAM/GAMM 95 Numerical Analysis, Scientific computing Computer ScienceICIAM/GAMM 95 Numerical Analysis, Scientific computing Computer Science
- A Numerical Method for Locating the Zeros of an Analytic Function
- The Simultaneous Newton Improvement of a Complete Set of Approximate Factors of a Polynomial
- On a companion operator for analytic functions
- On factorization of analytic functions and its verification
- Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations
