Straight-line computation of the polynomial matrix inverse
暂无分享,去创建一个
[1] B. Beckermann,et al. A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants , 1994, SIAM J. Matrix Anal. Appl..
[2] Arnold Schönhage,et al. Schnelle Multiplikation großer Zahlen , 1971, Computing.
[3] Robert T. Moenck,et al. Approximate algorithms to derive exact solutions to systems of linear equations , 1979, EUROSAM.
[4] A. Storjohann. Algorithms for matrix canonical forms , 2000 .
[5] George Labahn,et al. Shifted normal forms of polynomial matrices , 1999, ISSAC '99.
[6] Michael Clausen,et al. Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.
[7] Erich Kaltofen,et al. On fast multiplication of polynomials over arbitrary algebras , 1991, Acta Informatica.
[8] Jr. G. Forney,et al. Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems , 1975 .
[9] J. D. Lipson,et al. Chinese remainder and interpolation algorithms , 1971, SYMSAC '71.
[10] Ching-An Lin,et al. An algorithm for inverting rational matrices , 1996 .
[11] F. Gantmakher,et al. Théorie des matrices , 1990 .
[12] Thomas Kailath,et al. Linear Systems , 1980 .
[13] Erwin H. Bareiss,et al. Computational Solutions of Matrix Problems Over an Integral Domain , 1972 .
[14] Marie-Pierre Quere Stuchlik. Algorithmique des faisceaux lineaires de matrices, application a la theorie des systemes lineaires et a la resolution d'equations algebro-differentielles , 1997 .
[15] J. Hopcroft,et al. Triangular Factorization and Inversion by Fast Matrix Multiplication , 1974 .
[16] Arne Storjohann. High-order lifting , 2002, ISSAC '02.