A Schur's modified sequence and the number of zeros of a real polynomial in the unit disk: Testing its numerical quality

DOI10.1016/S0893-9659(99)00079-8zbMath0939.65073MaRDI QIDQ1808432

B. Gleyse

Publication date: 12 July 2000

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

numerical examples; polynomials; numerical accuracy; root-counting method; round-off error analysis; Schur-Cohn algorithm; Schur modified sequence

Mathematics Subject Classification ID

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

Cites Work

• New methods for evaluating the validity of the results of mathematical computations
• On Lehmer's Method for Finding the Zeros of a Polynomial
• The automatic integration of ordinary differential equations
• Unnamed Item
• Unnamed Item