Shifted normal forms of polynomial matrices

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Shifted normal forms of polynomial matrices

Full text

Pdf (933 KB)

Source

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

Vancouver, British Columbia, Canada

Pages: 189 - 196

Year of Publication: 1999

ISBN:1-58113-073-2

Authors

Bernhard Beckermann	Laboratoire d'Analyse Numéique et d'OptimiSation, UFR IEEA M3, USTL Flandres Artois, F-59655 Villeneuve d'Ascq CEDEX, France
George Labahn	Department of Computer Science, University Of Waterloo, Outario, Canada
Gilles Villard	LMC-IMAG, BP 53, F-38041 Grenoble cedex 9

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): 4, Downloads (12 Months): 11, Citation Count: 8

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/309831.309929 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	Bernhard Beckermann , Stan Cabay , George Labahn, Fraction-free computation of matrix Padé systems, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.125-132, July 21-23, 1997, Kihei, Maui, Hawaii, United States [doi>10.1145/258726.258765]
	2	BECKERMANN, B., AND LABAIIN, G. A uniforrrl approach for herrrlit(.', pa(t~, and simultaneous pad6 approximants and their matrix ge)leralizations. Numerical Algorithms 3 (1992), 45-54.
	3	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]
	4	BECKERMANN: B.. ANI) LABAHN, G. Fraction-free computation of matrix god's and rational interpola.nts. Submit.ted to SIAM .1. Matrix Anal. Appl. (1997), 45pgs.
	5	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]
	6	BECKERMANN, B., LABAHN, G.: AND VILLARD, G. Shifted normal forins of general polynomial matrices. manuscript. 1999.
	7	Th. G. J. Beelen , G. J. van den Hurk , C. Praagman, A new method for computing a column reduced polynomial matrix, Systems & Control Letters, v.10 n.4, p.217-224, April 1988 [doi>10.1016/0167-6911(88)90010-2]
	8	BULTIIEFL, A., AND VAN BAR.EL. N{. A matrix euclidean algorithm and the matrix minimal padd apt)roximation problem. Continued Fractions and Padd A pprox.imants (1990).
	9	G.D. FORNEY, J. Mi,fimal bases of rational vector spaces, with applications to multivariable linear systems. SIAM J. Control 13 (1975), 493 520.
	10	Keith O. Geddes , Stephen R. Czapor , George Labahn, Algorithms for computer algebra, Kluwer Academic Publishers, Norwell, MA, 1992
	11	HAVAS, G.. MAJEWSKI, B., ANI) i'k.IATTIIEWS, K. Extended gcd and hernlite nornlal forln algorit;hms via lat;- t.ice basis reduction. Experimental Mathematics 7(2) (1998), 125-135.
	12	KAII:ATIt, T. Lin~;ar Systems. Prenti(:c-Hall, 1980.
	13	KAI:rOVEN. E., KmSHNAMOOIVrHY, M., AND SAUN- DERS, B. ParMlel Mgorithms for matrix normal forms. Linear Algebra and its Applications 136 (1990), 189-- 2O8.
	14	KANNAN, R. Solving systems of linear equations over polynomials. The.ore.tical Computer Sole.nee 39 (1985), 69 88.
	15	h/IACDUF'FEE., C. 7'he Theory of Matrices. Chelsea,
	16	NEWMAN, I~i. Integral Matrices. Aca(telnic Press, New- York. 1972.
	17	P()POV, V. Some properties of control systems with irreducible matrix transfcr functions. L~:cture Notes in Mathematics 144 (1969), 169-180.
	18	Alexandeer Schrijver, Theory of linear and integer programming, John Wiley & Sons, Inc., New York, NY, 1986
	19	STt.IC.HLIK-QUERE. 1VI. How t.o (:omI)ute nlinilnal basses using pad~. approxilnants. Rapport. de recherche lip6 1997/035, Labora.toire d'Informatique, de Pro'is 6, Frml(:e, 1997.
	20	\.:AN BAR.EL, ~., AND BUITI.'HEEL, i. A generalized nlinimal partial realization problem. Linear Algebra and its Applications 254 (1997), 527--551.
	21	VERGHESE, G.: AND KAII~ATH, T. Rational inatrix structurc. IEEE Trans. Automat. Control 26 (1981). 434-438.
	22	G. Villard, Computing Popov and Hermite forms of polynomial matrices, Proceedings of the 1996 international symposium on Symbolic and algebraic computation, p.250-258, July 24-26, 1996, Zurich, Switzerland [doi>10.1145/236869.237082]

CITED BY 8

	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003
	T. Mulders , A. Storjohann, On lattice reduction for polynomial matrices, Journal of Symbolic Computation, v.35 n.4, p.377-401, April 2003
	Claude-Pierre Jeannerod , Gilles Villard, Essentially optimal computation of the inverse of generic polynomial matrices, Journal of Complexity, v.21 n.1, p.72-86, February 2005
	Dimitri Kagaris, A similarity transform for linear finite state machines, Discrete Applied Mathematics, v.154 n.11, p.1570-1577, 1 July 2006
	Howard Cheng , George Labahn, Output-sensitive modular algorithms for polynomial matrix normal forms, Journal of Symbolic Computation, v.42 n.7, p.733-750, July, 2007
	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
	Wei Zhou , George Labahn, Efficient computation of order bases, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, July 28-31, 2009, Seoul, Republic of Korea
	Bernhard Beckermann , George Labahn, Fraction-free computation of simultaneous padé approximants, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, July 28-31, 2009, Seoul, Republic of Korea