Partitioning method for rational and polynomial matrices (Q1883158)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2105526
Language Label Description Also known as
default for all languages
No label defined
    English
    Partitioning method for rational and polynomial matrices
    scientific article; zbMATH DE number 2105526

      Statements

      Partitioning method for rational and polynomial matrices (English)
      0 references
      0 references
      1 October 2004
      0 references
      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.
      0 references
      0 references
      rational matrix
      0 references
      symbolic computation
      0 references
      Moore-Penrose inverse
      0 references
      algorithms
      0 references

      Identifiers