Tighter bounds of errors of numerical roots

DOI10.1007/BF03167534zbMath1133.65027OpenAlexW1978846149MaRDI QIDQ2467047

Tateaki Sasaki

Publication date: 18 January 2008

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03167534

zbMATH Keywords

upper boundmonic univariate polynomial

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)

Cites Work

• On dominating sequence method in the point estimate and Smale's theorem
• A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
• Computing clustered close-roots of univariate polynomials
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item