Fraction-free computation of matrix Padé systems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Fraction-free computation of matrix Padé systems

Full text

Pdf (1.15 MB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1997 international symposium on Symbolic and algebraic computation table of contents

Kihei, Maui, Hawaii, United States

Pages: 125 - 132

Year of Publication: 1997

ISBN:0-89791-875-4

Authors

Bernhard Beckermann	Lahlratoire d'Analyse Numérique et d'Optimisation, UFR IEEA - M3, USTL Flandres Artois, F 59655 Villeneuve d'Ascq Ccdex, France
Stan Cabay	Department of Computer Science, University of Alberta, Edmonton, Alberta, Canada
George Labahn	Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 15, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/258726.258765 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	G.A. Baker & P.R. Graves-Morris, Padd Approximants, second edition, Cambridge Univ. Press, Cambridge, UK (1995).
	2	E. Bareiss, Sylvester's Identity and multistep integerpreserving Gaussian elimination, Math. Comp., 22(103) (1968) 565-578.
	3	B. Beckermann, Zur interpolation mit polynomialen Linearkombinationen beliebiger Funktionen, Thesis, Univ. Hannover, 1990.
	4	B. Beckermann & G. Labahn, A uniform approach for Hermite Pad6 and simultaneous Pad6 Approximants and their matrix generalizations, Numerical Algorithms 3 (1992) 45- 54.
	5	Bernhard Beckermann , George Labahn, A Uniform Approach for the Fast Computation of Matrix-Type Pade Approximants, SIAM Journal on Matrix Analysis and Applications, v.15 n.3, p.804-823, July 1994 [doi>10.1137/S0895479892230031]
	6	Bernhard Beckermann , George Labahn, Recursiveness in matrix rational interpolation problems, Journal of Computational and Applied Mathematics, v.77 n.1-2, p.5-34, Jan. 13, 1997 [doi>10.1016/S0377-0427(96)00120-3]
	7	B. Beckermann & G. Labahn, Fraction-free Computation of Matrix GCD's and Rational Interpolants. Manuscript.
	8	W. S. Brown , J. F. Traub, On Euclid's Algorithm and the Theory of Subresultants, Journal of the ACM (JACM), v.18 n.4, p.505-514, Oct. 1971 [doi>10.1145/321662.321665]
	9	A. Bultheel, Algorithms to compute the reflection coefficients of digital filters, Numerical Methods o/Approximation Thoery, 7(1983)
	10	Stanley Cabay , Dong Koo Choi, Algebraic computations of scaled pade´ fractions, SIAM Journal on Computing, v.15 n.1, p.243-270, Feb. 1986 [doi>10.1137/0215018]
	11	S. Cabay , P. Kossowski, Power series remainder sequences and Pade´ fractions over an integral domain, Journal of Symbolic Computation, v.10 n.2, p.139-163, Aug. 1990 [doi>10.1016/S0747-7171(08)80038-7]
	12	S. Cabay & G. Labahn, A superfast algorithm for multidimensional Pad~ systems, Numerical Algorithms 2 (1992) 201-224.
	13	George E. Collins, Subresultants and Reduced Polynomial Remainder Sequences, Journal of the ACM (JACM), v.14 n.1, p.128-142, Jan. 1967 [doi>10.1145/321371.321381]
	14	Keith O. Geddes , Stephen R. Czapor , George Labahn, Algorithms for computer algebra, Kluwer Academic Publishers, Norwell, MA, 1992
	15	G. Labahn, Inversion Components of Block Hankel-like Matrices, Linear Algebra and its Applications 177 (1992) 7-48
	16	George Labahn , Stan Cabay, Matrix Pade´ fractions and their computation, SIAM Journal on Computing, v.18 n.4, p.639-657, Aug. 1989 [doi>10.1137/0218044]
	17	George Labahn , Dong Koo Chio , Stan Cabay, The inverses of block Hankel and block Toeplitz matrices, SIAM Journal on Computing, v.19 n.1, p.98-123, Feb. 1990 [doi>10.1137/0219006]
	18	H.H. Rosenbrock, State-Space and Multivariable Theory. New York: Wiley, 1970.
	19	Bruno Salvy , Paul Zimmerman, GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable, ACM Transactions on Mathematical Software (TOMS), v.20 n.2, p.163-177, June 1994 [doi>10.1145/178365.178368]
	20	J. Rafael Sendra , Juan Llovet, An extended polynomial GCD algorithm using Hankel matrices, Journal of Symbolic Computation, v.13 n.1, p.25-39, Jan. 1992 [doi>10.1016/0747-7171(92)90003-M]
	21	Y Sugiyama, An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm, IEEE Transactions on Information Theory, v.32 n.3, p.394-409, May 1986 [doi>10.1109/TIT.1986.1057178]
	22	M. Van Barel & A. Bultheel, A general module theoretic framework for vector M-Pad~ and matrix rational interpolation, Numerical Algorithms 3 (1992) 451-462.
	23	Mark Van Hoeij, Factorization of differential operators with rational functions coefficients, Journal of Symbolic Computation, v.24 n.5, p.537-561, Nov. 1997 [doi>10.1006/jsco.1997.0151]
	24	G. Villard, Personal Communication (1996)

CITED BY 3

	Bernhard Beckermann , George Labahn , Gilles Villard, Shifted normal forms of polynomial matrices, Proceedings of the 1999 international symposium on Symbolic and algebraic computation, p.189-196, July 28-31, 1999, Vancouver, British Columbia, Canada
	Ruyong Feng , Xiao-Shan Gao , Zhenyu Huang, Rational solutions of ordinary difference equations, Journal of Symbolic Computation, v.43 n.10, p.746-763, October, 2008
	Mark W. Giesbrecht , Ilias Kotsireas , Austin Lobo, ISSAC 2007 poster abstracts, ACM Communications in Computer Algebra, v.41 n.1-2, p.38-72, March-June 2007 issues 159-160