Fast parallel absolute irreducibility testing
Journal of Symbolic Computation
Journal of Symbolic Computation - Special issue on computational algebraic complexity
The singular value decomposition for polynomial systems
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Matrix computations (3rd ed.)
A numerical absolute primality test for bivariate polynomials
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Riemann surfaces, plane algebraic curves and their period matrices
Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
Efficient algorithms for computing the nearest polynomial with a real root and related problems
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Challenges of symbolic computation: my favorite open problems
Journal of Symbolic Computation
Pseudofactors of multivariate polynomials
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Towards factoring bivariate approximate polynomials
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Approximate multivariate polynomial factorization based on zero-sum relations
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
A geometric-numeric algorithm for absolute factorization of multivariate polynomials
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Towards certified irreducibility testing of bivariate approximate polynomials
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
On approximate irreducibility of polynomials in several variables
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
A method computing multiple roots of inexact polynomials
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
The approximate GCD of inexact polynomials
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Numerical factorization of multivariate complex polynomials
Theoretical Computer Science - Algebraic and numerical algorithm
Numerical algebraic geometry and symbolic computation
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Hybrid symbolic-numeric computation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Symbolic-numeric sparse interpolation of multivariate polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Lifting and recombination techniques for absolute factorization
Journal of Complexity
Approximate bivariate factorization: a geometric viewpoint
Proceedings of the 2007 international workshop on Symbolic-numeric computation
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Numerical optimization in hybrid symbolic-numeric computation
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Computing Approximate GCDs in Ill-conditioned Cases
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Lower bounds for approximate factorizations via semidefinite programming: (extended abstract)
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Approximate factorization of multivariate polynomials using singular value decomposition
Journal of Symbolic Computation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
ApaTools: a software toolbox for approximate polynomial algebra
ACM Communications in Computer Algebra
Symbolic-numeric sparse interpolation of multivariate polynomials
Journal of Symbolic Computation
Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm
International Journal of Computational Science and Engineering
The approximate irreducible factorization of a univariate polynomial: revisited
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Exact polynomial factorization by approximate high degree algebraic numbers
Proceedings of the 2009 conference on Symbolic numeric computation
Extracting numerical factors of multivariate polynomials from taylor expansions
Proceedings of the 2009 conference on Symbolic numeric computation
Continuations and monodromy on random riemann surfaces
Proceedings of the 2009 conference on Symbolic numeric computation
Computing multivariate approximate GCD based on Barnett's theorem
Proceedings of the 2009 conference on Symbolic numeric computation
Approximate factorization of polynomials over Z
Proceedings of the 2009 conference on Symbolic numeric computation
From an approximate to an exact absolute polynomial factorization
Journal of Symbolic Computation
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Blind image deconvolution via fast approximate GCD
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
The calculation of the degree of an approximate greatest common divisor of two polynomials
Journal of Computational and Applied Mathematics
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Computing monodromy via continuation methods on random Riemann surfaces
Theoretical Computer Science
Approximate polynomial GCD over integers
Journal of Symbolic Computation
Towards more accurate separation bounds of empirical polynomials II
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Ruppert matrix as subresultant mapping
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
NAClab: a Matlab toolbox for numerical algebraic computation
ACM Communications in Computer Algebra
Hi-index | 0.00 |
The input to our algorithm is a multivariate polynomial, whose complex rational coefficients are considered imprecise with an unknown error that causes f to be irreducible over the complex numbers C. We seek to perturb the coefficients by a small quantitity such that the resulting polynomial factors over C. Ideally, one would like to minimize the perturbation in some selected distance measure, but no efficient algorithm for that is known. We give a numerical multivariate greatest common divisor algorithm and use it on a numerical variant of algorithms by W. M. Ruppert and S. Gao. Our numerical factorizer makes repeated use of singular value decompositions. We demonstrate on a significant body of experimental data that our algorithm is practical and can find factorizable polynomials within a distance that is about the same in relative magnitude as the input error, even when the relative error in the input is substantial (10-3).