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

Authors:
Anton Leykin;Jan Verschelde
Affiliations:
Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 851 South Morgan (/M&#/#/47/C 249)/, Chicago, IL 60607-/7045, USA.;Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 851 South Morgan (/M&#/#/47/C 249)/, Chicago, IL 60607-/7045, USA
Venue:
International Journal of Computational Science and Engineering
Year:
2009

Citing 25
Cited 4

Basic principles of mechanical theorem proving in elementary geometrics

Journal of Automated Reasoning
A new method for solving algebraic systems of positive dimension

Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
Factoring rational polynomials over the complex numbers

SIAM Journal on Computing
Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation

ACM Transactions on Mathematical Software (TOMS)
Primary decomposition of lattice basis ideals

Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
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
Numerical homotopies to compute generic points on positive dimensional algebraic sets

Journal of Complexity
Towards factoring bivariate approximate polynomials

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Semi-numerical determination of irreducible branches of a reduced space curve

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
Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components

SIAM Journal on Numerical Analysis
Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems

SIAM Journal on Numerical Analysis
Irreducible decomposition of curves

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
The Parallel Complexity of Embedding Algorithms for the Solution of Systems of Nonlinear Equations

IEEE Transactions on Parallel and Distributed Systems
The Granularity of Homotopy Algorithms for Polynomial Systems of Equations

Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing
Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods

Journal of Computational and Applied Mathematics - Proceedings of the international conference on recent advances in computational mathematics
A geometric-numeric algorithm for absolute factorization of multivariate polynomials

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Absolute polynomial factorization in two variables and the knapsack problem

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
Numerical factorization of multivariate complex polynomials

Theoretical Computer Science - Algebraic and numerical algorithm
PHoM – a Polyhedral Homotopy Continuation Method for Polynomial Systems

Computing
On Parallel Computation of Gröbner Bases

ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
Computing Feedback Laws for Linear Systems with a Parallel Pieri Homotopy

ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
Factoring Solution Sets of Polynomial Systems in Parallel

ICPPW '05 Proceedings of the 2005 International Conference on Parallel Processing Workshops

Computing monodromy via parallel homotopy continuation

Proceedings of the 2007 international workshop on Parallel symbolic computation
Polynomial homotopies on multicore workstations

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Parallel homotopy algorithms to solve polynomial systems

ICMS'06 Proceedings of the Second international conference on Mathematical Software
Interfacing with the numerical homotopy algorithms in PHCpack

ICMS'06 Proceedings of the Second international conference on Mathematical Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the numerical solution of algebraic Bernoulli equations (ABE) via the Newton iteration for the matrix sign function. Bernoulli equations are nonlinear matrix equations arising in control and systems theory in the context of stabilisation ...