Keywords
Condition Number Test Equation Numerical Condition Integer Coefficient Fixed Degree
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- W. Gautschi:On the condition of algebraic equations, Numer. Math.21, (1973), 405–424.MATHCrossRefMathSciNetGoogle Scholar
- W. Gautschi:Questions of numerical condition related to polynomials, in: «Recent Advances in Numerical Analysis» (1973), C. de Boor and G. H. Golub, eds., Academic Press, New York, 45–72.Google Scholar
- R. T. Gregory andD. L. Karney:A Collection of Matrices for Testing Computational Algorithms (1969), Wiley-Interscience, New York. [Corrected reprint, R. E. Krieger Publ. Co., Huntington, N. Y., 1978].Google Scholar
- M. A. Jenkins andJ. F. Traub:A three-stage algorithm for real polynomials using quadratic iteration, SIAM J. Numer. Anal.7, (1970), 545–566.CrossRefMathSciNetGoogle Scholar
- M. A. Jenkins andJ. F. Traub:Principles for testing polynomial zerofinding programs, ACM Trans. Math. Software1, (1975), 26–34.MATHCrossRefMathSciNetGoogle Scholar
- B. T. Smith:ZERPOL, a zero finding algorithm for polynomials using Laguerre's method, M. S. Thesis, Depertment of Computer Science, University of Toronto, (1967).Google Scholar
- J. H. Wilkinson:Rounding Errors in Algebraic Processes (1963), Prentice-Hall, Englewood Cliffs, N.J..MATHGoogle Scholar
Copyright information
© Instituto di Elaborazione della Informazione del CNR 1980