1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
|
/*
* iemmatrix
*
* objects for manipulating simple matrices
* mostly refering to matlab/octave matrix functions
* this functions depends on the GNU scientific library
*
* Copyright (c) 2009, Franz Zotter
* IEM, Graz, Austria
*
* For information on usage and redistribution, and for a DISCLAIMER OF ALL
* WARRANTIES, see the file, "LICENSE.txt," in this distribution.
*
*/
#include "iemmatrix.h"
#include "math.h"
#include <stdlib.h>
#ifdef HAVE_GSL_BESSEL
#include <gsl/gsl_sf_bessel.h>
#endif
static t_class *mtx_bessel_class;
typedef struct _MTXBessel_ MTXBessel;
struct _MTXBessel_
{
t_object x_obj;
t_outlet *list_h_re_out;
t_outlet *list_h_im_out;
t_atom *list_h_re;
t_atom *list_h_im;
double *kr;
double *h_re;
double *h_im;
size_t nmax;
size_t l;
};
static void allocMTXBesseldata (MTXBessel *x)
{
x->kr=(double*)calloc(x->l,sizeof(double));
if (x->list_h_re_out!=0) {
x->list_h_re=(t_atom*)calloc(x->l*(x->nmax+1)+2,sizeof(t_atom));
x->h_re=(double*)calloc(x->l*(x->nmax+1),sizeof(double));
}
if (x->list_h_im_out!=0) {
x->list_h_im=(t_atom*)calloc(x->l*(x->nmax+1)+2,sizeof(t_atom));
x->h_im=(double*)calloc(x->l*(x->nmax+1),sizeof(double));
}
}
static void deleteMTXBesseldata (MTXBessel *x)
{
if (x->kr!=0)
free(x->kr);
if (x->h_re!=0)
free(x->h_re);
if (x->h_im!=0)
free(x->h_im);
if (x->list_h_re!=0)
free(x->list_h_re);
if (x->list_h_im!=0)
free(x->list_h_im);
x->list_h_re=0;
x->list_h_im=0;
x->h_re=0;
x->h_im=0;
x->kr=0;
}
static void *newMTXBessel (t_symbol *s, int argc, t_atom *argv)
{
int nmax;
char whichfunction = 'j';
t_symbol *fsym;
MTXBessel *x = (MTXBessel *) pd_new (mtx_bessel_class);
x->list_h_re = 0;
x->list_h_im = 0;
x->list_h_im_out = 0;
x->list_h_re_out = 0;
x->kr = 0;
x->h_re = 0;
x->h_im = 0;
x->l=0;
fsym=atom_getsymbol(argv);
if (fsym->s_name!=0)
whichfunction=fsym->s_name[0];
switch (whichfunction) {
default:
case 'J':
x->list_h_re_out = outlet_new (&x->x_obj, gensym("matrix"));
break;
case 'H':
x->list_h_re_out = outlet_new (&x->x_obj, gensym("matrix"));
case 'Y':
x->list_h_im_out = outlet_new (&x->x_obj, gensym("matrix"));
}
nmax=(int) atom_getfloat(argv+1);
if (nmax<0)
nmax=0;
x->nmax=nmax;
return ((void *) x);
}
static void mTXBesselBang (MTXBessel *x)
{
if (x->list_h_im!=0) {
outlet_anything(x->list_h_im_out, gensym("matrix"), x->l*(x->nmax+1)+2, x->list_h_im);
}
if (x->list_h_re!=0) {
outlet_anything(x->list_h_re_out, gensym("matrix"), x->l*(x->nmax+1)+2, x->list_h_re);
}
}
static void mTXBesselMatrix (MTXBessel *x, t_symbol *s,
int argc, t_atom *argv)
{
int rows = atom_getint (argv++);
int columns = atom_getint (argv++);
int size = rows * columns;
int in_size = argc-2;
int n,m,ofs;
#if defined HAVE_MATH_BESSEL || defined HAVE_GSL_BESSEL
/* size check */
if (!size)
post("mtx_bessel: invalid dimensions");
else if (in_size<size)
post("mtx_bessel: sparse matrix not yet supported: use \"mtx_check\"");
else if ((rows!=1)||(columns<1))
post("mtx_bessel: 1 X L matrix expected with kr and h vector, but got more rows/no entries");
else {
if (x->l!=columns) {
deleteMTXBesseldata(x);
x->l=columns;
allocMTXBesseldata(x);
}
for (n=0;n<x->l;n++) {
x->kr[n]=(double) atom_getfloat(argv+n);
}
#ifdef HAVE_GSL_BESSEL
if (x->h_re!=0)
for (m=0;m<x->l;m++)
for (n=0;n<x->nmax+1;n++)
x->h_re[n+m*(x->nmax+1)]=gsl_sf_bessel_Jn(n,x->kr[m]);
if (x->h_im!=0)
for (m=0;m<x->l;m++)
for (n=0;n<x->nmax+1;n++)
x->h_im[n+m*(x->nmax+1)]=gsl_sf_bessel_Yn(n,x->kr[m]);
#else
if (x->h_re!=0)
for (m=0;m<x->l;m++)
for (n=0;n<x->nmax+1;n++)
x->h_re[n+m*(x->nmax+1)]=jn(n,x->kr[m]);
if (x->h_im!=0)
for (m=0;m<x->l;m++)
for (n=0;n<x->nmax+1;n++)
x->h_im[n+m*(x->nmax+1)]=yn(n,x->kr[m]);
#endif
if (x->h_re!=0) {
SETFLOAT(x->list_h_re+1,(float)(x->nmax+1));
SETFLOAT(x->list_h_re,(float)x->l);
for (n=0;n<x->l*(x->nmax+1);n++)
SETFLOAT(x->list_h_re+n+2,(float)x->h_re[n]);
}
if (x->h_im!=0) {
SETFLOAT(x->list_h_im+1,(float)(x->nmax+1));
SETFLOAT(x->list_h_im,(float)x->l);
for (n=0;n<x->l*(x->nmax+1);n++)
SETFLOAT(x->list_h_im+n+2,(float)x->h_im[n]);
}
mTXBesselBang(x);
}
#else
post("mtx_bessel: implementation requires math.h that implements jn and yn Bessel functions or gsl_sf_bessel.h");
#endif
}
void mtx_bessel_setup (void)
{
mtx_bessel_class = class_new
(gensym("mtx_bessel"),
(t_newmethod) newMTXBessel,
(t_method) deleteMTXBesseldata,
sizeof (MTXBessel),
CLASS_DEFAULT, A_GIMME, 0);
class_addbang (mtx_bessel_class, (t_method) mTXBesselBang);
class_addmethod (mtx_bessel_class, (t_method) mTXBesselMatrix, gensym("matrix"), A_GIMME,0);
}
void iemtx_bessel_setup(void){
mtx_bessel_setup();
}
|
