Tighter bounds of errors of numerical roots

DOI10.1007/BF03167534MaRDI QIDQ2467047zbMATH OpenOpenAlexFDO

Authors 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

monic univariate polynomialupper bound

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)

Recommendations

• scientific article; zbMATH DE number 1574479
• Bericht über die wissenschaftliche Jahrestagung 1988 der GAMM in Wien
• scientific article; zbMATH DE number 1206081
• Computation of bounds for polynomial roots
• Error Bounds for Polynomial Evaluation and Complex Arithmetic
• Error bounds and a condition number for the absolute value equations
• Alternative error bounds for some numerical quadrature rules
• A tight bound for approximating the square root
• Verified error bounds for multiple roots of systems of nonlinear equations
• scientific article; zbMATH DE number 1545816

Cites work

• A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Computing clustered close-roots of univariate polynomials
• Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
• scientific article; zbMATH DE number 3476451 (Why is no real title available?)
• scientific article; zbMATH DE number 3992817 (Why is no real title available?)
• scientific article; zbMATH DE number 3206520 (Why is no real title available?)
• On dominating sequence method in the point estimate and Smale's theorem

Cited in

(5)

• scientific article; zbMATH DE number 1574479 (Why is no real title available?)
• scientific article; zbMATH DE number 4023492 (Why is no real title available?)
• A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial
• A formula for separating small roots of a polynomial
• A property of the nearly optimal root-bound

This page was built for publication: Tighter bounds of errors of numerical roots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467047)