Approximate factorization of multivariate polynomials using singular value decomposition

DOI10.1016/j.jsc.2007.11.005zbMath1135.12003OpenAlexW2038133488MaRDI QIDQ2482630

John P. May, Lihong Zhi, Zhengfeng Yang, Erich L. Kaltofen

Publication date: 23 April 2008

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: http://www.lib.ncsu.edu/resolver/1840.2/570

zbMATH Keywords

singular value decompositionapproximate factorizationnumerical algebramultivariate polynomial factorizationGauss-Newton optimization

Mathematics Subject Classification ID

Related Items (22)

Approximating multidimensional subset sum and Minkowski decomposition of polygons ⋮ A quadratically convergent algorithm for structured low-rank approximation ⋮ Bounded-degree factors of lacunary multivariate polynomials ⋮ A fast recursive orthogonalization scheme for the Macaulay matrix ⋮ Irreducibility of Binomials ⋮ Duality of multiple root loci ⋮ Approximate parametrization of plane algebraic curves by linear systems of curves ⋮ A symbolic-numeric approach for parametrizing ruled surfaces ⋮ A geometrical approach to finding multivariate approximate LCMs and GCDs ⋮ Some Control Observation Problems and Their Differential Algebraic Partial Solutions ⋮ An algorithm to parametrize approximately space curves ⋮ A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials ⋮ An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain ⋮ The computation of the degree of the greatest common divisor of three Bernstein basis polynomials ⋮ The numerical factorization of polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares ⋮ Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients ⋮ The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain ⋮ Computing lower rank approximations of matrix polynomials ⋮ A Sequence of Nearest Polynomials with Given Factors ⋮ Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots

Uses Software

• MultRoot
• KELLEY
• CARS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical factorization of multivariate complex polynomials
• Irreducible decomposition of curves
• Fast parallel absolute irreducibility testing
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• Analysis of approximate factorization algorithm. I
• Riemann surfaces, plane algebraic curves and their period matrices
• Reducibility of polynomials \(f(x,y)\) modulo \(p\)
• Certified approximate univariate GCDs
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
• Fast algorithm for solving the Hankel/Toeplitz structured total least squares problem
• Low rank approximation of a Hankel matrix by structured total least norm
• Semi-numerical absolute factorization of polynomials with integer coefficients
• Towards factoring bivariate approximate polynomials
• Semi-numerical determination of irreducible branches of a reduced space curve
• Approximate multivariate polynomial factorization based on zero-sum relations
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• Pseudofactors of multivariate polynomials
• Reduzibilität ebener Kurven.
• DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
• Approximate factorization of multivariate polynomials via differential equations
• The approximate GCD of inexact polynomials
• Factoring multivariate polynomials via partial differential equations
• Computer Algebra in Scientific Computing
• Symbolic-numeric sparse interpolation of multivariate polynomials
• Symbolic-numeric sparse interpolation of multivariate polynomials

This page was built for publication: Approximate factorization of multivariate polynomials using singular value decomposition