roots-multi.lisp 18.5 KB
Newer Older
1 2
;;; Multivariate roots.                
;;; Liam Healy 2008-01-12 12:49:08
3
;;; Time-stamp: <2009-03-21 17:42:43EDT roots-multi.lisp>
lhealy's avatar
lhealy committed
4
;;; $Id$
5 6 7

(in-package :gsl)

8 9
;;; /usr/include/gsl/gsl_multiroots.h

10 11 12 13 14 15
;;; Currently, functions defined for root solving will be passed
;;; scalars and should return scalars as multiple values.  A possible
;;; future enhancement is to optionally pass marrays and return
;;; marrays instead.  This would allow directly manipulation of
;;; marrays by the user function.  Notes Mon Jan 19 2009.

16 17 18 19
;;;;****************************************************************************
;;;; Initialization
;;;;****************************************************************************

20
(defmobject multi-dimensional-root-solver-f "gsl_multiroot_fsolver"
21
  ((type :pointer) ((first dimensions) sizet))
22 23
  "multi-dimensional root solver with function only"
  :documentation			; FDL
24 25 26
  "Make an instance of a solver of the type specified for a system of
   the specified number of dimensions.  Optionally
   set or reset an existing solver to use the function and the
27 28
   initial guess gsl-vector.  If scalarsp is T, the functions will
   be supplied, and should return scalars."
29
  :initialize-suffix "set"
30
  :initialize-args ((callback :pointer) ((mpointer initial) :pointer))
31 32
  :callbacks
  (callback gsl-mfunction
33 34
	    (function :success-failure
		      (:double :marray dim0) (:double :marray dim0)))
35
  :arglists-function
36
  (lambda (set)
37
    `((type &optional function-or-dimension (initial nil ,set) (scalarsp t))
38
      (:type type
39 40
       :dimensions
       (if ,set (dimensions initial) function-or-dimension))
41 42
      (:functions
       (list function-or-dimension) :initial initial :scalarsp scalarsp)))
43
  :inputs (initial))
44 45

(defmobject multi-dimensional-root-solver-fdf "gsl_multiroot_fdfsolver"
46
  ((type :pointer) ((first dimensions) sizet))
47 48
  "multi-dimensional root solver with function and derivative"
  :documentation			; FDL
49 50 51
  "Make an instance of a derivative solver of the type specified for
   a system of the specified number of dimensions.  Optionally
   set or reset an existing solver to use the function and derivative
52 53
   (fdf) and the initial guess.  If scalarsp is T, the functions will
   be supplied, and should return scalars."
54
  :initialize-suffix "set"
55
  :initialize-args ((callback :pointer) ((mpointer initial) :pointer))
56 57 58 59 60 61
  :callbacks
  (callback gsl-mfunction-fdf
	    (function :success-failure
		      (:double :marray dim0)
		      (:double :marray dim0))
	    (df :success-failure
62 63 64 65 66 67
		(:double :marray dim0)
		(:double :marray dim0 dim0))
	    (fdf :success-failure
		 (:double :marray dim0)
		 (:double :marray dim0)
		 (:double :marray dim0 dim0)))
68
  :arglists-function
69
  (lambda (set)
70 71
    `((type &optional function-or-dimension (initial nil ,set) 
	    (scalarsp t))
72 73 74
      (:type type
	     :dimensions
	     (if ,set (dimensions initial) function-or-dimension))
75
      (:functions function-or-dimension :initial initial :scalarsp scalarsp)))
76
  :inputs (initial))
77

78
(defmfun name ((solver multi-dimensional-root-solver-f))
79
  "gsl_multiroot_fsolver_name"
80 81
  (((mpointer solver) :pointer))
  :definition :method
82
  :c-return :string
83
  :documentation			; FDL
84 85
  "The name of the solver.")

86
(defmfun name ((solver multi-dimensional-root-solver-fdf))
87
  "gsl_multiroot_fdfsolver_name"
88 89
  (((mpointer solver) :pointer))
  :definition :method
90
  :c-return :string
91
  :documentation			; FDL
92 93 94 95 96 97
  "The name of the solver.")

;;;;****************************************************************************
;;;; Iteration
;;;;****************************************************************************

98
(defmfun iterate ((solver multi-dimensional-root-solver-f))
99
  "gsl_multiroot_fsolver_iterate"
100
  (((mpointer solver) :pointer))
101
  :definition :method
102
  :callback-object solver
103
  :documentation			; FDL
104 105 106 107 108 109
  "Perform a single iteration of the solver.  The following errors may
   be signalled: 'bad-function-supplied, the iteration encountered a
   singular point where the function or its derivative evaluated to
   infinity or NaN, or 'gsl-division-by-zero, the derivative of the
   function vanished at the iteration point, preventing the algorithm
   from continuing without a division by zero.")
110

111
(defmfun iterate ((solver multi-dimensional-root-solver-fdf))
112
  "gsl_multiroot_fdfsolver_iterate"
113
  (((mpointer solver) :pointer))
114
  :definition :method
115
  :callback-object solver
116
  :documentation			; FDL
117 118 119 120 121 122
  "Perform a single iteration of the solver.  The following errors may
   be signalled: 'bad-function-supplied, the iteration encountered a
   singular point where the function or its derivative evaluated to
   infinity or NaN, or 'gsl-division-by-zero, the derivative of the
   function vanished at the iteration point, preventing the algorithm
   from continuing without a division by zero.")
123

124
(defmfun solution ((solver multi-dimensional-root-solver-f))
125
  "gsl_multiroot_fsolver_root"
126
  (((mpointer solver) :pointer))
127
  :definition :method
128
  :callback-object solver
129
  :c-return (crtn :pointer)
130
  :return ((copy crtn))
131
  :documentation			; FDL
132 133
  "The current estimate of the root for the solver.")

134
(defmfun solution ((solver multi-dimensional-root-solver-fdf))
135
  "gsl_multiroot_fdfsolver_root"
136
  (((mpointer solver) :pointer))
137
  :definition :method
138
  :callback-object solver
139
  :c-return (crtn :pointer)
140
  :return ((copy crtn))
141 142 143
  :documentation
  "The current estimate of the root for the solver.")

144
(defmfun function-value ((solver multi-dimensional-root-solver-f))
145
  "gsl_multiroot_fsolver_f"
146
  (((mpointer solver) :pointer))
147
  :definition :method
148
  :c-return (crtn :pointer)
149
  :return ((copy crtn))
150
  :documentation			; FDL
151 152
  "The function value f(x) at the current estimate x of the root for the solver.")

153
(defmfun function-value ((solver multi-dimensional-root-solver-fdf))
154
  "gsl_multiroot_fdfsolver_f"
155
  (((mpointer solver) :pointer))
156
  :definition :method
157
  :c-return (crtn :pointer)
158
  :return ((copy crtn))
159
  :documentation			; FDL
160 161
  "The function value f(x) at the current estimate x of the root for the solver.")

162
(defmfun last-step ((solver multi-dimensional-root-solver-f))
163
  "gsl_multiroot_fsolver_dx"
164
  (((mpointer solver) :pointer))
165
  :definition :method
166
  :c-return (crtn :pointer)
167
  :return ((copy crtn))
168
  :documentation			; FDL
169 170
  "The last step dx taken by the solver.")

171
(defmfun last-step ((solver multi-dimensional-root-solver-fdf))
172
  "gsl_multiroot_fsolver_dx"
173
  (((mpointer solver) :pointer))
174
  :definition :method
175
  :c-return (crtn :pointer)
176
  :return ((copy crtn))
177
  :documentation			; FDL
178 179 180 181 182 183 184
  "The last step dx taken by the solver.")

;;;;****************************************************************************
;;;; Search stopping conditions
;;;;****************************************************************************

;;; The only place we need to pick apart the gsl_multiroot_fsolver
185
;;; struct is here.  We could use last-step etc., but then we'd have
186 187 188 189 190 191 192 193 194 195 196
;;; to discriminate on mfsolver vs. mfdfsolver.
(cffi:defcstruct gsl-multiroot-fsolver
  ;; See /usr/include/gsl/gsl_multiroots.h
  (type :pointer)
  (function :pointer)
  (x :pointer)
  (f :pointer)
  (dx :pointer)
  (state :pointer))

(defun multiroot-slot (solver slot)
197
  (cffi:foreign-slot-value (mpointer solver) 'gsl-multiroot-fsolver slot))
198

liam's avatar
liam committed
199
(defmfun multiroot-test-delta (solver absolute-error relative-error)
200 201 202 203 204
  "gsl_multiroot_test_delta"
  (((multiroot-slot solver 'dx) :pointer)
   ((multiroot-slot solver 'x) :pointer)
   (absolute-error :double) (relative-error :double))
  :c-return :success-continue
205
  :documentation			; FDL
206 207 208 209 210 211 212
  "Test for the convergence of the sequence by comparing the
   last step dx with the absolute error and relative
   errors given to the current position x.  The test returns
   T if the following condition is achieved:
   |dx_i| < epsabs + epsrel |x_i|
   for each component of x and returns NIL otherwise.")

liam's avatar
liam committed
213
(defmfun multiroot-test-residual (solver absolute-error)
214 215 216
  "gsl_multiroot_test_residual"
  (((multiroot-slot solver 'f) :pointer) (absolute-error :double))
  :c-return :success-failure
217
  :documentation			; FDL
218 219 220 221 222 223 224 225 226 227 228 229
  "Test the residual value f against the absolute error,
   returning T if the following condition is achieved:
   \sum_i |f_i| < absolute_error
   and returns NIL otherwise.  This criterion is suitable
   for situations where the precise location of the root x is
   unimportant provided a value can be found where the
   residual is small enough.")

;;;;****************************************************************************
;;;; Algorithms using derivatives
;;;;****************************************************************************

Liam Healy's avatar
Liam Healy committed
230
(defmpar +powells-hybrid+ "gsl_multiroot_fdfsolver_hybridsj"
231
  ;; FDL
232
  "This is a modified version of Powell's Hybrid method as implemented in
liam's avatar
liam committed
233
   the hybrj algorithm in minpack.  Minpack was written by Jorge
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
   J. More, Burton S. Garbow and Kenneth E. Hillstrom.  The Hybrid
   algorithm retains the fast convergence of Newton's method but will also
   reduce the residual when Newton's method is unreliable. 

   The algorithm uses a generalized trust region to keep each step under
   control.  In order to be accepted a proposed new position x' must
   satisfy the condition |D (x' - x)| < \delta, where D is a
   diagonal scaling matrix and \delta is the size of the trust
   region.  The components of D are computed internally, using the
   column norms of the Jacobian to estimate the sensitivity of the residual
   to each component of x.  This improves the behavior of the
   algorithm for badly scaled functions.

   On each iteration the algorithm first determines the standard Newton
   step by solving the system J dx = - f.  If this step falls inside
   the trust region it is used as a trial step in the next stage.  If not,
   the algorithm uses the linear combination of the Newton and gradient
   directions which is predicted to minimize the norm of the function while
   staying inside the trust region,
   dx = - \alpha J^{-1} f(x) - \beta \nabla |f(x)|^2.
   This combination of Newton and gradient directions is referred to as a
   dogleg step.

   The proposed step is now tested by evaluating the function at the
   resulting point, x'.  If the step reduces the norm of the function
   sufficiently then it is accepted and size of the trust region is
   increased.  If the proposed step fails to improve the solution then the
   size of the trust region is decreased and another trial step is
   computed.

   The speed of the algorithm is increased by computing the changes to the
   Jacobian approximately, using a rank-1 update.  If two successive
   attempts fail to reduce the residual then the full Jacobian is
   recomputed.  The algorithm also monitors the progress of the solution
   and returns an error if several steps fail to make any improvement,
269
   'no-progress
270 271
   the iteration is not making any progress, preventing the algorithm from
   continuing.
272
   'jacobian-not-improving
273 274 275
   re-evaluations of the Jacobian indicate that the iteration is not
   making any progress, preventing the algorithm from continuing.")

Liam Healy's avatar
Liam Healy committed
276
(defmpar +powells-hybrid-unscaled+ "gsl_multiroot_fdfsolver_hybridj"
277
  ;; FDL
278 279 280 281 282
  "This algorithm is an unscaled version of *powells-hybrid*.  The steps are
   controlled by a spherical trust region |x' - x| < \delta, instead
   of a generalized region.  This can be useful if the generalized region
   estimated by *powells-hybrid* is inappropriate.")

Liam Healy's avatar
Liam Healy committed
283
(defmpar +newton-mfdfsolver+ "gsl_multiroot_fdfsolver_newton"
284
  ;; FDL
285 286 287 288 289 290 291 292 293 294 295 296
  "Newton's Method is the standard root-polishing algorithm.  The algorithm
   begins with an initial guess for the location of the solution.  On each
   iteration a linear approximation to the function F is used to
   estimate the step which will zero all the components of the residual.
   The iteration is defined by the following sequence,
   x -> x' = x - J{-1} f(x)
   where the Jacobian matrix J is computed from the derivative
   functions provided by f.  The step dx is obtained by solving
   the linear system,
   J dx = - f(x)
   using LU decomposition.")

Liam Healy's avatar
Liam Healy committed
297
(defmpar +gnewton-mfdfsolver+ "gsl_multiroot_fdfsolver_gnewton"
298
  ;; FDL
299 300 301 302 303 304 305 306 307 308 309 310 311
  "A modified version of Newton's method which attempts to improve
   global convergence by requiring every step to reduce the Euclidean norm
   of the residual, |f(x)|.  If the Newton step leads to an increase
   in the norm then a reduced step of relative size,
   t = (\sqrt(1 + 6 r) - 1) / (3 r)
   is proposed, with r being the ratio of norms
   |f(x')|^2/|f(x)|^2.  This procedure is repeated until a suitable step
   size is found.")

;;;;****************************************************************************
;;;; Algorithms without derivatives
;;;;****************************************************************************

Liam Healy's avatar
Liam Healy committed
312
(defmpar +hybrid-scaled+ "gsl_multiroot_fsolver_hybrids"
313 314
  ;; FDL
  "This is a version of the Hybrid algorithm which replaces calls to the
315 316 317 318 319 320
     Jacobian function by its finite difference approximation.  The finite
     difference approximation is computed using gsl_multiroots_fdjac
     with a relative step size of GSL_SQRT_DBL_EPSILON.")
;; Where is this function and parameter?  Only thing that shows in the
;; library is gsl_multiroot_fdjacobian.
 
Liam Healy's avatar
Liam Healy committed
321
(defmpar +hybrid-unscaled+ "gsl_multiroot_fsolver_hybrid"
322
  ;; FDL
323 324 325
  "A finite difference version of the Hybrid algorithm without
   internal scaling.")

Liam Healy's avatar
Liam Healy committed
326
(defmpar +discrete-newton+ "gsl_multiroot_fsolver_dnewton"
327
  ;; FDL
328 329 330 331 332 333 334 335 336 337 338 339 340 341 342
  "The discrete Newton algorithm is the simplest method of solving a
   multidimensional system.  It uses the Newton iteration
   x -> x - J^{-1} f(x)
   where the Jacobian matrix J is approximated by taking finite
   differences of the function f.  The approximation scheme used by
   this implementation is
   J_{ij} = (f_i(x + \delta_j) - f_i(x)) /  \delta_j
   where \delta_j is a step of size \sqrt\epsilon |x_j| with
   \epsilon being the machine precision 
   (\epsilon \approx 2.22 \times 10^-16}).
   The order of convergence of Newton's algorithm is quadratic, but the
   finite differences require n^2 function evaluations on each
   iteration.  The algorithm may become unstable if the finite differences
   are not a good approximation to the true derivatives.")

Liam Healy's avatar
Liam Healy committed
343
(defmpar +broyden+ "gsl_multiroot_fsolver_broyden"
344
  ;; FDL
345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367
  "The Broyden algorithm is a version of the discrete Newton
   algorithm which attempts to avoids the expensive update of the Jacobian
   matrix on each iteration.  The changes to the Jacobian are also
   approximated, using a rank-1 update,
   J^{-1} \to J^{-1} - (J^{-1} df - dx) dx^T J^{-1} / dx^T J^{-1} df
   where the vectors dx and df are the changes in x
   and f.  On the first iteration the inverse Jacobian is estimated
   using finite differences, as in the discrete Newton algorithm.
    
   This approximation gives a fast update but is unreliable if the changes
   are not small, and the estimate of the inverse Jacobian becomes worse as
   time passes.  The algorithm has a tendency to become unstable unless it
   starts close to the root.  The Jacobian is refreshed if this instability
   is detected (consult the source for details).

   This algorithm is included only for demonstration purposes, and is not
   recommended for serious use.")

;;;;****************************************************************************
;;;; Examples
;;;;****************************************************************************

(defparameter *powell-A* 1.0d4)
368
(defun powell (arg0 arg1)
369
  "Powell's test function."
370 371 372
  (values
   (- (* *powell-A* arg0 arg1) 1)
   (+ (exp (- arg0)) (exp (- arg1)) (- (1+ (/ *powell-A*))))))
373
;; not used?
374 375 376 377 378 379

;;; This is the example given in Sec. 34.8.

(defparameter *rosenbrock-a* 1.0d0)
(defparameter *rosenbrock-b* 10.0d0)

380
(defun rosenbrock (arg0 arg1)
381
  "Rosenbrock test function."
382 383 384
  (values
   (* *rosenbrock-a* (- 1 arg0))
   (* *rosenbrock-b* (- arg1 (expt arg0 2)))))
385

386
(defun roots-multi-example-no-derivative
Liam Healy's avatar
Liam Healy committed
387
    (&optional (method +hybrid-scaled+) (print-steps t))
388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412
  "Solving Rosenbrock, the example given in Sec. 34.8 of the GSL manual."
  (let ((max-iter 1000)
	(solver (make-multi-dimensional-root-solver-f 
		 method 'rosenbrock #m(-10.0d0 -5.0d0))))
    (loop for iter from 0
       with fnval and argval
       while (and (< iter max-iter)
		  (not (multiroot-test-residual solver 1.0d-7)))
       do
       (iterate solver)
       (setf fnval (function-value solver)
	     argval (solution solver))
       (when print-steps
	 (format t "iter=~d~8tx0=~12,8g~24tx1=~12,8g~38tf0=~12,8g~52tf1=~12,8g~&"
		 iter
		 (maref argval 0)
		 (maref argval 1)
		 (maref fnval 0)
		 (maref fnval 1)))
       finally (return
		 (values (maref argval 0)
			 (maref argval 1)
			 (maref fnval 0)
			 (maref fnval 1))))))

413
(defun rosenbrock-df (arg0 arg1)
414
  "The partial derivatives of the Rosenbrock functions."
415 416 417 418 419 420 421
  (declare (ignore arg1))
  (values (- *rosenbrock-a*)
	  0.0d0
	  (* -2 *rosenbrock-b* arg0)
	  *rosenbrock-b*))

;;; Why is it necessary to define a function that calls the two other functions?
422
(defun rosenbrock-fdf (arg0 arg1)
423 424 425 426 427
  (multiple-value-bind (v0 v1)
      (rosenbrock arg0 arg1)
    (multiple-value-bind (j0 j1 j2 j3)
	(rosenbrock-df arg0 arg1)
      (values v0 v1 j0 j1 j2 j3))))
428

429
(defun roots-multi-example-derivative
Liam Healy's avatar
Liam Healy committed
430
    (&optional (method +gnewton-mfdfsolver+) (print-steps t))
431 432 433
  "Solving Rosenbrock with derivatives, the example given in Sec. 34.8
   of the GSL manual."
  (flet ((print-state (iter argval fnval)
434 435 436 437 438 439 440
	   (when print-steps
	     (format t "iter=~d~8tx0=~12,8g~24tx1=~12,8g~38tf0=~12,8g~52tf1=~12,8g~&"
		     iter
		     (maref argval 0)
		     (maref argval 1)
		     (maref fnval 0)
		     (maref fnval 1)))))
441 442
    (let ((max-iter 1000)
	  (solver (make-multi-dimensional-root-solver-fdf
443
		   method
444
		   '(rosenbrock rosenbrock-df rosenbrock-fdf)
445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461
		   #m(-10.0d0 -5.0d0))))
      (loop for iter from 0
	 with fnval = (function-value solver)
	 and argval = (solution solver)
	 while (and (< iter max-iter)
		    (not (multiroot-test-residual solver 1.0d-7)))
	 initially (print-state iter argval fnval)
	 do
	 (iterate solver)
	 (setf fnval (function-value solver)
	       argval (solution solver))
	 (print-state iter argval fnval)
	 finally (return
		   (values (maref argval 0)
			   (maref argval 1)
			   (maref fnval 0)
			   (maref fnval 1)))))))
462

463 464
;; To see step-by-step information as the solution progresses, make
;; the last argument T.
465
(save-test roots-multi
Liam Healy's avatar
Liam Healy committed
466 467 468 469 470 471 472 473
 (roots-multi-example-no-derivative +hybrid-unscaled+ nil)
 (roots-multi-example-no-derivative +hybrid-scaled+ nil)
 (roots-multi-example-no-derivative +discrete-newton+ nil)
 (roots-multi-example-no-derivative +broyden+ nil)
 (roots-multi-example-derivative +newton-mfdfsolver+ nil)
 (roots-multi-example-derivative +gnewton-mfdfsolver+ nil)
 (roots-multi-example-derivative +powells-hybrid+ nil)
 (roots-multi-example-derivative +powells-hybrid-unscaled+ nil))