Inverses of multivariable polynomial matrices by discrete Fourier transforms
From MaRDI portal
This paper deals with the fast computation of the Moore-Penrose and Drazin inverse of a multivariable polynomial matrix. The authors implement evaluation-interpolation techniques and fast Fourier transform. Numerical examples are also performed.
Recommendations
- Polynomial generalized inverses of polynomial matrices
- Inversion of polynomial matrices
- Computation of the generalized inverse of a polynomial matrix and applications
- scientific article; zbMATH DE number 540181
- Inverse representation theorem for matrix polynomials and multiscaling functions
- DFT calculation of the generalized and Drazin inverse of a polynomial matrix
- Generalized inverses of two-variable polynomial matrices and applications
- scientific article; zbMATH DE number 3882587
- On the computation of the generalized inverse of a polynomial matrix
- Inversion of polynomial and rational matrices
Cited in
(16)- DFT calculation for the \(\{2\}\)-inverse of a polynomial matrix with prescribed image and kernel
- DFT calculation of the generalized and Drazin inverse of a polynomial matrix
- Computation of Moore-Penrose generalized inverses of matrices with meromorphic function entries
- On the computation of the inverse of a two-variable polynomial matrix by interpolation
- Perfect control for right-invertible Grünwald-Letnikov plants - an innovative approach to practical implementation
- Symbolic computation of weighted Moore-Penrose inverse using partitioning method
- Extensions of Faddeev's algorithms to polynomial matrices
- Construction of multiscaling functions using the inverse representation theorem of matrix polynomials
- Effective partitioning method for computing weighted Moore-Penrose inverse
- On the Leverrier-Faddeev algorithm for computing the Moore-Penrose inverse
- On the Newton bivariate polynomial interpolation with applications
- A study on new right/left inverses of nonsquare polynomial matrices
- Asymptotically fast polynomial matrix algorithms for multivariable systems
- Coding and Cryptography
- Effective computation of Moore-Penrose inverses over fields of rational functions by specializations
- Symbolic and recursive computation of different types of generalized inverses
This page was built for publication: Inverses of multivariable polynomial matrices by discrete Fourier transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701946)
