Output-sensitive modular algorithms for polynomial matrix normal forms

Journal of Symbolic Computation

Volumn 42, Issue 7, 2007, Pages 733-750

  Cheng, Howard ^a   Labahn, George ^b  

^a UNIVERSITY OF LETHBRIDGE   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Matrices; Modular algorithm; Popov form; Row reduced form; Weak Popov form

Indexed keywords

EID: 34250663510     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2007.03.001     Document Type: Article

References (22)

1. Abramov S., and Bronstein M. On solutions of linear functional systems. Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation (2001), ACM 1-6
2. Abramov, S., Bronstein, M., Linear algebra for skew-polynomial matrices. Technical Report RR-4420, INRIA. 2002
3. Bareiss E. Sylvester's identity and multistep integer-preserving Gaussian elimination. Math. Comp. 22 (1968) 565-578
4. Beckermann B., and Labahn G. Effective computation of rational approximants and interpolants. Reliable Computing 6 (2000) 365-390
5. Beckermann, B., Labahn, G., On the fraction-free computation of column-reduced matrix polynomials via FFFG. Technical Report ANO436, Laboratoire ANO, University of Lille, 2001. Available at http://ano.univ-lille1.fr/pub/2001/ano436.ps.Z
6. Beckermann B., and Labahn G. Recursiveness in matrix rational interpolation problems. J. Comput. Appl. Math. 77 (1997) 5-34
7. Beckermann B., and Labahn G. Fraction-free computation of matrix rational interpolants and matrix GCDs. SIAM J. Matrix Anal. and Appl. 22 1 (2000) 114-144
8. Beckermann B., Labahn G., and Villard G. Shifted normal forms of polynomial matrices. Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (1999), ACM 189-196
9. Beckermann B., Cheng H., and Labahn G. Fraction-free row reduction of matrices of skew polynomials. Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation (2002), ACM 8-15
10. Beckermann B., Cheng H., and Labahn G. Fraction-free row reduction of matrices of Ore polynomials. J. Symbolic Comput. 41 5 (2006) 513-543
11. Beckermann B., Labahn G., and Villard G. Normal forms for general polynomial matrices. J. Symbolic Comput. 41 6 (2006) 708-737
12. Brown W.S. On Euclid's algorithm and the computation of polynomial greatest common divisors. J. ACM 18 4 (1971) 478-504
13. Cabay S. Exact solution of linear equations. Proceedings of the Second Symposium on Symbolic and Algebraic Manipulation (1971) 392-398
14. Cheng, H., Algorithms for Normal Forms for Matrices of Polynomials and Ore Polynomials. Ph.D. Thesis. University of Waterloo, 2003
15. Geddes K.O., Czapor S.R., and Labahn G. Algorithms for Computer Algebra (1992), Kluwer Academic Publishers
16. Giorgi P., Jeannerod C.-P., and Villard G. On the complexity of polynomial matrix computations. Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation (2003) 135-142
17. Kailath T. Linear Systems (1980), Prentice-Hall
18. Kaltofen E., and Monagan M. On the genericity of the modular polynomial GCD algorithm. Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (1999), ACM 59-66
19. Li Z., and Nemes I. A modular algorithm for computing greatest common right divisors of Ore polynomials. Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (1997), ACM 282-289
20. Mulders T., and Storjohann A. On lattice reduction for polynomial matrices. J. Symbolic Comput. 35 4 (2003) 377-401
21. Storjohann, A., Algorithms for Matrix Canonical Forms. Ph.D. Thesis. Department of Computer Science, Swiss Federal Institute of Technology-ETH, 2000
22. von zur Gathen J., and Gerhard J. Modern Computer Algebra. second edition (2002), Cambridge University Press