On the computation of the inverse of a two-variable polynomial matrix by interpolation
Two interpolation algorithms are presented for the computation of the inverse of a two variable polynomial matrix. The first interpolation algorithm, is based on the Lagrange interpolation method that matches pre-assigned data of the determinant and the adjoint of a two-variable polynomial matrix, on a set of points on several circles centered at the origin. The second interpolation algorithm is using discrete fourier transforms (DFT) techniques or better fast fourier transforms which are very efficient algorithms available both in software and hardware and that they are greatly benefitted by the existence of a parallel environment (through symmetric multiprocessing or other techniques). The complexity of both algorithms is discussed and illustrated examples are given. The DFT-algorithm is implemented in the Mathematica programming language and tested in comparison to the respective built-in function of Mathematica.
Unable to display preview. Download preview PDF.
- Borchardt, W. (1860). Über eine Interpolationsformel f ür eine Art symmetrischer Funktionen und deren Anwendung (pp. 1–20), Abh. d. Preu β. Akad. d. Wiss..Google Scholar
- Borgmann M., & Bolcskei H. (2004) Interpolation-based efficient matrix inversion for MIMO-OFDM receivers, Vol 2 (pp. 1941–1947). Thirty-Eighth Asilomar Conference on Signals, Systems and Computers 2004. Google Scholar
- Frigo M., & Johnson S. (1998) FFTW: An adaptive software architecture for the FFT (pp. 1381–1384). in. ICASSP Conference Proceedings 3. Google Scholar
- Hromcik, M., & Sebek, M. (2001). Fast fourier transform and linear polynomial matrix equations. Proceedings of the 1rst IFAC Workshop on Systems Structure and Control, Prague, Czech Republic.Google Scholar
- Kaczorek, T. (1985). Two-dimensional linear systems. Lecture notes in control and information sciences. Springer-Verlag New York.Google Scholar
- Kronecker, L. (1865) Über einige Interpolationsformeln für ganze Funktionen mehrerer Variabeln. Lecture at the academy of sciences, December 21, 1865, In H. Hensel (Ed.), L. Kroneckers Werke, Vol. I, Teubner, Stuttgart, 1895, pp. 133–141. (reprinted by Chelsea, New York, 1968).Google Scholar
- Lipson John, D. (1976) The fast fourier transform, Its role as an algebraic algorithm. Proceedings of the ACM Annual Conference/Annual Meeting (pp. 436–441).Google Scholar
- Mertzios B. G. (1986) An algorithm for the computation of the transfer function matrix of two dimensional systems. Journal of Franklin Inst 32: 74–80Google Scholar
- Nam O. T., Ohta Y., Matsumoto T. (1978) Inversion of rational matrices by using FFT algorithm. Transaction on IECE Japan E 61: 732–733Google Scholar
- Stefanidis P., Paplinski A. P., Gibbard M. J. (1992) Numerical operations with polynomial matrices, lecture notes in control and information sciences (Vol. 171). Springer, BerlinGoogle Scholar
- Vidyasagar M. (1985) Control systems synthesis: A factorization approach. M.I.T, Cambridge, MAGoogle Scholar