Two resultant based methods computing the greatest common divisor of two polynomials

DOI10.1007/978-3-540-31852-1_63MaRDI QIDQ5710620zbMATH OpenOpenAlexFDO

Authors D. S. Triantafyllou, Marilena Mitrouli

Publication date 2 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106395

zbMATH Keywords

Gaussian eliminationGreater Common DivisorQR factorizationSylvester matrix

Mathematics Subject Classification ID

Factorization (11Y05)

Recommendations

• Estimating the greatest common divisor of the value of two polynomials
• A new view on the numerical computation of the greatest common divisor of two polynomials.
• scientific article; zbMATH DE number 3927124
• On the Greatest Common Divisor of the Value of Two Polynomials
• Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
• On the remainders obtained in finding the greatest common divisor of two polynomials
• The calculation of the degree of an approximate greatest common divisor of two polynomials
• A new method for computing polynomial greatest common divisors and polynomial remainder sequences
• On the computation of the GCD of 2-D polynomials
• Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix

Cited in

(14)

• Structured matrix methods computing the greatest common divisor of polynomials
• A hybrid method for computing the intersection and tangency points of plane curves
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
• Numerical and symbolical methods for the GCD of several polynomials
• The Sylvester Resultant Matrix and Image Deblurring
• On computing polynomial GCDs in alternate bases
• An improvement of Euclid's algorithm.
• scientific article; zbMATH DE number 480305 (Why is no real title available?)
• Resultant properties of gcd of many polynomials and a factorization representation of gcd
• On the Greatest Common Divisor of the Value of Two Polynomials
• A new view on the numerical computation of the greatest common divisor of two polynomials.
• On rank and null space computation of the generalized Sylvester matrix
• The calculation of the degree of an approximate greatest common divisor of two polynomials
• Structured ramp secret sharing schemata over rings of real polynomials

Describes a project that uses

Uses Software

• ERES

This page was built for publication: Two resultant based methods computing the greatest common divisor of two polynomials

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