GPGCD: an iterative method for calculating approximate GCD of univariate polynomials

DOI10.1016/J.TCS.2012.10.023zbMath1291.65162arXiv1207.0630OpenAlexW2167303512MaRDI QIDQ385007

Akira Terui

Publication date: 29 November 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

optimizationill-conditioned problemapproximate polynomial GCDgradient-projection method

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items (8)

Relaxed NewtonSLRA for approximate GCD ⋮ An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Structured low-rank approximation for nonlinear matrices ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility ⋮ Variable projection methods for approximate (greatest) common divisor computations

Uses Software

• MultRoot
• ApaTools
• mctoolbox
• GPGCD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A subdivision method for computing nearest gcd with certification
• 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
• 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
• The numerical greatest common divisor of univariate polynomials
• On Computations with Dense Structured Matrices
• GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
• Accuracy and Stability of Numerical Algorithms
• 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 of univariate polynomials