System theoretic based characterisation and computation of the least common multiple of a set of polynomials.

DOI10.1016/j.laa.2003.11.009zbMath1049.65011OpenAlexW2120672240MaRDI QIDQ1430368

Nicos Karcanias, Marilena Mitrouli

Publication date: 27 May 2004

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2003.11.009

zbMATH Keywords

algorithmpolynomialsleast common multiplesystem theorycontrollability matrixalgebraic computations

Mathematics Subject Classification ID

Related Items (3)

Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ Approximate least common multiple of several polynomials using the ERES division algorithm ⋮ On the Computation of the GCD of 2-D Polynomials

Cites Work

• Fast projection methods for minimal design problems in linear system theory
• Geometric state-space theory in linear multivariable control: A status report
• A Pencil Approach for Embedding a Polynomial Matrix into a Unimodular matrix
• Structure and Smith-MacMillan form of a rational matrix at infinity
• A matrix pencil based numerical method for the computation of the GCD of polynomials
• Computation of the GCD of polynomials using gaussian transformations and shifting
• Numerical computation of the least common multiple of a set of polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: System theoretic based characterisation and computation of the least common multiple of a set of polynomials.