From an approximate to an exact absolute polynomial factorization
From MaRDI portal
Publication:2457357
DOI10.1016/j.jsc.2005.11.004zbMath1134.13022OpenAlexW2035359068MaRDI QIDQ2457357
Guillaume Chèze, Andre Galligo
Publication date: 23 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2005.11.004
algorithmapproximate factorizationalgebraic integersabsolute irreducibilitybivariate polynomial factorization
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
Computing the determinant of a matrix with polynomial entries by approximation ⋮ Lifting and recombination techniques for absolute factorization ⋮ Symmetry detection of rational space curves from their curvature and torsion ⋮ Obtaining exact interpolation multivariate polynomial by approximation ⋮ Computing monodromy via continuation methods on random Riemann surfaces ⋮ Some Control Observation Problems and Their Differential Algebraic Partial Solutions ⋮ Algebraic osculation and application to factorization of sparse polynomials ⋮ Obtaining exact value by approximate computations ⋮ A complete algorithm to find exact minimal polynomial by approximations ⋮ Algebraic cycles from a computational point of view ⋮ Rational Hausdorff divisors: a new approach to the approximate parametrization of curves ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Towards toric absolute factorization ⋮ Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
Uses Software
Cites Work
- Numerical factorization of multivariate complex polynomials
- Irreducible decomposition of curves
- Solving zero-dimensional systems through the rational univariate representation
- Solving polynomial equations. Foundations, algorithms, and applications
- Semi-numerical absolute factorization of polynomials with integer coefficients
- Approximate multivariate polynomial factorization based on zero-sum relations
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Approximate factorization of multivariate polynomials via differential equations
- Classical theory of algebraic numbers
- Real factorization of multivariate polynomials with integer coefficients
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: From an approximate to an exact absolute polynomial factorization