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.65073OpenAlexW1969110611MaRDI QIDQ1808432

B. Gleyse

Publication date: 12 July 2000

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

Full work available at URL: https://doi.org/10.1016/s0893-9659(99)00079-8

zbMATH Keywords

numerical examplespolynomialsnumerical accuracyroot-counting methodround-off error analysisSchur-Cohn algorithmSchur modified sequence

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: A Schur's modified sequence and the number of zeros of a real polynomial in the unit disk: Testing its numerical quality