-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathannotated.html
224 lines (221 loc) · 24.3 KB
/
annotated.html
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
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<link rel="canonical" href="https://doc.cgal.org/latest/Solver_interface/annotated.html"/>
<link rel="icon" type="image/png" href="../Manual/g-196x196-doc.png">
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=11">
<meta name="generator" content="Doxygen 1.9.6">
<meta name="viewport" content="width=device-width, initial-scale=1">
<title>CGAL 6.1 - CGAL and Solvers: Class and Concept List</title>
<!-- <link href="../Manual/tabs.css" rel="stylesheet" type="text/css"/> -->
<script type="text/javascript" src="../Manual/jquery.js"></script>
<script type="text/javascript" src="../Manual/dynsections.js"></script>
<script src="../Manual/hacks.js" type="text/javascript"></script>
<!-- Manually include treeview and search to avoid bloat and to fix
paths to the directory Manual . -->
<!-- $.treeview -->
<!-- $.search -->
<link href="navtree.css" rel="stylesheet" type="text/css">
<script type="text/javascript" src="../Manual/resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="../Manual/search/search.css" rel="stylesheet" type="text/css">
<script type="text/javascript" src="../Manual/search/searchdata.js"></script>
<script type="text/javascript" src="../Manual/search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { init_search(); });
</script>
<link href="../Manual/search/search.css" rel="stylesheet" type="text/css">
<script type="text/javascript" src="../Manual/search/search.js"></script>
<!-- Manually done below. -->
<link href="../Manual/doxygen.css" rel="stylesheet" type="text/css">
<link href="../Manual/cgal_stylesheet.css" rel="stylesheet" type="text/css">
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
//<![CDATA[
MathJax.Hub.Config(
{
TeX: {
Macros: {
qprel: [ "{\\gtreqless}", 0],
qpx: [ "{\\mathbf{x}}", 0],
qpl: [ "{\\mathbf{l}}", 0],
qpu: [ "{\\mathbf{u}}", 0],
qpc: [ "{\\mathbf{c}}", 0],
qpb: [ "{\\mathbf{b}}", 0],
qpy: [ "{\\mathbf{y}}", 0],
qpw: [ "{\\mathbf{w}}", 0],
qplambda: [ "{\\mathbf{\\lambda}}", 0],
ssWpoint: [ "{\\bf #1}", 1],
ssWeight: [ "{w_{#1}}", 1],
dabs: [ "{\\parallel\\! #1 \\!\\parallel}", 1],
E: [ "{\\mathrm{E}}", 0],
A: [ "{\\mathrm{A}}", 0],
R: [ "{\\mathrm{R}}", 0],
N: [ "{\\mathrm{N}}", 0],
Q: [ "{\\mathrm{Q}}", 0],
Z: [ "{\\mathrm{Z}}", 0],
ccSum: [ "{\\sum_{#1}^{#2}{#3}}", 3],
ccProd: [ "{\\prod_{#1}^{#2}{#3}}", 3],
pyr: [ "{\\operatorname{Pyr}}", 0],
aff: [ "{\\operatorname{aff}}", 0],
Ac: [ "{\\cal A}", 0],
Sc: [ "{\\cal S}", 0],
},
equationNumbers: { autoNumber: "AMS" }
}
}
);
MathJax.Hub.Register.StartupHook("TeX Jax Ready",function () {
var PARSE = MathJax.InputJax.TeX.Parse,
TEXT = PARSE.prototype.InternalText;
PARSE.Augment({
InternalText: function (text,def) {
text = text.replace(/\\/g,"");
return TEXT.call(this,text,def);
}
});
});
//]]>
</script>
<script type="text/javascript" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js"></script>
<script src="modules.js" type="text/javascript"></script>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="back-nav">
<ul>
<li><a href="https://www.cgal.org/">cgal.org</a></li>
<li><a href="../Manual/index.html">Top</a></li>
<li><a href="../Manual/general_intro.html">Getting Started</a></li>
<li><a href="../Manual/tutorials.html">Tutorials</a></li>
<li><a href="../Manual/packages.html">Package Overview</a></li>
<li><a href="../Manual/how_to_cite_cgal.html">Acknowledging CGAL</a></li>
</ul>
<!-- In a package SEARCHENGINE = false, so we cannot use
insertion. That's why we have to do it manually here. Notice
that we also take pngs from the Manual. -->
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<span id="MSearchSelect" onmouseover="return searchBox.OnSearchSelectShow()" onmouseout="return searchBox.OnSearchSelectHide()">
</span>
<input type="text" id="MSearchField" value="" placeholder="Search" accesskey="S" onfocus="searchBox.OnSearchFieldFocus(true)" onblur="searchBox.OnSearchFieldFocus(false)" onkeyup="searchBox.OnSearchFieldChange(event)">
</span>
<span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="../Manual/search/close.svg" alt=""></a>
</span>
</div>
</div>
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">CGAL 6.1 - CGAL and Solvers
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- Code below is usually inserted by doxygen when SEARCHENGINE =
true. Notice that the path to the search directory is adjusted to
the top-level.-->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../Manual/search/",'.html');
</script>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow" onmouseover="return searchBox.OnSearchSelectShow()" onmouseout="return searchBox.OnSearchSelectHide()" onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.6 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync" style="display: none"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;" class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
$(document).ready(function(){initNavTree('annotated.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle"><div class="title">Class and Concept List</div></div>
</div><!--header-->
<div class="contents">
<div class="textblock">Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.</div><div class="directory">
<div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span>]</div><table class="directory">
<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">▼</span><span class="icona"><span class="icon-namespace">N</span></span><b>CGAL</b></td><td class="desc"></td></tr>
<tr id="row_0_0_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="classCGAL_1_1Eigen__diagonalize__traits.html" target="_self">Eigen_diagonalize_traits</a></td><td class="desc">The class <code><a class="el" href="classCGAL_1_1Eigen__diagonalize__traits.html" title="The class Eigen_diagonalize_traits provides an interface to the diagonalization of covariance matrice...">Eigen_diagonalize_traits</a></code> provides an interface to the diagonalization of covariance matrices of <a class="elRef" href="../Manual/thirdparty.html#thirdpartyEigen">Eigen</a> </td></tr>
<tr id="row_0_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="structCGAL_1_1Eigen__matrix.html" target="_self">Eigen_matrix</a></td><td class="desc">The class <code><a class="el" href="structCGAL_1_1Eigen__matrix.html" title="The class Eigen_matrix is a wrapper around Eigen matrix type Eigen::Matrix.">Eigen_matrix</a></code> is a wrapper around <code>Eigen</code> matrix type <a href="https://eigen.tuxfamily.org/dox/classEigen_1_1Matrix.html"><code>Eigen::Matrix</code></a> </td></tr>
<tr id="row_0_2_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="classCGAL_1_1Eigen__solver__traits.html" target="_self">Eigen_solver_traits</a></td><td class="desc">The class <code><a class="el" href="classCGAL_1_1Eigen__solver__traits.html" title="The class Eigen_solver_traits provides an interface to the sparse solvers of Eigen.">Eigen_solver_traits</a></code> provides an interface to the sparse solvers of <a class="elRef" href="../Manual/thirdparty.html#thirdpartyEigen">Eigen</a> </td></tr>
<tr id="row_0_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="classCGAL_1_1Eigen__solver__traits_3_01Eigen_1_1BiCGSTAB_3_01Eigen__sparse__matrix_3_01double_01_4_1_1EigenType_01_4_01_4.html" target="_self">Eigen_solver_traits< Eigen::BiCGSTAB< Eigen_sparse_matrix< double >::EigenType > ></a></td><td class="desc"></td></tr>
<tr id="row_0_4_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="structCGAL_1_1Eigen__sparse__matrix.html" target="_self">Eigen_sparse_matrix</a></td><td class="desc">The class <code><a class="el" href="structCGAL_1_1Eigen__sparse__matrix.html" title="The class Eigen_sparse_matrix is a wrapper around Eigen matrix type Eigen::SparseMatrix that represen...">Eigen_sparse_matrix</a></code> is a wrapper around <code>Eigen</code> matrix type <a href="https://eigen.tuxfamily.org/dox/classEigen_1_1SparseMatrix.html"><code>Eigen::SparseMatrix</code></a> that represents general matrices, be they symmetric or not </td></tr>
<tr id="row_0_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="structCGAL_1_1Eigen__sparse__symmetric__matrix.html" target="_self">Eigen_sparse_symmetric_matrix</a></td><td class="desc">The class <code><a class="el" href="structCGAL_1_1Eigen__sparse__symmetric__matrix.html" title="The class Eigen_sparse_symmetric_matrix is a wrapper around Eigen matrix type Eigen::SparseMatrix">Eigen_sparse_symmetric_matrix</a></code> is a wrapper around <code>Eigen</code> matrix type <a href="https://eigen.tuxfamily.org/dox/classEigen_1_1SparseMatrix.html"><code>Eigen::SparseMatrix</code> </a> </td></tr>
<tr id="row_0_6_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="classCGAL_1_1Eigen__svd.html" target="_self">Eigen_svd</a></td><td class="desc">The class <code><a class="el" href="classCGAL_1_1Eigen__svd.html" title="The class Eigen_svd provides an algorithm to solve in the least square sense a linear system with a s...">Eigen_svd</a></code> provides an algorithm to solve in the least square sense a linear system with a singular value decomposition using <a class="elRef" href="../Manual/thirdparty.html#thirdpartyEigen">Eigen</a> </td></tr>
<tr id="row_0_7_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="classCGAL_1_1Eigen__vector.html" target="_self">Eigen_vector</a></td><td class="desc">The class <code><a class="el" href="classCGAL_1_1Eigen__vector.html" title="The class Eigen_vector is a wrapper around Eigen vector type, which is a simple array of numbers.">Eigen_vector</a></code> is a wrapper around <code>Eigen</code> <a href="https://eigen.tuxfamily.org/dox/classEigen_1_1Matrix.html">vector type</a>, which is a simple array of numbers </td></tr>
<tr id="row_0_8_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="classCGAL_1_1GLPK__mixed__integer__program__traits.html" target="_self">GLPK_mixed_integer_program_traits</a></td><td class="desc">This class provides an interface for formulating and solving constrained or unconstrained mixed integer programs using <a class="elRef" href="../Manual/thirdparty.html#thirdpartyGLPK">GLPK</a>, which must be available on the system </td></tr>
<tr id="row_0_9_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="classCGAL_1_1Linear__constraint.html" target="_self">Linear_constraint</a></td><td class="desc">The linear constraint of a mixed integer program </td></tr>
<tr id="row_0_10_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="classCGAL_1_1Linear__objective.html" target="_self">Linear_objective</a></td><td class="desc">The linear objective of a mixed integer program </td></tr>
<tr id="row_0_11_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="classCGAL_1_1Mixed__integer__program__traits.html" target="_self">Mixed_integer_program_traits</a></td><td class="desc">The class <code><a class="el" href="classCGAL_1_1Mixed__integer__program__traits.html" title="The class CGAL::Mixed_integer_program_traits provides an interface for formulating and solving (const...">CGAL::Mixed_integer_program_traits</a></code> provides an interface for formulating and solving (constrained or unconstrained) mixed integer programs </td></tr>
<tr id="row_0_12_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="classCGAL_1_1OSQP__quadratic__program__traits.html" target="_self">OSQP_quadratic_program_traits</a></td><td class="desc">Wraps the external OSQP solver </td></tr>
<tr id="row_0_13_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="classCGAL_1_1SCIP__mixed__integer__program__traits.html" target="_self">SCIP_mixed_integer_program_traits</a></td><td class="desc">This class provides an interface for formulating and solving constrained or unconstrained mixed integer programs using <a class="elRef" href="../Manual/thirdparty.html#thirdpartySCIP">SCIP</a> (which must be available on the system) </td></tr>
<tr id="row_0_14_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-class">C</span></span><a class="el" href="classCGAL_1_1Variable.html" target="_self">Variable</a></td><td class="desc">The variable of a mixed integer program </td></tr>
<tr id="row_1_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classDiagonalizeTraits.html" target="_self">DiagonalizeTraits</a></td><td class="desc">Concept providing functions to extract eigenvectors and eigenvalues from covariance matrices represented by an array <code>a</code>, using symmetric diagonalization </td></tr>
<tr id="row_2_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classLinearProgramTraits.html" target="_self">LinearProgramTraits</a></td><td class="desc">A concept that describes the set of methods used to define and solve a linear programming (<code>lp</code>) problem of the general form: </td></tr>
<tr id="row_3_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classMixedIntegerProgramLinearConstraint.html" target="_self">MixedIntegerProgramLinearConstraint</a></td><td class="desc"><code><a class="el" href="classMixedIntegerProgramLinearConstraint.html" title="MixedIntegerProgramLinearConstraint is a concept of a linear constraint in a Mixed Integer Programmin...">MixedIntegerProgramLinearConstraint</a></code> is a concept of a linear constraint in a Mixed Integer Programming (MIP) problem </td></tr>
<tr id="row_4_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classMixedIntegerProgramLinearObjective.html" target="_self">MixedIntegerProgramLinearObjective</a></td><td class="desc"><code><a class="el" href="classMixedIntegerProgramLinearObjective.html" title="MixedIntegerProgramLinearObjective is a concept of the linear objective function in a Mixed Integer P...">MixedIntegerProgramLinearObjective</a></code> is a concept of the linear objective function in a Mixed Integer Programming (MIP) problem </td></tr>
<tr id="row_5_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classMixedIntegerProgramTraits.html" target="_self">MixedIntegerProgramTraits</a></td><td class="desc">Concept describing the set of requirements for (constrained or unconstrained) Mixed Integer Programming (MIP) problems. A model of this concept stores the integer variables, linear objective, and linear constraints (if any) and provides a method to solve the problem </td></tr>
<tr id="row_6_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classMixedIntegerProgramVariable.html" target="_self">MixedIntegerProgramVariable</a></td><td class="desc"><code><a class="el" href="classMixedIntegerProgramVariable.html" title="MixedIntegerProgramVariable is a concept of a variable in a Mixed Integer Programming (MIP) problem.">MixedIntegerProgramVariable</a></code> is a concept of a variable in a Mixed Integer Programming (MIP) problem </td></tr>
<tr id="row_7_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classNormalEquationSparseLinearAlgebraTraits__d.html" target="_self">NormalEquationSparseLinearAlgebraTraits_d</a></td><td class="desc">Concept describing the set of requirements for solving the normal equation \( A^t A X = A^t B \), \( A \) being a matrix, \( At \) its transpose matrix, \( B \) and \( X \) being two vectors </td></tr>
<tr id="row_8_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classQuadraticProgramTraits.html" target="_self">QuadraticProgramTraits</a></td><td class="desc">A concept that describes the set of methods used to define and solve a quadratic programming (<code>qp</code>) problem of the general form: </td></tr>
<tr id="row_9_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">▼</span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classSparseLinearAlgebraTraits__d.html" target="_self">SparseLinearAlgebraTraits_d</a></td><td class="desc">The concept <code><a class="el" href="classSparseLinearAlgebraTraits__d.html" title="The concept SparseLinearAlgebraTraits_d is used to solve sparse linear systems A X = B.">SparseLinearAlgebraTraits_d</a></code> is used to solve sparse linear systems <em>A \( \times \) X = B</em> </td></tr>
<tr id="row_9_0_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classSparseLinearAlgebraTraits__d_1_1Matrix.html" target="_self">Matrix</a></td><td class="desc"><code><a class="el" href="classSparseLinearAlgebraTraits__d_1_1Matrix.html" title="SparseLinearAlgebraTraits_d::Matrix is a concept of a sparse matrix class.">SparseLinearAlgebraTraits_d::Matrix</a></code> is a concept of a sparse matrix class </td></tr>
<tr id="row_9_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classSparseLinearAlgebraTraits__d_1_1Vector.html" target="_self">Vector</a></td><td class="desc"><code><a class="el" href="classSparseLinearAlgebraTraits__d_1_1Vector.html" title="SparseLinearAlgebraTraits_d::Vector is a concept of a vector that can be multiplied by a sparse matri...">SparseLinearAlgebraTraits_d::Vector</a></code> is a concept of a vector that can be multiplied by a sparse matrix </td></tr>
<tr id="row_10_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classSparseLinearAlgebraWithFactorTraits__d.html" target="_self">SparseLinearAlgebraWithFactorTraits_d</a></td><td class="desc">Concept describing the set of requirements for a direct sparse linear system solver with factorization. A model of this concept stores the left-hand matrix (denoted \( A \)) and provides an additional factorization method to solve the system for different right-hand vectors </td></tr>
<tr id="row_11_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_11_" class="arrow" onclick="toggleFolder('11_')">▼</span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classSvdTraits.html" target="_self">SvdTraits</a></td><td class="desc">The concept <code><a class="el" href="classSvdTraits.html" title="The concept SvdTraits describes the linear algebra types and algorithms needed to solve in the least ...">SvdTraits</a></code> describes the linear algebra types and algorithms needed to solve in the least square sense a linear system with a singular value decomposition </td></tr>
<tr id="row_11_0_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classSvdTraits_1_1Matrix.html" target="_self">Matrix</a></td><td class="desc">Concept of matrix type used by the concept <code><a class="el" href="classSvdTraits.html" title="The concept SvdTraits describes the linear algebra types and algorithms needed to solve in the least ...">SvdTraits</a></code> </td></tr>
<tr id="row_11_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon-concept">C</span></span><a class="el" href="classSvdTraits_1_1Vector.html" target="_self">Vector</a></td><td class="desc">Concept of vector type used by the concept <code><a class="el" href="classSvdTraits.html" title="The concept SvdTraits describes the linear algebra types and algorithms needed to solve in the least ...">SvdTraits</a></code> </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->
</div><!-- doc-content -->
<!-- HTML footer for doxygen 1.9.6-->
<!-- start footer part -->
<!-- The footer div is not part of the default but we require it to
move the footer to the bottom of the page. -->
<div id="footer">
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"></a> 1.9.6 </li>
</ul>
</div>
</div>
</body>
</html>