Partitioning method for rational and polynomial matrices
The authors investigate the problem of symbolic computation of the Moore-Penrose inverse of a one-variable rectangular rational or polynomial matrix by means of \textit{T. N. E. Greville}'s recursive algorithm [SIAM Rev. 2, 15--22 (1960)]. They also propose an algorithm for computation of the Moore-Penrose inverse of rational matrix and the corresponding algorithm for symbolic computation of the Moore-Penrose inverse of a polynomial matrix. The major problems arising in the implementation of this method are repetitive recomputations of the same values and simplification of rational polynomial expressions which contain unknown variable. These algorithms are implemented in the symbolic computational package MATHEMATICA.
- Symbolic computation of the Moore–Penrose inverse using a partitioning method
- scientific article; zbMATH DE number 2233533
- Partitioning method: computations and applications
- Symbolic computation of weighted Moore-Penrose inverse using partitioning method
- Symbolic and recursive computation of different types of generalized inverses
- 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
- Further results on output control in the servomechanism sense
- Generalized inverses of two-variable polynomial matrices and applications
- scientific article; zbMATH DE number 107539 (Why is no real title available?)
- scientific article; zbMATH DE number 953808 (Why is no real title available?)
- Leverrier’s Algorithm: A New Proof and Extensions
- Report on test matrices for generalized inverses
- Some Applications of the Pseudoinverse of a Matrix
- The computation and application of the generalized inverse via Maple
- Transfer-function matrix synthesis by matrix generalized inverses
- An efficient method to compute different types of generalized inverses based on linear transformation
- Representations and symbolic computation of generalized inverses over fields
- Computing generalized inverse of polynomial matrices by interpolation
- Symbolic computation of weighted Moore-Penrose inverse using partitioning method
- Effective partitioning method for computing weighted Moore-Penrose inverse
- Full-rank block LDL^ decomposition and the inverses of n n block matrices
- Computing Moore-Penrose inverses of Ore polynomial matrices
- Computation of generalized inverses using PHP/MySQL environment
- scientific article; zbMATH DE number 2127748 (Why is no real title available?)
- Computing generalized inverses using LU factorization of matrix product
- Computation of generalized inverses by using the \(LDL^{\ast}\) decomposition
- Symbolic computation of \(A_{T,S}^{(2)}\)-inverses using QDR factorization
- Symbolic computation of the Moore–Penrose inverse using a partitioning method
- ComputingAT,S(2) inverses of Hermitian matrices viaLDL*decomposition for a square matrixA
- Partitioning method: computations and applications
- Application of the partitioning method to specific Toeplitz matrices
- Effective partitioning method for computing generalized inverses and their gradients
- scientific article; zbMATH DE number 2233533 (Why is no real title available?)
- Partitioning procedure for polynomial optimization
- Evaluating \(A_{t,S}^{(2)}\) matrix inverses from full-rank singular value decomposition
- Symbolic and recursive computation of different types of generalized inverses
- About the generalized LM-inverse and the weighted Moore-Penrose inverse
- Differentiation of generalized inverses for rational and polynomial matrices
This page was built for publication: Partitioning method for rational and polynomial matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883158)
