|
@@ -267,6 +267,14 @@ namespace Lemma{
|
267
|
267
|
GQChave::GQChave( const ctor_key& key ) : HankelTransform( key ) {
|
268
|
268
|
//karg.resize(255, 100);
|
269
|
269
|
//kern.resize(510, 100);
|
|
270
|
+ Xr.resize(100);
|
|
271
|
+ Xi.resize(100);
|
|
272
|
+ Dr.resize(100);
|
|
273
|
+ Di.resize(100);
|
|
274
|
+ Sr.resize(100);
|
|
275
|
+ Si.resize(100);
|
|
276
|
+ Cfcor.resize(100);
|
|
277
|
+ Cfcoi.resize(100);
|
270
|
278
|
}
|
271
|
279
|
|
272
|
280
|
GQChave::GQChave( const YAML::Node& node, const ctor_key& key ) : HankelTransform(node, key) {
|
|
@@ -355,6 +363,8 @@ namespace Lemma{
|
355
|
363
|
//this->karg.setZero();
|
356
|
364
|
//this->kern.setZero();
|
357
|
365
|
|
|
366
|
+ //std::cout << "calling Besautn" << std::endl;
|
|
367
|
+
|
358
|
368
|
Besautn(Besr, Besi, itype, nl, nu, rho, rerr, aerr, npcs, inew, wavef, Kernel);
|
359
|
369
|
|
360
|
370
|
return Complex(Besr, Besi);
|
|
@@ -400,6 +410,7 @@ namespace Lemma{
|
400
|
410
|
int nsum(0);
|
401
|
411
|
|
402
|
412
|
// Check for Rtud
|
|
413
|
+ //std::cout << "calling Bestrn" << std::endl;
|
403
|
414
|
Bestrn(besr_1, besi_1, besselOrder, lowerGaussLimit, rho,
|
404
|
415
|
.1*relativeError, .1*absError,
|
405
|
416
|
numPieces, xsum, nsum, nw, ierr, ncntrl, aorb, Kernel);
|
|
@@ -498,12 +509,14 @@ namespace Lemma{
|
498
|
509
|
/////////////////////////////////////////////////////////////
|
499
|
510
|
void GQChave::
|
500
|
511
|
Bestrn(Real &BESR, Real &BESI, const int &IORDER,
|
501
|
|
- const int &NG, const Real &rho,
|
502
|
|
- const Real &RERR, const Real &AERR, const int &NPCS,
|
503
|
|
- VectorXi &XSUM, int &NSUM, int &NEW,
|
504
|
|
- int &IERR, int &NCNTRL, const Real &AORB, KernelEM1DBase* Kernel) {
|
505
|
|
-
|
506
|
|
-
|
|
512
|
+ const int& NG, const Real& rho,
|
|
513
|
+ const Real& RERR, const Real& AERR, const int& NPCS,
|
|
514
|
+ const VectorXi& XSUM, int& NSUM, int& NEW,
|
|
515
|
+ int& IERR, int& NCNTRL, const Real& AORB, KernelEM1DBase* Kernel) {
|
|
516
|
+
|
|
517
|
+ //std::cout << "Bestrn setZero " << NEW << std::endl;
|
|
518
|
+ //Xr.array() = 0.;
|
|
519
|
+ //Xi.array() = 0.;
|
507
|
520
|
Xr.setZero();
|
508
|
521
|
Xi.setZero();
|
509
|
522
|
Dr.setZero();
|
|
@@ -514,6 +527,7 @@ namespace Lemma{
|
514
|
527
|
Cfcoi.setZero();
|
515
|
528
|
Dr.setZero();
|
516
|
529
|
Di.setZero();
|
|
530
|
+ //std::cout << "Bestrn wat " << NEW << std::endl;
|
517
|
531
|
|
518
|
532
|
Dr(0) = (Real)(-1);
|
519
|
533
|
|
|
@@ -587,6 +601,7 @@ namespace Lemma{
|
587
|
601
|
++NPB;
|
588
|
602
|
}
|
589
|
603
|
}
|
|
604
|
+ //std::cout << "Bestrn NEW " << NEW << std::endl;
|
590
|
605
|
|
591
|
606
|
// ENTRY POINT FOR PADE SUMMATION OF PARTIAL INTEGRANDS
|
592
|
607
|
Real LASTR=0.e0;
|
|
@@ -1033,8 +1048,8 @@ namespace Lemma{
|
1033
|
1048
|
|
1034
|
1049
|
/////////////////////////////////////////////////////////////
|
1035
|
1050
|
void GQChave::CF(Real& RESR, Real &RESI,
|
1036
|
|
- Eigen::Matrix<Real, 100, 1> &CFCOR,
|
1037
|
|
- Eigen::Matrix<Real, 100, 1> &CFCOI,
|
|
1051
|
+ const VectorXr& CFCOR,
|
|
1052
|
+ const VectorXr& CFCOI,
|
1038
|
1053
|
const int &N) {
|
1039
|
1054
|
|
1040
|
1055
|
////////////////////////////////////////////////
|
|
@@ -1071,7 +1086,6 @@ namespace Lemma{
|
1071
|
1086
|
|
1072
|
1087
|
Real BETA(0);
|
1073
|
1088
|
switch (besselOrder) {
|
1074
|
|
-
|
1075
|
1089
|
case 0:
|
1076
|
1090
|
BETA=(nzero-.25e0)*PI;
|
1077
|
1091
|
return BETA-ZT1/BETA-ZT2/std::pow(BETA,3) -
|
|
@@ -1083,7 +1097,7 @@ namespace Lemma{
|
1083
|
1097
|
default:
|
1084
|
1098
|
throw 77;
|
1085
|
1099
|
}
|
1086
|
|
- return 0.;
|
|
1100
|
+ //return 0.;
|
1087
|
1101
|
}
|
1088
|
1102
|
|
1089
|
1103
|
|