The approximate GCD of inexact polynomials
From MaRDI portal
Publication:4657342
DOI10.1145/1005285.1005331zbMath1134.13313OpenAlexW2077315987MaRDI QIDQ4657342
Zhonggang Zeng, Barry H. Dayton
Publication date: 14 March 2005
Published in: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1005285.1005331
Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13P99)
Related Items (26)
A quadratically convergent algorithm for structured low-rank approximation ⋮ A numerical elimination method for polynomial computations ⋮ Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ Multivariate subresultants in roots ⋮ Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs ⋮ Validated Root Enclosures for Interval Polynomials with Multiplicities ⋮ An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Structured low-rank approximation for nonlinear matrices ⋮ Twin-float arithmetic ⋮ Computing nearby non-trivial Smith forms ⋮ A geometrical approach to finding multivariate approximate LCMs and GCDs ⋮ A subdivision method for computing nearest gcd with certification ⋮ Approximate polynomial GCD over integers ⋮ Numerical proper reparametrization of parametric plane curves ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Blind image deconvolution via Hankel based method for computing the GCD of polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Numerical computation of the genus of an irreducible curve within an algebraic set ⋮ Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials ⋮ Approximate factorization of multivariate polynomials using singular value decomposition ⋮ Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients ⋮ A computational study of ruled surfaces ⋮ Computing approximate greatest common right divisors of differential polynomials ⋮ Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
Uses Software
This page was built for publication: The approximate GCD of inexact polynomials
