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
|
# Copyright(c) 1986 Association of Universities for Research in Astronomy Inc.
include <math/curfit.h>
$if (datatype == r)
include "curfitdef.h"
$else
include "dcurfitdef.h"
$endif
# CVREFIT -- Procedure to refit the data assuming that the x and w values have
# not changed. MATRIX and CHOFAC are assumed to remain unchanged from the
# previous fit. It is only necessary to accumulate a new VECTOR and
# calculate the coefficients COEFF by forward and back substitution. On
# the first call to cvrefit the basis functions for all data points are
# calculated and stored in BASIS. Subsequent calls to cvrefit reference these
# functions. Intervening calls to cvfit or cvzero zero the basis functions.
$if (datatype == r)
procedure cvrefit (cv, x, y, w, ier)
$else
procedure dcvrefit (cv, x, y, w, ier)
$endif
pointer cv # curve descriptor
PIXEL x[ARB] # x array
PIXEL y[ARB] # y array
PIXEL w[ARB] # weight array
int ier # error code
int i, k
pointer bzptr
pointer vzptr, vindex
begin
# zero the right side of the matrix equation
call aclr$t (VECTOR(CV_VECTOR(cv)), CV_NCOEFF(cv))
vzptr = CV_VECTOR(cv) - 1
# if first call to cvrefit then calculate and store the basis
# functions
if (CV_BASIS(cv) == NULL) {
# allocate space for the basis functions and array containing
# the index of the first non-zero basis function
call malloc (CV_BASIS(cv), CV_NPTS(cv)*CV_ORDER(cv), TY_PIXEL)
call malloc (CV_WY(cv), CV_NPTS(cv), TY_PIXEL)
# calculate the non-zero basis functions
switch (CV_TYPE(cv)) {
case LEGENDRE:
call $tcv_bleg (x, CV_NPTS(cv), CV_ORDER(cv), CV_MAXMIN(cv),
CV_RANGE(cv), BASIS(CV_BASIS(cv)))
case CHEBYSHEV:
call $tcv_bcheb (x, CV_NPTS(cv), CV_ORDER(cv), CV_MAXMIN(cv),
CV_RANGE(cv), BASIS(CV_BASIS(cv)))
case SPLINE3:
call malloc (CV_LEFT(cv), CV_NPTS(cv), TY_INT)
call $tcv_bspline3 (x, CV_NPTS(cv), CV_NPIECES(cv),
-CV_XMIN(cv), CV_SPACING(cv), BASIS(CV_BASIS(cv)),
LEFT(CV_LEFT(cv)))
call aaddki (LEFT(CV_LEFT(cv)), vzptr, LEFT(CV_LEFT(cv)),
CV_NPTS(cv))
case SPLINE1:
call malloc (CV_LEFT(cv), CV_NPTS(cv), TY_INT)
call $tcv_bspline1 (x, CV_NPTS(cv), CV_NPIECES(cv),
-CV_XMIN(cv), CV_SPACING(cv), BASIS(CV_BASIS(cv)),
LEFT(CV_LEFT(cv)))
call aaddki (LEFT(CV_LEFT(cv)), vzptr, LEFT(CV_LEFT(cv)),
CV_NPTS(cv))
case USERFNC:
call $tcv_buser (cv, x, CV_NPTS(cv))
}
}
# accumulate the new right side of the matrix equation
call amul$t (w, y, Mem$t[CV_WY(cv)], CV_NPTS(cv))
bzptr = CV_BASIS(cv)
switch (CV_TYPE(cv)) {
case SPLINE1, SPLINE3:
do k = 1, CV_ORDER(cv) {
do i = 1, CV_NPTS(cv) {
vindex = LEFT(CV_LEFT(cv)+i-1) + k
VECTOR(vindex) = VECTOR(vindex) + Mem$t[CV_WY(cv)+i-1] *
BASIS(bzptr+i-1)
}
bzptr = bzptr + CV_NPTS(cv)
}
case LEGENDRE, CHEBYSHEV, USERFNC:
do k = 1, CV_ORDER(cv) {
vindex = vzptr + k
do i = 1, CV_NPTS(cv)
VECTOR(vindex) = VECTOR(vindex) + Mem$t[CV_WY(cv)+i-1] *
BASIS(bzptr+i-1)
bzptr = bzptr + CV_NPTS(cv)
}
}
# solve for the new coefficients using forward and back
# substitution
call $tcvchoslv (CHOFAC(CV_CHOFAC(cv)), CV_ORDER(cv), CV_NCOEFF(cv),
VECTOR(CV_VECTOR(cv)), COEFF(CV_COEFF(cv)))
end
|
