Approximate factorization of multivariate polynomials using singular value decomposition
From MaRDI portal
Publication:2482630
DOI10.1016/J.JSC.2007.11.005zbMATH Open1135.12003OpenAlexW2038133488MaRDI QIDQ2482630FDOQ2482630
Authors: John P. May, Zhengfeng Yang, Lihong Zhi, 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
Recommendations
- scientific article; zbMATH DE number 1009446
- Approximate multivariate polynomial factorization based on zero-sum relations
- scientific article; zbMATH DE number 1254251
- Approximate factorization of multidimensional polynomials depending on a parameter \(\lambda\)
- Approximate factorization of multivariate polynomials via differential equations
- scientific article; zbMATH DE number 962291
- scientific article; zbMATH DE number 966297
- Factoring sparse multivariate polynomials
- A unified method for multivariate polynomial factorizations
- scientific article; zbMATH DE number 1014744
singular value decompositionnumerical algebraapproximate factorizationmultivariate polynomial factorizationGauss-Newton optimization
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Reducibility of polynomials \(f(x,y)\) modulo \(p\)
- Certified approximate univariate GCDs
- Low rank approximation of a Hankel matrix by structured total least norm
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Approximate factorization of multivariate polynomials via differential equations
- The approximate GCD of inexact polynomials
- Reduzibilität ebener Kurven.
- Factoring multivariate polynomials via partial differential equations
- Pseudofactors of multivariate polynomials
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
- Title not available (Why is that?)
- Fast algorithm for solving the Hankel/Toeplitz structured total least squares problem
- Title not available (Why is that?)
- Irreducible decomposition of curves
- Towards factoring bivariate approximate polynomials
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Analysis of approximate factorization algorithm. I
- Semi-numerical absolute factorization of polynomials with integer coefficients
- Approximate multivariate polynomial factorization based on zero-sum relations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical factorization of multivariate complex polynomials
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Semi-numerical determination of irreducible branches of a reduced space curve
- Fast parallel absolute irreducibility testing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Riemann surfaces, plane algebraic curves and their period matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Algebra in Scientific Computing
Cited In (35)
- Numerical factorization of multivariate complex polynomials
- A symbolic-numeric approach for parametrizing ruled surfaces
- Approximate parametrization of plane algebraic curves by linear systems of curves
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- A fast recursive orthogonalization scheme for the Macaulay matrix
- Some control observation problems and their differential algebraic partial solutions
- Approximate factorization of multivariate polynomials via differential equations
- Computing lower rank approximations of matrix polynomials
- Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- Approximate square-free part and decomposition
- A sequence of nearest polynomials with given factors
- A quadratically convergent algorithm for structured low-rank approximation
- Extracting numerical factors of multivariate polynomials from Taylor expansions
- Regularization and matrix computation in numerical polynomial algebra
- Title not available (Why is that?)
- Irreducibility of Binomials
- The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain
- Exact certification in global polynomial optimization via rationalizing sums-of-squares
- Pseudofactors of multivariate polynomials
- Approximating multidimensional subset sum and Minkowski decomposition of polygons
- An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain
- An algorithm to parametrize approximately space curves
- Approximate multivariate polynomial factorization based on zero-sum relations
- Duality of multiple root loci
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved dense multivariate polynomial factorization algorithms
- Analysis of approximate factorization algorithm. I
- Approximate decoupling of multivariate polynomials using weighted tensor decomposition.
- Bounded-degree factors of lacunary multivariate polynomials
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- Towards industrial application of approximate computer algebra
- The numerical factorization of polynomials
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
Uses Software
This page was built for publication: Approximate factorization of multivariate polynomials using singular value decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482630)
