Lines Matching refs:td
28 …td>\link Sparse_Module SparseCore \endlink</td><td>\code#include <Eigen/SparseCore>\endcode</td><t…
29 …td>\link SparseCholesky_Module SparseCholesky \endlink</td><td>\code#include <Eigen/SparseCholesky…
30 …td>\link IterativeLinearSolvers_Module IterativeLinearSolvers \endlink</td><td>\code#include <Eige…
31 <tr><td></td><td>\code#include <Eigen/Sparse>\endcode</td><td>Includes all the above modules</td></…
52 <tr><td> 0</td><td>3</td><td> 0</td><td>0</td><td> 0</td></tr>
53 <tr><td>22</td><td>0</td><td> 0</td><td>0</td><td>17</td></tr>
54 <tr><td> 7</td><td>5</td><td> 0</td><td>1</td><td> 0</td></tr>
55 <tr><td> 0</td><td>0</td><td> 0</td><td>0</td><td> 0</td></tr>
56 <tr><td> 0</td><td>0</td><td>14</td><td>0</td><td> 8</td></tr>
61 …tr><td>Values:</td> <td>22</td><td>7</td><td>_</td><td>3</td><td>5</td><td>14</td><td>_</td…
62 …tr><td>InnerIndices:</td> <td> 1</td><td>2</td><td>_</td><td>0</td><td>2</td><td> 4</td><td>_</td…
65 <tr><td>OuterStarts:</td><td>0</td><td>3</td><td>5</td><td>8</td><td>10</td><td>\em 12 </td></tr>
66 <tr><td>InnerNNZs:</td> <td>2</td><td>2</td><td>1</td><td>1</td><td> 2</td><td></td></tr>
87 <tr><td>Values:</td> <td>22</td><td>7</td><td>3</td><td>5</td><td>14</td><td>1</td><td>17</t…
88 <tr><td>InnerIndices:</td> <td> 1</td><td>2</td><td>0</td><td>2</td><td> 4</td><td>2</td><td> 1</t…
91 <tr><td>OuterStarts:</td><td>0</td><td>2</td><td>4</td><td>5</td><td>6</td><td>\em 8 </td></tr>
104 <tr><td>
106 </td>
107 <td>
109 </td></tr></table>
150 <tr><td>Standard \n dimensions</td><td>\code
152 mat.cols()\endcode</td>
153 <td>\code
154 vec.size() \endcode</td>
156 <tr><td>Sizes along the \n inner/outer dimensions</td><td>\code
158 mat.outerSize()\endcode</td>
159 <td></td>
161 <tr><td>Number of non \n zero coefficients</td><td>\code
162 mat.nonZeros() \endcode</td>
163 <td>\code
164 vec.nonZeros() \endcode</td></tr>
175 <tr><td>
187 </td><td>
196 </td></tr>
252 …td>SimplicialLLT </td><td>\link SparseCholesky_Module SparseCholesky \endlink</td><td>Direct LL…
253 <td>built-in, LGPL</td>
254 <td>SimplicialLDLT is often preferable</td></tr>
255 …td>SimplicialLDLT </td><td>\link SparseCholesky_Module SparseCholesky \endlink</td><td>Direct LD…
256 <td>built-in, LGPL</td>
257 <td>Recommended for very sparse and not too large problems (e.g., 2D Poisson eq.)</td></tr>
258 …td>ConjugateGradient</td><td>\link IterativeLinearSolvers_Module IterativeLinearSolvers \endlink</…
259 <td>built-in, LGPL</td>
260 <td>Recommended for large symmetric problems (e.g., 3D Poisson eq.)</td></tr>
261 …td>BiCGSTAB</td><td>\link IterativeLinearSolvers_Module IterativeLinearSolvers \endlink</td><td>It…
262 <td>built-in, LGPL</td>
263 <td>Might not always converge</td></tr>
266 …td>PastixLLT \n PastixLDLT \n PastixLU</td><td>\link PaStiXSupport_Module PaStiXSupport \endlink</…
267 <td>Requires the <a href="http://pastix.gforge.inria.fr">PaStiX</a> package, \b CeCILL-C </td>
268 <td>optimized for tough problems and symmetric patterns</td></tr>
269 …td>CholmodSupernodalLLT</td><td>\link CholmodSupport_Module CholmodSupport \endlink</td><td>Direct…
270 …<td>Requires the <a href="http://www.cise.ufl.edu/research/sparse/SuiteSparse/">SuiteSparse</a> pa…
271 <td></td></tr>
272 …td>UmfPackLU</td><td>\link UmfPackSupport_Module UmfPackSupport \endlink</td><td>Direct LU factori…
273 …<td>Requires the <a href="http://www.cise.ufl.edu/research/sparse/SuiteSparse/">SuiteSparse</a> pa…
274 <td></td></tr>
275 …td>SuperLU</td><td>\link SuperLUSupport_Module SuperLUSupport \endlink</td><td>Direct LU factoriza…
276 …<td>Requires the <a href="http://crd-legacy.lbl.gov/~xiaoye/SuperLU/">SuperLU</a> library, (BSD-li…
277 <td></td></tr>