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
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
|
/* fit/linear.c
*
* Copyright (C) 2000 Brian Gough
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or (at
* your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include <config.h>
#include <gsl/gsl_errno.h>
#include <gsl/gsl_fit.h>
/* Fit the data (x_i, y_i) to the linear relationship
Y = c0 + c1 x
returning,
c0, c1 -- coefficients
cov00, cov01, cov11 -- variance-covariance matrix of c0 and c1,
sumsq -- sum of squares of residuals
This fit can be used in the case where the errors for the data are
uknown, but assumed equal for all points. The resulting
variance-covariance matrix estimates the error in the coefficients
from the observed variance of the points around the best fit line.
*/
int
gsl_fit_linear (const double *x, const size_t xstride,
const double *y, const size_t ystride,
const size_t n,
double *c0, double *c1,
double *cov_00, double *cov_01, double *cov_11, double *sumsq)
{
double m_x = 0, m_y = 0, m_dx2 = 0, m_dxdy = 0;
size_t i;
for (i = 0; i < n; i++)
{
m_x += (x[i * xstride] - m_x) / (i + 1.0);
m_y += (y[i * ystride] - m_y) / (i + 1.0);
}
for (i = 0; i < n; i++)
{
const double dx = x[i * xstride] - m_x;
const double dy = y[i * ystride] - m_y;
m_dx2 += (dx * dx - m_dx2) / (i + 1.0);
m_dxdy += (dx * dy - m_dxdy) / (i + 1.0);
}
/* In terms of y = a + b x */
{
double s2 = 0, d2 = 0;
double b = m_dxdy / m_dx2;
double a = m_y - m_x * b;
*c0 = a;
*c1 = b;
/* Compute chi^2 = \sum (y_i - (a + b * x_i))^2 */
for (i = 0; i < n; i++)
{
const double dx = x[i * xstride] - m_x;
const double dy = y[i * ystride] - m_y;
const double d = dy - b * dx;
d2 += d * d;
}
s2 = d2 / (n - 2.0); /* chisq per degree of freedom */
*cov_00 = s2 * (1.0 / n) * (1 + m_x * m_x / m_dx2);
*cov_11 = s2 * 1.0 / (n * m_dx2);
*cov_01 = s2 * (-m_x) / (n * m_dx2);
*sumsq = d2;
}
return GSL_SUCCESS;
}
/* Fit the weighted data (x_i, w_i, y_i) to the linear relationship
Y = c0 + c1 x
returning,
c0, c1 -- coefficients
s0, s1 -- the standard deviations of c0 and c1,
r -- the correlation coefficient between c0 and c1,
chisq -- weighted sum of squares of residuals */
int
gsl_fit_wlinear (const double *x, const size_t xstride,
const double *w, const size_t wstride,
const double *y, const size_t ystride,
const size_t n,
double *c0, double *c1,
double *cov_00, double *cov_01, double *cov_11,
double *chisq)
{
/* compute the weighted means and weighted deviations from the means */
/* wm denotes a "weighted mean", wm(f) = (sum_i w_i f_i) / (sum_i w_i) */
double W = 0, wm_x = 0, wm_y = 0, wm_dx2 = 0, wm_dxdy = 0;
size_t i;
for (i = 0; i < n; i++)
{
const double wi = w[i * wstride];
if (wi > 0)
{
W += wi;
wm_x += (x[i * xstride] - wm_x) * (wi / W);
wm_y += (y[i * ystride] - wm_y) * (wi / W);
}
}
W = 0; /* reset the total weight */
for (i = 0; i < n; i++)
{
const double wi = w[i * wstride];
if (wi > 0)
{
const double dx = x[i * xstride] - wm_x;
const double dy = y[i * ystride] - wm_y;
W += wi;
wm_dx2 += (dx * dx - wm_dx2) * (wi / W);
wm_dxdy += (dx * dy - wm_dxdy) * (wi / W);
}
}
/* In terms of y = a + b x */
{
double d2 = 0;
double b = wm_dxdy / wm_dx2;
double a = wm_y - wm_x * b;
*c0 = a;
*c1 = b;
*cov_00 = (1 / W) * (1 + wm_x * wm_x / wm_dx2);
*cov_11 = 1 / (W * wm_dx2);
*cov_01 = -wm_x / (W * wm_dx2);
/* Compute chi^2 = \sum w_i (y_i - (a + b * x_i))^2 */
for (i = 0; i < n; i++)
{
const double wi = w[i * wstride];
if (wi > 0)
{
const double dx = x[i * xstride] - wm_x;
const double dy = y[i * ystride] - wm_y;
const double d = dy - b * dx;
d2 += wi * d * d;
}
}
*chisq = d2;
}
return GSL_SUCCESS;
}
int
gsl_fit_linear_est (const double x,
const double c0, const double c1,
const double c00, const double c01, const double c11,
double *y, double *y_err)
{
*y = c0 + c1 * x;
*y_err = sqrt (c00 + x * (2 * c01 + c11 * x));
return GSL_SUCCESS;
}
int
gsl_fit_mul (const double *x, const size_t xstride,
const double *y, const size_t ystride,
const size_t n,
double *c1, double *cov_11, double *sumsq)
{
double m_x = 0, m_y = 0, m_dx2 = 0, m_dxdy = 0;
size_t i;
for (i = 0; i < n; i++)
{
m_x += (x[i * xstride] - m_x) / (i + 1.0);
m_y += (y[i * ystride] - m_y) / (i + 1.0);
}
for (i = 0; i < n; i++)
{
const double dx = x[i * xstride] - m_x;
const double dy = y[i * ystride] - m_y;
m_dx2 += (dx * dx - m_dx2) / (i + 1.0);
m_dxdy += (dx * dy - m_dxdy) / (i + 1.0);
}
/* In terms of y = b x */
{
double s2 = 0, d2 = 0;
double b = (m_x * m_y + m_dxdy) / (m_x * m_x + m_dx2);
*c1 = b;
/* Compute chi^2 = \sum (y_i - b * x_i)^2 */
for (i = 0; i < n; i++)
{
const double dx = x[i * xstride] - m_x;
const double dy = y[i * ystride] - m_y;
const double d = (m_y - b * m_x) + dy - b * dx;
d2 += d * d;
}
s2 = d2 / (n - 1.0); /* chisq per degree of freedom */
*cov_11 = s2 * 1.0 / (n * (m_x * m_x + m_dx2));
*sumsq = d2;
}
return GSL_SUCCESS;
}
int
gsl_fit_wmul (const double *x, const size_t xstride,
const double *w, const size_t wstride,
const double *y, const size_t ystride,
const size_t n,
double *c1, double *cov_11, double *chisq)
{
/* compute the weighted means and weighted deviations from the means */
/* wm denotes a "weighted mean", wm(f) = (sum_i w_i f_i) / (sum_i w_i) */
double W = 0, wm_x = 0, wm_y = 0, wm_dx2 = 0, wm_dxdy = 0;
size_t i;
for (i = 0; i < n; i++)
{
const double wi = w[i * wstride];
if (wi > 0)
{
W += wi;
wm_x += (x[i * xstride] - wm_x) * (wi / W);
wm_y += (y[i * ystride] - wm_y) * (wi / W);
}
}
W = 0; /* reset the total weight */
for (i = 0; i < n; i++)
{
const double wi = w[i * wstride];
if (wi > 0)
{
const double dx = x[i * xstride] - wm_x;
const double dy = y[i * ystride] - wm_y;
W += wi;
wm_dx2 += (dx * dx - wm_dx2) * (wi / W);
wm_dxdy += (dx * dy - wm_dxdy) * (wi / W);
}
}
/* In terms of y = b x */
{
double d2 = 0;
double b = (wm_x * wm_y + wm_dxdy) / (wm_x * wm_x + wm_dx2);
*c1 = b;
*cov_11 = 1 / (W * (wm_x * wm_x + wm_dx2));
/* Compute chi^2 = \sum w_i (y_i - b * x_i)^2 */
for (i = 0; i < n; i++)
{
const double wi = w[i * wstride];
if (wi > 0)
{
const double dx = x[i * xstride] - wm_x;
const double dy = y[i * ystride] - wm_y;
const double d = (wm_y - b * wm_x) + (dy - b * dx);
d2 += wi * d * d;
}
}
*chisq = d2;
}
return GSL_SUCCESS;
}
int
gsl_fit_mul_est (const double x,
const double c1, const double c11,
double *y, double *y_err)
{
*y = c1 * x;
*y_err = sqrt (c11) * fabs (x);
return GSL_SUCCESS;
}
|
