scientific article
From MaRDI portal
Publication:3447170
zbMath1117.65060MaRDI QIDQ3447170
Lihong Zhi, Zhengfeng Yang, Erich L. Kaltofen
Publication date: 28 June 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
numerical examplesapproximate greatest common divisorstructured total least normhybrid symbolic/numeric algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (22)
A quadratically convergent algorithm for structured low-rank approximation ⋮ Relaxed NewtonSLRA for approximate GCD ⋮ Approximate least common multiple of several polynomials using the ERES division algorithm ⋮ Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach ⋮ A regularization approach for estimating the type of a plane curve singularity ⋮ GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ Structured matrix methods computing the greatest common divisor of polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ The computation of multiple roots of a polynomial ⋮ Computing nearby non-trivial Smith forms ⋮ A subdivision method for computing nearest gcd with certification ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Structured total least norm and approximate GCDs of inexact polynomials ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials ⋮ A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ Computing approximate greatest common right divisors of differential polynomials ⋮ Structured low-rank approximation: optimization on matrix manifold approach ⋮ Variable projection methods for approximate (greatest) common divisor computations
This page was built for publication:
