-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathdf2lambda.m
More file actions
299 lines (287 loc) · 9.35 KB
/
df2lambda.m
File metadata and controls
299 lines (287 loc) · 9.35 KB
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
function lambda = df2lambda(argvals, basisobj, wtvec, Lfdobj, df, lambda0)
% DF2LAMBDA converts a degrees of freedom value to the equivalent
% smoothing parameter value.
% Arguments:
% ARGVALS ... Vector of argument values for smoothing
% BASISOBJ ... Basis object used for smoothing
% WTVEC ... Vector of weight values for smoothing
% LFDOBJ ... Linear differential operator object
% (may be an integer)
% DF ... Degrees of freedom value to be converted.
% Last modified 23 January 2013
% check wtvec
if isempty(wtvec)
wtvec = ones(length(argvals),1);
end
% check LFDOBJ
Lfdobj = int2Lfd(Lfdobj);
nderiv = getnderiv(Lfdobj);
nbasis = getnbasis(basisobj);
% check DF
if df <= 0
error('DF is not positive.');
end
if df >= nbasis
lambda = 0;
return;
end
if df <= nderiv
lambda = inf;
return;
end
TOL = 1e-3;
GOLD = 1.0;
GLIMIT = 2.0;
TINY = 1.0E-20;
% find machine precision
eps = 1;
tol1 = 1 + eps;
while tol1 > 1
eps = eps/2;
tol1 = 1 + eps;
end
eps = sqrt(eps);
% ------ initialization of lambda by finding bracketing values ------------
% a < b < c such that fb < fa and fb < fc
% first use input value for lambda unless it is zero, in which case -1
if nargin < 6
bx = -4.0;
else
bx = log10(lambda0);
end
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
lambda = 10^bx;
dfb = lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda);
fb = (dfb - df)^2;
dfb_old = dfb;
% disp([dfb,fb])
if dfb < nderiv
% disp('dfb < nderiv')
end
while dfb < nderiv
bx = bx - 2;
lambda = 10^bx;
dfb = lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda);
fb = (dfb - df)^2;
if dfb == dfb_old
error('dfb failed to change.');
end
dfb_old = dfb;
% disp([dfb,fb])
end
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
% now try bracketing the minimum by using a large value and a small
% value. If this doesn't work, revert to the iterative method
% at statement 5
if bx >= -10 && bx <= 5
% disp('bx >= -10 && bx <= 5')
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
cx = bx+2; % the upper limit
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
lambda = 10^cx;
dfc = lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda);
fc = (dfc - df)^2;
dfc_old = dfc;
% disp([dfc,fc])
if fb >= fc
% disp('fb >= fc')
end
while fb >= fc
cx = cx + 1;
lambda = 10^cx;
dfc = lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda);
if dfc == dfc_old
warning('dfc failed to change.');
break;
end
dfc_old = dfc;
fc = (dfc - df)^2;
% disp([dfc,fc])
end
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
ax = bx-2; % the lower limit
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
lambda = 10^ax;
dfa = lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda);
fa = (dfa - df)^2;
dfa_old = dfa;
% disp([dfa,fa])
if fb >= fa
% disp('fb >= fa')
end
while fb >= fa
ax = ax - 1;
lambda = 10^ax;
dfa = lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda);
if dfa == dfa_old
warning('dfa failed to change.');
break;
end
dfa_old = dfa;
fa = (dfa - df)^2;
% disp([dfa,fa])
end
else
error('bx outside of allowable range');
end
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
% check to see if minimum bracketed
% disp([ax,bx,cx,fa,fb,fc, lambda])
if fb >= fa || fb >= fc
% disp('fb >= fa || fb >= fc')
end
if fb >= fa || fb >= fc
% Failure to bracket minimum, proceed with iterative search for
% bracketing values.
% First, as an alternative value for ax, use the input value plus 0.1
ax = bx + 1;
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
lambda = 10^ax;
fa = (lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda) - df)^2;
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
% now the bracketing process begins
if fb > fa
% exchange ax and bx
dum = ax; ax = bx; bx = dum;
dum = fb; fb = fa; fa = dum;
end
% first guess at cx
cx = bx + GOLD*(bx - ax);
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
lambda = 10^(cx);
fc = (lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda) - df)^2;
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
% check if three values bracket minimum
% disp([ax,bx,cx,fa,fb,fc, lambda])
while fb >= fc
r = (bx - ax)*(fb - fc);
q = (bx - cx)*(fb - fa);
u = bx - ...
((bx - cx)*q - (bx - ax)*r)/(2.0*sign(max([abs(q-r),TINY]))*(q-r));
ulim = bx + GLIMIT*(cx - bx);
if (bx-u)*(u-cx) > 0.0
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
lambda = 10^(u);
fu = (lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda) - df)^2;
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
if fu < fc
% success
ax = bx; bx = u;
break;
elseif fu > fb
% also success
cx = u;
break;
end
% failure: fu >= fb;
u = cx + GOLD*(cx - bx);
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
lambda = 10^(u);
fu = (lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda) - df)^2;
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
elseif (cx - u)*(u - ulim) > 0.0
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
lambda = 10^(u);
fu = (lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda) - df)^2;
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
if fu < fc
bx = cx; cx = u; u = cx + GOLD*(cx - bx);
fb = fc; fc = fu;
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
lambda = 10^(u);
fu = (lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda) - df)^2;
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
end
elseif (u-ulim)*(ulim-cx) >= 0.0
u = ulim;
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
lambda = 10^(u);
fu = (lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda) - df)^2;
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
else
u = cx + GOLD*(cx - bx);
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
lambda = 10^(u);
fu = (lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda) - df)^2;
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
end
ax = bx; bx = cx; cx = u;
fa = fb; fb = fc; fc = fu;
% disp([ax,bx,cx,fa,fb,fc, lambda])
end % end of while loop
end
% ---------------------------------------------------------------------
% -------------------- bracketing successful ------------------------
% ---------------------------------------------------------------------
a = min([ax,cx]); b = max([ax,cx]);
v = bx; w = v; x = v; e = 0.0;
fx = fb; fv = fx; fw = fx;
% ---------------------------------------------------------------------
% -------------------- main loop starts here -------------------------
% ---------------------------------------------------------------------
xm = 0.5*(a + b);
tol1 = eps*abs(x) + TOL/3;
tol2 = 2*tol1;
crit = abs(x - xm) - (tol2 - 0.5*(b - a));
% disp('fitting loop')
% disp([crit, lambda])
while crit > 0
% is golden-section necessary?
if abs(e) > tol1
% fit parabola
r = (x - w)*(fx - fv);
q = (x - v)*(fx - fw);
p = (x - v)*q - (x - w)*r;
q = 2.0*(q - r);
if q > 0.0, p = -p; end
q = abs(q); s = e; e = d;
% is parabola acceptable?
if abs(p) < abs(0.5*q*s) && p > q*(a - x) && p < q*(b - x)
% a parabolic interpolation step
d = p/q;
u = x + d;
% f must not be evaluated too close to a or b
if (u - a) < tol2 || b - u < tol2
if xm - x >= 0.0, d = tol1; else d = -tol1; end
end
else
% a golden-section step
if x >= xm, e = a - x; else e = b - x; end
d = 0.382*e;
end
else
% a golden-section step
if x >= xm, e = a - x; else e = b - x; end
d = 0.382*e;
end
% f must not be evaluated too close to x
if abs(d) >= tol1
u = x + d;
else
if d >= 0.0, u = x + tol1; else u = x - tol1; end
end
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
lambda = 10^(u);
fu = (lambda2df(argvals, basisobj, wtvec, Lfdobj, lambda) - df)^2;
% +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
% update a, b, v, w, and x
if fu <= fx
if u >= x, a = x; else b = x; end
v = w; w = x; x = u;
fv = fw; fw = fx; fx = fu;
else
if u < x, a = u; else b = u; end
if fu <= fw || w == x
v = w; w = u;
fv = fw; fw = fu;
elseif fu <= fv || v == x || v == w
v = u; fv = fu;
end
end
xm = 0.5*(a + b);
tol1 = eps*abs(x) + TOL/3;
tol2 = 2*tol1;
crit = abs(x - xm) - (tol2 - 0.5*(b - a));
% disp([crit, lambda])
% ------------------- end of main loop ------------------------------
end