Floating-point versus symbolic computations in the QD-algorithm

Journal of Symbolic Computation

Volumn 24, Issue 6, 1997, Pages 695-703

  Cuyt, Annie ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031537306     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1997.0162     Document Type: Article

References (5)

1. Baker, G., Graves-Morris, P. (1981). Padé approximants I. Encycl. Math., volume 13. Reading: Addison-Wesley.
2. Cuyt, A. (1988). A multivariate qd-like algorithm. BIT 28, 98-112.
3. Cuyt, A. (1994). Where do the columns of the multivariate QD-algorithm go? A proof constructed with the aid of Mathematica. Numer. Math. Submitted.
4. Henrici, P. (1974). Applied and Computational complex analysis I. New York: John Wiley & Sons, Inc.
5. Perron, O. (1977). Die Lehre von den Kettenbrüchen II. 3rd Edition. Stuttgart: Teubner.