GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials

DOI10.1007/978-3-642-15274-0_22zbMath1290.68139arXiv1007.1836OpenAlexW3123003267MaRDI QIDQ3587712

Akira Terui

Publication date: 10 September 2010

Published in: ACM Communications in Computer Algebra, Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.1836

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nonlinear programming (90C30) Polynomials in general fields (irreducibility, etc.) (12E05) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Related Items (3)

GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ GPGCD

Uses Software

• GPGCD
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasi-gcd computations
• A geometric method in nonlinear programming
• On approximate GCDs of univariate polynomials
• A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Certified approximate univariate GCDs
• Computation of approximate polynomial GCDs and an extension
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
• An iterative method for calculating approximate GCD of univariate polynomials
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
• GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints

This page was built for publication: GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials