Normal factorisation of polynomials and computational issues.

DOI10.1016/S0898-1221(03)80016-0zbMath1035.65048OpenAlexW2075038925MaRDI QIDQ1416384

Nicos Karcanias, Marilena Mitrouli

Publication date: 14 December 2003

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(03)80016-0

zbMATH Keywords

algorithmnumerical examplessymbolic computationPolynomialsFactorisationGreatest common divisor

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Numerical computation of solutions to single equations (65H05)

Related Items (2)

On rank and null space computation of the generalized Sylvester matrix ⋮ Nearest common root of a set of polynomials: a structured singular value approach

Uses Software

• ERES

Cites Work

• Fast projection methods for minimal design problems in linear system theory
• Approximate GCD and its application to ill-conditioned algebraic equations
• Geometric state-space theory in linear multivariable control: A status report
• Matrix Analysis
• 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
• Comparison of algorithms for calculation of g.c.d. of polynomials
• 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

This page was built for publication: Normal factorisation of polynomials and computational issues.