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
|
<html lang="en">
<head>
<title>One dimensional Root-Finding - 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="prev" href="Discrete-Hankel-Transforms.html" title="Discrete Hankel Transforms">
<link rel="next" href="One-dimensional-Minimization.html" title="One dimensional Minimization">
<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="One-dimensional-Root-Finding"></a>
<a name="One-dimensional-Root_002dFinding"></a>
Next: <a rel="next" accesskey="n" href="One-dimensional-Minimization.html">One dimensional Minimization</a>,
Previous: <a rel="previous" accesskey="p" href="Discrete-Hankel-Transforms.html">Discrete Hankel Transforms</a>,
Up: <a rel="up" accesskey="u" href="index.html#Top">Top</a>
<hr>
</div>
<h2 class="chapter">32 One dimensional Root-Finding</h2>
<p><a name="index-root-finding-2199"></a><a name="index-zero-finding-2200"></a><a name="index-finding-roots-2201"></a><a name="index-finding-zeros-2202"></a><a name="index-roots-2203"></a><a name="index-solving-a-nonlinear-equation-2204"></a><a name="index-nonlinear-equation_002c-solutions-of-2205"></a>
This chapter describes routines for finding roots of arbitrary
one-dimensional functions. The library provides low level components
for a variety of iterative solvers and convergence tests. These can be
combined by the user to achieve the desired solution, with full access
to the intermediate steps of the iteration. Each class of methods uses
the same framework, so that you can switch between solvers at runtime
without needing to recompile your program. Each instance of a solver
keeps track of its own state, allowing the solvers to be used in
multi-threaded programs.
<p>The header file <samp><span class="file">gsl_roots.h</span></samp> contains prototypes for the root
finding functions and related declarations.
<ul class="menu">
<li><a accesskey="1" href="Root-Finding-Overview.html">Root Finding Overview</a>
<li><a accesskey="2" href="Root-Finding-Caveats.html">Root Finding Caveats</a>
<li><a accesskey="3" href="Initializing-the-Solver.html">Initializing the Solver</a>
<li><a accesskey="4" href="Providing-the-function-to-solve.html">Providing the function to solve</a>
<li><a accesskey="5" href="Search-Bounds-and-Guesses.html">Search Bounds and Guesses</a>
<li><a accesskey="6" href="Root-Finding-Iteration.html">Root Finding Iteration</a>
<li><a accesskey="7" href="Search-Stopping-Parameters.html">Search Stopping Parameters</a>
<li><a accesskey="8" href="Root-Bracketing-Algorithms.html">Root Bracketing Algorithms</a>
<li><a accesskey="9" href="Root-Finding-Algorithms-using-Derivatives.html">Root Finding Algorithms using Derivatives</a>
<li><a href="Root-Finding-Examples.html">Root Finding Examples</a>
<li><a href="Root-Finding-References-and-Further-Reading.html">Root Finding References and Further Reading</a>
</ul>
<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>
|
