The numerical factorization of polynomials
From MaRDI portal
Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Polynomials, factorization in commutative rings (13P05) Numerical computation of roots of polynomial equations (65H04) Computational methods for problems pertaining to field theory (12-08)
Abstract: Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper formulates the notion of numerical factorization based on the geometry of polynomial spaces and the stratification of factorization manifolds. Furthermore, this paper establishes the existence, uniqueness, Lipschitz continuity, condition number, and convergence of the numerical factorization to the underlying exact factorization, leading to a robust and efficient algorithm with a MATLAB implementation capable of accurate polynomial factorizations using floating point arithmetic even if the coefficients are perturbed.
Recommendations
- The approximate irreducible factorization of a univariate polynomial. Revisited
- Towards factoring bivariate approximate polynomials
- Regularization and matrix computation in numerical polynomial algebra
- Approximate factorization of multivariate polynomials via differential equations
- The numerical greatest common divisor of univariate polynomials
Cites work
- scientific article; zbMATH DE number 5302686 (Why is no real title available?)
- scientific article; zbMATH DE number 3750287 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 1253987 (Why is no real title available?)
- scientific article; zbMATH DE number 2151173 (Why is no real title available?)
- scientific article; zbMATH DE number 2151196 (Why is no real title available?)
- scientific article; zbMATH DE number 2151216 (Why is no real title available?)
- scientific article; zbMATH DE number 3992817 (Why is no real title available?)
- scientific article; zbMATH DE number 2109418 (Why is no real title available?)
- Algorithm 795
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Approximate factorization of multivariate polynomials using singular value decomposition
- Approximate factorization of multivariate polynomials via differential equations
- Approximate multivariate polynomial factorization based on zero-sum relations
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Computing multiple roots of inexact polynomials
- Condition. The geometry of numerical algorithms
- Factoring multivariate polynomials via partial differential equations
- Factoring polynomials and the knapsack problem
- Factoring sparse multivariate polynomials
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Newton's method for overdetermined systems of equations
- Numerical factorization of multivariate complex polynomials
- Numerically solving polynomial systems with Bertini
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Pseudofactors of multivariate polynomials
- Reducibility of polynomials \(f(x,y)\) modulo \(p\)
- Regularization and matrix computation in numerical polynomial algebra
- Towards factoring bivariate approximate polynomials
Cited in
(9)- scientific article; zbMATH DE number 1262457 (Why is no real title available?)
- Factoring a binary polynomial of degree over one million
- On the Sensitivity of Singular and Ill-Conditioned Linear Systems
- The computation of multiple roots of a Bernstein basis polynomial
- Regularization and matrix computation in numerical polynomial algebra
- The approximate irreducible factorization of a univariate polynomial. Revisited
- Irreducibility of Binomials
- A dataset for suggesting variable orderings for cylindrical algebraic decompositions
- A Hybrid Approach for Normal Factorization of Polynomials
This page was built for publication: The numerical factorization of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q525605)
