PHCmaple PHCpack and C Interfacing with the Numerical Homotopy Algorithms in PHCpack Anton Leykin and Jan Verschelde Institute of Mathematics and its Applications, Minneapolis, USA ICMS 2006, Castro Urdiales Anton Leykin Interfacing with the Numerical Homotopy Algorithms in PHCpack
PHCmaple PHCpack and C Evolution of PHCpack interfaces PHCpack: a general-purpose solver for polynomial systems by homotopy continuation Implementation language: Ada User interface: interactive text terminal OpenXM calls the blackbox solver 1 A simple Maple 7 procedure calls the blackbox solver 2 A functional C interface to the Ada routines in PHCpack 3 PHCmaple gives access to the tools of phc 4 PHCpack as a state machine 5 Plan of the talk: Maple interface bindings for C Anton Leykin Interfacing with the Numerical Homotopy Algorithms in PHCpack
PHCmaple dim = 0 PHCpack and C dim > 0 Numerical algebraic geometry Sommese and Wampler, “The numerical solution of systems of polynomials” (2005). What does it mean “to solve”? ( dim = 0 ) the number of solutions is finite the system is overdetermined compute the approximations to the solutions ( dim > 0 ) the solution set is infinite decompose the solution set into equidimensional parts each part is represented via an approximation to a witness set decompose each equidimensional part into irreducible components Anton Leykin Interfacing with the Numerical Homotopy Algorithms in PHCpack
PHCmaple dim = 0 PHCpack and C dim > 0 Systems with a finite number of solutions Basic idea of homotopy continuation “Connect” a start system with known solutions to the target 1 system via a homotopy. Follow (numerically) the paths from the start solutions to the 2 target solutions. phc[solve] – black-box solver A start system is created automatically: the number of paths to track in the worst case is the Bézout bound. phc[track] – specify start system and its solutions Tracks selected paths for a given start system. phc[drawPaths] – visualizing the continuation paths Draws projections of continuation paths on the specified coordinate C -axis. Anton Leykin Interfacing with the Numerical Homotopy Algorithms in PHCpack
PHCmaple dim = 0 PHCpack and C dim > 0 Singular isolated solutions First-order deflation The continuation procedure is not Augment the original system well-conditioned when approaching with a certain number of linear an isolated solution that is singular combinations of the derivatives (=multiple). of the original equations with indeterminate coefficients. The resulting system has x ∗ Example (Ojika (1995)) as a solution, but with lower x 2 + y − 3 = 0 multiplicity. x + 0 . 125 y 2 − 1 . 5 = 0 The solution x ∗ = (1 , 2) is isolated Repeat the procedure until x ∗ is regular. and singular – � 2 x � 1 A ( x ) = 1 0 . 25 y is a singular matrix at x = x ∗ . Anton Leykin Interfacing with the Numerical Homotopy Algorithms in PHCpack
PHCmaple dim = 0 PHCpack and C dim > 0 Example (Circles and points) The solution set consists of four x 2 + y 2 + ( z − 1) 2 − 1 = 0; irreducible components: the two points (0 , 0 , 1) , (0 , 0 , − 1) , and the ( z − 0 . 5)( z − 1) y = 0; circles x 2 + y 2 = 1 in the xy -plane ( z − 0 . 5)( z − 1) x = 0 and x 2 + y 2 = 0 . 75 , z = 0 . 5 . define the following variety Witness set Higher-dimensional parts of the solution set are represented by 0-dimensional witness sets. Irreducible decomposition Usually, irreducible components correspond to essentially different solution cases of the underlying problem. Anton Leykin Interfacing with the Numerical Homotopy Algorithms in PHCpack
PHCmaple C bindings PHCpack and C Parallel homotopy continuation Using PHCpack in C programs Minimalism: PHCpack as a state machine The only Ada function used is function use_c2phc ( job : integer; a : C_intarrs.Pointer; b : C_intarrs.Pointer; c : C_dblarrs.Pointer ) return integer; and there are only three functions available in C extern void adainit( void ); extern int _ada_use_c2phc ( int job, ...); extern void adafinal( void ); Bindings There is a collection of header files matching job numbers for the state machine with functions having meaningful names. Anton Leykin Interfacing with the Numerical Homotopy Algorithms in PHCpack
PHCmaple C bindings PHCpack and C Parallel homotopy continuation Parallel PHCpack Why parallelize? Coarse-grain parallelization is natural for homotopy continuation methods. Master-slave paradigm: distribute path-tracking jobs over a cluster of worker nodes. Parallel implementations parallel monodromy decomposition parallel polyhedral homotopies Jan Verschelde, 3:30pm, Room B Anton Leykin Interfacing with the Numerical Homotopy Algorithms in PHCpack
PHCmaple C bindings PHCpack and C Parallel homotopy continuation Caveats and future Dependency on the operating system and Maple version Currently PHCmaple is available for Windows Maple 8+. It is considerably faster if Classical Worksheet is used. GPL interface for a commercial software? Yes, we will continue developing PHCmaple . Yes, we consider writing an interface for a major GPL computer system. Anton Leykin Interfacing with the Numerical Homotopy Algorithms in PHCpack
Recommend
More recommend
