Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
From MaRDI portal
Publication:2958983
DOI10.1145/1145768.1145799zbMath1356.12011MaRDI 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
linear constraint; symbolic/numeric hybrid method; singular polynomial; approximate multiple root; approximate polynomial gcd; multivariate polynomial gcd
68W30: Symbolic computation and algebraic computation
12D05: Polynomials in real and complex fields: factorization
Related Items
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, SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, A quadratically convergent algorithm for structured low-rank approximation, Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs, GPGCD: an iterative method for calculating approximate GCD of univariate polynomials, Approximate GCD of several univariate polynomials with small degree perturbations, Twin-float arithmetic, A heuristic verification of the degree of the approximate GCD of two univariate polynomials, Overdetermined Weierstrass iteration and the nearest consistent system, Approximate polynomial GCD over integers, Blind image deconvolution through Bezoutians, Relaxed NewtonSLRA for approximate GCD, On real factors of real interval polynomials, Factorization results for left polynomials in some associative real algebras: state of the art, applications, and open questions, 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, Approximate polynomial GCD by approximate syzygies, Structured low-rank approximation: optimization on matrix manifold approach, On the local stability of semidefinite relaxations, Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction, Approximate square-free part and decomposition, Computing lower rank approximations of matrix polynomials, Computing approximate greatest common right divisors of differential polynomials, Variable projection methods for approximate (greatest) common divisor computations, Approximate gcds of polynomials and sparse SOS relaxations, An ODE-based method for computing the approximate greatest common divisor of polynomials, Approximate factorization of multivariate polynomials using singular value decomposition, Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach, Regularization and Matrix Computation in Numerical Polynomial Algebra, Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares, GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials
