115 lst lmom = ex_to<lst>(aio.
Internal);
116 lst emom = ex_to<lst>(aio.
External);
119 if(
Verbose > 1) cout <<
PRE <<
"\\--Reading ApartIBP" << flush;
126 if(IBPmethod==1) wdir = aio.
SaveDir +
"/FIRE";
127 else if(IBPmethod==2) wdir = aio.
SaveDir +
"/KIRA";
128 else if(IBPmethod==3) wdir = aio.
SaveDir +
"/UKIRA";
130 wdir = to_string(getpid());
131 if(IBPmethod==1) wdir = wdir +
"_FIRE";
132 else if(IBPmethod==2) wdir = wdir +
"_KIRA";
133 else if(IBPmethod==3) wdir = wdir +
"_UKIRA";
137 vector<IBP*> ibp_vec;
139 if(
Verbose > 1) cout <<
PRE <<
"\\--Reading AIR2F" << flush;
140 AIR2F_Get(aio.
SaveDir, air_vec, IntFs, ibp_vec, IBPmethod);
141 for(
auto ibp : ibp_vec) ibp->WorkingDir = wdir;
142 if(
Verbose > 1) cout <<
" @ " <<
now(
false) << endl;
148 if(
Verbose > 1) cout <<
PRE <<
"\\--Reading AP.gar" << flush;
150 if(
Verbose > 1) cout <<
" @ " <<
now(
false) << endl;
152 }
else rc = system((
"mkdir -p "+aio.
SaveDir).c_str());
156 int av_size = air_vec.size();
162 for(
int i=0; i<av_size; i++) {
163 for(
auto cv : ex_to<lst>(air_vec[i])) vset.insert(cv.op(1));
165 exvector vvec(vset.begin(), vset.end());
169 for(
int i=0; i<vvec.size(); i++) v2api[vvec[i]] = i;
170 for(
int i=0; i<av_size; i++) {
172 lst cvs = ex_to<lst>(air_vec[i]);
173 air_vec[i] = av_item;
174 for(
auto & cv : cvs) av_item.append(lst{cv.op(0), v2api[cv.op(1)]});
176 air_vec[i] = av_item;
180 auto ap_vec =
GiNaC_Parallel(vvec.size(), [&vvec,lmom,emom,aio] (
int idx) {
181 auto air = vvec[idx];
182 air = Apart(air,lmom,emom,aio.smap);
183 air = air.subs(ApartIR(1,w)==aio.apart1);
184 air = collect_lst(air, ApartIR(w1,w2), o_flintf);
190 for(
auto cvs : ap_vec)
for(
auto cv : cvs)
if(is_a<matrix>(cv.op(1).op(0))) ap_set.insert(cv.op(1));
191 exvector ap_ir_vec(ap_set.begin(), ap_set.end());
198 ap_vec =
GiNaC_Parallel(ap_vec.size(), [&aio,&ap_vec,&ap_rules] (
int idx) {
199 auto const & cvs = ap_vec[idx];
202 for(auto const & cv : cvs) {
203 auto fi = ap_rules.find(cv.op(1));
204 if(fi==ap_rules.end()) res += cv.op(0) * cv.op(1);
205 else res += cv.op(0) * fi->second;
208 for(auto cv : cvs) res += cv.op(0) * ApartIRC(cv.op(1));
213 int vn = ap_vec.size();
214 for(
int idx=0; idx<vn; idx++) {
215 lst cvs = ex_to<lst>(ap_vec[idx]);
218 for(
auto const & cv : cvs) {
219 auto fi = ap_rules.find(cv.op(1));
220 if(fi==ap_rules.end()) res += cv.op(0) * cv.op(1);
221 else res += cv.op(0) * fi->second;
224 for(
auto cv : cvs) res += cv.op(0) *
ApartIRC(cv.op(1));
234 lst cvs = ex_to<lst>(air_vec[idx]);
236 for(
auto const & cv : cvs) {
237 int idx = ex_to<numeric>(cv.op(1)).to_int();
238 res += cv.op(0) * ap_vec[idx];
245 if(aio.SaveDir !=
"") {
246 garWrite(air_vec,aio.SaveDir+
"/AP.gar");
247 garRead(air_vec,aio.SaveDir+
"/AP.gar");
256 auto ret =
GiNaC_Parallel(air_vec.size(), [&air_vec](
int idx)->ex {
257 auto air = air_vec[idx];
259 find(air, ApartIR(w1,w2), airs);
261 for(auto item : airs) ret.append(item);
265 for(
auto airs : ret) for(auto air : ex_to<lst>(airs))
intg.insert(air);
266 AIR = exvector(
intg.begin(),
intg.end());
269 for(
auto sp : aio.CSP)
SP_map.erase(
sp);
275 repls.append(w*kv.first == w*kv.second);
276 repls.append(kv.first == kv.second);
280 for(
auto li : lmom) {
281 if(is_a<Vector>(li)) loops.append(ex_to<Vector>(li).name);
282 else loops.append(li);
284 for(
auto li : emom) {
285 if(is_a<Vector>(li)) exts.append(ex_to<Vector>(li).name);
286 else exts.append(li);
289 if(Verbose>0) cout <<
PRE <<
"\\--Prepare " <<
WHITE <<
"IBP" <<
RESET <<
" reduction @ " <<
now(
false) << flush;
292 std::map<ex, IBP*, ex_is_less> p2IBP;
294 int ntot = AIR.size();
295 for(
int i=0; i<ntot; i++) {
296 if(Verbose>0 && (((i+1)%1000)==0 || i+1==ntot)) {
297 cout <<
"\r \r" << flush;
298 cout <<
PRE <<
"\\--Prepare " <<
WHITE <<
"IBP" <<
RESET <<
" reduction [" << (i+1) <<
"/" << ntot <<
"] @ " <<
now(
false) << flush;
300 auto const & ir = AIR[i];
301 auto mat = ex_to<matrix>(ir.op(0));
302 auto vars = ex_to<lst>(ir.op(1));
304 int nrow = mat.rows();
306 for(
int c=0; c<mat.cols(); c++) {
308 for(
int r=0; r<nrow-2; r++) pc += mat(r,c) * vars.op(r);
311 ex nc = ex(0)-mat(nrow-1,c);
315 if(ncn==-1) den_tot++;
316 pns.append(lst{ ncn, pc, nc });
318 bool pn_sector =
false;
319 if(aio.pn_sector>0 && den_tot>=aio.pn_sector) pn_sector =
true;
321 for(
int i=0; i<pns.nops(); i++) pns[i] = lst{ pns.op(i).op(1), pns.op(i).op(2) };
325 for(
int i=0; i<pns.nops(); i++) pns[i] = lst{ pns.op(i).op(1), pns.op(i).op(2) };
328 int nCut = aio.Cut.nops();
331 cuts = cuts.subs(SP_map,nopat);
332 if(aio.CutFirst)
for(
auto cut : cuts) pns.prepend(lst{
SP2sp(cut), 1 });
333 else for(
auto cut : cuts) pns.append(lst{
SP2sp(cut), 1 });
337 for(
auto item : pns) {
338 props.append(item.op(0));
339 ns.append(item.op(1));
345 for(
int i=0; i<ns.nops(); i++) nss.append(ns.op(i)>0 ? 1 : 0);
346 key = lst{props,nss};
349 auto kv = p2IBP.find(key);
350 if(kv==p2IBP.end()) {
352 if(IBPmethod==0) ibp =
new IBP();
353 else if(IBPmethod==1) ibp =
new FIRE();
354 else if(IBPmethod==2) ibp =
new KIRA();
355 else if(IBPmethod==3) ibp =
new UKIRA();
361 p2IBP.insert(make_pair(key,ibp));
362 ibp->Propagator = props;
363 ibp->Internal = loops;
364 ibp->External = exts;
365 ibp->Replacement = repls;
366 if(aio.ISP.nops()>0)
for(
auto item : aio.ISP) ibp->ISP.append(
SP2sp(item));
367 if(aio.DSP.nops()>0) {
368 for(
auto item : aio.DSP) {
369 lst
sp = ex_to<lst>(item);
370 if(is_a<Vector>(
sp.op(0)))
sp[0] = (ex_to<Vector>(
sp.op(0)).name);
371 if(is_a<Vector>(
sp.op(1))) sp[1] = (ex_to<Vector>(
sp.op(1)).name);
377 for(
auto const & item : ns) {
378 if(item>0) sector.append(1);
379 else sector.append(0);
381 ibp->SECTOR = sector;
383 ibp->WorkingDir = wdir;
384 ibp->ProblemNumber =
pn;
387 if(aio.CutFirst)
for(
int i=0; i<nCut; i++) ibp->Cut.append(i+1);
388 else for(
int i=0; i<nCut; i++) ibp->Cut.append(nCut-i);
390 ibp_vec.push_back(ibp);
391 ibp->Integral.append(ns);
392 AIR2F[AIR[i]] = F(ibp->ProblemNumber, ns);
394 IBP* ibp = kv->second;
395 ibp->Integral.append(ns);
396 AIR2F[AIR[i]] = F(ibp->ProblemNumber, ns);
399 if(Verbose>0) cout << endl;
401 if(Verbose>0) cout <<
PRE <<
"\\--Total Ints/Pros: " <<
WHITE << ntot <<
"/" << ibp_vec.size() <<
RESET <<
" @ " <<
now(
false) << endl;
406 auto int_fr =
FindRules(ibp_vec,
false, aio.UF);
407 IntFs = int_fr.second;
410 air_vec =
GiNaC_Parallel(air_vec.size(), [&air_vec,&AIR2F,&int_fr] (
int idx) {
411 auto air = air_vec[idx];
412 air = air.subs(AIR2F,nopat);
413 air = air.subs(int_fr.first,nopat);
414 air = collect_ex(air, F(w1,w2));
417 if(aio.SaveDir !=
"") AIR2F_Save(aio.SaveDir, air_vec, IntFs, ibp_vec);
422 MapFunction _F2ex([&ibp_vec,aio](
const ex &e, MapFunction &self)->ex {
423 if(!e.has(F(w1,w2)))
return e;
424 else if(e.match(F(w1,w2))) {
425 int pn = ex_to<numeric>(e.op(0)).to_int();
426 auto pso = ex_to<lst>(ibp_vec[
pn-1]->Propagator);
427 auto nso = ex_to<lst>(e.op(1));
429 for(
int i=0; i<pso.nops(); i++) {
430 if(!aio.keep0F && nso.op(i).is_zero())
continue;
431 ps.append(pso.op(i));
432 ns.append(nso.op(i));
435 }
else return e.map(self);
439 air_vec =
GiNaC_Parallel(air_vec.size(), [&air_vec,&_F2ex](
int idx)->ex {
440 auto res = air_vec[idx];
443 for(
auto fp : ibp_vec) delete fp;
444 if(aio.SaveDir ==
"") rc = system((
"rm -rf "+wdir).c_str());
449 if(aio.SaveDir !=
"" &&
file_exists(aio.SaveDir+
"/MIs.gar")) {
453 vector<IBP*> ibp_vec_re;
455 map<int,lst> pn_ints_map;
456 for(
auto item : IntFs) {
457 int pn = ex_to<numeric>(item.op(0)).to_int();
458 pn_ints_map[
pn].append(item.op(1));
462 for(
auto pi : pn_ints_map) {
463 auto ibp = ibp_vec[pi.first-1];
464 ibp->Integral = pi.second;
465 nints += ibp->Integral.nops();
466 ibp_vec_re.push_back(ibp);
469 if(Verbose>0) cout <<
PRE <<
"\\--Refined Ints/Pros: " <<
WHITE << nints <<
"/" << ibp_vec_re.size() <<
RESET <<
" @ " <<
now(
false) << endl;
474 auto pRes =
GiNaC_Parallel(ibp_vec_re.size(), [&ibp_vec_re](
int idx)->ex {
475 ibp_vec_re[idx]->Export();
476 auto ret = lst{ ibp_vec_re[idx]->IsAlwaysZero ? 1 : 0, ibp_vec_re[idx]->Rules };
479 for(
int i=0; i<ibp_vec_re.size(); i++) {
480 ibp_vec_re[i]->IsAlwaysZero = (pRes[i].op(0)==1 ? true :
false);
481 ibp_vec_re[i]->Rules = ex_to<lst>(pRes[i].op(1));
484 int nproc = aio.NIBP;
485 if(nproc<1) nproc = 8;
487 if(nproc<1) nproc = 1;
488 size_t nibp = ibp_vec_re.size();
492 #pragma omp parallel for num_threads(nproc) schedule(dynamic, 1)
493 for(
int pi=0; pi<nibp; pi++) {
497 cout <<
"\r \r" << flush;
498 cout <<
PRE <<
"\\--" <<
WHITE <<
"FIRE" <<
RESET <<
" Reduction [" << (++cproc) <<
"/" << nibp <<
"] " << flush;
501 ibp_vec_re[pi]->Run();
503 if(Verbose>1 && nibp>0) cout <<
"@" <<
now(
false) << endl;
509 ibp_vec_re[idx]->Run();
513 for(
int pi=0; pi<nibp; pi++) {
514 if(Verbose>1) cout <<
"\r \r" <<
PRE <<
"\\--" <<
WHITE <<
"FIRE" <<
RESET <<
" Reduction [" << (++cproc) <<
"/" << nibp <<
"] " << flush;
515 ibp_vec_re[pi]->Run();
517 if(Verbose>1 && nibp>0) cout <<
"@" <<
now(
false) << endl;
521 if(ibp_vec_re.size()>100) {
522 auto ret =
GiNaC_Parallel(ibp_vec_re.size(), [&ibp_vec_re,wdir](
int idx)->ex {
523 ibp_vec_re[idx]->Import();
524 return ibp_vec_re[idx]->TO();
526 for(
int i=0; i<ibp_vec_re.size(); i++) ibp_vec_re[i]->FROM(ret[i]);
529 for(
auto item : ibp_vec_re) {
530 if(Verbose>1) cout <<
"\r \r" <<
PRE <<
"\\--" <<
WHITE <<
"FIRE" <<
RESET <<
" Import [" << (++cproc) <<
"/" << ibp_vec_re.size() <<
"] " << flush;
533 if(Verbose>1 && ibp_vec_re.size()>0) cout <<
"@" <<
now(
false) << endl;
537 if(aio.SaveDir ==
"") rc = system((
"rm -rf "+wdir).c_str());
538 }
else if(IBPmethod==2 || IBPmethod==3) {
539 for(
auto ibp : ibp_vec_re) ibp->Reduce();
540 if(aio.SaveDir ==
"") rc = system((
"rm -rf "+wdir).c_str());
544 auto fr =
FindRules(ibp_vec_re,
true, aio.UF);
545 exmap miRules = fr.first;
547 if(aio.SaveDir !=
"") rc = system((
"mkdir -p "+aio.SaveDir+
"/Rules").c_str());
548 auto rules_vec =
GiNaC_Parallel(ibp_vec_re.size(), [&ibp_vec_re,&miRules,&aio](
int idx)->ex {
549 lst rules = ex_to<lst>(ibp_vec_re[idx]->Rules);
551 for(auto ri : rules) res.append(lst {
553 collect_ex(ri.op(1).subs(miRules,nopat),F(w1,w2),o_flint)
555 for(
auto mi : ibp_vec_re[idx]->MIntegral) {
556 auto fi = miRules.find(mi);
557 if(fi!=miRules.end()) res.append(lst{ mi, fi->second });
559 auto pn = ibp_vec_re[idx]->ProblemNumber;
560 if(aio.SaveDir !=
"") {
561 garWrite(aio.SaveDir+
"/Rules/"+to_string(
pn)+
".gar", res);
565 if(aio.SaveDir !=
"") {
566 garWrite(aio.SaveDir+
"/MIs.gar", _F2ex(fr.second));
568 for(
auto rs : rules_vec) {
569 for(
auto ri : rs) if(ri.op(0)!=ri.op(1)) ibpRules[ri.op(0)] = ri.op(1);
578 GiNaC_Parallel(air_vec.size(), [&air_vec,&ibpRules,&_F2ex,&aio](
int idx)->ex {
579 ex res = air_vec[idx];
581 if(aio.SaveDir !=
"") {
583 find(res, F(w1,w2), fs);
585 for(auto fi : fs) pns.insert(fi.op(0));
587 auto rs = ex_to<lst>(garRead(aio.SaveDir+
"/Rules/"+ex2str(pn)+
".gar"));
588 for(auto ri : rs) if(ri.op(0)!=ri.op(1)) rules[ri.op(0)] = ri.op(1);
590 }
else rules = ibpRules;
591 res = res.subs(rules,nopat);
592 if(aio.pat.nops()>0) {
598 if(aio.cv!=
nullptr) {
599 auto _cv = aio.cv(c,v);
609 for(
auto fp : ibp_vec) delete fp;
611 if(aio.SaveDir !=
"")
garWrite(air_vec, aio.SaveDir+
"/ApartIBP.gar");