scientific article; zbMATH DE number 1262453
From MaRDI portal
Publication:4232503
zbMath0922.65011MaRDI QIDQ4232503
Paulina Chin, Robert M. Corless, George F. Corliss
Publication date: 15 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsconvergencegreatest common divisorpolynomialsnonlinear optimization problemdivisor-quotient iterationGlobal project software
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Polynomial computations for blind image deconvolution ⋮ Approximate gcds of polynomials and sparse SOS relaxations ⋮ Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ 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 ⋮ The Sylvester Resultant Matrix and Image Deblurring ⋮ An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials ⋮ Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials ⋮ Computation of approximate polynomial GCDs and an extension ⋮ An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
Uses Software
This page was built for publication:
