File: Iterating-the-Sparse-Linear-System.html

package info (click to toggle)
gsl-ref-html 2.3-1
  • links: PTS
  • area: non-free
  • in suites: bullseye, buster, sid
  • size: 6,876 kB
  • ctags: 4,574
  • sloc: makefile: 35
file content (132 lines) | stat: -rw-r--r-- 7,231 bytes parent folder | download
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
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<!-- Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016 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.3 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 the freedom to copy and modify this
GNU Manual." -->
<!-- Created by GNU Texinfo 5.1, http://www.gnu.org/software/texinfo/ -->
<head>
<title>GNU Scientific Library &ndash; Reference Manual: Iterating the Sparse Linear System</title>

<meta name="description" content="GNU Scientific Library &ndash; Reference Manual: Iterating the Sparse Linear System">
<meta name="keywords" content="GNU Scientific Library &ndash; Reference Manual: Iterating the Sparse Linear System">
<meta name="resource-type" content="document">
<meta name="distribution" content="global">
<meta name="Generator" content="makeinfo">
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<link href="index.html#Top" rel="start" title="Top">
<link href="Function-Index.html#Function-Index" rel="index" title="Function Index">
<link href="Sparse-Iterative-Solvers.html#Sparse-Iterative-Solvers" rel="up" title="Sparse Iterative Solvers">
<link href="Sparse-Linear-Algebra-Examples.html#Sparse-Linear-Algebra-Examples" rel="next" title="Sparse Linear Algebra Examples">
<link href="Sparse-Iterative-Solvers-Types.html#Sparse-Iterative-Solvers-Types" rel="previous" title="Sparse Iterative Solvers Types">
<style type="text/css">
<!--
a.summary-letter {text-decoration: none}
blockquote.smallquotation {font-size: smaller}
div.display {margin-left: 3.2em}
div.example {margin-left: 3.2em}
div.indentedblock {margin-left: 3.2em}
div.lisp {margin-left: 3.2em}
div.smalldisplay {margin-left: 3.2em}
div.smallexample {margin-left: 3.2em}
div.smallindentedblock {margin-left: 3.2em; font-size: smaller}
div.smalllisp {margin-left: 3.2em}
kbd {font-style:oblique}
pre.display {font-family: inherit}
pre.format {font-family: inherit}
pre.menu-comment {font-family: serif}
pre.menu-preformatted {font-family: serif}
pre.smalldisplay {font-family: inherit; font-size: smaller}
pre.smallexample {font-size: smaller}
pre.smallformat {font-family: inherit; font-size: smaller}
pre.smalllisp {font-size: smaller}
span.nocodebreak {white-space:nowrap}
span.nolinebreak {white-space:nowrap}
span.roman {font-family:serif; font-weight:normal}
span.sansserif {font-family:sans-serif; font-weight:normal}
ul.no-bullet {list-style: none}
-->
</style>


</head>

<body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000">
<a name="Iterating-the-Sparse-Linear-System"></a>
<div class="header">
<p>
Previous: <a href="Sparse-Iterative-Solvers-Types.html#Sparse-Iterative-Solvers-Types" accesskey="p" rel="previous">Sparse Iterative Solvers Types</a>, Up: <a href="Sparse-Iterative-Solvers.html#Sparse-Iterative-Solvers" accesskey="u" rel="up">Sparse Iterative Solvers</a> &nbsp; [<a href="Function-Index.html#Function-Index" title="Index" rel="index">Index</a>]</p>
</div>
<hr>
<a name="Iterating-the-Sparse-Linear-System-1"></a>
<h4 class="subsection">43.2.3 Iterating the Sparse Linear System</h4>

<p>The following functions are provided to allocate storage for the
sparse linear solvers and iterate the system to a solution.
</p>
<dl>
<dt><a name="index-gsl_005fsplinalg_005fitersolve_005falloc"></a>Function: <em>gsl_splinalg_itersolve *</em> <strong>gsl_splinalg_itersolve_alloc</strong> <em>(const gsl_splinalg_itersolve_type * <var>T</var>, const size_t <var>n</var>, const size_t <var>m</var>)</em></dt>
<dd><p>This function allocates a workspace for the iterative solution of
<var>n</var>-by-<var>n</var> sparse matrix systems. The iterative solver type
is specified by <var>T</var>. The argument <var>m</var> specifies the size
of the solution candidate subspace <em>{\cal K}_m</em>. The dimension
<var>m</var> may be set to 0 in which case a reasonable default value is used.
</p></dd></dl>

<dl>
<dt><a name="index-gsl_005fsplinalg_005fitersolve_005ffree"></a>Function: <em>void</em> <strong>gsl_splinalg_itersolve_free</strong> <em>(gsl_splinalg_itersolve * <var>w</var>)</em></dt>
<dd><p>This function frees the memory associated with the workspace <var>w</var>.
</p></dd></dl>

<dl>
<dt><a name="index-gsl_005fsplinalg_005fitersolve_005fname"></a>Function: <em>const char *</em> <strong>gsl_splinalg_itersolve_name</strong> <em>(const gsl_splinalg_itersolve * <var>w</var>)</em></dt>
<dd><p>This function returns a string pointer to the name of the solver.
</p></dd></dl>

<dl>
<dt><a name="index-gsl_005fsplinalg_005fitersolve_005fiterate"></a>Function: <em>int</em> <strong>gsl_splinalg_itersolve_iterate</strong> <em>(const gsl_spmatrix *<var>A</var>, const gsl_vector *<var>b</var>, const double <var>tol</var>, gsl_vector *<var>x</var>, gsl_splinalg_itersolve *<var>w</var>)</em></dt>
<dd><p>This function performs one iteration of the iterative method for
the sparse linear system specfied by the matrix <var>A</var>, right hand
side vector <var>b</var> and solution vector <var>x</var>. On input, <var>x</var>
must be set to an initial guess for the solution. On output,
<var>x</var> is updated to give the current solution estimate. The
parameter <var>tol</var> specifies the relative tolerance between the residual
norm and norm of <var>b</var> in order to check for convergence.
When the following condition is satisfied:
</p><div class="example">
<pre class="example">|| A x - b || &lt;= tol * || b ||
</pre></div>
<p>the method has converged, the function returns <code>GSL_SUCCESS</code> and
the final solution is provided in <var>x</var>. Otherwise, the function
returns <code>GSL_CONTINUE</code> to signal that more iterations are
required. Here, <em>|| \cdot ||</em> represents the Euclidean norm.
The input matrix <var>A</var> may be in triplet or compressed column
format.
</p></dd></dl>

<dl>
<dt><a name="index-gsl_005fsplinalg_005fitersolve_005fnormr"></a>Function: <em>double</em> <strong>gsl_splinalg_itersolve_normr</strong> <em>(const gsl_splinalg_itersolve *<var>w</var>)</em></dt>
<dd><p>This function returns the current residual norm
<em>||r|| = ||A x - b||</em>, which is updated after each call to
<code>gsl_splinalg_itersolve_iterate</code>.
</p></dd></dl>

<hr>
<div class="header">
<p>
Previous: <a href="Sparse-Iterative-Solvers-Types.html#Sparse-Iterative-Solvers-Types" accesskey="p" rel="previous">Sparse Iterative Solvers Types</a>, Up: <a href="Sparse-Iterative-Solvers.html#Sparse-Iterative-Solvers" accesskey="u" rel="up">Sparse Iterative Solvers</a> &nbsp; [<a href="Function-Index.html#Function-Index" title="Index" rel="index">Index</a>]</p>
</div>



</body>
</html>