DFT calculation for the \(\{2\}\)-inverse of a polynomial matrix with prescribed image and kernel
DOI10.1016/J.AMC.2009.09.015zbMath1183.65041OpenAlexW2117836610MaRDI QIDQ1044447
Publication date: 18 December 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.09.015
numerical examplesrandom matricesdiscrete Fourier transformDrazin inversegeneralized inverseMoore-Penrose inversegroup inversepolynomial matrixpseudoinversesoverdetermined systemsfinite algorithm
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Matrices over function rings in one or more variables (15A54)
Related Items (3)
Uses Software
Cites Work
- Computation of the generalized inverse of a polynomial matrix and applications
- A finite algorithm for computing the weighted Moore-Penrose inverse \(A^ +_{MN}\)
- A modified Leverrier-Faddeev algorithm for matrices with multiple eigenvalues
- DFT calculation of the generalized and Drazin inverse of a polynomial matrix
- A finite algorithm for the Drazin inverse of a polynomial matrix
- Generalized inverses. Theory and applications.
- The Souriau-Frame algorithm and the Drazin pseudoinverse
- The Generalized Inverse A(2)T, Sof a Matrix Over an Associative Ring
- A cramer rule for solution of the general restricted linear equation∗
- Finite algorithms for the (2)-generalized inverse
- An Application of the Cayley-Hamilton Theorem to Generalized Matrix Inversion
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: DFT calculation for the \(\{2\}\)-inverse of a polynomial matrix with prescribed image and kernel