Lines Matching refs:td
13 <tr><td>Constructor</td>
14 <td>
19 </td> <td> Default is ColMajor</td> </tr>
21 <td> Resize/Reserve</td>
22 <td>
27 </td>
28 …td> Note that when calling reserve(), it is not required that nnz is the exact number of nonzero e…
31 <td> Assignment </td>
32 <td>
40 </td>
41 <td> The copy constructor can be used to convert from a storage order to another</td>
44 <td> Element-wise Insertion</td>
45 <td>
55 </td>
56 <td> insert() assumes that the element does not already exist; otherwise, use coeffRef()</td>
59 <td> Batch insertion</td>
60 <td>
67 </td>
68 <td>A complete example is available at \link TutorialSparseFilling Triplet Insertion \endlink.</td>
71 <td> Constant or Random Insertion</td>
72 <td>
76 </td>
77 <td>Remove all non-zero coefficients</td>
86 <td> \code
98 \endcode </td>
108 <td> add subtract </td>
109 <td> \code
114 </td>
115 <td>
117 </td>
120 <tr class="alt"><td>
121 scalar product</td><td>\code
124 </td>
125 <td>
130 <td> %Sparse %Product </td>
131 <td> \code
135 \endcode </td>
136 <td>
137 </td>
141 <td> transposition, adjoint</td>
142 <td> \code
145 \endcode </td>
146 <td>
148 </td>
151 <td> Permutation </td>
152 <td>
159 </td>
160 <td>
162 </td>
165 <td>
167 </td>
168 <td>\code
175 \endcode</td>
176 <td>
178 </td>
186 <td>Sub-matrices</td>
187 <td>
196 </td> <td> </td>
199 <td> Range </td>
200 <td>
210 </td>
211 …td>A inner vector is either a row (for row-major) or a column (for column-major). As stated earlie…
214 <td> Triangular and selfadjoint views</td>
215 <td>
220 </td>
221 <td> Several combination between triangular views and blocks views are possible
223 \endcode </td>
226 <td>Triangular solve </td>
227 <td>
232 </td>
233 <td> For general sparse solve, Use any suitable module described at \ref TopicSparseSystems </td>
236 <td> Low-level API</td>
237 <td>
243 </td>
244 …td> If the matrix is not in compressed form, makeCompressed() should be called before. Note that t…