27 for(
int i=0; i<nvars; i++) {
36 if(res.has(
NaN))
return 1.E100L;
38 auto err = res.subs(VE(
w0,
w1)==
w1);
39 numeric nerr = numeric(1.E100);
41 nerr = ex_to<numeric>(
NN(abs(err)));
42 if(nerr > numeric(1.E100)) nerr = numeric(1.E100);
45 diff = diff.subs(VE(0,0)==0);
47 diff.find(VE(
w0,
w1), ves);
49 if(abs(ve.op(0)) > ve.op(1))
return 1.E100L;
54 for(
int i=0; i<nvars; i++) cout << las[i] <<
" ";
55 cout << endl <<
" " << res.subs(VE(0,0)==0).subs(VE(
w1,
w2)==VEO(
w1,
w2)) << endl;
58 for(
int i=0; i<nvars; i++)
lambda[i] = las[i];
61 cout <<
" ------------------------------" << endl;
71 }
catch(domain_error &ex) {
76 cout <<
" ------------------------------" << endl;
83 fn << pid <<
".las.done";
86 cmd <<
"rm " << fn.str();
87 auto rc = system(cmd.str().c_str());
89 if(
Verbose>3) cout <<
" Exit: " << fn.str() << endl;
90 cout <<
" ------------------------------" << endl;
static IntegratorBase * Integrator
static MinimizeBase * miner
static dREAL IntError(int nvars, dREAL *las, dREAL *n1, dREAL *n2)
virtual ex Integrate(size_t n=0)=0
virtual void ForceStop()=0
namespace for Numerical integration with Sector Decomposition method
const char * Color_HighLight
__float128 ex2q(ex num)
ex of numeric to __float128
ex NN(ex expr, int digits)
the nuerical evaluation
bool file_exists(string fn)