Lines Matching refs:td

52 <tr><td>\code
57 \endcode</td><td>\code
62 \endcode</td></tr>
70 <tr><td>\code
79 \endcode</td><td>\code
88 \endcode</td>
126 <tr><td>\code
128 A.part<StrictlyLowerTriangular>(); \endcode</td>
129 <td>\code
131 A.triangularView<StrictlyLower>()\endcode</td></tr>
132 <tr><td>\code
134 A.extract<StrictlyLowerTriangular>();\endcode</td>
135 <td>\code
137 A.triangularView<StrictlyLower>()\endcode</td></tr>
138 <tr><td>\code
140 A.marked<StrictlyLowerTriangular>();\endcode</td>
141 <td>\code
143 A.triangularView<StrictlyLower>()\endcode</td></tr>
144 <tr><td colspan="2"></td></tr>
145 <tr><td>\code
147 A.extract<SelfAdfjoint|LowerTriangular>();\endcode</td>
148 <td>\code
150 A.selfadjointView<Lower>()\endcode</td></tr>
151 <tr><td colspan="2"></td></tr>
152 <tr><td>\code
159 \endcode</td><td>\code
166 \endcode</td>
176 <tr><td>\code A.triangularSolveInPlace<XxxTriangular>(Y);\endcode</td><td>\code A.triangularView<Xx…
191     <td>LU</td>
192     <td>FullPivLU</td>
193     <td class="alt">See also the new PartialPivLU, it's much faster</td>
196     <td>QR</td>
197     <td>HouseholderQR</td>
198     <td class="alt">See also the new ColPivHouseholderQR, it's more reliable</td>
201     <td>SVD</td>
202     <td>JacobiSVD</td>
203     <td class="alt">We currently don't have a bidiagonalizing SVD; of course this is planned.</td>
206     <td>EigenSolver and friends</td>
207     <td>\code #include<Eigen/Eigenvalues> \endcode </td>
208     <td class="alt">Moved to separate module</td>
216 <tr><td>\code A.lu();\endcode</td>
217 <td>\code A.fullPivLu();\endcode</td>
218 <td class="alt">Now A.lu() returns a PartialPivLU</td></tr>
219 <tr><td>\code A.lu().solve(B,&X);\endcode</td>
220 <td>\code X = A.lu().solve(B);
221  X = A.fullPivLu().solve(B);\endcode</td>
222 <td class="alt">The returned by value is fully optimized</td></tr>
223 <tr><td>\code A.llt().solve(B,&X);\endcode</td>
224 <td>\code X = A.llt().solve(B);
226  X = A.selfadjointView<Upper>.llt().solve(B);\endcode</td>
227 <td class="alt">The returned by value is fully optimized and \n
229 triangular part to work on (default is lower part)</td></tr>
230 <tr><td>\code A.llt().solveInPlace(B);\endcode</td>
231 <td>\code B = A.llt().solve(B);
233  B = A.selfadjointView<Upper>.llt().solve(B);\endcode</td>
234 <td class="alt">In place solving</td></tr>
235 <tr><td>\code A.ldlt().solve(B,&X);\endcode</td>
236 <td>\code X = A.ldlt().solve(B);
238  X = A.selfadjointView<Upper>.ldlt().solve(B);\endcode</td>
239 <td class="alt">The returned by value is fully optimized and \n
241 triangular part to work on</td></tr>
257   <td> Transform3f </td>
258   <td> Affine3f or Projective3f </td>
259   <td> Of course 3f is just an example here </td>
306   <td> \code std::vector<Matrix4f> \endcode </td>
307   <td> \code std::vector<Matrix4f, aligned_allocator<Matrix4f> > \endcode </td>