Unimodular completion of polynomial matrices
暂无分享,去创建一个
[1] George Labahn,et al. Computing minimal nullspace bases , 2012, ISSAC.
[2] Claude-Pierre Jeannerod,et al. On the complexity of polynomial matrix computations , 2003, ISSAC '03.
[3] George Labahn,et al. Computing column bases of polynomial matrices , 2013, ISSAC '13.
[4] George Labahn,et al. Normal forms for general polynomial matrices , 2006, J. Symb. Comput..
[5] M. G. Bruin,et al. A uniform approach for the fast computation of Matrix-type Padé approximants , 1996 .
[6] Alban Quadrat,et al. Isomorphisms and Serre's reduction of linear systems , 2013 .
[7] B. Sturmfels,et al. Algorithms for the Quillen-Suslin theorem , 1992 .
[8] Wei Zhou,et al. Fast Order Basis and Kernel Basis Computation and Related Problems , 2013 .
[9] George Labahn,et al. Recursiveness in matrix rational interpolation problems , 1997 .
[10] R. Gregory Taylor,et al. Modern computer algebra , 2002, SIGA.
[11] Dante C. Youla,et al. The Quillen - Suslin theorem and the structure of n-dimensional elementary polynomial matrices , 1984 .
[12] George Labahn,et al. Shifted normal forms of polynomial matrices , 1999, ISSAC '99.
[13] Joachim von zur Gathen,et al. Modern Computer Algebra , 1998 .
[14] Tsit Yuen Lam,et al. Serre's Conjecture , 1978 .
[15] A. Quadrat,et al. Applications of the Quillen-Suslin theorem to multidimensional systems theory , 2007 .
[16] George Labahn,et al. Efficient algorithms for order basis computation , 2012, J. Symb. Comput..