Publication:3447170
From MaRDI portal
zbMath1117.65060MaRDI QIDQ3447170
Lihong Zhi, Zhengfeng Yang, Erich L. Kaltofen
Publication date: 28 June 2007
numerical examples; approximate greatest common divisor; structured total least norm; hybrid symbolic/numeric algorithm
Related Items
The Computation of Multiple Roots of a Bernstein Basis Polynomial, SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials, A quadratically convergent algorithm for structured low-rank approximation, Approximate least common multiple of several polynomials using the ERES division algorithm, A regularization approach for estimating the type of a plane curve singularity, GPGCD: an iterative method for calculating approximate GCD of univariate polynomials, The computation of multiple roots of a polynomial, A heuristic verification of the degree of the approximate GCD of two univariate polynomials, Overdetermined Weierstrass iteration and the nearest consistent system, A subdivision method for computing nearest gcd with certification, Relaxed NewtonSLRA for approximate GCD, A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix, Structured matrix methods computing the greatest common divisor of polynomials, Toward the best algorithm for approximate GCD of univariate polynomials, Structured low-rank approximation: optimization on matrix manifold approach, Computing nearby non-trivial Smith forms, Computing approximate greatest common right divisors of differential polynomials, Variable projection methods for approximate (greatest) common divisor computations, Structured total least norm and approximate GCDs of inexact polynomials, Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach, Regularization and Matrix Computation in Numerical Polynomial Algebra, GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials
