Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

DOI10.1145/1145768.1145799zbMath1356.12011OpenAlexW2060143865MaRDI QIDQ2958983

Zhengfeng Yang, Lihong Zhi, Erich L. Kaltofen

Publication date: 3 February 2017

Published in: Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1145768.1145799

zbMATH Keywords

linear constraintsymbolic/numeric hybrid methodsingular polynomialapproximate multiple rootapproximate polynomial gcdmultivariate polynomial gcd

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05)

Related Items

A quadratically convergent algorithm for structured low-rank approximation, Relaxed NewtonSLRA for approximate GCD, Approximate gcds of polynomials and sparse SOS relaxations, On the local stability of semidefinite relaxations, Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs, Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach, Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction, GPGCD: an iterative method for calculating approximate GCD of univariate polynomials, An ODE-based method for computing the approximate greatest common divisor of polynomials, SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials, Approximate GCD of several univariate polynomials with small degree perturbations, Twin-float arithmetic, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, Factorization results for left polynomials in some associative real algebras: state of the art, applications, and open questions, Approximate polynomial GCD over integers, A heuristic verification of the degree of the approximate GCD of two univariate polynomials, Overdetermined Weierstrass iteration and the nearest consistent system, Approximate square-free part and decomposition, Kempe's universality theorem for rational space curves, Toward the best algorithm for approximate GCD of univariate polynomials, Blind image deconvolution via Hankel based method for computing the GCD of polynomials, Regularization and Matrix Computation in Numerical Polynomial Algebra, Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares, Approximate factorization of multivariate polynomials using singular value decomposition, Approximate polynomial GCD by approximate syzygies, GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials, Computing lower rank approximations of matrix polynomials, Blind image deconvolution through Bezoutians, Computing approximate greatest common right divisors of differential polynomials, On real factors of real interval polynomials, A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix, An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility, Structured low-rank approximation: optimization on matrix manifold approach, Variable projection methods for approximate (greatest) common divisor computations