|
34 | 34 | <tbody> |
35 | 35 | <tr id="projectrow"> |
36 | 36 | <td id="projectalign"> |
37 | | - <div id="projectname">linalg<span id="projectnumber"> 1.8.0</span> |
| 37 | + <div id="projectname">linalg<span id="projectnumber"> 1.8.1</span> |
38 | 38 | </div> |
39 | 39 | <div id="projectbrief">A linear algebra library that provides a user-friendly interface to several BLAS and LAPACK routines.</div> |
40 | 40 | </td> |
|
232 | 232 | <tr id="row_4_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1aplb.html" target="_self">aplb</a></td><td class="desc">Computes the matrix sum: C = A + B, where the matrices are given in CSR format </td></tr> |
233 | 233 | <tr id="row_4_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1aplsb.html" target="_self">aplsb</a></td><td class="desc">Computes the matrix sum: C = A + s * B, where the matrices are given in CSR format </td></tr> |
234 | 234 | <tr id="row_4_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1bndcsr.html" target="_self">bndcsr</a></td><td class="desc">Converts the LINPACK, BLAS, LAPACK banded matrix format into a CSR format </td></tr> |
235 | | -<tr id="row_4_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1csrcsc2.html" target="_self">csrcsc2</a></td><td class="desc">Converts a CSR matrix into a CSC matrix (transposition) </td></tr> |
236 | | -<tr id="row_4_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1csrmsr.html" target="_self">csrmsr</a></td><td class="desc">Converts a CSR matrix to an MSR matrix </td></tr> |
237 | | -<tr id="row_4_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1getdia.html" target="_self">getdia</a></td><td class="desc">Extracts the diagonal from a matrix </td></tr> |
238 | | -<tr id="row_4_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1getelm.html" target="_self">getelm</a></td><td class="desc">Gets element A(i,j) of matrix A for any pair (i,j) </td></tr> |
239 | | -<tr id="row_4_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1ilud.html" target="_self">ilud</a></td><td class="desc">Computes the incomplete LU factorization of a sparse matrix in CSR format with standard dropping strategy </td></tr> |
240 | | -<tr id="row_4_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1iludp.html" target="_self">iludp</a></td><td class="desc">Computes the incomplete LU factorization of a sparse matrix in CSR format with standard dropping strategy </td></tr> |
241 | | -<tr id="row_4_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1ilut.html" target="_self">ilut</a></td><td class="desc">Computes the incomplete LU factorization of a sparse matrix in CSR format using a dual truncation mechanism </td></tr> |
242 | | -<tr id="row_4_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1ilutp.html" target="_self">ilutp</a></td><td class="desc">Computes the incomplete LU factorization of a sparse matrix in CSR format using a dual truncation mechanism and pivoting </td></tr> |
243 | | -<tr id="row_4_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1lusol.html" target="_self">lusol</a></td><td class="desc">Solves the LU-factored system (LU) x = y </td></tr> |
244 | | -<tr id="row_4_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1msrcsr.html" target="_self">msrcsr</a></td><td class="desc">Converts and MSR matrix to a CSR matrix </td></tr> |
245 | | -<tr id="row_4_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1pgmres.html" target="_self">pgmres</a></td><td class="desc">An ILUT preconditioned GMRES algorithm. This routine utilizes the L and U matrices generated by the ILUT routine to precondition the GMRES algorithm. The stopping criteria utilized is based simply on reducing the residual norm to the requested tolerance </td></tr> |
| 235 | +<tr id="row_4_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1clncsr.html" target="_self">clncsr</a></td><td class="desc">@breif Cleans up a CSR matrix </td></tr> |
| 236 | +<tr id="row_4_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1coocsr.html" target="_self">coocsr</a></td><td class="desc">Converte a matrix stored in coordinate format to CSR format </td></tr> |
| 237 | +<tr id="row_4_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1csort.html" target="_self">csort</a></td><td class="desc">Sorces the elements of a CSR matrix in increasing order of their column indices within each row </td></tr> |
| 238 | +<tr id="row_4_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1csrcsc2.html" target="_self">csrcsc2</a></td><td class="desc">Converts a CSR matrix into a CSC matrix (transposition) </td></tr> |
| 239 | +<tr id="row_4_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1csrmsr.html" target="_self">csrmsr</a></td><td class="desc">Converts a CSR matrix to an MSR matrix </td></tr> |
| 240 | +<tr id="row_4_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1getdia.html" target="_self">getdia</a></td><td class="desc">Extracts the diagonal from a matrix </td></tr> |
| 241 | +<tr id="row_4_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1getelm.html" target="_self">getelm</a></td><td class="desc">Gets element A(i,j) of matrix A for any pair (i,j) </td></tr> |
| 242 | +<tr id="row_4_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1ilud.html" target="_self">ilud</a></td><td class="desc">Computes the incomplete LU factorization of a sparse matrix in CSR format with standard dropping strategy </td></tr> |
| 243 | +<tr id="row_4_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1iludp.html" target="_self">iludp</a></td><td class="desc">Computes the incomplete LU factorization of a sparse matrix in CSR format with standard dropping strategy </td></tr> |
| 244 | +<tr id="row_4_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1ilut.html" target="_self">ilut</a></td><td class="desc">Computes the incomplete LU factorization of a sparse matrix in CSR format using a dual truncation mechanism </td></tr> |
| 245 | +<tr id="row_4_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1ilutp.html" target="_self">ilutp</a></td><td class="desc">Computes the incomplete LU factorization of a sparse matrix in CSR format using a dual truncation mechanism and pivoting </td></tr> |
| 246 | +<tr id="row_4_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1lusol.html" target="_self">lusol</a></td><td class="desc">Solves the LU-factored system (LU) x = y </td></tr> |
| 247 | +<tr id="row_4_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1msrcsr.html" target="_self">msrcsr</a></td><td class="desc">Converts and MSR matrix to a CSR matrix </td></tr> |
| 248 | +<tr id="row_4_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacesparskit_1_1pgmres.html" target="_self">pgmres</a></td><td class="desc">An ILUT preconditioned GMRES algorithm. This routine utilizes the L and U matrices generated by the ILUT routine to precondition the GMRES algorithm. The stopping criteria utilized is based simply on reducing the residual norm to the requested tolerance </td></tr> |
246 | 249 | </table> |
247 | 250 | </div><!-- directory --> |
248 | 251 | </div><!-- contents --> |
|
0 commit comments