Numerical computation of the least common multiple of a set of polynomials

DOI10.1023/A:1009979130810zbMath0984.65016OpenAlexW130500341MaRDI QIDQ5926519

Marilena Mitrouli, Nicos Karcanias

Publication date: 13 May 2001

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009979130810

zbMATH Keywords

ERES methodgreatest common divisorleast commong multipleoptimal completion problemorder of approximationset of polynomials

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Computation of special functions and constants, construction of tables (65D20) Numerical computation of solutions to single equations (65H05)

Related Items (5)

Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ Approximate least common multiple of several polynomials using the ERES division algorithm ⋮ Normal factorisation of polynomials and computational issues. ⋮ System theoretic based characterisation and computation of the least common multiple of a set of polynomials. ⋮ On the Computation of the GCD of 2-D Polynomials

Uses Software

• ERES

This page was built for publication: Numerical computation of the least common multiple of a set of polynomials