Publication:4232503
From MaRDI portal
zbMath0922.65011MaRDI QIDQ4232503
Paulina Chin, Robert M. Corless, George F. Corliss
Publication date: 15 March 1999
algorithms; convergence; greatest common divisor; polynomials; nonlinear optimization problem; divisor-quotient iteration; Global project software
65K05: Numerical mathematical programming methods
65D20: Computation of special functions and constants, construction of tables
65H05: Numerical computation of solutions to single equations
Related Items
An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility, SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials, Polynomial computations for blind image deconvolution, Approximate least common multiple of several polynomials using the ERES division algorithm, The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials, GPGCD: an iterative method for calculating approximate GCD of univariate polynomials, Overdetermined Weierstrass iteration and the nearest consistent system, Computation of approximate polynomial GCDs and an extension, Approximate gcds of polynomials and sparse SOS relaxations, An ODE-based method for computing the approximate greatest common divisor of polynomials, Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation, Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials, Numerical and Symbolical Methods for the GCD of Several Polynomials, The Sylvester Resultant Matrix and Image Deblurring, GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials
Uses Software
