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
|
<html lang="en">
<head>
<title>Iteration of the Minimization Algorithm - GNU Scientific Library -- Reference Manual</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="GNU Scientific Library -- Reference Manual">
<meta name="generator" content="makeinfo 4.8">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="Nonlinear-Least_002dSquares-Fitting.html" title="Nonlinear Least-Squares Fitting">
<link rel="prev" href="Providing-the-Function-to-be-Minimized.html" title="Providing the Function to be Minimized">
<link rel="next" href="Search-Stopping-Parameters-for-Minimization-Algorithms.html" title="Search Stopping Parameters for Minimization Algorithms">
<link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
<!--
Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 The GSL Team.
Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License, Version 1.2 or
any later version published by the Free Software Foundation; with the
Invariant Sections being ``GNU General Public License'' and ``Free Software
Needs Free Documentation'', the Front-Cover text being ``A GNU Manual'',
and with the Back-Cover Text being (a) (see below). A copy of the
license is included in the section entitled ``GNU Free Documentation
License''.
(a) The Back-Cover Text is: ``You have freedom to copy and modify this
GNU Manual, like GNU software.''-->
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<p>
<a name="Iteration-of-the-Minimization-Algorithm"></a>
Next: <a rel="next" accesskey="n" href="Search-Stopping-Parameters-for-Minimization-Algorithms.html">Search Stopping Parameters for Minimization Algorithms</a>,
Previous: <a rel="previous" accesskey="p" href="Providing-the-Function-to-be-Minimized.html">Providing the Function to be Minimized</a>,
Up: <a rel="up" accesskey="u" href="Nonlinear-Least_002dSquares-Fitting.html">Nonlinear Least-Squares Fitting</a>
<hr>
</div>
<h3 class="section">37.4 Iteration</h3>
<p>The following functions drive the iteration of each algorithm. Each
function performs one iteration to update the state of any solver of the
corresponding type. The same functions work for all solvers so that
different methods can be substituted at runtime without modifications to
the code.
<div class="defun">
— Function: int <b>gsl_multifit_fsolver_iterate</b> (<var>gsl_multifit_fsolver * s</var>)<var><a name="index-gsl_005fmultifit_005ffsolver_005fiterate-2405"></a></var><br>
— Function: int <b>gsl_multifit_fdfsolver_iterate</b> (<var>gsl_multifit_fdfsolver * s</var>)<var><a name="index-gsl_005fmultifit_005ffdfsolver_005fiterate-2406"></a></var><br>
<blockquote><p>These functions perform a single iteration of the solver <var>s</var>. If
the iteration encounters an unexpected problem then an error code will
be returned. The solver maintains a current estimate of the best-fit
parameters at all times.
</p></blockquote></div>
<p>The solver struct <var>s</var> contains the following entries, which can
be used to track the progress of the solution:
<dl>
<dt><code>gsl_vector * x</code><dd>The current position.
<br><dt><code>gsl_vector * f</code><dd>The function value at the current position.
<br><dt><code>gsl_vector * dx</code><dd>The difference between the current position and the previous position,
i.e. the last step, taken as a vector.
<br><dt><code>gsl_matrix * J</code><dd>The Jacobian matrix at the current position (for the
<code>gsl_multifit_fdfsolver</code> struct only)
</dl>
<p>The best-fit information also can be accessed with the following
auxiliary functions,
<div class="defun">
— Function: gsl_vector * <b>gsl_multifit_fsolver_position</b> (<var>const gsl_multifit_fsolver * s</var>)<var><a name="index-gsl_005fmultifit_005ffsolver_005fposition-2407"></a></var><br>
— Function: gsl_vector * <b>gsl_multifit_fdfsolver_position</b> (<var>const gsl_multifit_fdfsolver * s</var>)<var><a name="index-gsl_005fmultifit_005ffdfsolver_005fposition-2408"></a></var><br>
<blockquote><p>These functions return the current position (i.e. best-fit parameters)
<code>s->x</code> of the solver <var>s</var>.
</p></blockquote></div>
<hr>The GNU Scientific Library - a free numerical library licensed under the GNU GPL<br>Back to the <a href="/software/gsl/">GNU Scientific Library Homepage</a></body></html>
|
