Computing the rank and a small nullspace basis of a polynomial matrix

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn 2005, Issue , 2005, Pages 309-316

  Storjohann, Arne ^a   Villard, Gilles ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIV LYON   (France)

Author keywords

Linear algebra; Matrix rank; Minimal polynomial basis; Nullspace basis; Polynomial matrix

Indexed keywords

LINEAR ALGEBRA; MATRIX ALGEBRA; NUMBER THEORY; POLYNOMIALS; VECTORS;

MATRIX RANK; MINIMAL POLYNOMIAL BASIS; NULLSPACE BASIS; POLYNOMIAL MATRIX;

COMPUTATION THEORY;

EID: 33749575549     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073884.1073927     Document Type: Conference Paper

References (34)

1. B. Beckermann and G. Labahn. A uniform approach for the fast computation of matrix-type Fade approximants. SIAM J. Matrix Anal. Appl. 15(3):804-823, July 1994.
2. B. Beckermann, G. Labahn, and G.Villard. Normal forms for funeral polynomial matrices. RR LIP 2002-1, Laboratoire LIP, NS Lyon, France, 2002. To appear in J. Symb. Comput.
3. T. Beelen and P.M. VanDooren. An improved algorithm for the computation of Kronecker's canonical form of a singular pencil. Lin. Alg. Appl., 105:9-65, 1988.
4. T. Beelen and P.M. Van Dooren. A pencil approach for embedding a polynomial matrix into a unimodular matrix. SIAM J. Matrix Anal. Appl., 9(1):77-89, Jan. 1988.
5. R.R. Bitmead, S.Y. Kung, B.D.O. Anderson, and T. Kailath. Greatest common divisors via generalized Sylvester and Bezout matrices. IEEE Trans. Aut. Control., 23(6):1043-1047, 1978.
6. A. Bostan. Algorithmique efficace pour des opérations de base en calcul formel. PhD thesis, École Polytechnique, Palaiseau, France, Dec. 2003.
7. A. Bostan and E. Schost. Polynomial evaluation and interpolation on special sets of points. To appear in J. Complexity.
8. P. Bürgisser, M.Clausen, and M.A. Shokrollahi. Algebraic Complexity Theory. Volume 315, Grundlehren der mathematischen Wissenschaften. Springer-Verlag, 1997.
9. D.G. Cantor and E. Kaltofen. On fast multiplication of polynomials over arbitrary algebras. Acta Informatica, 28(7):693-701, 1991.
10. L. Chen, W. Eberly, E. Kaltofen, B.D. Saunders, W.J. Turner, and G. Villard. Efficient matrix preconditioners for black box linear algebra. Lin. Alg. Appl., 343-344:119-146, 2002.
11. D. Coppersmith and S.Winograd. Matrix multiplication via arithmetic progressions. J. of Symb. Comput., 9(3):251-280, 1990.
12. R. A. DeMillo and R. J. Lipton. A probabilistic remark on algebraic program testing. Inf. Proc. Letters, 7(4):193-195, 1978.
13. G.D. Forney. Minimal bases of rational vector spaces, with applications to multivariable linear systems. SIAM J. Control, 13:493-520, 1975.
14. J. von zur Gathen and J.Gerhard. Modern Computer Algebra. Cambridge University Press, 1999.
15. P. Giorgi, C.-P. Jeannerod, and G.Villard. On the complexity of polynomial matrix computations. In Proc. ISSAC'03, Philadelphia, Pennsylvania, USA, pages 135-142. ACM Press, August 2003.
16. C.-P. Jeannerod and G.Villard. Essentially optimal computation of the inverse of generic polynomial matrices. J. Complexity, 21(1):72-86, 2005.
17. T. Kailath. Linear systems. Prentice Hall, 1980.
18. E. Kaltofen. On computing determinants without divisions. In Proc. ISSAC'92, Berkeley, California USA, pages 342-349. ACM Press, July 1992.
19. E. Kaltofen, M.S. Krishnamoorthy, and B.D. Saunders. Parallel algorithms for matrix normal forms. Lin. Alg. Appl., 136:189-208, 1990.
20. E. Kaltofen and B.D. Saunders. On Wiedemann's method of solving sparse linear systems. In Proc. AAECC-9, LNCS 539, Springer Verlag, pages 29-38, 1991.
21. E. Kaltofen and G. Villard. On the complexity of computing determinants. Computational Complexity, 13:91-130, 2004.
22. D.E. Knuth. The analysis of algorithms. In Proc. Int. Congr. Math., Nice, France, volume3, pages 269-274, 1970.
23. P. Misra, P. Van Dooren, and A. Varga. Computation of structural invariants of generalized state-space systems. Automatica, 30:1921-1936, 1994.
24. T. Mulders and A. Storjohann. On lattice reduction for polynomial matrices. J. Symb. Comput., 35(4):377-401, 2003.
25. C.Oarǎ and P. Van Dooren. An improved algorithm for the computation of structural invariants of a system pencil and related geometric aspects. Syst. Cont. Letters, 30:38-48, 1997.
26. A. Schönhage. Schnelle Berechnung von Kettenbruchenwicklungen. Acta Informatica, 1:139-144, 1971.
27. J.T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27:701-717, 1980.
28. A. Storjohann. Algorithms for Matrix Canonical Forms. PhD thesis, Institut für Wissenschaftliches Rechnen, ETH-Zentrum, Zurich, Switzerland, November 2000.
29. A. Storjohann. High-Order Lifting. In Proc. ISSAC'OS, Lille, France, pages 246-254. ACM Press, July 2002.
30. A. Storjohann. High-order lifting and integrality certification. Journal of Symbolic Computation, 36(3-4) :613-648, 2003.
31. A. Storjohann and G.Villard. Computing the rank and a small nullspace basis of a polynomial matrix. RR LIP 2005-3, Laboratoire LIP, ÉNS Lyon, France, 2005, http://www.ens-lyon.fr/LIP/Pub
32. G.Villard. A study of Coppersmith's block Wiedemann algorithm using matrix polynomials, Feb. 1997. RR 975-I-M IMAG Grenoble, France.
33. G.Villard. Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems. In Proc. ISSAC'97, Maui, Hawaii, USA, pages 32-39. ACM Press, July 1997.
34. R.E. Zippel. Probabilistic algorithms for sparse polynomials. In Proc. EUROSAM, LNCS 72, Springer Verlag, pages 216-226, 1979.