Computing generalized inverses of a rational matrix and applications
From MaRDI portal
Publication:2454966
The paper is concerned with the analysis of the symbolic implementation of two modifications of the Leverrier-Faddeev algorithm, which are applicable in computation of the Moore-Penrose and the Drazin inverse of rational matrices. In this context, the authors propose a new algorithm for computation of the Drazin inverse and develop the symbolic implementation of all considered algorithms in the package MATHEMATICA.
Recommendations
- A finite algorithm for generalized inverses of polynomial and rational matrices
- Computing generalized inverses using LU factorization of matrix product
- scientific article; zbMATH DE number 5243977
- Symbolic and recursive computation of different types of generalized inverses
- Extensions of Faddeev's algorithms to polynomial matrices
Cites work
- A new extension of Leverrier's algorithm
- An alternative limit expression of Drazin inverse and its application
- An Application of the Cayley-Hamilton Theorem to Generalized Matrix Inversion
- An introduction to the application of the simplest matrix-generalized inverse in systems science
- Computation of the generalized inverse of a polynomial matrix and applications
- Computation of the inverse of a polynomial matrix and evaluation of its Laurent expansion
- Condition number for the W-weighted Drazin inverse and its applications in the solution of rectangular linear system
- Generalized inverses of two-variable polynomial matrices and applications
- scientific article; zbMATH DE number 3648910 (Why is no real title available?)
- scientific article; zbMATH DE number 4098590 (Why is no real title available?)
- scientific article; zbMATH DE number 3181418 (Why is no real title available?)
- scientific article; zbMATH DE number 97115 (Why is no real title available?)
- Leverrier's algorithm for singular systems
- Leverrier’s Algorithm: A New Proof and Extensions
- More on the Souriau–Frame Algorithm and the Drazin Inverse
- On the computation of the generalized inverse of a polynomial matrix
- On the modified Leverrier-Faddeev algorithm
- The algorithm for computing the Drazin inverses of two-variable polynomial matrices
- The computation and application of the generalized inverse via Maple
- The Souriau-Frame algorithm and the Drazin pseudoinverse
- Weighted generalized inverses of partitioned matrices in Banachiewicz-Schur form
Cited in
(18)- Generalized matrix inversion is not harder than matrix multiplication
- The computation and application of the generalized inverse via Maple
- A finite algorithm for generalized inverses of polynomial and rational matrices
- Gröbner basis computation of Drazin inverses with multivariate rational function entries
- An efficient method to compute different types of generalized inverses based on linear transformation
- On the Leverrier-Faddeev algorithm for computing the Moore-Penrose inverse
- Computing specified generators of structured matrix inverses
- Application of block Cayley-Hamilton theorem to generalized inversion
- scientific article; zbMATH DE number 36682 (Why is no real title available?)
- scientific article; zbMATH DE number 1740438 (Why is no real title available?)
- Symbolic computation of \(A_{T,S}^{(2)}\)-inverses using QDR factorization
- scientific article; zbMATH DE number 1779710 (Why is no real title available?)
- Symbolic computation of the Moore–Penrose inverse using a partitioning method
- scientific article; zbMATH DE number 839300 (Why is no real title available?)
- scientific article; zbMATH DE number 5220554 (Why is no real title available?)
- Symbolic computation of Drazin inverses by specializations
- EP matrices: computation of the Moore-Penrose inverse via factorizations
- Symbolic and recursive computation of different types of generalized inverses
This page was built for publication: Computing generalized inverses of a rational matrix and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454966)
