-
Notifications
You must be signed in to change notification settings - Fork 315
/
loglin.c
407 lines (331 loc) · 7.55 KB
/
loglin.c
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
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
/* Algorithm AS 51 Appl. Statist. (1972), vol. 21, p. 218
original (C) Royal Statistical Society 1972
Performs an iterative proportional fit of the marginal totals of a
contingency table.
*/
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <math.h>
#include <stdio.h>
#include <R_ext/Memory.h>
#include <R_ext/Applic.h>
#undef max
#undef min
#undef abs
#define max(a, b) ((a) < (b) ? (b) : (a))
#define min(a, b) ((a) > (b) ? (b) : (a))
#define abs(x) ((x) >= 0 ? (x) : -(x))
static void collap(int *nvar, double *x, double *y, int *locy,
int *nx, int *ny, int *dim, int *config);
static void adjust(int *nvar, double *x, double *y, double *z,
int *locz, int *nx, int *ny, int *nz, int *dim,
int *config, double *d);
static int *lvector(int n);
/* Table of constant values */
static int c__1 = 1;
void loglin(int *nvar, int *dim, int *ncon, int *config, int *ntab,
double *table, double *fit, int *locmar, int *nmar, double *marg,
int *nu, double *u, double *maxdev, int *maxit,
double *dev, int *nlast, int *ifault)
{
int i, j, k, n, point, size, *icon, *check;
double x, y, xmax;
check = lvector(*nvar);
icon = lvector(*nvar);
/* Parameter adjustments */
--dim;
--locmar;
config -= *nvar + 1;
--fit;
--table;
--marg;
--u;
--dev;
/* Function body */
*ifault = 0;
*nlast = 0;
/* Check validity of NVAR, the number of variables, and of maxit,
the maximum number of iterations */
if (*nvar > 0 && *maxit > 0) {
goto L10;
}
L5:
*ifault = 4;
return;
/* Look at table and fit constants */
L10:
size = 1;
for (j = 1; j <= *nvar; ++j) {
if (dim[j] <= 0) {
goto L5;
}
size *= dim[j];
}
if (size <= *ntab) {
goto L40;
}
L35:
*ifault = 2;
return;
L40:
x = 0.;
y = 0.;
for (i = 1; i <= size; ++i) {
if (table[i] < 0. || fit[i] < 0.) {
goto L5;
}
x += table[i];
y += fit[i];
}
/* Make a preliminary adjustment to obtain the fit to an empty
configuration list */
if (y == 0.) {
goto L5;
}
x /= y;
for (i = 1; i <= size; ++i) {
fit[i] = x * fit[i];
}
if (*ncon <= 0 || config[*nvar + 1] == 0) {
return;
}
/* Allocate marginal tables */
point = 1;
for (i = 1; i <= *ncon; ++i) {
/* A zero beginning a configuration indicates that the list is
completed */
if (config[i * *nvar + 1] == 0) {
goto L160;
}
/* Get marginal table size. While doing this task, see if the
configuration list contains duplications or elements out of
range. */
size = 1;
for (j = 0; j < *nvar; ++j) {
check[j] = 0;
}
for (j = 1; j <= *nvar; ++j) {
k = config[j + i * *nvar];
/* A zero indicates the end of the string. */
if (k == 0) {
goto L130;
}
/* See if element is valid. */
if (k >= 0 && k <= *nvar) {
goto L100;
}
L95:
*ifault = 1;
return;
/* Check for duplication */
L100:
if (check[k - 1]) {
goto L95;
}
check[k - 1] = (1);
/* Get size */
size *= dim[k];
}
/* Since U is used to store fitted marginals, size must not
exceed NU */
L130:
if (size > *nu) {
goto L35;
}
/* LOCMAR points to marginal tables to be placed in MARG */
locmar[i] = point;
point += size;
}
/* Get N, number of valid configurations */
i = *ncon + 1;
L160:
n = i - 1;
/* See if MARG can hold all marginal tables */
if (point > *nmar + 1) {
goto L35;
}
/* Obtain marginal tables */
for (i = 1; i <= n; ++i) {
for (j = 1; j <= *nvar; ++j) {
icon[j - 1] = config[j + i * *nvar];
}
collap(nvar, &table[1], &marg[1], &locmar[i], ntab, nmar,
&dim[1], icon);
}
/* Perform iterations */
for (k = 1; k <= *maxit; ++k) {
/* XMAX is maximum deviation observed between fitted and true
marginal during a cycle */
xmax = 0.;
for (i = 1; i <= n; ++i) {
for (j = 1; j <= *nvar; ++j) {
icon[j - 1] = config[j + i * *nvar];
}
collap(nvar, &fit[1], &u[1], &c__1, ntab, nu, &dim[1],
icon);
adjust(nvar, &fit[1], &u[1], &marg[1], &locmar[i], ntab, nu,
nmar, &dim[1], icon, &xmax);
}
/* Test convergence */
dev[k] = xmax;
if (xmax < *maxdev) {
goto L240;
}
}
if (*maxit > 1) {
goto L230;
}
*nlast = 1;
return;
/* No convergence */
L230:
*ifault = 3;
*nlast = *maxit;
return;
/* Normal termination */
L240:
*nlast = k;
return;
}
/* Algorithm AS 51.1 Appl. Statist. (1972), vol. 21, p. 218
Computes a marginal table from a complete table.
All parameters are assumed valid without test.
The larger table is X and the smaller one is Y.
*/
void collap(int *nvar, double *x, double *y, int *locy, int *nx, int
*ny, int *dim, int *config)
{
int i, j, k, l, n, locu, *coord, *size;
size = lvector(*nvar + 1);
coord = lvector(*nvar);
/* Parameter adjustments */
--config;
--dim;
--x;
--y;
/* Initialize arrays */
size[0] = 1;
for (k = 1; k <= *nvar; ++k) {
l = config[k];
if (l == 0) {
goto L20;
}
size[k] = size[k - 1] * dim[l];
}
/* Find number of variables in configuration */
k = *nvar + 1;
L20:
n = k - 1;
/* Initialize Y. First cell of marginal table is at Y(LOCY) and
table has SIZE(K) elements */
locu = *locy + size[k - 1] - 1;
for (j = *locy; j <= locu; ++j) {
y[j] = 0.;
}
/* Initialize coordinates */
for (k = 0; k < *nvar; ++k) {
coord[k] = 0;
}
/* Find locations in tables */
i = 1;
L60:
j = *locy;
for (k = 1; k <= n; ++k) {
l = config[k];
j += coord[l - 1] * size[k - 1];
}
y[j] += x[i];
/* Update coordinates */
++i;
for (k = 1; k <= *nvar; ++k) {
++coord[k - 1];
if (coord[k - 1] < dim[k]) {
goto L60;
}
coord[k - 1] = 0;
}
return;
}
/* Algorithm AS 51.2 Appl. Statist. (1972), vol. 21, p. 218
Makes proportional adjustment corresponding to CONFIG.
All parameters are assumed valid without test.
*/
void adjust(int *nvar, double *x, double *y, double *z, int *locz, int
*nx, int *ny, int *nz, int *dim, int *config, double *d)
{
int i, j, k, l, n, *coord, *size;
double e;
size = lvector(*nvar + 1);
coord = lvector(*nvar);
/* Parameter adjustments */
--config;
--dim;
--x;
--y;
--z;
/* Set size array */
size[0] = 1;
for (k = 1; k <= *nvar; ++k) {
l = config[k];
if (l == 0) {
goto L20;
}
size[k] = size[k - 1] * dim[l];
}
/* Find number of variables in configuration */
k = *nvar + 1;
L20:
n = k - 1;
/* Test size of deviation */
l = size[k - 1];
j = 1;
k = *locz;
for (i = 1; i <= l; ++i) {
e = abs(z[k] - y[j]);
if (e > *d) {
*d = e;
}
++j;
++k;
}
/* Initialize coordinates */
for (k = 0; k < *nvar; ++k) {
coord[k] = 0;
}
i = 1;
/* Perform adjustment */
L50:
j = 0;
for (k = 1; k <= n; ++k) {
l = config[k];
j += coord[l - 1] * size[k - 1];
}
k = j + *locz;
++j;
/* Note that Y(J) should be non-negative */
if (y[j] <= 0.) {
x[i] = 0.;
}
if (y[j] > 0.) {
x[i] = x[i] * z[k] / y[j];
}
/* Update coordinates */
++i;
for (k = 1; k <= *nvar; ++k) {
++coord[k - 1];
if (coord[k - 1] < dim[k]) {
goto L50;
}
coord[k - 1] = 0;
}
return;
}
/* Auxiliary routine to get rid of limitations on the number of factors
in the model.
Changed to use R_alloc to avoid memory leak if routine was
interrupted.
*/
static int *lvector(int n) {
return (int *) R_alloc(n, sizeof(int));
}