A fast and numerically stable euclidean-like algorithm for detecting relatively prime numerical polynomials

Journal of Symbolic Computation

Volumn 26, Issue 6, 1998, Pages 691-714

  Beckermann, Bernhard ^a   Labahn, George ^b  

^a UNIV LILLE   (France)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (19)

1. Beckermann, B. (1996). The stable computation of formal orthogonal polynomials. Numer. Algorithms, 11, 1-23.
2. Beckermann, B. (1997). The condition number of real Vandermonde, Krylov and positive definite Hankel matrices. Publication ANO 380, Université de Lille.
3. Beckermann, B., Labahn, G. (1998) When are two numerical polynomials relatively prime? J. Symb. Comput. 267, 677-689.
4. Bini, D., Pan, V. (1994). Polynomial and Matrix Computations. Basel, Birkhäuser.
5. Bojanczyk, A. W., Brent, R. P., de Hoog, F. R. (1995). Stability analysis of a general Toeplitz systems solver, Numer. Algorithms, 10, 225-244.
6. Bunch, J. (1987). The weak and strong stability of algorithms in numerical linear algebra, Lin. Alg. Appl., 88/89, 49-66.
7. Cabay, S., Meleshko, R. (1993). A weakly stable algorithm for Padé approximants and the inversion of Hankel matrices. SIAM J. Matrix Analysis and Applications, 14, 735-765.
8. Cabay, S., Jones, A. R., Labahn, G. (1996a). Computation of numerical Padé-Hermite and simultaneous Padé systems I: Near inversion of generalized Sylvester matrices. SIAM J. Matrix Anal. Applic., 17, 237-267.
9. Cabay, S., Jones, A. R., Labahn, G. (1996b). Computation of numerical Padé-Hermite and simultaneous Padé systems II: A weakly stable algorithm. SIAM J. Matrix Anal. Applic., 17, 268-297.
10. Cabay, S., Jones, A. R., Labahn, G. (1997). Experiments with a weakly stable algorithm for computing Padé-Hermite and simultaneous Padé approximants. ACM Trans. Math. Software (TOMS), 23, 91-110.
11. Corless, R. M., Gianni, P. M., Trager, B. M., Watt, S. M. (1995). The singular value decomposition for polynomial systems. Proceedings ISSAC '95, pp. 195-207. ACM Press.
12. Emiris, I. Z., Galligo, A., Lombardi, H. (1997). Certified approximate univariate GCDs. J. Pure Appl. Algebra, 117 & 118, 229-251.
13. Geddes, K. O. Czapor, S. R., Labahn, G. (1992). Algorithms for Computer Algebra. Boston, Kluwer.
14. nd Edn. Baltimore, MD, Johns Hopkins University Press.
15. Karmarkar, N., Lakshman, Y. N. (1996). Approximate polynomial greatest common divisors and nearest singular polynomials. Proceedings ISSAC '96, pp. 35-39. ACM Press.
16. Meleshko, R., Cabay, S. (1991). Experience with a fast stable Sylvester solver. Talk at Fourth SIAM conference in Applied Linear Algebra, Minneapolis, Minnesota.
17. Noda, M.-T., Sasaki, T. (1991). Approximate GCD and its applications to ill-conditioned algebraic equations. J. CAM, 38, 335-351.
18. Schönhage, A. (1985). Quasi-GCD computations. J. Complexity, 1, 118-137.
19. Van Barel, M., Bultheel, A. (1997) A look-ahead algorithm for the solution of block Toeplitz systems. Linear Algebra and its Applications, 266, 291-335.