scientific article; zbMATH DE number 953021
From MaRDI portal
Publication:4717942
zbMath0856.65006MaRDI QIDQ4717942
Ioannis Z. Emiris, Henri Lombardi, Andre Galligo
Publication date: 24 February 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
singular value decompositiongreatest common divisorEuclidean algorithmunivariate polynomialsworst-caes complexity
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Relaxed NewtonSLRA for approximate GCD ⋮ Certified approximate univariate GCDs ⋮ Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Continuity properties for flat families of polynomials. I: Continuous parametrizations ⋮ A subdivision method for computing nearest gcd with certification ⋮ Approximate polynomial GCD over integers ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials ⋮ Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding ⋮ On the geometry of Graeffe iteration ⋮ A computational study of ruled surfaces ⋮ An algorithm for computing certified approximate GCD of \(n\) univariate polynomials ⋮ Computation of approximate polynomial GCDs and an extension
This page was built for publication:
