Numerical and symbolical methods for the GCD of several polynomials

DOI10.1007/978-94-007-0602-6_7MaRDI QIDQ2913160zbMATH OpenOpenAlexFDO

Authors Dimitrios Christou, D. S. Triantafyllou, Nicos Karcanias, Marilena Mitrouli

Publication date 26 September 2012

Published in Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://openaccess.city.ac.uk/id/eprint/7300/1/%28232%29%20Book%20Chapter%20Springer%20Series%202011%2010-07-08.pdf

zbMATH Keywords

Gaussian eliminationsingular value decompositionresultantgreatest common divisorsymbolic-numeric computationsmatrix-pencil

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Polynomials, factorization in commutative rings (13P05)

Recommendations

• The ERES method for computing the approximate GCD of several polynomials
• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Structured matrix based methods for approximate polynomial GCD
• Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3711820 (Why is no real title available?)
• scientific article; zbMATH DE number 3484411 (Why is no real title available?)
• scientific article; zbMATH DE number 1254251 (Why is no real title available?)
• scientific article; zbMATH DE number 1254271 (Why is no real title available?)
• scientific article; zbMATH DE number 1252488 (Why is no real title available?)
• scientific article; zbMATH DE number 1262453 (Why is no real title available?)
• scientific article; zbMATH DE number 1999210 (Why is no real title available?)
• scientific article; zbMATH DE number 3355217 (Why is no real title available?)
• scientific article; zbMATH DE number 3390604 (Why is no real title available?)
• A New Version of the Euclidean Algorith
• A matrix pencil based numerical method for the computation of the GCD of polynomials
• A new source of structured singular value decomposition problems
• A subspace method for the computation of the GCD of polynomials
• An algorithm for computing certified approximate GCD of n univariate polynomials
• An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
• Approximate GCD and its application to ill-conditioned algebraic equations
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Certified approximate univariate GCDs
• Comparison of algorithms for calculation of g.c.d. of polynomials
• Computation of the GCD of polynomials using gaussian transformations and shifting
• Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
• Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method
• Further numerical aspects of the ERES algorithm for the computation of the greatest common divisor of polynomials and comparison with other existing methodologies
• Greatest common divisors from generalized sylvester resultant matrices
• Invariance properties, and characterization of the greatest common divisor of a set of polynomials
• Linear multivariable control. A geometric approach
• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
• Numerical Analysis and Its Applications
• Numerical computation of the least common multiple of a set of polynomials
• Numerical linear algebra and applications
• Resultant properties of gcd of many polynomials and a factorization representation of gcd
• System theoretic based characterisation and computation of the least common multiple of a set of polynomials.
• The approximate GCD of inexact polynomials

Cited in

(12)

• A hybrid method for computing the intersection and tangency points of plane curves
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
• A subspace method for the computation of the GCD of polynomials
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• An ODE-based method for computing the approximate greatest common divisor of polynomials
• Computation of the GCD of polynomials using gaussian transformations and shifting
• Structured matrix based methods for approximate polynomial GCD
• Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
• The ERES method for computing the approximate GCD of several polynomials
• Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method
• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
• The greatest common divisor of a set of polynomials, control theory and approximate algebraic computations

Describes a project that uses

Uses Software

• ERES
• MultRoot

This page was built for publication: Numerical and symbolical methods for the GCD of several polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913160)