Asymptotically fast polynomial matrix algorithms for multivariable systems

International Journal of Control

Volumn 79, Issue 11, 2006, Pages 1359-1367

  Jeannerod, C P ^a   Villard, G ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; INVERSE PROBLEMS; MATRIX ALGEBRA; POLYNOMIALS; RANDOM PROCESSES;

COMPUTER ALGEBRA; POLYNOMIAL MATRIX ALGORITHMS; POLYNOMIAL MATRIX MULTIPLICATION;

CONTROL SYSTEMS;

EID: 33747625639     PISSN: 00207179     EISSN: 13665820     Source Type: Journal    
DOI: 10.1080/00207170600726477     Document Type: Article

References (17)

1. B. Beckermann and G. Labahn, "A uniform approach for the fast computation of matrix-type Padé approximants", SIAM J. Matrix Anal. Appl., 15, pp. 804-823, 1994.
2. B. Beckermann, G. Labahn and G. Villard, "Normal forms for general polynomial matrices", J. Symb. Camp., 41(6), pp. 708-737, 2006.
3. A. Bostan and E. Schost, "Polynomial evaluation and interpolation on special sets of points, J. Camp., 21, pp. 420-446, 2005.
4. B. Bürgisser, C. Clausen and M.A. Shokrollahi, Algebraic Complexity Theory, volume 315 of Grundlehren der mathematischen Wissenschaften, Berlin: Springer-Verlag, 1997.
5. D.G. Cantor and E. Kaltofen, "On fast multiplication of polynomials over arbitrary algebras", Acta Informat., 28, pp. 693-701, 1991.
6. G.D. Forney, "Minimal bases of rational vector spaces, with applications to multivariable linear systems", SIAM J. Contr., 13, pp. 493-520, 1975.
7. J. von zur Gathen and J. Gerhard, Modern Computer Algebra, 2nd edn, Cambridge, UK.: Cambridge University Press, 2003.
8. P. Giorgi, C.-P. Jeannerod and G. Villard, "On the complexity of polynomial matrix computations", in Proc. International Symposium on Symbolic and Algebraic Compulation, Philadelphia, Pennsylvania, USA: ACM Press, August 2003, pp. 135-142.
9. C.-P. Jeannerod and G. Villard, "Essentially optimal computation of the inverse of generic polynomial matrices", J. Comp., 21, pp. 72-86, 2005.
10. T. Kailath, Linear Systems, Englewood Cliffs, N.J.: Prentice-Hall, 1980.
11. E. Kaltofen, "On computing determinants without divisions", in International Symposium on Symbolic and Algebraic Computation, Berkeley, California USA: ACM Press, July 1992, pp. 342-349.
12. E. Kaltofen and G. Villard, "On the complexity of computing determinants", Computat. Compl., 13, pp. 91-130, 2004.
13. D.E. Knuth, "The analysis of algorithms", in Proc. International Congress of Mathematicians, Nice, France, 3, 1970, pp. 269-274.
14. C. Oarǎ and A. Varga, "Minimal degree coprime factorization of rational matrices", SIAM J. Matrix Anal. Appl., 21, pp. 245-278, 1999.
15. A. Schönhage, "Schnelle Berechnung von Kettenbruchentwick- lungen", Acta Informat., 1, pp. 139-144, 1971.
16. A. Storjohann, "High-order lifting and integrality certification", J. Symb. Comp., 36, pp. 613-648, 2003. Special issue International Symposium on Symbolic and Algebraic Computation (ISSAC'2002). Guest editors: M. Giusti & L.M. Pardo.
17. A. Storjohann and G. Villard, "Computing the rank and a small nullspace basis of a polynomial matrix", in Proc. International Symposium on Symbolic and Algebraic Computation, Beijing, China: ACM Press, July 2005, pp. 309-316.