Approximate multivariate polynomial factorization based on zero-sum relations

DOI10.1145/384101.384139MaRDI QIDQ2958946zbMATH OpenOpenAlexFDO

Authors Tateaki Sasaki

Publication date 3 February 2017

Published in Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/384101.384139

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Algorithms for approximation of functions (65D15) Complexity and performance of numerical algorithms (65Y20) Symbolic computation and algebraic computation (68W30)

Recommendations

• On multivariate polynomial matrix factorization problems
• scientific article; zbMATH DE number 966297
• Approximate factorization of multivariate polynomials using singular value decomposition
• Approximate factorization of multidimensional polynomials depending on a parameter
• scientific article; zbMATH DE number 1014744
• Towards factoring bivariate approximate polynomials
• A unified method for multivariate polynomial factorizations
• Approximate factorization of multivariate polynomials via differential equations
• scientific article; zbMATH DE number 962291
• Approximate factorization of multivariate polynomials and absolute irreducibility testing

Cited in

(24)

• Obtaining exact interpolation multivariate polynomial by approximation
• Approximate polynomial GCD by approximate syzygies
• A symbolic-numeric approach for parametrizing ruled surfaces
• Rational Hausdorff divisors: a new approach to the approximate parametrization of curves
• Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
• Factorization of multivariate positive Laurent polynomials
• From an approximate to an exact absolute polynomial factorization
• Improved dense multivariate polynomial factorization algorithms
• Obtaining exact value by approximate computations
• Approximate factorization of multivariate polynomials using singular value decomposition
• Distance bounds of \(\varepsilon\)-points on hypersurfaces
• Parametrization of approximate algebraic surfaces by lines
• On multivariate polynomial matrix factorization problems
• Regularization and matrix computation in numerical polynomial algebra
• Approximate factorization of multivariate polynomials via differential equations
• scientific article; zbMATH DE number 784435 (Why is no real title available?)
• The numerical factorization of polynomials
• scientific article; zbMATH DE number 966297 (Why is no real title available?)
• Parametrization of approximate algebraic curves by lines
• Numerical factorization of multivariate complex polynomials
• Irreducibility of Binomials
• Approximate parametrization of plane algebraic curves by linear systems of curves
• Computing monodromy via continuation methods on random Riemann surfaces
• Irreducible decomposition of curves

This page was built for publication: Approximate multivariate polynomial factorization based on zero-sum relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958946)