[LIVRE][B] Solving polynomial equations
A Dickenstein - 2005 - Springer
The subject of this book is the solution of polynomial equations, that is, systems of
(generally) non-linear algebraic equations. This study is at the heart of several areas of …
(generally) non-linear algebraic equations. This study is at the heart of several areas of …
Behavior sampling: A technique for automated retrieval of reusable components
A Podgurski, L Pierce - Proceedings of the 14th international conference …, 1992 - dl.acm.org
A new method, called behavior sampling, is proposed for automated retrieval of reusable
components from software libraries. Unlike other retrieval met hods, behavior sampling …
components from software libraries. Unlike other retrieval met hods, behavior sampling …
Algorithm 857: POLSYS_GLP—a parallel general linear product homotopy code for solving polynomial systems of equations
Globally convergent, probability-one homotopy methods have proven to be very effective for
finding all the isolated solutions to polynomial systems of equations. After many years of …
finding all the isolated solutions to polynomial systems of equations. After many years of …
Generalized linear product homotopy algorithms and the computation of reachable surfaces
In this paper, we apply a homotopy algorithm to the problem of finding points in a moving
body that lie on specific algebraic surfaces for a given set of spatial configurations of the …
body that lie on specific algebraic surfaces for a given set of spatial configurations of the …
Using hybrid social emotional optimization algorithm with metropolis rule to solve nonlinear equations
J Wu, Z Cui, J Liu - … and cognitive computing (ICCI-CC'11), 2011 - ieeexplore.ieee.org
Social emotional optimization algorithm (SEOA) is a novel swarm intelligent population-
based optimization algorithm by simulating the human social behaviors. How-ever, as a …
based optimization algorithm by simulating the human social behaviors. How-ever, as a …
Parallel homotopy algorithms to solve polynomial systems
Homotopy continuation methods to compute numerical approximations to all isolated
solutions of a polynomial system are known as “embarrassingly parallel”, ie: because of their …
solutions of a polynomial system are known as “embarrassingly parallel”, ie: because of their …
Evaluating polynomials in several variables and their derivatives on a GPU computing processor
J Verschelde, G Yoffe - 2012 IEEE 26th International Parallel …, 2012 - ieeexplore.ieee.org
In order to obtain more accurate solutions of polynomial systems with numerical continuation
methods we use multiprecision arithmetic. Our goal is to offset the overhead of double …
methods we use multiprecision arithmetic. Our goal is to offset the overhead of double …
Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm
Our problem is to decompose a positive dimensional solution set of a polynomial system into
irreducible components. This solution set is represented by a witness set, which can be …
irreducible components. This solution set is represented by a witness set, which can be …
Computing feedback laws for linear systems with a parallel Pieri homotopy
J Verschelde, Y Wang - … Control and Management/Ad Hoc and …, 2004 - ieeexplore.ieee.org
Homotopy methods to solve polynomial systems are well suited for parallel computing
because the solution paths defined by the homotopy can be tracked independently. Both the …
because the solution paths defined by the homotopy can be tracked independently. Both the …
Parallel implementation of the polyhedral homotopy method
J Verschelde, Y Zhuang - 2006 International Conference on …, 2006 - ieeexplore.ieee.org
Homotopy methods to solve polynomial systems are well suited for parallel computing
because the solution paths defined by the homotopy can be tracked independently. For …
because the solution paths defined by the homotopy can be tracked independently. For …