Towards factoring bivariate approximate polynomials

Authors:
Robert M. Corless;Mark W. Giesbrecht;Mark van Hoeij;Ilias S. Kotsireas;Stephen M. Watt
Affiliations:
Univ. of Western Ontario, London Ontario, Canada;Univ. of Western Ontario, London Ontario, Canada;Florida State Univ., Tallahassee;Univ. of Western Ontario, London Ontario, Canada;Univ. of Western Ontario, London Ontario, Canada
Venue:
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Year:
2001

Citing 17
Cited 28

Fast parallel absolute irreducibility testing

Journal of Symbolic Computation
Projected collocation for higher-order higher-index differential-algebraic equations

Journal of Computational and Applied Mathematics - Orthogonal polynomials and numerical methods
The singular value decomposition for polynomial systems

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Approximate polynomial greatest common divisors and nearest singular polynomials

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A numerical absolute primality test for bivariate polynomials

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Solving a Polynomial Equation: Some History and Recent Progress

SIAM Review
When are two numerical polynomials relatively prime?

Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
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
Approximate polynomial decomposition

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
Initial value problems for ODEs in problem solving environments

Journal of Computational and Applied Mathematics - Special issue on numerical anaylsis 2000 Vol. VI: Ordinary differential equations and integral equations
Approximate multivariate polynomial factorization based on zero-sum relations

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Polynomial Factorization 1987-1991

LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics

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
Cited References

Computer algebra handbook
Numerical algebraic geometry and symbolic computation

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Numerical parameterization of affine varieties using

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Approximate factorization of multivariate polynomials via differential equations

ISSAC '04 Proceedings of the 2004 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
Parametrization of approximate algebraic curves by lines

Theoretical Computer Science - Algebraic and numerical algorithm
Numerical factorization of multivariate complex polynomials

Theoretical Computer Science - Algebraic and numerical algorithm
Parametrization of approximate algebraic surfaces by lines

Computer Aided Geometric Design
Distance bounds of ε-points on hypersurfaces

Theoretical Computer Science
Approximate bivariate factorization: a geometric viewpoint

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Approximate factorization of multivariate polynomials using singular value decomposition

Journal of Symbolic Computation
Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm

International Journal of Computational Science and Engineering
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
Finding exact minimal polynomial by approximations

Proceedings of the 2009 conference on Symbolic numeric computation
Approximate factorization of polynomials over Z

Proceedings of the 2009 conference on Symbolic numeric computation
Parametrization of ε-rational curves: extended abstract

Proceedings of the 2009 conference on Symbolic numeric computation
Parametrization of approximate algebraic surfaces by lines

Computer Aided Geometric Design
Approximate parametrization of plane algebraic curves by linear systems of curves

Computer Aided Geometric Design
Polynomial homotopies on multicore workstations

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Computing monodromy via continuation methods on random Riemann surfaces

Theoretical Computer Science
Tropical algebraic geometry in Maple: A preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients

Journal of Symbolic Computation
Computing curves bounding trigonometric planar maps: symbolic and hybrid methods

ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
Exact solutions of completely integrable systems and linear ODE's having elliptic function coefficients

CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Rational Hausdorff divisors: A new approach to the approximate parametrization of curves

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new algorithm is presented for factoring bivariate approximate polynomials over C[x, y]. Given a particular polynomial, the method constructs a nearby composite polynomial, if one exists, and its irreducible factors. Subject to a conjecture, the time to produce the factors is polynomial in the degree of the problem. This method has been implemented in Maple, and has been demonstrated to be efficient and numerically robust.