QPMS
/
qpms
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Fix comments and limits (at least I think it's a fix) 

Former-commit-id: 72f1cddf58f6e6a2e01d1e87174c147c38ead0dd
This commit is contained in:
Marek Nečada 2018-05-14 15:58:32 +00:00
parent 08f0332dbb
commit b6e1663619
2 changed files with 3 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
qpms/bessels.h
View File

@ -49,8 +49,7 @@ void hankelparts_fill(complex double *target_longrange, /* Not needed for the ac
// this declaration is general; however, the implementation
// is so far only for kappa == 5, maxp <= 5, longrange_order_cutoff <= 1
void lrhankel_recpart_fill(complex double *target_longrange_kspace /*Must be of size maxn*(maxn+1)/2*/,
size_t maxp /* Max. degree of transformed spherical Hankel function,
also the max. order of the Hankel transform */,
size_t maxp /* Max. order of the Hankel transform */,
size_t longrange_order_cutoff /* terms e**(I x)/x**(k+1), k>= longrange_order_cutoff go
completely to the shortrange part
index with hankelcoeffs_get(target,p)l[delta_m] */,

5
qpms/lrhankel_recspace_dirty.c
View File

@ -232,15 +232,14 @@ static const lrhankelspec transfuns_n[MAXKAPPA+1][MAXQM+1][MAXN+1] = {
};
void lrhankel_recpart_fill(complex double *target,
size_t maxp /*max. degree of transformed spherical Hankel fun,
also the max. order of the Hankel transform */,
size_t maxp /* max. order of the Hankel transform */,
size_t lrk_cutoff,
complex double const *const hct,
unsigned kappa, double c, double k0, double k)
{
assert(5 == kappa); // Only kappa == 5 implemented so far
assert(maxp <= MAXN); // only n <= 5 implemented so far
assert(lrk_cutoff <= MAXQM); // only q <= 2 implemented so far
assert(lrk_cutoff <= MAXQM + 1); // only q <= 2 implemented so far; TODO shouldn't it be only MAXQM ???
const lrhankelspec (*funarr)[MAXQM+1][MAXN+1] = (k>k0) ? transfuns_f : transfuns_n;
memset(target, 0, maxp*(maxp+1)/2*sizeof(complex double));
complex double a[kappa+1], b[kappa+1], d[kappa+1], e[kappa+1], ash[kappa+1];