[ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
[ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
phc.start
:: Start ox_sm1_phc
on the localhost.
Integer
ox_sm1_phc
on the localhost.
It returns the descriptor of ox_sm1_phc
.
Xm_noX = 1
to start ox_sm1_phc
without a debug window.
Phc_proc
.
P = phc.start() |
ox_launch
, phc
[ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
phc.phc
:: Ask PHC pack to find all the roots in the complex torus of the given systems of polynomials s
Void
Number
List
www.mth.msu.edu/~jan
for the original distribution.
The original PHC pack can choose several strategies to solve,
but our phc interface uses only black-box solver, which is general
and automatic but is not efficient. So, if you fails by our interface,
try the other strategies via the original user interface.
tmp.output.*
contains details informations on how PCH pack
solves the system.
length(s)
must agree.
Algorithm: Jan Verschelde, PHCpack: A general-purpose solver for polynomial systems by homotopy continuation". ACM Transaction on Mathematical Softwares, 25(2): 251-276, 1999.
[232] P = phc.start(); 0 [233] phc.phc([x^2+y^2-4,x*y-1]|proc=P); The detailed output is in the file tmp.output.* The answer is in the variable Phc. 0 [234] Phc; [[[-1.93185,0],[-0.517638,0]], [[0.517638,0],[1.93185,0]], [[-0.517638,0],[-1.93185,0]], [[1.93185,0],[0.517638,0]]] [[x=[real, imaginary], y=[real,imaginary]], the first solution [x=[real, imaginary], y=[real,imaginary]], the second solution ... |
ox_launch
, phc.start
, `$(OpenXM_HOME)/bin/lin_phcv2'(original PHC pack binary for linux)
[ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] |
This document was generated by Nobuki Takayama on January, 28 2008 using texi2html 1.76.