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
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
|
# Copyright(c) 1986 Association of Universities for Research in Astronomy Inc.
include <math/gsurfit.h>
# GS_EVPOLY -- Procedure to evluate the polynomials
procedure rgs_evpoly (coeff, x, y, zfit, npts, xterms, xorder, yorder, k1x,
k2x, k1y, k2y)
real coeff[ARB] # 1D array of coefficients
real x[npts] # x values of points to be evaluated
real y[npts]
real zfit[npts] # the fitted points
int npts # number of points to be evaluated
int xterms # cross terms ?
int xorder,yorder # order of the polynomials in x and y
real k1x, k2x # normalizing constants
real k1y, k2y
int i, k, cptr, maxorder, xincr
pointer sp, xb, yb, xbptr, ybptr, accum
begin
# fit a constant
if (xorder == 1 && yorder == 1) {
call amovkr (coeff[1], zfit, npts)
return
}
# fit first order in x and y
if (xorder == 2 && yorder == 1) {
call altmr (x, zfit, npts, coeff[2], coeff[1])
return
}
if (yorder == 2 && xorder == 1) {
call altmr (x, zfit, npts, coeff[2], coeff[1])
return
}
if (xorder == 2 && yorder == 2 && xterms == NO) {
do i = 1, npts
zfit[i] = coeff[1] + x[i] * coeff[2] + y[i] * coeff[3]
return
}
# allocate temporary space for the basis functions
call smark (sp)
call salloc (xb, xorder * npts, TY_REAL)
call salloc (yb, yorder * npts, TY_REAL)
call salloc (accum, npts, TY_REAL)
# calculate basis functions
call rgs_bpol (x, npts, xorder, k1x, k2x, Memr[xb])
call rgs_bpol (y, npts, yorder, k1y, k2y, Memr[yb])
# accumulate the output vector
cptr = 0
call aclrr (zfit, npts)
if (xterms != GS_XNONE) {
maxorder = max (xorder + 1, yorder + 1)
xincr = xorder
ybptr = yb
do i = 1, yorder {
call aclrr (Memr[accum], npts)
xbptr = xb
do k = 1, xincr {
call awsur (Memr[accum], Memr[xbptr], Memr[accum], npts,
1.0, coeff[cptr+k])
xbptr = xbptr + npts
}
call gs_asumvpr (Memr[accum], Memr[ybptr], zfit, zfit, npts)
cptr = cptr + xincr
ybptr = ybptr + npts
switch (xterms) {
case GS_XHALF:
if ((i + xorder + 1) > maxorder)
xincr = xincr - 1
default:
;
}
}
} else {
xbptr = xb
do k = 1, xorder {
call awsur (zfit, Memr[xbptr], zfit, npts, 1.0, coeff[k])
xbptr = xbptr + npts
}
ybptr = yb + npts
do k = 1, yorder - 1 {
call awsur (zfit, Memr[ybptr], zfit, npts, 1.0, coeff[xorder+k])
ybptr = ybptr + npts
}
}
call sfree (sp)
end
# GS_EVCHEB -- Procedure to evaluate a Chebyshev polynomial assuming that
# the coefficients have been calculated.
procedure rgs_evcheb (coeff, x, y, zfit, npts, xterms, xorder, yorder, k1x,
k2x, k1y, k2y)
real coeff[ARB] # 1D array of coefficients
real x[npts] # x values of points to be evaluated
real y[npts]
real zfit[npts] # the fitted points
int npts # number of points to be evaluated
int xterms # cross terms ?
int xorder,yorder # order of the polynomials in x and y
real k1x, k2x # normalizing constants
real k1y, k2y
int i, k, cptr, maxorder, xincr
pointer sp, xb, yb, xbptr, ybptr, accum
begin
# fit a constant
if (xorder == 1 && yorder == 1) {
call amovkr (coeff[1], zfit, npts)
return
}
# allocate temporary space for the basis functions
call smark (sp)
call salloc (xb, xorder * npts, TY_REAL)
call salloc (yb, yorder * npts, TY_REAL)
call salloc (accum, npts, TY_REAL)
# calculate basis functions
call rgs_bcheb (x, npts, xorder, k1x, k2x, Memr[xb])
call rgs_bcheb (y, npts, yorder, k1y, k2y, Memr[yb])
# accumulate thr output vector
cptr = 0
call aclrr (zfit, npts)
if (xterms != GS_XNONE) {
maxorder = max (xorder + 1, yorder + 1)
xincr = xorder
ybptr = yb
do i = 1, yorder {
call aclrr (Memr[accum], npts)
xbptr = xb
do k = 1, xincr {
call awsur (Memr[accum], Memr[xbptr], Memr[accum], npts,
1.0, coeff[cptr+k])
xbptr = xbptr + npts
}
call gs_asumvpr (Memr[accum], Memr[ybptr], zfit, zfit, npts)
cptr = cptr + xincr
ybptr = ybptr + npts
switch (xterms) {
case GS_XHALF:
if ((i + xorder + 1) > maxorder)
xincr = xincr - 1
default:
;
}
}
} else {
xbptr = xb
do k = 1, xorder {
call awsur (zfit, Memr[xbptr], zfit, npts, 1.0, coeff[k])
xbptr = xbptr + npts
}
ybptr = yb + npts
do k = 1, yorder - 1 {
call awsur (zfit, Memr[ybptr], zfit, npts, 1.0, coeff[xorder+k])
ybptr = ybptr + npts
}
}
# free temporary space
call sfree (sp)
end
# GS_EVLEG -- Procedure to evaluate a Chebyshev polynomial assuming that
# the coefficients have been calculated.
procedure rgs_evleg (coeff, x, y, zfit, npts, xterms, xorder, yorder, k1x, k2x,
k1y, k2y)
real coeff[ARB] # 1D array of coefficients
real x[npts] # x values of points to be evaluated
real y[npts]
real zfit[npts] # the fitted points
int npts # number of points to be evaluated
int xterms # cross terms ?
int xorder,yorder # order of the polynomials in x and y
real k1x, k2x # normalizing constants
real k1y, k2y
int i, k, cptr, maxorder, xincr
pointer sp, xb, yb, accum, xbptr, ybptr
begin
# fit a constant
if (xorder == 1 && yorder == 1) {
call amovkr (coeff[1], zfit, npts)
return
}
# allocate temporary space for the basis functions
call smark (sp)
call salloc (xb, xorder * npts, TY_REAL)
call salloc (yb, yorder * npts, TY_REAL)
call salloc (accum, npts, TY_REAL)
# calculate basis functions
call rgs_bleg (x, npts, xorder, k1x, k2x, Memr[xb])
call rgs_bleg (y, npts, yorder, k1y, k2y, Memr[yb])
cptr = 0
call aclrr (zfit, npts)
if (xterms != GS_XNONE) {
maxorder = max (xorder + 1, yorder + 1)
xincr = xorder
ybptr = yb
do i = 1, yorder {
xbptr = xb
call aclrr (Memr[accum], npts)
do k = 1, xincr {
call awsur (Memr[accum], Memr[xbptr], Memr[accum], npts,
1.0, coeff[cptr+k])
xbptr = xbptr + npts
}
call gs_asumvpr (Memr[accum], Memr[ybptr], zfit, zfit, npts)
cptr = cptr + xincr
ybptr = ybptr + npts
switch (xterms) {
case GS_XHALF:
if ((i + xorder + 1) > maxorder)
xincr = xincr - 1
default:
;
}
}
} else {
xbptr = xb
do k = 1, xorder {
call awsur (zfit, Memr[xbptr], zfit, npts, 1.0, coeff[k])
xbptr = xbptr + npts
}
ybptr = yb + npts
do k = 1, yorder - 1 {
call awsur (zfit, Memr[ybptr], zfit, npts, 1.0, coeff[xorder+k])
ybptr = ybptr + npts
}
}
# free temporary space
call sfree (sp)
end
# GS_ASUMVP -- Procedure to add the product of two vectors to another vector
procedure gs_asumvpr (a, b, c, d, npts)
real a[ARB] # first input vector
real b[ARB] # second input vector
real c[ARB] # third vector
real d[ARB] # output vector
int npts # number of points
int i
begin
do i = 1, npts
d[i] = c[i] + a[i] * b[i]
end
|
