| <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> |
| <html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"> |
| <title>SuperLU: SRC/cpivotgrowth.c File Reference</title> |
| <link href="doxygen.css" rel="stylesheet" type="text/css"> |
| <link href="tabs.css" rel="stylesheet" type="text/css"> |
| </head><body> |
| |
| <div class="navigation" id="top"> |
| <div class="tabs"> |
| <ul> |
| <li><a href="index.html"><span>Main Page</span></a></li> |
| <li><a href="annotated.html"><span>Data Structures</span></a></li> |
| <li class="current"><a href="files.html"><span>Files</span></a></li> |
| </ul> |
| </div> |
| </div> |
| <div class="contents"> |
| <h1>SRC/cpivotgrowth.c File Reference</h1>Computes the reciprocal pivot growth factor. <a href="#_details">More...</a> |
| <p> |
| <code>#include <math.h></code><br> |
| <code>#include "<a class="el" href="slu__cdefs_8h-source.html">slu_cdefs.h</a>"</code><br> |
| <table border="0" cellpadding="0" cellspacing="0"> |
| <tr><td></td></tr> |
| <tr><td colspan="2"><br><h2>Functions</h2></td></tr> |
| <tr><td class="memItemLeft" nowrap align="right" valign="top">float </td><td class="memItemRight" valign="bottom"><a class="el" href="cpivotgrowth_8c.html#cda3921f49d46be7eaa23b58bc2b09c5">cPivotGrowth</a> (int ncols, <a class="el" href="structSuperMatrix.html">SuperMatrix</a> *<a class="el" href="ilu__zdrop__row_8c.html#c900805a486cbb8489e3c176ed6e0d8e">A</a>, int *perm_c, <a class="el" href="structSuperMatrix.html">SuperMatrix</a> *L, <a class="el" href="structSuperMatrix.html">SuperMatrix</a> *U)</td></tr> |
| |
| </table> |
| <hr><a name="_details"></a><h2>Detailed Description</h2> |
| <pre> |
| -- SuperLU routine (version 2.0) -- |
| Univ. of California Berkeley, Xerox Palo Alto Research Center, |
| and Lawrence Berkeley National Lab. |
| November 15, 1997 |
| </pre> <hr><h2>Function Documentation</h2> |
| <a class="anchor" name="cda3921f49d46be7eaa23b58bc2b09c5"></a> |
| <div class="memitem"> |
| <div class="memproto"> |
| <table class="memname"> |
| <tr> |
| <td class="memname">float cPivotGrowth </td> |
| <td>(</td> |
| <td class="paramtype">int </td> |
| <td class="paramname"> <em>ncols</em>, </td> |
| </tr> |
| <tr> |
| <td class="paramkey"></td> |
| <td></td> |
| <td class="paramtype"><a class="el" href="structSuperMatrix.html">SuperMatrix</a> * </td> |
| <td class="paramname"> <em>A</em>, </td> |
| </tr> |
| <tr> |
| <td class="paramkey"></td> |
| <td></td> |
| <td class="paramtype">int * </td> |
| <td class="paramname"> <em>perm_c</em>, </td> |
| </tr> |
| <tr> |
| <td class="paramkey"></td> |
| <td></td> |
| <td class="paramtype"><a class="el" href="structSuperMatrix.html">SuperMatrix</a> * </td> |
| <td class="paramname"> <em>L</em>, </td> |
| </tr> |
| <tr> |
| <td class="paramkey"></td> |
| <td></td> |
| <td class="paramtype"><a class="el" href="structSuperMatrix.html">SuperMatrix</a> * </td> |
| <td class="paramname"> <em>U</em></td><td> </td> |
| </tr> |
| <tr> |
| <td></td> |
| <td>)</td> |
| <td></td><td></td><td width="100%"></td> |
| </tr> |
| </table> |
| </div> |
| <div class="memdoc"> |
| |
| <p> |
| <pre> |
| Purpose |
| =======</pre><p> |
| <pre> Compute the reciprocal pivot growth factor of the leading ncols columns |
| of the matrix, using the formula: |
| min_j ( max_i(<a class="el" href="slamch_8c.html#3aa069ac3980707dae1e0530f50d59e4">abs(A_ij)</a>) / max_i(<a class="el" href="slamch_8c.html#3aa069ac3980707dae1e0530f50d59e4">abs(U_ij)</a>) )</pre><p> |
| <pre> Arguments |
| =========</pre><p> |
| <pre> ncols (input) int |
| The number of columns of matrices A, L and U.</pre><p> |
| <pre> A (input) SuperMatrix* |
| Original matrix A, permuted by columns, of dimension |
| (A->nrow, A->ncol). The type of A can be: |
| Stype = NC; Dtype = SLU_C; Mtype = GE.</pre><p> |
| <pre> L (output) SuperMatrix* |
| The factor L from the factorization Pr*A=L*U; use compressed row |
| subscripts storage for supernodes, i.e., L has type: |
| Stype = SC; Dtype = SLU_C; Mtype = TRLU.</pre><p> |
| <pre> U (output) SuperMatrix* |
| The factor U from the factorization Pr*A*Pc=L*U. Use column-wise |
| storage scheme, i.e., U has types: Stype = NC; |
| Dtype = SLU_C; Mtype = TRU. |
| </pre> |
| </div> |
| </div><p> |
| </div> |
| <hr size="1"><address style="text-align: right;"><small>Generated on Mon Nov 22 10:23:47 2010 for SuperLU by |
| <a href="http://www.doxygen.org/index.html"> |
| <img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.5 </small></address> |
| </body> |
| </html> |