On approximate GCDs of univariate polynomials
From MaRDI portal
Publication:1281842
DOI10.1006/jsco.1998.0232zbMath0967.12007OpenAlexW2011703168MaRDI QIDQ1281842
Y. N. Lakshman, Narendra K. Karmarkar
Publication date: 5 September 2001
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ba052bccf563df4446fb9072b7c094608e9cf196
Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05)
Related Items
Structured low rank approximation, Affine equivalences of trigonometric curves, A quadratically convergent algorithm for structured low-rank approximation, Approximate gcds of polynomials and sparse SOS relaxations, 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, The Sylvester Resultant Matrix and Image Deblurring, An ODE-based method for computing the approximate greatest common divisor of polynomials, Approximate GCD of several univariate polynomials with small degree perturbations, A geometrical approach to finding multivariate approximate LCMs and GCDs, A subdivision method for computing nearest gcd with certification, The nearest complex polynomial with a zero in a given complex domain, Approximate polynomial GCD over integers, Overdetermined Weierstrass iteration and the nearest consistent system, A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints, Optimal rank-1 Hankel approximation of matrices: Frobenius norm and spectral norm and Cadzow's algorithm, Computing multiple roots of inexact polynomials, Regularization and Matrix Computation in Numerical Polynomial Algebra, Global minimization of rational functions and the nearest GCDs, The ERES method for computing the approximate GCD of several polynomials, Hybrid method for computing the nearest singular polynomials, GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials, Approximate polynomial GCD: small degree and small height perturbations, Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials, Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities, Nearest multivariate system with given root multiplicities, Computing approximate greatest common right divisors of differential polynomials, On real factors of real interval polynomials, Exact and approximate similarities of non-necessarily rational planar, parametrized curves, using centers of gravity and inertia tensors, An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility, Structured low-rank approximation: optimization on matrix manifold approach, A unified approach to computing the nearest complex polynomial with a given zero, Variable projection methods for approximate (greatest) common divisor computations
