Sciweavers

281 search results - page 3 / 57
» A Method for Invariant Generation for Polynomial Continuous ...
Sort
View
ERSHOV
2009
Springer
14 years 2 months ago
A Complete Invariant Generation Approach for P-solvable Loops
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
Laura Kovács
COMPUTING
2006
127views more  COMPUTING 2006»
13 years 7 months ago
PHoMpara - Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems
The polyhedral homotopy continuation method is known to be a successful method for finding all isolated solutions of a system of polynomial equations. PHoM, an implementation of t...
T. Gunji, S. Kim, K. Fujisawa, M. Kojima
COMPUTING
2004
90views more  COMPUTING 2004»
13 years 7 months ago
PHoM - a Polyhedral Homotopy Continuation Method for Polynomial Systems
Takayuki Gunji, Sunyoung Kim, Masakazu Kojima, Aki...
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
13 years 7 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler
ISSAC
2007
Springer
99views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Computing monodromy via parallel homotopy continuation
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
Anton Leykin, Frank Sottile