scientific article
From MaRDI portal
Publication:4008406
zbMath0755.65046MaRDI QIDQ4008406
Tateaki Sasaki, Matu-Tarow Noda
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmEuclidean algorithmapproximate GCDill-conditioned equationsfloating-point numberssquare-free decomposition of polynomials
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (18)
Relaxed NewtonSLRA for approximate GCD ⋮ A new Gröbner basis conversion method based on stabilization techniques ⋮ A study of approximate polynomials. I: Representation and arithmetic ⋮ GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ Validated Root Enclosures for Interval Polynomials with Multiplicities ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Approximate GCD of several univariate polynomials with small degree perturbations ⋮ Approximate polynomial GCD over integers ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Approximate factorization of multivariate polynomials and absolute irreducibility testing ⋮ Approximate square-free part and decomposition ⋮ Approximate GCD and its application to ill-conditioned algebraic equations ⋮ A hybrid approach for the integration of a rational function ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ Approximate polynomial GCD by approximate syzygies ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials ⋮ Nearest multivariate system with given root multiplicities ⋮ Approximate eigenvalues, eigenvectors and inverse of a matrix with polynomial entries
This page was built for publication:
