Approximate least common multiple of several polynomials using the ERES division algorithm

DOI10.1016/j.laa.2016.09.010zbMath1352.65126OpenAlexW2520546048MaRDI QIDQ331163

Marilena Mitrouli, Dimitrios Christou, Nicos Karcanias

Publication date: 26 October 2016

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

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

zbMATH Keywords

complexitylinear systemsgreatest common divisornumerical stabilityleast squaresnumerical optimizationlow-rank approximationnumerical errorsshifting operation

Mathematics Subject Classification ID

Cites Work

• The ERES method for computing the approximate GCD of several polynomials
• Fast projection methods for minimal design problems in linear system theory
• Certified approximate univariate GCDs
• System theoretic based characterisation and computation of the least common multiple of a set of polynomials.
• Necessary and sufficient conditions for zero assignment by constant squaring down
• A geometrical approach to finding multivariate approximate LCMs and GCDs
• Structured total least norm and approximate GCDs of inexact polynomials
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
• Minimal bases of matrix pencils and coprime matrix fraction descriptions
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• Invariance properties, and characterization of the greatest common divisor of a set of polynomials
• Optimal backward perturbation bounds for the linear least squares problem
• Geometric properties, invariants, and the Toeplitz structure of minimal bases of rational vector spaces
• Computation of the GCD of polynomials using gaussian transformations and shifting
• Numerical computation of the least common multiple of a set of polynomials
• Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate least common multiple of several polynomials using the ERES division algorithm