Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
Authors:
- 1 December 1988
- journal article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 28 (3) , 191-209
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Triplex: A system for interval arithmeticSoftware: Practice and Experience, 1982
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of PolynomialsSIAM Journal on Numerical Analysis, 1978
- Some modifications of Laguerre's methodBIT Numerical Mathematics, 1977
- Parallel laguerre iterations: The complex caseNumerische Mathematik, 1976
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomialBIT Numerical Mathematics, 1975
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial RootsSIAM Journal on Numerical Analysis, 1974
- Simultaneous inclusion of the zeros of a polynomialNumerische Mathematik, 1973
- Iteration methods for finding all zeros of a polynomial simultaneouslyMathematics of Computation, 1973
- Circular arithmetic and the determination of polynomial zerosNumerische Mathematik, 1971
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von PolynomenNumerische Mathematik, 1966