Fraction-free computation of matrix rational interpolants and matrix GCDs

SIAM Journal on Matrix Analysis and Applications

Volumn 22, Issue 1, 2000, Pages 114-144

  Beckermann, Bernhard ^a   Labahn, George ^b  

^a UNIV LILLE   (France)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Fraction free arithmetic; Hermite Pad approximant; Simultaneous Pad approximant; Striped Krylov matrices

Indexed keywords

EID: 0034353665     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479897326912     Document Type: Article

References (55)

1. G.A. BAKER AND P.R. GRAVES-MORRIS, Padé Approximants, 2nd ed., Cambridge University Press, Cambridge, UK, 1995.
2. E. BAREISS, Sylvester's identity and multistep integer-preserving Gaussian elimination, Math. Comp., 22 (1968), pp. 565-578.
3. B. BECKERMANN, Zur Interpolation mit polynomialen Linearkombinationen beliebiger Funktionen, Ph.D. Thesis, Department of Applied Mathematics, University of Hannover, Hannover, Germany, 1990.
4. B. BECKERMANN, The structure of the singular solution table of the M-Padé approximation problem, J. Comput. Appl. Math., 32 (1990), pp. 3-15.
5. B. BECKERMANN, A reliable method for computing M-Padé approximants on arbitrary staircases, J. Comput. Appl. Math., 40 (1992), pp. 19-42.
6. B. BECKERMANN, The stable computation of formal orthogonal polynomials, Numer. Algorithms, 11 (1996), pp. 1-23.
7. B. BECKERMANN AND G. LABAHN, A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix generalizations, Numer. Algorithms, 3 (1992), pp. 45-54.
8. B. BECKERMANN AND G. LABAHN, A uniform approach for the fast, computation of matrix-type Padé approximants, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 804-823.
9. B. BECKERMANN AND G. LABAHN, Recursiveness in matrix rational interpolation problems, J. Comput. Appl. Math., 77 (1997), pp. 5-34.
10. B. BECKERMANN, S. CABAY, AND G. LABAHN, Fraction-free Computation of Matrix Padé Systems, in Proceedings of ISSAC'97, Maui, HI, ACM Press, New York, 1997, pp. 125-132.
11. B. BECKERMANN, G. LABAHN, AND G. VILLARD, Shifted Normal Forms of Polynomial Matrices, in Proceedings of ISSAC'99, Vancouver, BC, ACM Press, New York, 1999, pp. 189-196.
12. R.R. BITMEAD, S.Y. KUNG, B.D.O. ANDERSON, AND T. KAILATH, Greatest common divisors via generalized Sylvester and Bezout matrices, IEEE Trans. Automat. Control, 23 (1978), pp. 1043-1046.
13. A.W. BOJANCZYK, R.P. BRENT, AND F.R. DE HOOG, Stability analysis of a general Toeplitz systems solver, Numer. Algorithms, 10 (1995), pp. 225-244.
14. A.W. BOJANCZYK, R.P. BRENT, F.R. DE HOOG, AND D.R. SWEET, On the stability of the Bareiss and related Toeplitz factorization algorithms, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 40-57.
15. R. BRENT, F.G. GUSTAVSON, AND D.Y. Y. YUN, Fast solution of Toeplitz systems of equations and computation of Padé approximants, J. Algorithms, 1 (1980), pp. 259-295.
16. W. BROWN AND J.F. TRAUB, On Euclid's algorithm and the theory of subresultants, J. ACM, 18 (1971), pp. 505-514.
17. A. BULTHEEL AND M. VAN BAREL, A matrix Euclidean algorithm and the matrix minimal Padé approximation problem, in Continued Fractions and Padé Approximants, C. Brezinski, ed., North-Holland, Amsterdam, pp. 11-51, 1990.
18. S. CABAY AND D.K. CHOI, Algebraic computations of scaled Padé fractions, SIAM J. Comput., 15 (1986), pp. 243-270.
19. S. CABAY, G. LABAHN, AND B. BECKERMANN, On the theory and computation of non-perfect Padé-Hermite approximants, J. Comput. Appl. Math., 39 (1992), pp. 295-313.
20. S. CABAY, A.R. JONES, AND G. LABAHN, Computation of numerical Padé-Hermite and simultaneous Padé systems II: A weakly stable algorithm, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 268-297.
21. S. CABAY AND P. KOSSOWSKI, Power series remainder sequences and Padé fractions over an integral domain, J. Symbolic Comput., 10 (1990), pp. 139-163.
22. S. CABAY AND G. LABAHN, A superfast algorithm for multidimensional Padé systems, Numer. Algorithms, 2 (1992), pp. 201-224.
23. S. CABAY AND R. MELESHKO, A weakly stable algorithm for Padé approximants and the inversion of Hankel matrices, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 735-765.
24. S. CHANDRASEKARAN AND A.H. SAYED, Stabilizing the generalized Schur algorithm, SIAM J. Matrix Anal. Appl., 14 (1996), pp. 950-983.
25. G. COLLINS, Subresultant and reduced polynomial remainder sequences, J. ACM, 14 (1967), pp. 128-142.
26. S.R. CZAPOR AND K.O. GEDDES, A comparison of algorithms for the symbolic computation of Padé approximants, in Proceedings of EUROSAM'84, J. Fitch, ed., Lecture Notes in Comput. Sci. 174, Springer-Verlag, Berlin, 1984, pp. 248-259.
27. R.W. FREUND AND H. ZHA, Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems, Linear Algebra Appl., 188/89 (1993), pp. 255-303.
28. R.W. FREUND AND H. ZHA, A look-ahead algorithm for the solution of general Hankel systems, Numer. Math., 64 (1993), pp. 295-321.
29. W.F. FORD AND A. SIDI, An algorithm for a generalization of the Richardson extrapolation process, SIAM J. Numer. Anal., 24 (1987), pp. 1212-1232.
30. K.O. GEDDES, S.R. CZAPOR, AND G. LABAHN, Algorithms for Computer Algebra, Kluwer, Boston, MA, 1992.
31. I. GOHBERG, T. KAILATH, AND V. OLSHEVSKI, Fast Gaussian elimination with partial pivoting for matrices with displacement structure, Math. Comp., 64 (1995), pp. 1557-1567.
32. G. GOLUB AND V. OLSHEVSKI, Pivoting for Structured Matrices, with Applications, http://www-isl.stanford.edu/~olshevsk, 1997.
33. M. GU, Stable and efficient algorithms for structured systems of linear equations, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 279-306.
34. M.H. GUTKNECHT, Stable row recurrences for the Padé table and generically superfast look-ahead solvers for non-Hermitian Toeplitz systems, Linear Algebra Appl., 188/89 (1993), pp. 351-421.
35. M.H. GUTKNECHT AND M. HOCHBRUCK, Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz Systems, Numer. Math., 70 (1995), pp. 181-227.
36. G. HEINIG AND K. ROST, Algebraic Methods for Toeplitz-like Matrices and Operators, Oper. Theory Adv. Appl. 13, Birkhäuser Verlag, Basel, Boston, 1984.
37. T. KAILATH, Linear Systems, Prentice-Hall Englewood Cliffs, NJ, 1980.
38. D. KNUTH, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, MA, 1981.
39. S.Y. KUNG, T. KALIATH, AND M. MORF, A generalized resultant matrix for polynomial matrices, in Proceedings of the IEEE Conference on Decision and Control, Florida, 1976, pp. 892-895.
40. G. LABAHN, Inversion Components of block Hankel-like matrices, Linear Algebra Appl., 177 (1992), pp. 7-48.
41. G. LABAHN AND S. CABAY, Matrix Padé fractions and their computation, SIAM J. Comput., 18 (1989), pp. 639-657.
42. G. LABAHN, D.K. CHOI, AND S. CABAY, The inverses of block Hankel and block Toeplitz matrices, SIAM J. Comput., 19 (1990), pp. 98-123.
43. Z. LI, A Subresultant Theory for Linear Differential, Linear Difference and Ore Polynomials, with Applications, Ph.D. Thesis, Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, 1996.
44. W. LÜBBE, Über ein allgemeines Interpolationsproblem - Lineare Identitäten zwischen benachbarten Lösungssystemen, Ph.D. Thesis, Department of Applied Mathematics, University of Hannover, Hannover, Germany, 1983.
45. K. MAHLER, Perfect systems, Composit. Math., 19 (1968), pp. 95-166.
46. S. PASZKOWSKI, Quelques Algorithmes de l'Approximation de Padé-Hermite, Publication ANO 89, University of Science and Technology at Lille, Lille, France, 1982.
47. S. PASZKOWSKI, Recurrence relations in Padé-Hermite approximation, J. Comput. Appl. Math., 19 (1987), pp. 99-107.
48. S. PASZKOWSKI, Hermite Padé approximation: Basic notions and theorems, J. Comput. Appl. Math., 32 (1990), pp. 229-236.
49. B. SALVY AND P. ZIMMERMANN, Gfun: A Maple package for the manipulation of generating and holonomic functions in one variable, ACM Trans. Math. Software, 20 (1994), pp. 163-177.
50. A. SIDI, On a generalization of the Richardson extrapolation process, Numer. Math., 57 (1990), pp. 365-377.
51. M. VAN BAREL AND A. BULTHEEL, The computation of non-perfect Padé-Hermite approximants, Numer. Algorithms, 1 (1991), pp. 285-304.
52. M. VAN BAREL AND A. BULTHEEL, A general module theoretic framework for vector M-Padé and matrix rational interpolation, Numer. Algorithms, 3 (1992), pp. 451-462.
53. M. VAN BAREL AND A. BULTHEEL, A look-ahead algorithm for the solution of block Toeplitz systems, Linear Algebra Appl., 266 (1997), pp. 291-335.
54. M. VAN HOEIJ, Factorization of differential operators with rational function coefficients, J. Symbolic Comput., 24 (1997), pp. 537-561.
55. G. VlLLARD, Computing Popov and Hermite forms of polynomial matrices, in Proceedings of ISSAC'96, Zurich, ACM Press, New York, 1996, pp. 250-258.