An algorithm for coprime matrix fraction description using Sylvester matrices
Several algorithms for the computation of coprime matrix fraction descriptions have been proposed in the past. Here we explore some of the properties of Sylvester matrices and develop a different approach to the problem which is based on singular value decompositions and therefore avoids problems of...
Main Authors: | Basilio, J, Kouvaritakis, B |
---|---|
Format: | Journal article |
Language: | English |
Published: |
1997
|
Similar Items
-
Sylvester-type matrices for sparse resultants
by: Nahar Ahmad, Shamsatun, et al.
Published: (2010) -
Construction of Sylvester-Hadamard Matrices by Using Binary Code
Published: (2009-04-01) -
Boolean Functions and Permanents of Sylvester Hadamard Matrices
by: José Andrés Armario
Published: (2021-01-01) -
Hybrid resultant matrix algorithm based on the sylvester-bezout formulation
by: Ahmad, Shamsatun Nahar
Published: (2016) -
Gradient-Based Optimization Algorithm for Solving Sylvester Matrix Equation
by: Juan Zhang, et al.
Published: (2022-03-01)