A compound matrix algorithm for the computation of the Smith form of a polynomial matrix

DOI10.1007/BF02140679zbMath0807.65040OpenAlexW2102558929MaRDI QIDQ1334229

Marilena Mitrouli, Grigoris I. Kalogeropoulos

Publication date: 17 October 1994

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02140679

zbMATH Keywords

numerical resultscompound matricesMATLABpolynomial matrixnumerical algorithmSmith canonical form

Mathematics Subject Classification ID

Related Items (5)

On non-homogeneous singular systems of fractional nabla difference equations ⋮ On non-homogeneous generalized linear discrete time systems ⋮ On stability and state feedback stabilization of singular linear matrix difference equations ⋮ Duality of singular linear systems of fractional nabla difference equations ⋮ Optimal solutions for non-consistent singular linear systems of fractional nabla difference equations

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• Exact reduction of a polynomial matrix to the Smith normal form
• A matrix pencil based numerical method for the computation of the GCD of polynomials
• Part I-Smith form and common divisor of polynomial matrices
• Computation of the GCD of polynomials using gaussian transformations and shifting
• Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations
• Comparison of algorithms for calculation of g.c.d. of polynomials

This page was built for publication: A compound matrix algorithm for the computation of the Smith form of a polynomial matrix