From 86ea4b3cf0c7b31ecc58038428515b92f78571c0 Mon Sep 17 00:00:00 2001 From: Sherry Li Date: Sun, 31 Mar 2024 10:52:49 -0700 Subject: [PATCH] In ilu_dpivotL, if singularity is detected, return an error flag, instead of triggering exit(1). --- DOC/html/EXAMPLE_2sp__ienv_8c.html | 86 +- DOC/html/SRC_2sp__ienv_8c.html | 7 +- DOC/html/annotated.html | 30 +- DOC/html/ccolumn__bmod_8c.html | 62 +- DOC/html/ccolumn__dfs_8c.html | 36 +- DOC/html/ccopy__to__ucol_8c.html | 42 +- DOC/html/cdiagonal_8c.html | 24 +- DOC/html/cfgmr_8c.html | 128 +- DOC/html/cgscon_8c.html | 56 +- DOC/html/cgsequ_8c.html | 32 +- DOC/html/cgsisx_8c.html | 78 +- DOC/html/cgsitrf_8c.html | 82 +- DOC/html/cgsrfs_8c.html | 70 +- DOC/html/cgssv_8c.html | 86 +- DOC/html/cgssvx_8c.html | 78 +- DOC/html/cgstrf_8c.html | 78 +- DOC/html/cgstrs_8c.html | 54 +- DOC/html/citersol1_8c.html | 186 +-- DOC/html/citersol_8c.html | 184 +-- DOC/html/clangs_8c.html | 32 +- DOC/html/claqgs_8c.html | 30 +- DOC/html/cldperm_8c.html | 78 +- DOC/html/clinsol1_8c.html | 78 +- DOC/html/clinsol_8c.html | 78 +- DOC/html/clinsolx1_8c.html | 78 +- DOC/html/clinsolx2_8c.html | 86 +- DOC/html/clinsolx_8c.html | 79 +- DOC/html/cmemory_8c.html | 238 ++-- DOC/html/cmyblas2_8c.html | 50 +- DOC/html/colamd_8c.html | 14 +- DOC/html/colamd_8h.html | 55 +- DOC/html/cpanel__bmod_8c.html | 56 +- DOC/html/cpanel__dfs_8c.html | 34 +- DOC/html/cpivotL_8c.html | 34 +- DOC/html/cpivotgrowth_8c.html | 32 +- DOC/html/cpruneL_8c.html | 24 +- DOC/html/creadhb_8c.html | 102 +- DOC/html/creadrb_8c.html | 98 +- DOC/html/creadtriple_8c.html | 54 +- DOC/html/csnode__bmod_8c.html | 46 +- DOC/html/csnode__dfs_8c.html | 40 +- DOC/html/csp__blas2_8c.html | 86 +- DOC/html/csp__blas3_8c.html | 46 +- DOC/html/cutil_8c.html | 222 ++-- DOC/html/dcolumn__bmod_8c.html | 40 +- DOC/html/dcolumn__dfs_8c.html | 38 +- DOC/html/dcopy__to__ucol_8c.html | 30 +- DOC/html/ddiagonal_8c.html | 22 +- DOC/html/dfgmr_8c.html | 42 +- DOC/html/dgscon_8c.html | 34 +- DOC/html/dgsequ_8c.html | 28 +- DOC/html/dgsisx_8c.html | 52 +- DOC/html/dgsitrf_8c.html | 50 +- DOC/html/dgsrfs_8c.html | 34 +- DOC/html/dgssv_8c.html | 60 +- DOC/html/dgssvx_8c.html | 56 +- DOC/html/dgstrs_8c.html | 26 +- DOC/html/ditersol1_8c.html | 66 +- DOC/html/ditersol_8c.html | 66 +- DOC/html/dlangs_8c.html | 28 +- DOC/html/dlaqgs_8c.html | 28 +- DOC/html/dldperm_8c.html | 60 +- DOC/html/dlinsol1_8c.html | 52 +- DOC/html/dlinsol_8c.html | 50 +- DOC/html/dlinsolx1_8c.html | 52 +- DOC/html/dlinsolx2_8c.html | 54 +- DOC/html/dlinsolx_8c.html | 123 +- DOC/html/dpanel__bmod_8c.html | 30 +- DOC/html/dpanel__dfs_8c.html | 24 +- DOC/html/dpivotL_8c.html | 26 +- DOC/html/dpivotgrowth_8c.html | 28 +- DOC/html/dpruneL_8c.html | 22 +- DOC/html/dreadhb_8c.html | 54 +- DOC/html/dreadrb_8c.html | 52 +- DOC/html/dreadtriple_8c.html | 30 +- DOC/html/dsnode__bmod_8c.html | 18 +- DOC/html/dsnode__dfs_8c.html | 42 +- DOC/html/dsp__blas2_8c.html | 20 +- DOC/html/dsp__blas3_8c.html | 18 +- DOC/html/dutil_8c.html | 72 +- DOC/html/files.html | 72 +- DOC/html/functions.html | 4 +- DOC/html/functions_vars.html | 4 +- DOC/html/get__perm__c_8c.html | 253 ++-- DOC/html/globals.html | 11 +- DOC/html/globals_defs.html | 10 +- DOC/html/globals_type.html | 2 +- DOC/html/globals_vars.html | 4 +- DOC/html/heap__relax__snode_8c.html | 42 +- DOC/html/icmax1_8c.html | 10 +- DOC/html/ilu__ccolumn__dfs_8c.html | 34 +- DOC/html/ilu__ccopy__to__ucol_8c.html | 58 +- DOC/html/ilu__cdrop__row_8c.html | 98 +- DOC/html/ilu__cpanel__dfs_8c.html | 38 +- DOC/html/ilu__cpivotL_8c.html | 52 +- DOC/html/ilu__csnode__dfs_8c.html | 36 +- DOC/html/ilu__dcolumn__dfs_8c.html | 36 +- DOC/html/ilu__dcopy__to__ucol_8c.html | 30 +- DOC/html/ilu__ddrop__row_8c.html | 26 +- DOC/html/ilu__dpanel__dfs_8c.html | 22 +- DOC/html/ilu__dpivotL_8c.html | 26 +- DOC/html/ilu__dsnode__dfs_8c.html | 38 +- DOC/html/ilu__heap__relax__snode_8c.html | 18 +- DOC/html/ilu__relax__snode_8c.html | 30 +- DOC/html/ilu__scolumn__dfs_8c.html | 26 +- DOC/html/ilu__scopy__to__ucol_8c.html | 20 +- DOC/html/ilu__sdrop__row_8c.html | 26 +- DOC/html/ilu__spanel__dfs_8c.html | 22 +- DOC/html/ilu__spivotL_8c.html | 26 +- DOC/html/ilu__ssnode__dfs_8c.html | 28 +- DOC/html/ilu__zcolumn__dfs_8c.html | 28 +- DOC/html/ilu__zcopy__to__ucol_8c.html | 22 +- DOC/html/ilu__zdrop__row_8c.html | 30 +- DOC/html/ilu__zpanel__dfs_8c.html | 24 +- DOC/html/ilu__zpivotL_8c.html | 30 +- DOC/html/ilu__zsnode__dfs_8c.html | 30 +- DOC/html/mark__relax_8c.html | 26 +- DOC/html/mc64ad_8c.html | 230 ++-- DOC/html/memory_8c.html | 54 +- DOC/html/mmd_8c.html | 56 +- DOC/html/qselect_8c.html | 18 +- DOC/html/relax__snode_8c.html | 42 +- DOC/html/scolumn__bmod_8c.html | 30 +- DOC/html/scolumn__dfs_8c.html | 28 +- DOC/html/scomplex_8c.html | 114 +- DOC/html/scopy__to__ucol_8c.html | 20 +- DOC/html/scsum1_8c.html | 16 +- DOC/html/sdiagonal_8c.html | 18 +- DOC/html/sfgmr_8c.html | 36 +- DOC/html/sgscon_8c.html | 28 +- DOC/html/sgsequ_8c.html | 28 +- DOC/html/sgsisx_8c.html | 46 +- DOC/html/sgsitrf_8c.html | 30 +- DOC/html/sgsrfs_8c.html | 28 +- DOC/html/sgssv_8c.html | 46 +- DOC/html/sgssvx_8c.html | 46 +- DOC/html/sgstrf_8c.html | 32 +- DOC/html/sgstrs_8c.html | 18 +- DOC/html/sitersol1_8c.html | 54 +- DOC/html/sitersol_8c.html | 54 +- DOC/html/slangs_8c.html | 28 +- DOC/html/slaqgs_8c.html | 28 +- DOC/html/sldperm_8c.html | 60 +- DOC/html/slinsol1_8c.html | 46 +- DOC/html/slinsol_8c.html | 46 +- DOC/html/slinsolx1_8c.html | 48 +- DOC/html/slinsolx2_8c.html | 60 +- DOC/html/slinsolx_8c.html | 48 +- DOC/html/slu__Cnames_8h.html | 34 +- DOC/html/slu__cdefs_8h.html | 1348 +++++++++++----------- DOC/html/slu__ddefs_8h.html | 538 ++++----- DOC/html/slu__scomplex_8h.html | 132 ++- DOC/html/slu__sdefs_8h.html | 324 +++--- DOC/html/slu__util_8h.html | 315 +++-- DOC/html/slu__zdefs_8h.html | 338 +++--- DOC/html/smemory_8c.html | 97 +- DOC/html/sp__coletree_8c.html | 60 +- DOC/html/sp__preorder_8c.html | 36 +- DOC/html/spanel__bmod_8c.html | 30 +- DOC/html/spanel__dfs_8c.html | 24 +- DOC/html/spivotL_8c.html | 26 +- DOC/html/spivotgrowth_8c.html | 28 +- DOC/html/spruneL_8c.html | 22 +- DOC/html/sreadhb_8c.html | 50 +- DOC/html/sreadrb_8c.html | 48 +- DOC/html/sreadtriple_8c.html | 26 +- DOC/html/ssnode__bmod_8c.html | 18 +- DOC/html/ssnode__dfs_8c.html | 32 +- DOC/html/ssp__blas2_8c.html | 18 +- DOC/html/ssp__blas3_8c.html | 18 +- DOC/html/structDNformat.html | 4 +- DOC/html/structGlobalLU__t.html | 32 +- DOC/html/structLU__stack__t.html | 16 +- DOC/html/structNCPformat.html | 16 +- DOC/html/structNCformat.html | 12 +- DOC/html/structNRformat.html | 12 +- DOC/html/structNRformat__loc.html | 20 +- DOC/html/structSCPformat.html | 28 +- DOC/html/structSCformat.html | 20 +- DOC/html/structSuperMatrix.html | 8 +- DOC/html/structe__node.html | 4 +- DOC/html/superlu_8c.html | 50 +- DOC/html/superlu__enum__consts_8h.html | 12 +- DOC/html/superlu__timer_8c.html | 22 +- DOC/html/sutil_8c.html | 70 +- DOC/html/util_8c.html | 278 +++-- DOC/html/zcolumn__bmod_8c.html | 32 +- DOC/html/zcolumn__dfs_8c.html | 30 +- DOC/html/zcopy__to__ucol_8c.html | 22 +- DOC/html/zdiagonal_8c.html | 20 +- DOC/html/zfgmr_8c.html | 40 +- DOC/html/zgscon_8c.html | 30 +- DOC/html/zgsequ_8c.html | 30 +- DOC/html/zgsisx_8c.html | 52 +- DOC/html/zgsitrf_8c.html | 34 +- DOC/html/zgsrfs_8c.html | 30 +- DOC/html/zgssv_8c.html | 50 +- DOC/html/zgssvx_8c.html | 52 +- DOC/html/zgstrf_8c.html | 34 +- DOC/html/zgstrs_8c.html | 20 +- DOC/html/zitersol1_8c.html | 60 +- DOC/html/zitersol_8c.html | 60 +- DOC/html/zlangs_8c.html | 30 +- DOC/html/zlaqgs_8c.html | 30 +- DOC/html/zldperm_8c.html | 62 +- DOC/html/zlinsol1_8c.html | 52 +- DOC/html/zlinsol_8c.html | 52 +- DOC/html/zlinsolx1_8c.html | 54 +- DOC/html/zlinsolx2_8c.html | 54 +- DOC/html/zlinsolx_8c.html | 52 +- DOC/html/zmemory_8c.html | 99 +- DOC/html/zpanel__bmod_8c.html | 32 +- DOC/html/zpanel__dfs_8c.html | 26 +- DOC/html/zpivotL_8c.html | 30 +- DOC/html/zpivotgrowth_8c.html | 30 +- DOC/html/zpruneL_8c.html | 24 +- DOC/html/zreadhb_8c.html | 52 +- DOC/html/zreadrb_8c.html | 50 +- DOC/html/zreadtriple_8c.html | 28 +- DOC/html/zsnode__bmod_8c.html | 20 +- DOC/html/zsnode__dfs_8c.html | 34 +- DOC/html/zsp__blas2_8c.html | 20 +- DOC/html/zsp__blas3_8c.html | 20 +- DOC/html/zutil_8c.html | 72 +- SRC/cgssvx.c | 9 +- SRC/cldperm.c | 4 +- SRC/dgssvx.c | 5 +- SRC/dldperm.c | 4 +- SRC/ilu_cpivotL.c | 18 +- SRC/ilu_dpivotL.c | 18 +- SRC/ilu_spivotL.c | 18 +- SRC/ilu_zpivotL.c | 18 +- SRC/sgssvx.c | 5 +- SRC/sldperm.c | 4 +- SRC/zgssvx.c | 5 +- SRC/zldperm.c | 4 +- 236 files changed, 6704 insertions(+), 6517 deletions(-) diff --git a/DOC/html/EXAMPLE_2sp__ienv_8c.html b/DOC/html/EXAMPLE_2sp__ienv_8c.html index 44b55ead..5e4d67ad 100644 --- a/DOC/html/EXAMPLE_2sp__ienv_8c.html +++ b/DOC/html/EXAMPLE_2sp__ienv_8c.html @@ -45,42 +45,30 @@
Functions
-
sp_ienv.c File Reference
Example
+
sp_ienv.c File Reference
- -

Chooses machine-dependent parameters for the local environment. -More...

-
#include "slu_sdefs.h"
+
#include "slu_Cnames.h"
Include dependency graph for sp_ienv.c:
- - - - - - - - - - - - - - + +
-

Functions

int sp_ienv (int ispec)
 sp_ienv() is inquired to choose machine-dependent parameters for the local environment. More...
 
-

Function Documentation

+

Detailed Description

+

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

+

All rights reserved.

+

The source code is distributed under BSD license, see the file License.txt at the top-level directory.

+

Function Documentation

◆ sp_ienv()

@@ -96,28 +84,48 @@

-

See ISPEC for a description of the parameters. This version provides a set of parameters which should give good, but not optimal, performance on many of the currently available computers. Users are encouraged to modify this subroutine to set the tuning parameters for their particular machine using the option and problem size information in the arguments.

-
Parameters
- - -
[in]ispecSpecifies the parameter to be returned as the value of SP_IENV.
- = 1: the panel size w; a panel consists of w consecutive columns of matrix A in the process of Gaussian elimination. The best value depends on machine's cache characters.
- = 2: the relaxation parameter relax; if the number of nodes (columns) in a subtree of the elimination tree is less than relax, this subtree is considered as one supernode, regardless of their row structures.
- = 3: the maximum size for a supernode in complete LU.
- = 4: the minimum row dimension for 2-D blocking to be used.
- = 5: the minimum column dimension for 2-D blocking to be used.
- = 6: the estimated fills factor for L and U, compared with A.
- = 7: the maximum size for a supernode in ILU.
-
-
-
Returns
>= 0: the value of the parameter specified by ispec.
- < 0: if SP_IENV = -k, the k-th argument had an illegal value.
-
+
+    Purpose   
+    =======   
+
+    sp_ienv() is inquired to choose machine-dependent parameters for the
+    local environment. See ISPEC for a description of the parameters.   
+
+    This version provides a set of parameters which should give good,   
+    but not optimal, performance on many of the currently available   
+    computers.  Users are encouraged to modify this subroutine to set   
+    the tuning parameters for their particular machine using the option   
+    and problem size information in the arguments.   
+
+    Arguments   
+    =========   
+
+    ISPEC   (input) int
+            Specifies the parameter to be returned as the value of SP_IENV.   
+            = 1: the panel size w; a panel consists of w consecutive
+                 columns of matrix A in the process of Gaussian elimination.
+                 The best value depends on machine's cache characters.
+            = 2: the relaxation parameter relax; if the number of
+                 nodes (columns) in a subtree of the elimination tree is less
+                 than relax, this subtree is considered as one supernode,
+                 regardless of their row structures.
+            = 3: the maximum size for a supernode in complete LU;
+            = 4: the minimum row dimension for 2-D blocking to be used;
+            = 5: the minimum column dimension for 2-D blocking to be used;
+            = 6: the estimated fills factor for L and U, compared with A;
+            = 7: the maximum size for a supernode in ILU.
+
+   (SP_IENV) (output) int
+            >= 0: the value of the parameter specified by ISPEC   
+            < 0:  if SP_IENV = -k, the k-th argument had an illegal value. 
+
+    ===================================================================== 
+
Here is the call graph for this function:
- +
diff --git a/DOC/html/SRC_2sp__ienv_8c.html b/DOC/html/SRC_2sp__ienv_8c.html index 339fad1d..d7f1ae45 100644 --- a/DOC/html/SRC_2sp__ienv_8c.html +++ b/DOC/html/SRC_2sp__ienv_8c.html @@ -45,7 +45,7 @@
Functions
-
sp_ienv.c File Reference
+
sp_ienv.c File Reference
Common
@@ -68,10 +68,7 @@  

Detailed Description

-

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

-

All rights reserved.

-

The source code is distributed under BSD license, see the file License.txt at the top-level directory.

-
+
 -- SuperLU routine (version 4.1) --
 Univ. of California Berkeley, Xerox Palo Alto Research Center,
 and Lawrence Berkeley National Lab.
diff --git a/DOC/html/annotated.html b/DOC/html/annotated.html
index 2f379306..59778d62 100644
--- a/DOC/html/annotated.html
+++ b/DOC/html/annotated.html
@@ -46,21 +46,21 @@
 
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/DOC/html/ccolumn__bmod_8c.html b/DOC/html/ccolumn__bmod_8c.html
index f360db0b..64368a77 100644
--- a/DOC/html/ccolumn__bmod_8c.html
+++ b/DOC/html/ccolumn__bmod_8c.html
@@ -59,28 +59,28 @@
 

 

 
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
 
 

 
 CColamd_Col_struct

 
 CColamd_Row_struct
 Ccomplex
 CDNformat
 Cdoublecomplex
 Ce_nodeHeaders for 4 types of dynamatically managed memory 
 Cfactors_t
 CGlobalLU_t
 CLU_stack_t
 Cmem_usage_t
 CNCformat
 CNCPformat
 CNRformat
 CNRformat_loc
 CNRformat_loc3d
 CSCformat
 CSCPformat
 CDNformat
 Cdoublecomplex
 Ce_nodeHeaders for 4 types of dynamatically managed memory 
 Cfactors_t
 CGlobalLU_t
 CLU_stack_t
 Cmem_usage_t
 CNCformat
 CNCPformat
 CNRformat
 CNRformat_loc
 CNRformat_loc3d
 CSCformat
 CSCPformat
 Csinglecomplex

 
 Csuperlu_options_t

 
 CSuperLUStat_t

 
 CSuperMatrix

 

-
-
+
+

 

 Functions
int ccolumn_bmod (const int jcol, const int nseg, complex *dense, complex *tempv, int *segrep, int *repfnz, int fpanelc, GlobalLU_t *Glu, SuperLUStat_t *stat)
 
int ccolumn_bmod (const int jcol, const int nseg, singlecomplex *dense, singlecomplex *tempv, int *segrep, int *repfnz, int fpanelc, GlobalLU_t *Glu, SuperLUStat_t *stat)
 

 

 
Detailed Description

 
Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -103,8 +103,8 @@
  granted, provided the above notices are retained, and a notice that
  the code was modified is included with the above copyright notice.
 
 
Function Documentation

-
-
◆ ccolumn_bmod()

+
+
◆ ccolumn_bmod()

 
 

 

@@ -124,13 +124,13 @@ 

           
-          complex * 
+          singlecomplex * 
           dense, 
         
         
           
           
-          complex * 
+          singlecomplex * 
           tempv, 
         
         
@@ -181,20 +181,20 @@ 

 Here is the call graph for this function:

 

-

-
+

+
 
-
-
+
+
 
-
-
+
+
 
 
-
-
-
-
+
+
+
+
 
 

 
diff --git a/DOC/html/ccolumn__dfs_8c.html b/DOC/html/ccolumn__dfs_8c.html
index b11150e3..40ebc523 100644
--- a/DOC/html/ccolumn__dfs_8c.html
+++ b/DOC/html/ccolumn__dfs_8c.html
@@ -62,17 +62,17 @@
 
 
 
-
-
-
-
-
-
-
+
+
+
+
+
+
+
 
-
-
-
+
+
+
@@ -84,7 +84,7 @@
- +

Functions

int ccolumn_dfs (const int m, const int jcol, int *perm_r, int *nseg, int *lsub_col, int *segrep, int *repfnz, int_t *xprune, int *marker, int *parent, int_t *xplore, GlobalLU_t *Glu)
int ccolumn_dfs (const int m, const int jcol, int *perm_r, int *nseg, int *lsub_col, int *segrep, int *repfnz, int_t *xprune, int *marker, int *parent, int_t *xplore, GlobalLU_t *Glu)
 

Detailed Description

@@ -174,7 +174,7 @@

- int_t *  + int_t *  xprune, @@ -192,7 +192,7 @@

- int_t *  + int_t *  xplore, @@ -246,13 +246,13 @@

- + - - - - + + + +

diff --git a/DOC/html/ccopy__to__ucol_8c.html b/DOC/html/ccopy__to__ucol_8c.html index 459a5017..70a24637 100644 --- a/DOC/html/ccopy__to__ucol_8c.html +++ b/DOC/html/ccopy__to__ucol_8c.html @@ -61,24 +61,24 @@ - - - - - - - + + + + + + + - - - + + +

- - + +

Functions

int ccopy_to_ucol (int jcol, int nseg, int *segrep, int *repfnz, int *perm_r, complex *dense, GlobalLU_t *Glu)
 
int ccopy_to_ucol (int jcol, int nseg, int *segrep, int *repfnz, int *perm_r, singlecomplex *dense, GlobalLU_t *Glu)
 

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -100,8 +100,8 @@ granted, provided the above notices are retained, and a notice that the code was modified is included with the above copyright notice.

Function Documentation

- -

◆ ccopy_to_ucol()

+ +

◆ ccopy_to_ucol()

@@ -139,7 +139,7 @@

- complex *  + singlecomplex *  dense, @@ -158,16 +158,16 @@

Here is the call graph for this function:

-
- +
+ - - - - + + + +
diff --git a/DOC/html/cdiagonal_8c.html b/DOC/html/cdiagonal_8c.html index f50ea5d9..2340148b 100644 --- a/DOC/html/cdiagonal_8c.html +++ b/DOC/html/cdiagonal_8c.html @@ -61,17 +61,17 @@ - - - - - - - + + + + + + + - - - + + +
@@ -122,8 +122,8 @@

- - + + diff --git a/DOC/html/cfgmr_8c.html b/DOC/html/cfgmr_8c.html index 8a8940f7..42bb99e9 100644 --- a/DOC/html/cfgmr_8c.html +++ b/DOC/html/cfgmr_8c.html @@ -62,17 +62,17 @@ - - - - - - - + + + + + + + - - - + + +

@@ -83,13 +83,13 @@
- - - - - - - + + + + + + +

Functions

void cdotc_ (complex *, int *, complex[], int *, complex[], int *)
 
float scnrm2_ (int *, complex[], int *)
 
int cfgmr (int n, void(*cmatvec)(complex, complex[], complex, complex[]), void(*cpsolve)(int, complex[], complex[]), complex *rhs, complex *sol, double tol, int im, int *itmax, FILE *fits)
 Simple version of the ARMS preconditioned FGMRES algorithm. More...
 
void cdotc_ (singlecomplex *, int *, singlecomplex[], int *, singlecomplex[], int *)
 
float scnrm2_ (int *, singlecomplex[], int *)
 
int cfgmr (int n, void(*cmatvec)(singlecomplex, singlecomplex[], singlecomplex, singlecomplex[]), void(*cpsolve)(int, singlecomplex[], singlecomplex[]), singlecomplex *rhs, singlecomplex *sol, double tol, int im, int *itmax, FILE *fits)
 Simple version of the ARMS preconditioned FGMRES algorithm. More...
 

Macro Definition Documentation

 @@ -107,8 +107,8 @@

Function Documentation

- -

◆ cdotc_()

+ +

◆ cdotc_()

@@ -116,7 +116,7 @@

void cdotc_ ( - complex *  + singlecomplex *  , @@ -128,7 +128,7 @@

- complex  + singlecomplex  [], @@ -140,7 +140,7 @@

- complex  + singlecomplex  [], @@ -159,8 +159,8 @@

-

◆ cfgmr()

+ +

◆ cfgmr()

@@ -174,25 +174,25 @@

- void(*)(complex, complex[], complex, complex[])  + void(*)(singlecomplex, singlecomplex[], singlecomplex, singlecomplex[])  cmatvec, - void(*)(int, complex[], complex[])  + void(*)(int, singlecomplex[], singlecomplex[])  cpsolve, - complex *  + singlecomplex *  rhs, - complex *  + singlecomplex *  sol, @@ -246,65 +246,65 @@

Here is the call graph for this function:

-
- +
+ - - - - - - - - - + + + + + + + + + - + - + - + - - - + + + - - - - - - + + + + + + - - - - - - - + + + + + + + - - - + + +

- -

◆ scnrm2_()

+ +

◆ scnrm2_()

@@ -318,7 +318,7 @@

- complex  + singlecomplex  [], diff --git a/DOC/html/cgscon_8c.html b/DOC/html/cgscon_8c.html index 09a30371..0be68aff 100644 --- a/DOC/html/cgscon_8c.html +++ b/DOC/html/cgscon_8c.html @@ -58,21 +58,21 @@
- - - - - - - - - - - - - - - + + + + + + + + + + + + + + +

@@ -200,21 +200,21 @@

- + - - - - - - + + + + + + - - - - - - + + + + + + diff --git a/DOC/html/cgsequ_8c.html b/DOC/html/cgsequ_8c.html index 9072b184..4db49e67 100644 --- a/DOC/html/cgsequ_8c.html +++ b/DOC/html/cgsequ_8c.html @@ -58,21 +58,21 @@
- - - - - - - - - - - - - - - + + + + + + + + + + + + + + +

@@ -211,7 +211,7 @@

- + diff --git a/DOC/html/cgsisx_8c.html b/DOC/html/cgsisx_8c.html index 523b199d..f155a1d8 100644 --- a/DOC/html/cgsisx_8c.html +++ b/DOC/html/cgsisx_8c.html @@ -61,23 +61,23 @@ - - - - - - - + + + + + + + - - - + + +

- +

Functions

void cgsisx (superlu_options_t *options, SuperMatrix *A, int *perm_c, int *perm_r, int *etree, char *equed, float *R, float *C, SuperMatrix *L, SuperMatrix *U, void *work, int_t lwork, SuperMatrix *B, SuperMatrix *X, float *recip_pivot_growth, float *rcond, GlobalLU_t *Glu, mem_usage_t *mem_usage, SuperLUStat_t *stat, int_t *info)
void cgsisx (superlu_options_t *options, SuperMatrix *A, int *perm_c, int *perm_r, int *etree, char *equed, float *R, float *C, SuperMatrix *L, SuperMatrix *U, void *work, int_t lwork, SuperMatrix *B, SuperMatrix *X, float *recip_pivot_growth, float *rcond, GlobalLU_t *Glu, mem_usage_t *mem_usage, SuperLUStat_t *stat, int_t *info)
 

Detailed Description

@@ -165,7 +165,7 @@

- int_t  + int_t  lwork, @@ -213,7 +213,7 @@

- int_t *  + int_t *  info  @@ -251,7 +251,7 @@

sp_preorder.c. + For more details of this step, see sp_preorder.c. 1.3. If options->Fact != FACTORED, the LU decomposition is used to factor the matrix A (after equilibration if options->Equil = YES) @@ -362,7 +362,7 @@

sp_preorder.c. + For more details of this step, see sp_preorder.c. 2.3. If options->Fact != FACTORED, the LU decomposition is used to factor the transpose(A) (after equilibration if @@ -607,55 +607,55 @@

- + - + - + - - - + + + - - - - - - - + + + + + + + - - + + - - - - - + + + + + - + - - + + - +
diff --git a/DOC/html/cgsitrf_8c.html b/DOC/html/cgsitrf_8c.html index ba1bc1be..0b15d3d7 100644 --- a/DOC/html/cgsitrf_8c.html +++ b/DOC/html/cgsitrf_8c.html @@ -61,23 +61,23 @@ - - - - - - - + + + + + + + - - - + + + - +

Functions

void cgsitrf (superlu_options_t *options, SuperMatrix *A, int relax, int panel_size, int *etree, void *work, int_t lwork, int *perm_c, int *perm_r, SuperMatrix *L, SuperMatrix *U, GlobalLU_t *Glu, SuperLUStat_t *stat, int_t *info)
void cgsitrf (superlu_options_t *options, SuperMatrix *A, int relax, int panel_size, int *etree, void *work, int_t lwork, int *perm_c, int *perm_r, SuperMatrix *L, SuperMatrix *U, GlobalLU_t *Glu, SuperLUStat_t *stat, int_t *info)
 

Detailed Description

@@ -135,7 +135,7 @@

- int_t  + int_t  lwork, @@ -177,7 +177,7 @@

- int_t *  + int_t *  info  @@ -345,54 +345,54 @@

- - + + - - - - + + + + - - - - - + + + + + - + - - + + - - - - + + + + - - - - - + + + + + - - + + - - - + + + diff --git a/DOC/html/cgsrfs_8c.html b/DOC/html/cgsrfs_8c.html index 42b306a9..17b97742 100644 --- a/DOC/html/cgsrfs_8c.html +++ b/DOC/html/cgsrfs_8c.html @@ -59,21 +59,21 @@
- - - - - - - - - - - - - - - + + + + + + + + + + + + + + +
@@ -328,30 +328,30 @@

- - - - + + + + - + - + - - - - - - - - - - - - - - + + + + + + + + + + + + + + diff --git a/DOC/html/cgssv_8c.html b/DOC/html/cgssv_8c.html index 6cf1e4c1..7dbb64b0 100644 --- a/DOC/html/cgssv_8c.html +++ b/DOC/html/cgssv_8c.html @@ -61,23 +61,23 @@ - - - - - - - + + + + + + + - - - + + +

- +

Functions

void cgssv (superlu_options_t *options, SuperMatrix *A, int *perm_c, int *perm_r, SuperMatrix *L, SuperMatrix *U, SuperMatrix *B, SuperLUStat_t *stat, int_t *info)
void cgssv (superlu_options_t *options, SuperMatrix *A, int *perm_c, int *perm_r, SuperMatrix *L, SuperMatrix *U, SuperMatrix *B, SuperLUStat_t *stat, int_t *info)
 Driver routines. More...
 
@@ -148,7 +148,7 @@

- int_t *  + int_t *  info  @@ -169,7 +169,7 @@

sp_preorder.c. + see sp_preorder.c. 1.2. Factor A as Pr*A*Pc=L*U with the permutation Pr determined by Gaussian elimination with partial pivoting. @@ -184,7 +184,7 @@

sp_preorder.c. + For more details of this step, see sp_preorder.c. 2.2. Factor A as Pr*transpose(A)*Pc=L*U with the permutation Pr determined by Gaussian elimination with partial pivoting. @@ -277,55 +277,55 @@

- + - + - - - + + + - + - - - + + + - + - - + + - - + + - + - - - - - - - - - - - + + + + + + + + + + + - - - + + + diff --git a/DOC/html/cgssvx_8c.html b/DOC/html/cgssvx_8c.html index 5498ba7f..db927337 100644 --- a/DOC/html/cgssvx_8c.html +++ b/DOC/html/cgssvx_8c.html @@ -61,23 +61,23 @@ - - - - - - - + + + + + + + - - - + + + - +

Functions

void cgssvx (superlu_options_t *options, SuperMatrix *A, int *perm_c, int *perm_r, int *etree, char *equed, float *R, float *C, SuperMatrix *L, SuperMatrix *U, void *work, int_t lwork, SuperMatrix *B, SuperMatrix *X, float *recip_pivot_growth, float *rcond, float *ferr, float *berr, GlobalLU_t *Glu, mem_usage_t *mem_usage, SuperLUStat_t *stat, int_t *info)
void cgssvx (superlu_options_t *options, SuperMatrix *A, int *perm_c, int *perm_r, int *etree, char *equed, float *R, float *C, SuperMatrix *L, SuperMatrix *U, void *work, int_t lwork, SuperMatrix *B, SuperMatrix *X, float *recip_pivot_growth, float *rcond, float *ferr, float *berr, GlobalLU_t *Glu, mem_usage_t *mem_usage, SuperLUStat_t *stat, int_t *info)
 

Detailed Description

@@ -165,7 +165,7 @@

- int_t  + int_t  lwork, @@ -225,7 +225,7 @@

- int_t *  + int_t *  info  @@ -262,7 +262,7 @@

sp_preorder.c. + For more details of this step, see sp_preorder.c. 1.3. If options->Fact != FACTORED, the LU decomposition is used to factor the matrix A (after equilibration if options->Equil = YES) @@ -309,7 +309,7 @@

sp_preorder.c. + For more details of this step, see sp_preorder.c. 2.3. If options->Fact != FACTORED, the LU decomposition is used to factor the transpose(A) (after equilibration if @@ -572,7 +572,7 @@

- + @@ -580,44 +580,44 @@

- + - - - + + + - - - - - - - - + + + + + + + + - - + + - - - + + + - + - - + + - - + + - + diff --git a/DOC/html/cgstrf_8c.html b/DOC/html/cgstrf_8c.html index 8e2919eb..6235b537 100644 --- a/DOC/html/cgstrf_8c.html +++ b/DOC/html/cgstrf_8c.html @@ -61,23 +61,23 @@ - - - - - - - + + + + + + + - - - + + + - +

Functions

void cgstrf (superlu_options_t *options, SuperMatrix *A, int relax, int panel_size, int *etree, void *work, int_t lwork, int *perm_c, int *perm_r, SuperMatrix *L, SuperMatrix *U, GlobalLU_t *Glu, SuperLUStat_t *stat, int_t *info)
void cgstrf (superlu_options_t *options, SuperMatrix *A, int relax, int panel_size, int *etree, void *work, int_t lwork, int *perm_c, int *perm_r, SuperMatrix *L, SuperMatrix *U, GlobalLU_t *Glu, SuperLUStat_t *stat, int_t *info)
 

Detailed Description

@@ -146,7 +146,7 @@

- int_t  + int_t  lwork, @@ -188,7 +188,7 @@

- int_t *  + int_t *  info  @@ -345,7 +345,7 @@

cpanel_dfs(), and are + the panel diagonal. These are filled in during cpanel_dfs(), and are used later in the inner LU factorization within the panel. panel_lsub[]/dense[] pair forms the SPA data structure. NOTE: There are W of them. @@ -361,50 +361,50 @@

- + - - - - - + + + + + - + - - + + - - + + - + - - - - + + + + - - - - - - + + + + + + - - - + + + diff --git a/DOC/html/cgstrs_8c.html b/DOC/html/cgstrs_8c.html index 65b683e5..21b72f17 100644 --- a/DOC/html/cgstrs_8c.html +++ b/DOC/html/cgstrs_8c.html @@ -61,17 +61,17 @@ - - - - - - - + + + + + + + - - - + + + @@ -79,8 +79,8 @@ Functions - - + +
void cgstrs (trans_t trans, SuperMatrix *L, SuperMatrix *U, int *perm_c, int *perm_r, SuperMatrix *B, SuperLUStat_t *stat, int *info)
 
void cprint_soln (int n, int nrhs, complex *soln)
 
void cprint_soln (int n, int nrhs, singlecomplex *soln)
 

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -220,26 +220,26 @@

- - - - - - - - - + + + + + + + + + - - - + + + - -

◆ cprint_soln()

+ +

◆ cprint_soln()

@@ -259,7 +259,7 @@

- complex *  + singlecomplex *  soln  diff --git a/DOC/html/citersol1_8c.html b/DOC/html/citersol1_8c.html index c2c79e7f..7cfb7669 100644 --- a/DOC/html/citersol1_8c.html +++ b/DOC/html/citersol1_8c.html @@ -62,28 +62,28 @@ - - - - - - - + + + + + + + - - - + + +

- - - - - - + + + + + +

Functions

void cpsolve (int n, complex x[], complex y[])
 Performs cgsisx with original matrix A. More...
 
void cmatvec_mult (complex alpha, complex x[], complex beta, complex y[])
 Performs matrix-vector multipliation sp_cgemv with original matrix A. More...
 
void cpsolve (int n, singlecomplex x[], singlecomplex y[])
 Performs cgsisx with original matrix A. More...
 
void cmatvec_mult (singlecomplex alpha, singlecomplex x[], singlecomplex beta, singlecomplex y[])
 Performs matrix-vector multipliation sp_cgemv with original matrix A. More...
 
int main (int argc, char *argv[])
 
@@ -119,8 +119,8 @@

Note that CGSISX performs the following factorization: Pr*Dr*A*Dc*Pc^T ~= LU with Pr being obtained from MC64 statically then partial pivoting dynamically. On return, A is overwritten as A1 = Dr*A*Dc.

We need to save a copy of the original matrix A, then solve the original system, A*x = B, using FGMRES. Each GMRES step requires requires 2 procedures: 1) Apply preconditioner M^{-1} = Dc*Pc^T*U^{-1}*L^{-1}*Pr*Dr 2) Matrix-vector multiplication: w = A*v

Function Documentation

- -

◆ cmatvec_mult()

+ +

◆ cmatvec_mult()

@@ -128,25 +128,25 @@

void cmatvec_mult

- + - + - + - + @@ -169,18 +169,18 @@

Here is the call graph for this function:
-
- +
+ - +
- -

◆ cpsolve()

+ +

◆ cpsolve()

@@ -194,13 +194,13 @@

- + - + @@ -222,58 +222,58 @@

Here is the call graph for this function:
-
- +
+ - + - + - + - + - - - + + + - - - - - - - - - + + + + + + + + + - - - - - - - + + + + + + + - + - - - - - - + + + + + +
@@ -310,55 +310,55 @@

- - - - - - + + + + + + - + - - - - - - - - - - + + + + + + + + + + - - - - - - - - - - + + + + + + + + + + - + - + - - + + - + diff --git a/DOC/html/citersol_8c.html b/DOC/html/citersol_8c.html index e22b484d..b2aca0a4 100644 --- a/DOC/html/citersol_8c.html +++ b/DOC/html/citersol_8c.html @@ -62,28 +62,28 @@ - - - - - - - + + + + + + + - - - + + +

(complex singlecomplex  alpha,
complex singlecomplex  x[],
complex singlecomplex  beta,
complex singlecomplex  y[] 
complex singlecomplex  x[],
complex singlecomplex  y[] 
- - - - - - + + + + + +

Functions

void cpsolve (int n, complex x[], complex y[])
 Performs cgsisx with original matrix A. More...
 
void cmatvec_mult (complex alpha, complex x[], complex beta, complex y[])
 Performs matrix-vector multipliation sp_cgemv with original matrix A. More...
 
void cpsolve (int n, singlecomplex x[], singlecomplex y[])
 Performs cgsisx with original matrix A. More...
 
void cmatvec_mult (singlecomplex alpha, singlecomplex x[], singlecomplex beta, singlecomplex y[])
 Performs matrix-vector multipliation sp_cgemv with original matrix A. More...
 
int main (int argc, char *argv[])
 
@@ -115,8 +115,8 @@

Note that CGSISX performs the following factorization: Pr*Dr*A*Dc*Pc^T ~= LU with Pr being obtained from MC64 statically then partial pivoting dynamically. On return, A is overwritten as A1 = Dr*A*Dc.

We can solve the transformed system, A1*y = Dr*B, using FGMRES. B is first overwritten as Dr*B. Then GMRES step requires requires 2 procedures: 1) Apply preconditioner M^{-1} = Pc^T*U^{-1}*L^{-1}*Pr 2) Matrix-vector multiplication: w = A1*v

Function Documentation

- -

◆ cmatvec_mult()

+ +

◆ cmatvec_mult()

@@ -124,25 +124,25 @@

void cmatvec_mult

- + - + - + - + @@ -165,18 +165,18 @@

Here is the call graph for this function:
-
- +
+ - +
- -

◆ cpsolve()

+ +

◆ cpsolve()

@@ -190,13 +190,13 @@

- + - + @@ -218,58 +218,58 @@

Here is the call graph for this function:
-
- +
+ - + - + - + - - - + + + - - - - - - - - - + + + + + + + + + - - - - - - - + + + + + + + - + - - - - - - + + + + + +
@@ -306,37 +306,37 @@

- - - - - - - + + + + + + + - + - - - - - - - - - + + + + + + + + + - - - - - - - - - + + + + + + + + + @@ -344,17 +344,17 @@

- + - + - - + + - - + + diff --git a/DOC/html/clangs_8c.html b/DOC/html/clangs_8c.html index c3bec099..961b6a61 100644 --- a/DOC/html/clangs_8c.html +++ b/DOC/html/clangs_8c.html @@ -58,21 +58,21 @@
- - - - - - - - - - - - - - - + + + + + + + + + + + + + + +

(complex singlecomplex  alpha,
complex singlecomplex  x[],
complex singlecomplex  beta,
complex singlecomplex  y[] 
complex singlecomplex  x[],
complex singlecomplex  y[] 
@@ -159,7 +159,7 @@

- + diff --git a/DOC/html/claqgs_8c.html b/DOC/html/claqgs_8c.html index d353ea39..ac8786b1 100644 --- a/DOC/html/claqgs_8c.html +++ b/DOC/html/claqgs_8c.html @@ -59,21 +59,21 @@
- - - - - - - - - - - - - - - + + + + + + + + + + + + + + +

diff --git a/DOC/html/cldperm_8c.html b/DOC/html/cldperm_8c.html index fac9cc0d..465f4955 100644 --- a/DOC/html/cldperm_8c.html +++ b/DOC/html/cldperm_8c.html @@ -61,28 +61,28 @@ - - - - - - - + + + + + + + - - - + + +
- + - + - - + +

Functions

int_t mc64id_ (int_t *)
int_t mc64id_ (int_t *)
 
int_t mc64ad_ (int_t *job, int_t *n, int_t *ne, int_t *ip, int_t *irn, double *a, int_t *num, int *cperm, int_t *liw, int_t *iw, int_t *ldw, double *dw, int_t *icntl, int_t *info)
int_t mc64ad_ (int_t *job, int_t *n, int_t *ne, int_t *ip, int_t *irn, double *a, int_t *num, int *cperm, int_t *liw, int_t *iw, int_t *ldw, double *dw, int_t *icntl, int_t *info)
 
int cldperm (int job, int n, int_t nnz, int_t colptr[], int_t adjncy[], complex nzval[], int *perm, float u[], float v[])
 
int cldperm (int job, int n, int_t nnz, int_t colptr[], int_t adjncy[], singlecomplex nzval[], int *perm, float u[], float v[])
 

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -93,8 +93,8 @@ Lawrence Berkeley National Laboratory. June 30, 2009

Function Documentation

- -

◆ cldperm()

+ +

◆ cldperm()

@@ -114,25 +114,25 @@

- int_t  + int_t  nnz, - int_t  + int_t  colptr[], - int_t  + int_t  adjncy[], - complex  + singlecomplex  nzval[], @@ -205,7 +205,7 @@

Here is the call graph for this function:

-
- +
+ - + - + @@ -254,33 +254,33 @@

- + - + - + - + - + - + @@ -292,7 +292,7 @@

- + @@ -304,19 +304,19 @@

- + - + - + @@ -328,13 +328,13 @@

- + - + @@ -373,9 +373,9 @@

int_t mc64ad_ int_t mc64ad_ (int_t * int_t *  job,
int_t * int_t *  n,
int_t * int_t *  ne,
int_t * int_t *  ip,
int_t * int_t *  irn,
int_t * int_t *  num,
int_t * int_t *  liw,
int_t * int_t *  iw,
int_t * int_t *  ldw,
int_t * int_t *  icntl,
int_t * int_t *  info 
- + - + diff --git a/DOC/html/clinsol1_8c.html b/DOC/html/clinsol1_8c.html index 5aa671a1..0e83af13 100644 --- a/DOC/html/clinsol1_8c.html +++ b/DOC/html/clinsol1_8c.html @@ -61,17 +61,17 @@ - - - - - - - + + + + + + + - - - + + +
int_t mc64id_ int_t mc64id_ (int_t * int_t *  icntl)
@@ -112,53 +112,53 @@

- - - - + + + + - - - + + + - - - + + + - - - - - + + + + + - + - - + + - + - - - - + + + + - - + + - - + + - - + + diff --git a/DOC/html/clinsol_8c.html b/DOC/html/clinsol_8c.html index 71917513..8a9d8b41 100644 --- a/DOC/html/clinsol_8c.html +++ b/DOC/html/clinsol_8c.html @@ -61,17 +61,17 @@ - - - - - - - + + + + + + + - - - + + +

@@ -112,53 +112,53 @@

- - - - + + + + - - - + + + - - - + + + - - - - - + + + + + - + - - + + - + - - - - + + + + - - + + - - + + - - + + diff --git a/DOC/html/clinsolx1_8c.html b/DOC/html/clinsolx1_8c.html index e0abc621..b75eb9ca 100644 --- a/DOC/html/clinsolx1_8c.html +++ b/DOC/html/clinsolx1_8c.html @@ -63,27 +63,27 @@ - - - - - - - + + + + + + + - - - + + +

- - + +

Functions

int main (int argc, char *argv[])
 
void parse_command_line (int argc, char *argv[], int *lwork, float *u, yes_no_t *equil, trans_t *trans)
 Parse command line options to get relaxed snode size, panel size, etc. More...
 
int main (int argc, char *argv[])
 

Function Documentation

 @@ -117,24 +117,24 @@

- - - - + + + + - + - - - - + + + + - - - - - + + + + + @@ -142,28 +142,28 @@

- + - - + + - - - - - - - - + + + + + + + + - - + + diff --git a/DOC/html/clinsolx2_8c.html b/DOC/html/clinsolx2_8c.html index dd412411..d7a5f5bf 100644 --- a/DOC/html/clinsolx2_8c.html +++ b/DOC/html/clinsolx2_8c.html @@ -63,27 +63,27 @@ - - - - - - - + + + + + + + - - - + + +

+ + + - - -

Functions

void parse_command_line (int argc, char *argv[], int *lwork, float *u, yes_no_t *equil, trans_t *trans)
 Parse command line options to get relaxed snode size, panel size, etc. More...
 
int main (int argc, char *argv[])
 
void parse_command_line (int argc, char *argv[], int *lwork, double *u, yes_no_t *equil, trans_t *trans)
 Parse command line options to get relaxed snode size, panel size, etc. More...
 

Function Documentation

 @@ -119,25 +119,25 @@

- - - - + + + + - + - - - - - + + + + + - - - - - + + + + + @@ -145,27 +145,27 @@

- + - - - + + + - - - - - - + + + + + + - - + + @@ -173,8 +173,8 @@

-

◆ parse_command_line()

+ +

◆ parse_command_line()

@@ -200,7 +200,7 @@

- double *  + float *  u, diff --git a/DOC/html/clinsolx_8c.html b/DOC/html/clinsolx_8c.html index da7c5d6b..01edf113 100644 --- a/DOC/html/clinsolx_8c.html +++ b/DOC/html/clinsolx_8c.html @@ -63,27 +63,27 @@ - - - - - - - + + + + + + + - - - + + +

- - + +

Functions

int main (int argc, char *argv[])
 
void parse_command_line (int argc, char *argv[], int *lwork, float *u, yes_no_t *equil, trans_t *trans)
 Parse command line inputs. More...
 
int main (int argc, char *argv[])
 

Function Documentation

 @@ -117,24 +117,24 @@

- - - - + + + + - + - - - - + + + + - - - - - + + + + + @@ -142,28 +142,28 @@

- + - - + + - - - - - - - - + + + + + + + + - - + + @@ -220,6 +220,7 @@

+

Parse command line options to get relaxed snode size, panel size, etc.

diff --git a/DOC/html/cmemory_8c.html b/DOC/html/cmemory_8c.html index 5e7646a1..f80581e9 100644 --- a/DOC/html/cmemory_8c.html +++ b/DOC/html/cmemory_8c.html @@ -62,17 +62,17 @@ - - - - - - - + + + + + + + - - - + + + @@ -91,18 +91,18 @@
- + - - - - - + + + + + - + @@ -117,26 +117,26 @@ - - - - - - - - - - + + + + + + + + + + - - - - - - - - + + + + + + + +

Functions

void * cexpand (int_t *prev_len, MemType type, int_t len_to_copy, int keep_prev, GlobalLU_t *Glu)
void * cexpand (int_t *prev_len, MemType type, int_t len_to_copy, int keep_prev, GlobalLU_t *Glu)
 Expand the existing storage to accommodate more fill-ins. More...
 
int cLUWorkInit (int m, int n, int panel_size, int **iworkptr, complex **dworkptr, GlobalLU_t *Glu)
 Allocate known working storage. Returns 0 if success, otherwise returns the number of bytes allocated so far when failure occurred. More...
 
void copy_mem_complex (int_t, void *, void *)
 
int cLUWorkInit (int m, int n, int panel_size, int **iworkptr, singlecomplex **dworkptr, GlobalLU_t *Glu)
 Allocate known working storage. Returns 0 if success, otherwise returns the number of bytes allocated so far when failure occurred. More...
 
void copy_mem_singlecomplex (int_t, void *, void *)
 
void cStackCompress (GlobalLU_t *Glu)
 Compress the work[] array to remove fragmentation. More...
 
void cSetupSpace (void *work, int_t lwork, GlobalLU_t *Glu)
void cSetupSpace (void *work, int_t lwork, GlobalLU_t *Glu)
 Setup the memory model to be used for factorization. More...
 
void * cuser_malloc (int, int, GlobalLU_t *)
 
int ilu_cQuerySpace (SuperMatrix *L, SuperMatrix *U, mem_usage_t *mem_usage)
 
int_t cLUMemInit (fact_t fact, void *work, int_t lwork, int m, int n, int_t annz, int panel_size, float fill_ratio, SuperMatrix *L, SuperMatrix *U, GlobalLU_t *Glu, int **iwork, complex **dwork)
 Allocate storage for the data structures common to all factor routines. More...
 
void cSetRWork (int m, int panel_size, complex *dworkptr, complex **dense, complex **tempv)
 Set up pointers for real working arrays. More...
 
void cLUWorkFree (int *iwork, complex *dwork, GlobalLU_t *Glu)
 Free the working storage used by factor routines. More...
 
int_t cLUMemXpand (int jcol, int_t next, MemType mem_type, int_t *maxlen, GlobalLU_t *Glu)
int_t cLUMemInit (fact_t fact, void *work, int_t lwork, int m, int n, int_t annz, int panel_size, float fill_ratio, SuperMatrix *L, SuperMatrix *U, GlobalLU_t *Glu, int **iwork, singlecomplex **dwork)
 Allocate storage for the data structures common to all factor routines. More...
 
void cSetRWork (int m, int panel_size, singlecomplex *dworkptr, singlecomplex **dense, singlecomplex **tempv)
 Set up pointers for real working arrays. More...
 
void cLUWorkFree (int *iwork, singlecomplex *dwork, GlobalLU_t *Glu)
 Free the working storage used by factor routines. More...
 
int_t cLUMemXpand (int jcol, int_t next, MemType mem_type, int_t *maxlen, GlobalLU_t *Glu)
 Expand the data structures for L and U during the factorization. More...
 
void callocateA (int n, int_t nnz, complex **a, int_t **asub, int_t **xa)
 Allocate storage for original matrix A. More...
 
complex * complexMalloc (size_t n)
 
complex * complexCalloc (size_t n)
 
int_t cmemory_usage (const int_t nzlmax, const int_t nzumax, const int_t nzlumax, const int n)
void callocateA (int n, int_t nnz, singlecomplex **a, int_t **asub, int_t **xa)
 Allocate storage for original matrix A. More...
 
singlecomplex * complexMalloc (size_t n)
 
singlecomplex * complexCalloc (size_t n)
 
int_t cmemory_usage (const int_t nzlmax, const int_t nzumax, const int_t nzlumax, const int n)
 

Detailed Description

@@ -246,15 +246,15 @@

Value:
( (2*w + 4 + NO_MARKER) * m * sizeof(int) + \
-
(w + 1) * m * sizeof(complex) )
+
(w + 1) * m * sizeof(singlecomplex) )
NO_MARKER
#define NO_MARKER
Definition: slu_util.h:57
-
complex
Definition: slu_scomplex.h:31
+
singlecomplex
Definition: slu_scomplex.h:31

Function Documentation

- -

◆ callocateA()

+ +

◆ callocateA()

@@ -268,25 +268,25 @@

- int_t  + int_t  nnz, - complex **  + singlecomplex **  a, - int_t **  + int_t **  asub, - int_t **  + int_t **  xa  @@ -299,10 +299,10 @@

Here is the call graph for this function:

-
- +
+ - +
@@ -318,7 +318,7 @@

void * cexpand ( - int_t *  + int_t *  prev_len, @@ -330,7 +330,7 @@

- int_t  + int_t  len_to_copy, @@ -358,23 +358,23 @@

- - - - + + + + - -

◆ cLUMemInit()

+ +

◆ cLUMemInit()

- + @@ -388,7 +388,7 @@

- + @@ -406,7 +406,7 @@

- + @@ -448,7 +448,7 @@

- + @@ -468,23 +468,23 @@

Here is the call graph for this function:
-
- +
+ - - + + - - - - - - + + + + + +
@@ -497,7 +497,7 @@

int_t cLUMemInit int_t cLUMemInit ( fact_t  fact, int_t int_t  lwork,
int_t int_t  annz,
complex ** singlecomplex **  dwork 
- + @@ -505,7 +505,7 @@

- + @@ -517,7 +517,7 @@

- + @@ -544,17 +544,17 @@

- - - - + + + + - -

◆ cLUWorkFree()

+ +

◆ cLUWorkFree()

@@ -568,7 +568,7 @@

- + @@ -587,8 +587,8 @@

-

◆ cLUWorkInit()

+ +

◆ cLUWorkInit()

@@ -620,7 +620,7 @@

- + @@ -639,12 +639,12 @@

Here is the call graph for this function:
-
- +
+ - +
@@ -658,21 +658,21 @@

int_t cLUMemXpand int_t cLUMemXpand ( int  jcol, int_t int_t  next,
int_t * int_t *  maxlen,
complex * singlecomplex *  dwork,
complex ** singlecomplex **  dworkptr,
- + - + - + - + @@ -691,14 +691,14 @@

-

◆ complexCalloc()

+ +

◆ complexCalloc()

int_t cmemory_usage int_t cmemory_usage (const int_t const int_t  nzlmax,
const int_t const int_t  nzumax,
const int_t const int_t  nzlumax,
- + @@ -709,14 +709,14 @@

-

◆ complexMalloc()

+ +

◆ complexMalloc()

complex * complexCalloc singlecomplex * complexCalloc ( size_t  n)
- + @@ -727,16 +727,16 @@

-

◆ copy_mem_complex()

+ +

◆ copy_mem_int()

complex * complexMalloc singlecomplex * complexMalloc ( size_t  n)
- + - + @@ -761,29 +761,29 @@

-

◆ copy_mem_int()

+ +

◆ copy_mem_singlecomplex()

void copy_mem_complex void copy_mem_int (int_t int  howmany,
- + - - + + - + - + @@ -843,15 +843,15 @@

- + - -

◆ cSetRWork()

+ +

◆ cSetRWork()

@@ -871,19 +871,19 @@

- + - + - + @@ -896,11 +896,11 @@

Here is the call graph for this function:
-
- +
+ - - + +
@@ -922,7 +922,7 @@

- + @@ -963,8 +963,8 @@

- - + + @@ -1086,7 +1086,7 @@

- + diff --git a/DOC/html/cmyblas2_8c.html b/DOC/html/cmyblas2_8c.html index 3d472623..d2bfa086 100644 --- a/DOC/html/cmyblas2_8c.html +++ b/DOC/html/cmyblas2_8c.html @@ -64,15 +64,15 @@

void copy_mem_int void copy_mem_singlecomplex (int , int_t howmany,
void * , old,
void *  new 
complex * singlecomplex *  dworkptr,
complex ** singlecomplex **  dense,
complex ** singlecomplex **  tempv 
int_t int_t  lwork,
- - - - - - - - - + + + + + + + + +

Functions

void clsolve (int ldm, int ncol, complex *M, complex *rhs)
 Solves a dense UNIT lower triangular system. More...
 
void cusolve (int ldm, int ncol, complex *M, complex *rhs)
 Solves a dense upper triangular system. More...
 
void cmatvec (int ldm, int nrow, int ncol, complex *M, complex *vec, complex *Mxvec)
 Performs a dense matrix-vector multiply: Mxvec = Mxvec + M * vec. More...
 
void clsolve (int ldm, int ncol, singlecomplex *M, singlecomplex *rhs)
 Solves a dense UNIT lower triangular system. More...
 
void cusolve (int ldm, int ncol, singlecomplex *M, singlecomplex *rhs)
 Solves a dense upper triangular system. More...
 
void cmatvec (int ldm, int nrow, int ncol, singlecomplex *M, singlecomplex *vec, singlecomplex *Mxvec)
 Performs a dense matrix-vector multiply: Mxvec = Mxvec + M * vec. More...
 

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -89,8 +89,8 @@ Note: This is only used when the system lacks an efficient BLAS library.

Function Documentation

- -

◆ clsolve()

+ +

◆ clsolve()

@@ -110,13 +110,13 @@

- complex *  + singlecomplex *  M, - complex *  + singlecomplex *  rhs  @@ -130,8 +130,8 @@

-

◆ cmatvec()

+ +

◆ cmatvec()

@@ -157,19 +157,19 @@

- complex *  + singlecomplex *  M, - complex *  + singlecomplex *  vec, - complex *  + singlecomplex *  Mxvec  @@ -183,8 +183,8 @@

-

◆ cusolve()

+ +

◆ cusolve()

@@ -204,13 +204,13 @@

- complex *  + singlecomplex *  M, - complex *  + singlecomplex *  rhs  @@ -224,10 +224,10 @@

Here is the call graph for this function:

-
- +
+ - +
diff --git a/DOC/html/colamd_8c.html b/DOC/html/colamd_8c.html index b4ae3c5c..05ba4eb1 100644 --- a/DOC/html/colamd_8c.html +++ b/DOC/html/colamd_8c.html @@ -48,9 +48,12 @@ Macros | Typedefs | Functions
-
colamd.c File Reference
+
colamd.c File Reference
Common

+ +

Approximate minimum degree column ordering algorithm. +More...

#include <limits.h>
#include <math.h>
#include "colamd.h"
@@ -60,14 +63,13 @@
- + -
@@ -185,11 +187,7 @@
PUBLIC Int COLAMD_MAIN (Int n_row, Int n_col, Int Alen, Int A[], Int p[], double knobs[COLAMD_KNOBS], Int stats[COLAMD_STATS])
 
-

Detailed Description

-

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

-

All rights reserved.

-

The source code is distributed under BSD license, see the file License.txt at the top-level directory.

-

Macro Definition Documentation

+

Macro Definition Documentation

◆ ALIVE

diff --git a/DOC/html/colamd_8h.html b/DOC/html/colamd_8h.html index babb396e..25d61347 100644 --- a/DOC/html/colamd_8h.html +++ b/DOC/html/colamd_8h.html @@ -59,7 +59,6 @@ -
@@ -68,7 +67,7 @@
- +
@@ -77,8 +76,6 @@ - - @@ -147,23 +144,23 @@ - + - + - + - + - + - + - + - + - +

Macros

#define DLONG
 
#define COLAMD_DATE   "Oct 10, 2014"
 
#define COLAMD_VERSION_CODE(main, sub)   ((main) * 1000 + (sub))
 
#define SuiteSparse_long_id   "%" SuiteSparse_long_idd
 
#define Int   SuiteSparse_long
#define Int   int
 
#define ID   SuiteSparse_long_id
#define ID   "%d"
 
#define Int_MAX   SuiteSparse_long_max
#define Int_MAX   INT_MAX
 
#define COLAMD_recommended   colamd_l_recommended
#define COLAMD_recommended   colamd_recommended
 
#define COLAMD_set_defaults   colamd_l_set_defaults
#define COLAMD_set_defaults   colamd_set_defaults
 
#define COLAMD_MAIN   colamd_l
#define COLAMD_MAIN   colamd
 
#define SYMAMD_MAIN   symamd_l
#define SYMAMD_MAIN   symamd
 
#define COLAMD_report   colamd_l_report
#define COLAMD_report   colamd_report
 
#define SYMAMD_report   symamd_l_report
#define SYMAMD_report   symamd_report
 
- + - + @@ -193,14 +193,14 @@

Here is the call graph for this function:
-
- +
+ - - - - - + + + + +
diff --git a/DOC/html/cpanel__dfs_8c.html b/DOC/html/cpanel__dfs_8c.html index 43e328f2..9c76eb0a 100644 --- a/DOC/html/cpanel__dfs_8c.html +++ b/DOC/html/cpanel__dfs_8c.html @@ -61,24 +61,24 @@ - - - - - - - + + + + + + + - - - + + +

@@ -485,7 +482,7 @@

- +
#define COLAMD_MAIN   colamd_l#define COLAMD_MAIN   colamd
@@ -541,7 +538,7 @@

- +
#define COLAMD_recommended   colamd_l_recommended#define COLAMD_recommended   colamd_recommended

@@ -555,7 +552,7 @@

- +
#define COLAMD_report   colamd_l_report#define COLAMD_report   colamd_report

@@ -569,7 +566,7 @@

- +
#define COLAMD_set_defaults   colamd_l_set_defaults#define COLAMD_set_defaults   colamd_set_defaults

@@ -672,20 +669,6 @@

-

- - -

◆ DLONG

- -
-
- - - - -
#define DLONG
-
-
@@ -695,7 +678,7 @@

- +
#define ID   SuiteSparse_long_id#define ID   "%d"
@@ -709,7 +692,7 @@

- +
#define Int   SuiteSparse_long#define Int   int

@@ -723,7 +706,7 @@

- +
#define Int_MAX   SuiteSparse_long_max#define Int_MAX   INT_MAX

@@ -807,7 +790,7 @@

- +
#define SYMAMD_MAIN   symamd_l#define SYMAMD_MAIN   symamd

@@ -821,7 +804,7 @@

- +
#define SYMAMD_report   symamd_l_report#define SYMAMD_report   symamd_report

diff --git a/DOC/html/cpanel__bmod_8c.html b/DOC/html/cpanel__bmod_8c.html index e72ed31f..f2d68d2a 100644 --- a/DOC/html/cpanel__bmod_8c.html +++ b/DOC/html/cpanel__bmod_8c.html @@ -59,28 +59,28 @@
- - - - - - - - - - - - - - - + + + + + + + + + + + + + + +
- - + +

Functions

void cpanel_bmod (const int m, const int w, const int jcol, const int nseg, complex *dense, complex *tempv, int *segrep, int *repfnz, GlobalLU_t *Glu, SuperLUStat_t *stat)
 
void cpanel_bmod (const int m, const int w, const int jcol, const int nseg, singlecomplex *dense, singlecomplex *tempv, int *segrep, int *repfnz, GlobalLU_t *Glu, SuperLUStat_t *stat)
 

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -103,8 +103,8 @@ granted, provided the above notices are retained, and a notice that the code was modified is included with the above copyright notice.

Function Documentation

- -

◆ cpanel_bmod()

+ +

◆ cpanel_bmod()

@@ -136,13 +136,13 @@

complex * singlecomplex *  dense,
complex * singlecomplex *  tempv,
- - + +

Functions

void cpanel_dfs (const int m, const int w, const int jcol, SuperMatrix *A, int *perm_r, int *nseg, complex *dense, int *panel_lsub, int *segrep, int *repfnz, int_t *xprune, int *marker, int *parent, int_t *xplore, GlobalLU_t *Glu)
 
void cpanel_dfs (const int m, const int w, const int jcol, SuperMatrix *A, int *perm_r, int *nseg, singlecomplex *dense, int *panel_lsub, int *segrep, int *repfnz, int_t *xprune, int *marker, int *parent, int_t *xplore, GlobalLU_t *Glu)
 

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -101,8 +101,8 @@ granted, provided the above notices are retained, and a notice that the code was modified is included with the above copyright notice.

Function Documentation

- -

◆ cpanel_dfs()

+ +

◆ cpanel_dfs()

@@ -146,7 +146,7 @@

- complex *  + singlecomplex *  dense, @@ -170,7 +170,7 @@

- int_t *  + int_t *  xprune, @@ -188,7 +188,7 @@

- int_t *  + int_t *  xplore, diff --git a/DOC/html/cpivotL_8c.html b/DOC/html/cpivotL_8c.html index 691093bc..a1e8b40b 100644 --- a/DOC/html/cpivotL_8c.html +++ b/DOC/html/cpivotL_8c.html @@ -59,21 +59,21 @@
- - - - - - - - - - - - - - - + + + + + + + + + + + + + + +

@@ -195,8 +195,8 @@

- - + + diff --git a/DOC/html/cpivotgrowth_8c.html b/DOC/html/cpivotgrowth_8c.html index 6585f714..2a8676e6 100644 --- a/DOC/html/cpivotgrowth_8c.html +++ b/DOC/html/cpivotgrowth_8c.html @@ -58,21 +58,21 @@
- - - - - - - - - - - - - - - + + + + + + + + + + + + + + +

@@ -168,7 +168,7 @@

- + diff --git a/DOC/html/cpruneL_8c.html b/DOC/html/cpruneL_8c.html index 069c2368..971df6fd 100644 --- a/DOC/html/cpruneL_8c.html +++ b/DOC/html/cpruneL_8c.html @@ -61,23 +61,23 @@ - - - - - - - + + + + + + + - - - + + +

- +

Functions

void cpruneL (const int jcol, const int *perm_r, const int pivrow, const int nseg, const int *segrep, const int *repfnz, int_t *xprune, GlobalLU_t *Glu)
void cpruneL (const int jcol, const int *perm_r, const int pivrow, const int nseg, const int *segrep, const int *repfnz, int_t *xprune, GlobalLU_t *Glu)
 

Detailed Description

@@ -146,7 +146,7 @@

- int_t *  + int_t *  xprune, diff --git a/DOC/html/creadhb_8c.html b/DOC/html/creadhb_8c.html index 115fa821..1cb03f0c 100644 --- a/DOC/html/creadhb_8c.html +++ b/DOC/html/creadhb_8c.html @@ -59,21 +59,21 @@
- - - - - - - - - - - - - - - + + + + + + + + + + + + + + +

@@ -86,16 +86,16 @@ - + - - - - - - - - + + + + + + + +
 
int cParseFloatFormat (char *buf, int *num, int *size)
 
static int ReadVector (FILE *fp, int_t n, int_t *where, int perline, int persize)
static int ReadVector (FILE *fp, int_t n, int_t *where, int perline, int persize)
 
int cReadValues (FILE *fp, int n, complex *destination, int perline, int persize)
 Read complex numbers as pairs of (real, imaginary) More...
 
static void FormFullA (int n, int_t *nonz, complex **nzval, int_t **rowind, int_t **colptr)
 
void creadhb (FILE *fp, int *nrow, int *ncol, int_t *nonz, complex **nzval, int_t **rowind, int_t **colptr)
 Auxiliary routines. More...
 
int cReadValues (FILE *fp, int n, singlecomplex *destination, int perline, int persize)
 Read complex numbers as pairs of (real, imaginary) More...
 
static void FormFullA (int n, int_t *nonz, singlecomplex **nzval, int_t **rowind, int_t **colptr)
 
void creadhb (FILE *fp, int *nrow, int *ncol, int_t *nonz, singlecomplex **nzval, int_t **rowind, int_t **colptr)
 Auxiliary routines. More...
 

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -258,8 +258,8 @@

-

◆ creadhb()

+ +

◆ creadhb()

@@ -285,25 +285,25 @@

- int_t *  + int_t *  nonz, - complex **  + singlecomplex **  nzval, - int_t **  + int_t **  rowind, - int_t **  + int_t **  colptr  @@ -316,26 +316,26 @@

Here is the call graph for this function:

-
- +
+ - + - - + + - + - +

- -

◆ cReadValues()

+ +

◆ cReadValues()

@@ -355,7 +355,7 @@

- complex *  + singlecomplex *  destination, @@ -380,8 +380,8 @@

-

◆ FormFullA()

+ +

◆ FormFullA()

@@ -398,25 +398,25 @@

- int_t *  + int_t *  nonz, - complex **  + singlecomplex **  nzval, - int_t **  + int_t **  rowind, - int_t **  + int_t **  colptr  @@ -437,10 +437,10 @@

Here is the call graph for this function:

-
- +
+ - +
@@ -465,13 +465,13 @@

- int_t  + int_t  n, - int_t *  + int_t *  where, diff --git a/DOC/html/creadrb_8c.html b/DOC/html/creadrb_8c.html index 3969a9df..a137c214 100644 --- a/DOC/html/creadrb_8c.html +++ b/DOC/html/creadrb_8c.html @@ -59,21 +59,21 @@
- - - - - - - - - - - - - - - + + + + + + + + + + + + + + +

@@ -86,15 +86,15 @@ - + - - - - - - - + + + + + + +
 
static int cParseFloatFormat (char *buf, int *num, int *size)
 
static int ReadVector (FILE *fp, int n, int_t *where, int perline, int persize)
static int ReadVector (FILE *fp, int n, int_t *where, int perline, int persize)
 
static int cReadValues (FILE *fp, int n, complex *destination, int perline, int persize)
 Read complex numbers as pairs of (real, imaginary) More...
 
static void FormFullA (int n, int_t *nonz, complex **nzval, int_t **rowind, int_t **colptr)
 
void creadrb (int *nrow, int *ncol, int_t *nonz, complex **nzval, int_t **rowind, int_t **colptr)
 
static int cReadValues (FILE *fp, int n, singlecomplex *destination, int perline, int persize)
 Read complex numbers as pairs of (real, imaginary) More...
 
static void FormFullA (int n, int_t *nonz, singlecomplex **nzval, int_t **rowind, int_t **colptr)
 
void creadrb (int *nrow, int *ncol, int_t *nonz, singlecomplex **nzval, int_t **rowind, int_t **colptr)
 

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -276,8 +276,8 @@

-

◆ creadrb()

+ +

◆ creadrb()

@@ -297,25 +297,25 @@

- int_t *  + int_t *  nonz, - complex **  + singlecomplex **  nzval, - int_t **  + int_t **  rowind, - int_t **  + int_t **  colptr  @@ -328,26 +328,26 @@

Here is the call graph for this function:

-
- +
+ - + - - + + - + - +

- -

◆ cReadValues()

+ +

◆ cReadValues()

@@ -370,7 +370,7 @@

- complex *  + singlecomplex *  destination, @@ -400,8 +400,8 @@

-

◆ FormFullA()

+ +

◆ FormFullA()

@@ -418,25 +418,25 @@

- int_t *  + int_t *  nonz, - complex **  + singlecomplex **  nzval, - int_t **  + int_t **  rowind, - int_t **  + int_t **  colptr  @@ -457,10 +457,10 @@

Here is the call graph for this function:

-
- +
+ - +
@@ -491,7 +491,7 @@

- int_t *  + int_t *  where, diff --git a/DOC/html/creadtriple_8c.html b/DOC/html/creadtriple_8c.html index ff2fb928..9f64f63e 100644 --- a/DOC/html/creadtriple_8c.html +++ b/DOC/html/creadtriple_8c.html @@ -61,26 +61,26 @@ - - - - - - - + + + + + + + - - - + + +

- - - - + + + +

Functions

void creadtriple (int *m, int *n, int_t *nonz, complex **nzval, int_t **rowind, int_t **colptr)
 
void creadrhs (int m, complex *b)
 
void creadtriple (int *m, int *n, int_t *nonz, singlecomplex **nzval, int_t **rowind, int_t **colptr)
 
void creadrhs (int m, singlecomplex *b)
 

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -91,8 +91,8 @@ Lawrence Berkeley National Laboratory. June 30, 2009

Function Documentation

- -

◆ creadrhs()

+ +

◆ creadrhs()

@@ -106,7 +106,7 @@

- complex *  + singlecomplex *  b  @@ -119,8 +119,8 @@

-

◆ creadtriple()

+ +

◆ creadtriple()

@@ -140,25 +140,25 @@

- int_t *  + int_t *  nonz, - complex **  + singlecomplex **  nzval, - int_t **  + int_t **  rowind, - int_t **  + int_t **  colptr  @@ -171,12 +171,12 @@

Here is the call graph for this function:

-
- +
+ - + - +
diff --git a/DOC/html/csnode__bmod_8c.html b/DOC/html/csnode__bmod_8c.html index cc32a737..2dbdc51f 100644 --- a/DOC/html/csnode__bmod_8c.html +++ b/DOC/html/csnode__bmod_8c.html @@ -61,25 +61,25 @@ - - - - - - - + + + + + + + - - - + + +

- - - + + +

Functions

int csnode_bmod (const int jcol, const int jsupno, const int fsupc, complex *dense, complex *tempv, GlobalLU_t *Glu, SuperLUStat_t *stat)
 Performs numeric block updates within the relaxed snode. More...
 
int csnode_bmod (const int jcol, const int jsupno, const int fsupc, singlecomplex *dense, singlecomplex *tempv, GlobalLU_t *Glu, SuperLUStat_t *stat)
 Performs numeric block updates within the relaxed snode. More...
 

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -102,8 +102,8 @@ granted, provided the above notices are retained, and a notice that the code was modified is included with the above copyright notice.

Function Documentation

- -

◆ csnode_bmod()

+ +

◆ csnode_bmod()

@@ -129,13 +129,13 @@

- complex *  + singlecomplex *  dense, - complex *  + singlecomplex *  tempv, @@ -160,13 +160,13 @@

Here is the call graph for this function:

-
- +
+ - - - - + + + +
diff --git a/DOC/html/csnode__dfs_8c.html b/DOC/html/csnode__dfs_8c.html index 364bfafc..b9f2a989 100644 --- a/DOC/html/csnode__dfs_8c.html +++ b/DOC/html/csnode__dfs_8c.html @@ -61,23 +61,23 @@ - - - - - - - + + + + + + + - - - + + +
- +

Functions

int_t csnode_dfs (const int jcol, const int kcol, const int_t *asub, const int_t *xa_begin, const int_t *xa_end, int_t *xprune, int *marker, GlobalLU_t *Glu)
int_t csnode_dfs (const int jcol, const int kcol, const int_t *asub, const int_t *xa_begin, const int_t *xa_end, int_t *xprune, int *marker, GlobalLU_t *Glu)
 

Detailed Description

@@ -108,7 +108,7 @@

- + @@ -122,25 +122,25 @@

- + - + - + - + @@ -183,10 +183,10 @@

- - - - + + + + diff --git a/DOC/html/csp__blas2_8c.html b/DOC/html/csp__blas2_8c.html index b538428c..1cf63052 100644 --- a/DOC/html/csp__blas2_8c.html +++ b/DOC/html/csp__blas2_8c.html @@ -61,28 +61,28 @@ - - - - - - - + + + + + + + - - - + + +

int_t csnode_dfs int_t csnode_dfs ( const int  jcol, const int_t * const int_t *  asub,
const int_t * const int_t *  xa_begin,
const int_t * const int_t *  xa_end,
int_t * int_t *  xprune,
- - - - - - + + + + + +

Functions

int sp_ctrsv (char *uplo, char *trans, char *diag, SuperMatrix *L, SuperMatrix *U, complex *x, SuperLUStat_t *stat, int *info)
 Solves one of the systems of equations A*x = b, or A'*x = b. More...
 
int sp_cgemv (char *trans, complex alpha, SuperMatrix *A, complex *x, int incx, complex beta, complex *y, int incy)
 Performs one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y. More...
 
int sp_ctrsv (char *uplo, char *trans, char *diag, SuperMatrix *L, SuperMatrix *U, singlecomplex *x, SuperLUStat_t *stat, int *info)
 Solves one of the systems of equations A*x = b, or A'*x = b. More...
 
int sp_cgemv (char *trans, singlecomplex alpha, SuperMatrix *A, singlecomplex *x, int incx, singlecomplex beta, singlecomplex *y, int incy)
 Performs one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y. More...
 

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -96,8 +96,8 @@ Last update: December 3, 2015

Function Documentation

- -

◆ sp_cgemv()

+ +

◆ sp_cgemv()

@@ -111,7 +111,7 @@

- complex  + singlecomplex  alpha, @@ -123,7 +123,7 @@

- complex *  + singlecomplex *  x, @@ -135,13 +135,13 @@

- complex  + singlecomplex  beta, - complex *  + singlecomplex *  y, @@ -161,7 +161,7 @@

sp_cgemv() performs one of the matrix-vector operations + sp_cgemv() performs one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, where alpha and beta are scalars, x and y are vectors and A is a sparse A->nrow by A->ncol matrix. @@ -176,14 +176,14 @@

Here is the call graph for this function:

-
- +
+ @@ -225,8 +225,8 @@

-

◆ sp_ctrsv()

+ +

◆ sp_ctrsv()

@@ -264,7 +264,7 @@

- complex *  + singlecomplex *  x, @@ -290,7 +290,7 @@

sp_ctrsv() solves one of the systems of equations + sp_ctrsv() solves one of the systems of equations A*x = b, or A'*x = b, where b and x are n element vectors and A is a sparse unit , or non-unit, upper or lower triangular matrix. @@ -329,7 +329,7 @@

Here is the call graph for this function:

-
- +
+ - - - - - - - + + + + + + +
diff --git a/DOC/html/csp__blas3_8c.html b/DOC/html/csp__blas3_8c.html index b904228f..91a7dbbf 100644 --- a/DOC/html/csp__blas3_8c.html +++ b/DOC/html/csp__blas3_8c.html @@ -61,24 +61,24 @@ - - - - - - - + + + + + + + - - - + + +
- - + +

Functions

int sp_cgemm (char *transa, char *transb, int m, int n, int k, complex alpha, SuperMatrix *A, complex *b, int ldb, complex beta, complex *c, int ldc)
 
int sp_cgemm (char *transa, char *transb, int m, int n, int k, singlecomplex alpha, SuperMatrix *A, singlecomplex *b, int ldb, singlecomplex beta, singlecomplex *c, int ldc)
 

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -90,8 +90,8 @@ and Lawrence Berkeley National Lab. November 15, 1997

Function Documentation

- -

◆ sp_cgemm()

+ +

◆ sp_cgemm()

@@ -129,7 +129,7 @@

- complex  + singlecomplex  alpha, @@ -141,7 +141,7 @@

- complex *  + singlecomplex *  b, @@ -153,13 +153,13 @@

- complex  + singlecomplex  beta, - complex *  + singlecomplex *  c, @@ -227,7 +227,7 @@

Here is the call graph for this function:

-
- +
+ - +
diff --git a/DOC/html/cutil_8c.html b/DOC/html/cutil_8c.html index 8d08eed7..e178b075 100644 --- a/DOC/html/cutil_8c.html +++ b/DOC/html/cutil_8c.html @@ -58,43 +58,43 @@
- - - - - - - - - - - - - - - + + + + + + + + + + + + + + +
- - - - - + + + + + - - - - - - - - - + + + + + + + + + @@ -102,28 +102,28 @@ - + - - - - - - - - - - - - - - + + + + + + + + + + + + + + - - + +

Functions

void cCreate_CompCol_Matrix (SuperMatrix *A, int m, int n, int_t nnz, complex *nzval, int_t *rowind, int_t *colptr, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
 Supernodal LU factor related. More...
 
void cCreate_CompRow_Matrix (SuperMatrix *A, int m, int n, int_t nnz, complex *nzval, int_t *colind, int_t *rowptr, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
 
void cCreate_CompCol_Matrix (SuperMatrix *A, int m, int n, int_t nnz, singlecomplex *nzval, int_t *rowind, int_t *colptr, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
 Supernodal LU factor related. More...
 
void cCreate_CompRow_Matrix (SuperMatrix *A, int m, int n, int_t nnz, singlecomplex *nzval, int_t *colind, int_t *rowptr, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
 
void cCopy_CompCol_Matrix (SuperMatrix *A, SuperMatrix *B)
 Copy matrix A into matrix B. More...
 
void cCreate_Dense_Matrix (SuperMatrix *X, int m, int n, complex *x, int ldx, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
 
void cCopy_Dense_Matrix (int M, int N, complex *X, int ldx, complex *Y, int ldy)
 
void cCreate_SuperNode_Matrix (SuperMatrix *L, int m, int n, int_t nnz, complex *nzval, int_t *nzval_colptr, int_t *rowind, int_t *rowind_colptr, int *col_to_sup, int *sup_to_col, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
 
void cCompRow_to_CompCol (int m, int n, int_t nnz, complex *a, int_t *colind, int_t *rowptr, complex **at, int_t **rowind, int_t **colptr)
 Convert a row compressed storage into a column compressed storage. More...
 
void cCreate_Dense_Matrix (SuperMatrix *X, int m, int n, singlecomplex *x, int ldx, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
 
void cCopy_Dense_Matrix (int M, int N, singlecomplex *X, int ldx, singlecomplex *Y, int ldy)
 
void cCreate_SuperNode_Matrix (SuperMatrix *L, int m, int n, int_t nnz, singlecomplex *nzval, int_t *nzval_colptr, int_t *rowind, int_t *rowind_colptr, int *col_to_sup, int *sup_to_col, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
 
void cCompRow_to_CompCol (int m, int n, int_t nnz, singlecomplex *a, int_t *colind, int_t *rowptr, singlecomplex **at, int_t **rowind, int_t **colptr)
 Convert a row compressed storage into a column compressed storage. More...
 
void cPrint_CompCol_Matrix (char *what, SuperMatrix *A)
 Routines for debugging. More...
 
 
void cPrint_Dense_Matrix (char *what, SuperMatrix *A)
 
void cprint_lu_col (char *msg, int jcol, int pivrow, int_t *xprune, GlobalLU_t *Glu)
void cprint_lu_col (char *msg, int jcol, int pivrow, int_t *xprune, GlobalLU_t *Glu)
 Diagnostic print of column "jcol" in the U/L factor. More...
 
void ccheck_tempv (int n, complex *tempv)
 Check whether tempv[] == 0. This should be true before and after calling any numeric routines, i.e., "panel_bmod" and "column_bmod". More...
 
void cGenXtrue (int n, int nrhs, complex *x, int ldx)
 
void cFillRHS (trans_t trans, int nrhs, complex *x, int ldx, SuperMatrix *A, SuperMatrix *B)
 Let rhs[i] = sum of i-th row of A, so the solution vector is all 1's. More...
 
void cfill (complex *a, int alen, complex dval)
 Fills a complex precision array with a given value. More...
 
void cinf_norm_error (int nrhs, SuperMatrix *X, complex *xtrue)
 Check the inf-norm of the error vector. More...
 
void ccheck_tempv (int n, singlecomplex *tempv)
 Check whether tempv[] == 0. This should be true before and after calling any numeric routines, i.e., "panel_bmod" and "column_bmod". More...
 
void cGenXtrue (int n, int nrhs, singlecomplex *x, int ldx)
 
void cFillRHS (trans_t trans, int nrhs, singlecomplex *x, int ldx, SuperMatrix *A, SuperMatrix *B)
 Let rhs[i] = sum of i-th row of A, so the solution vector is all 1's. More...
 
void cfill (singlecomplex *a, int alen, singlecomplex dval)
 Fills a complex precision array with a given value. More...
 
void cinf_norm_error (int nrhs, SuperMatrix *X, singlecomplex *xtrue)
 Check the inf-norm of the error vector. More...
 
void cPrintPerf (SuperMatrix *L, SuperMatrix *U, mem_usage_t *mem_usage, float rpg, float rcond, float *ferr, float *berr, char *equed, SuperLUStat_t *stat)
 Print performance of the code. More...
 
int print_complex_vec (char *what, int n, complex *vec)
 
int print_complex_vec (char *what, int n, singlecomplex *vec)
 

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

@@ -146,8 +146,8 @@ granted, provided the above notices are retained, and a notice that the code was modified is included with the above copyright notice.

Function Documentation

- -

◆ ccheck_tempv()

+ +

◆ ccheck_tempv()

@@ -161,7 +161,7 @@

- complex *  + singlecomplex *  tempv  @@ -174,8 +174,8 @@

-

◆ cCompRow_to_CompCol()

+ +

◆ cCompRow_to_CompCol()

@@ -195,43 +195,43 @@

- int_t  + int_t  nnz, - complex *  + singlecomplex *  a, - int_t *  + int_t *  colind, - int_t *  + int_t *  rowptr, - complex **  + singlecomplex **  at, - int_t **  + int_t **  rowind, - int_t **  + int_t **  colptr  @@ -244,10 +244,10 @@

Here is the call graph for this function:

-
- +
+ - + @@ -283,8 +283,8 @@

-

◆ cCopy_Dense_Matrix()

+ +

◆ cCopy_Dense_Matrix()

@@ -304,7 +304,7 @@

- complex *  + singlecomplex *  X, @@ -316,7 +316,7 @@

- complex *  + singlecomplex *  Y, @@ -336,8 +336,8 @@

-

◆ cCreate_CompCol_Matrix()

+ +

◆ cCreate_CompCol_Matrix()

@@ -363,25 +363,25 @@

- int_t  + int_t  nnz, - complex *  + singlecomplex *  nzval, - int_t *  + int_t *  rowind, - int_t *  + int_t *  colptr, @@ -412,8 +412,8 @@

-

◆ cCreate_CompRow_Matrix()

+ +

◆ cCreate_CompRow_Matrix()

@@ -439,25 +439,25 @@

- int_t  + int_t  nnz, - complex *  + singlecomplex *  nzval, - int_t *  + int_t *  colind, - int_t *  + int_t *  rowptr, @@ -488,8 +488,8 @@

-

◆ cCreate_Dense_Matrix()

+ +

◆ cCreate_Dense_Matrix()

@@ -515,7 +515,7 @@

- complex *  + singlecomplex *  x, @@ -552,8 +552,8 @@

-

◆ cCreate_SuperNode_Matrix()

+ +

◆ cCreate_SuperNode_Matrix()

@@ -579,31 +579,31 @@

- int_t  + int_t  nnz, - complex *  + singlecomplex *  nzval, - int_t *  + int_t *  nzval_colptr, - int_t *  + int_t *  rowind, - int_t *  + int_t *  rowind_colptr, @@ -646,8 +646,8 @@

-

◆ cfill()

+ +

◆ cfill()

@@ -655,7 +655,7 @@

void cfill ( - complex *  + singlecomplex *  a, @@ -667,7 +667,7 @@

- complex  + singlecomplex  dval  @@ -680,8 +680,8 @@

-

◆ cFillRHS()

+ +

◆ cFillRHS()

@@ -701,7 +701,7 @@

- complex *  + singlecomplex *  x, @@ -732,19 +732,19 @@

Here is the call graph for this function:

-
- +
+ - - + +

- -

◆ cGenXtrue()

+ +

◆ cGenXtrue()

@@ -764,7 +764,7 @@

- complex *  + singlecomplex *  x, @@ -783,8 +783,8 @@

-

◆ cinf_norm_error()

+ +

◆ cinf_norm_error()

@@ -804,7 +804,7 @@

- complex *  + singlecomplex *  xtrue  @@ -817,10 +817,10 @@

Here is the call graph for this function:

-
- +
+ - +
@@ -909,7 +909,7 @@

- int_t *  + int_t *  xprune, @@ -1026,8 +1026,8 @@

-

◆ print_complex_vec()

+ +

◆ print_complex_vec()

@@ -1047,7 +1047,7 @@

- complex *  + singlecomplex *  vec  diff --git a/DOC/html/dcolumn__bmod_8c.html b/DOC/html/dcolumn__bmod_8c.html index 420b918c..d1b66cb2 100644 --- a/DOC/html/dcolumn__bmod_8c.html +++ b/DOC/html/dcolumn__bmod_8c.html @@ -59,20 +59,20 @@
- - - - - - - - - - - - - - + + + + + + + + + + + + + +

@@ -185,14 +185,14 @@

- + - - - - - + + + + + diff --git a/DOC/html/dcolumn__dfs_8c.html b/DOC/html/dcolumn__dfs_8c.html index 65368f05..a1e714c8 100644 --- a/DOC/html/dcolumn__dfs_8c.html +++ b/DOC/html/dcolumn__dfs_8c.html @@ -62,16 +62,16 @@ - - - - - - - + + + + + + + - - + +

@@ -83,7 +83,7 @@
- +

Functions

int dcolumn_dfs (const int m, const int jcol, int *perm_r, int *nseg, int *lsub_col, int *segrep, int *repfnz, int_t *xprune, int *marker, int *parent, int_t *xplore, GlobalLU_t *Glu)
int dcolumn_dfs (const int m, const int jcol, int *perm_r, int *nseg, int *lsub_col, int *segrep, int *repfnz, int_t *xprune, int *marker, int *parent, int_t *xplore, GlobalLU_t *Glu)
 

Detailed Description

@@ -173,7 +173,7 @@

- int_t *  + int_t *  xprune, @@ -191,7 +191,7 @@

- int_t *  + int_t *  xplore, @@ -244,13 +244,13 @@

- - - - - - - + + + + + + + diff --git a/DOC/html/dcopy__to__ucol_8c.html b/DOC/html/dcopy__to__ucol_8c.html index 0974f527..debabd4f 100644 --- a/DOC/html/dcopy__to__ucol_8c.html +++ b/DOC/html/dcopy__to__ucol_8c.html @@ -61,16 +61,16 @@ - - - - - - - + + + + + + + - - + +

@@ -160,12 +160,12 @@

- - - - - - + + + + + + diff --git a/DOC/html/ddiagonal_8c.html b/DOC/html/ddiagonal_8c.html index 4f3a8861..22237607 100644 --- a/DOC/html/ddiagonal_8c.html +++ b/DOC/html/ddiagonal_8c.html @@ -61,16 +61,16 @@ - - - - - - - + + + + + + + - - + +

@@ -121,7 +121,7 @@

- + @@ -159,7 +159,7 @@

- + diff --git a/DOC/html/dfgmr_8c.html b/DOC/html/dfgmr_8c.html index c62bf100..90ccf0c2 100644 --- a/DOC/html/dfgmr_8c.html +++ b/DOC/html/dfgmr_8c.html @@ -62,16 +62,16 @@ - - - - - - - + + + + + + + - - + +

@@ -247,42 +247,42 @@

- + - - + + - + - + - + - + - + - - + + - + - + diff --git a/DOC/html/dgscon_8c.html b/DOC/html/dgscon_8c.html index 9b53cb5b..4ae96ef6 100644 --- a/DOC/html/dgscon_8c.html +++ b/DOC/html/dgscon_8c.html @@ -58,20 +58,20 @@
- - - - - - - - - - - - - - + + + + + + + + + + + + + +

@@ -172,12 +172,12 @@

dgstrf(). Use compressed row subscripts storage for supernodes, + dgstrf(). Use compressed row subscripts storage for supernodes, i.e., L has types: Stype = SLU_SC, Dtype = SLU_D, Mtype = SLU_TRLU. U (input) SuperMatrix* The factor U from the factorization Pr*A*Pc=L*U as computed by - dgstrf(). Use column-wise storage scheme, i.e., U has types: + dgstrf(). Use column-wise storage scheme, i.e., U has types: Stype = SLU_NC, Dtype = SLU_D, Mtype = SLU_TRU. ANORM (input) double @@ -200,7 +200,7 @@

- + diff --git a/DOC/html/dgsequ_8c.html b/DOC/html/dgsequ_8c.html index 788acfa7..e322fe2f 100644 --- a/DOC/html/dgsequ_8c.html +++ b/DOC/html/dgsequ_8c.html @@ -58,20 +58,20 @@
- - - - - - - - - - - - - - + + + + + + + + + + + + + +

diff --git a/DOC/html/dgsisx_8c.html b/DOC/html/dgsisx_8c.html index 04efc5eb..5dec4e84 100644 --- a/DOC/html/dgsisx_8c.html +++ b/DOC/html/dgsisx_8c.html @@ -61,22 +61,22 @@ - - - - - - - + + + + + + + - - + +
- +

Functions

void dgsisx (superlu_options_t *options, SuperMatrix *A, int *perm_c, int *perm_r, int *etree, char *equed, double *R, double *C, SuperMatrix *L, SuperMatrix *U, void *work, int_t lwork, SuperMatrix *B, SuperMatrix *X, double *recip_pivot_growth, double *rcond, GlobalLU_t *Glu, mem_usage_t *mem_usage, SuperLUStat_t *stat, int_t *info)
void dgsisx (superlu_options_t *options, SuperMatrix *A, int *perm_c, int *perm_r, int *etree, char *equed, double *R, double *C, SuperMatrix *L, SuperMatrix *U, void *work, int_t lwork, SuperMatrix *B, SuperMatrix *X, double *recip_pivot_growth, double *rcond, GlobalLU_t *Glu, mem_usage_t *mem_usage, SuperLUStat_t *stat, int_t *info)
 

Detailed Description

@@ -164,7 +164,7 @@

- int_t  + int_t  lwork, @@ -212,7 +212,7 @@

- int_t *  + int_t *  info  @@ -249,7 +249,7 @@

sp_preorder.c. + For more details of this step, see sp_preorder.c. 1.3. If options->Fact != FACTORED, the LU decomposition is used to factor the matrix A (after equilibration if options->Equil = YES) @@ -360,7 +360,7 @@

sp_preorder.c. + For more details of this step, see sp_preorder.c. 2.3. If options->Fact != FACTORED, the LU decomposition is used to factor the transpose(A) (after equilibration if @@ -606,39 +606,39 @@

- - + + - + - + - + - + - + - + - + - + - + @@ -653,7 +653,7 @@

- +

diff --git a/DOC/html/dgsitrf_8c.html b/DOC/html/dgsitrf_8c.html index d59b750e..36b49d9a 100644 --- a/DOC/html/dgsitrf_8c.html +++ b/DOC/html/dgsitrf_8c.html @@ -61,22 +61,22 @@ - - - - - - - + + + + + + + - - + +

- +

Functions

void dgsitrf (superlu_options_t *options, SuperMatrix *A, int relax, int panel_size, int *etree, void *work, int_t lwork, int *perm_c, int *perm_r, SuperMatrix *L, SuperMatrix *U, GlobalLU_t *Glu, SuperLUStat_t *stat, int_t *info)
void dgsitrf (superlu_options_t *options, SuperMatrix *A, int relax, int panel_size, int *etree, void *work, int_t lwork, int *perm_c, int *perm_r, SuperMatrix *L, SuperMatrix *U, GlobalLU_t *Glu, SuperLUStat_t *stat, int_t *info)
 

Detailed Description

@@ -134,7 +134,7 @@

- int_t  + int_t  lwork, @@ -176,7 +176,7 @@

- int_t *  + int_t *  info  @@ -345,18 +345,18 @@

- + - - + + - + - + - + @@ -374,13 +374,13 @@

- - - - - - - + + + + + + + diff --git a/DOC/html/dgsrfs_8c.html b/DOC/html/dgsrfs_8c.html index 5256a835..851a52ab 100644 --- a/DOC/html/dgsrfs_8c.html +++ b/DOC/html/dgsrfs_8c.html @@ -59,20 +59,20 @@
- - - - - - - - - - - - - - + + + + + + + + + + + + + +

@@ -251,7 +251,7 @@

dgstrf(). Use column-wise storage scheme, + dgstrf(). Use column-wise storage scheme, i.e., U has types: Stype = SLU_NC, Dtype = SLU_D, Mtype = SLU_TRU. perm_c (input) int*, dimension (A->ncol) @@ -330,7 +330,7 @@

- + @@ -339,7 +339,7 @@

- + diff --git a/DOC/html/dgssv_8c.html b/DOC/html/dgssv_8c.html index d840db65..f7895f66 100644 --- a/DOC/html/dgssv_8c.html +++ b/DOC/html/dgssv_8c.html @@ -61,22 +61,22 @@ - - - - - - - + + + + + + + - - + +

- +

Functions

void dgssv (superlu_options_t *options, SuperMatrix *A, int *perm_c, int *perm_r, SuperMatrix *L, SuperMatrix *U, SuperMatrix *B, SuperLUStat_t *stat, int_t *info)
void dgssv (superlu_options_t *options, SuperMatrix *A, int *perm_c, int *perm_r, SuperMatrix *L, SuperMatrix *U, SuperMatrix *B, SuperLUStat_t *stat, int_t *info)
 Driver routines. More...
 
@@ -147,7 +147,7 @@

- int_t *  + int_t *  info  @@ -168,7 +168,7 @@

sp_preorder.c. + see sp_preorder.c. 1.2. Factor A as Pr*A*Pc=L*U with the permutation Pr determined by Gaussian elimination with partial pivoting. @@ -183,7 +183,7 @@

sp_preorder.c. + For more details of this step, see sp_preorder.c. 2.2. Factor A as Pr*transpose(A)*Pc=L*U with the permutation Pr determined by Gaussian elimination with partial pivoting. @@ -277,34 +277,34 @@

- - - - + + + + - + - + - + - + - + - + @@ -313,18 +313,18 @@

- - + + - + - - - - + + + +

diff --git a/DOC/html/dgssvx_8c.html b/DOC/html/dgssvx_8c.html index 7b7ee1f1..a5f2868c 100644 --- a/DOC/html/dgssvx_8c.html +++ b/DOC/html/dgssvx_8c.html @@ -61,22 +61,22 @@ - - - - - - - + + + + + + + - - + +

- +

Functions

void dgssvx (superlu_options_t *options, SuperMatrix *A, int *perm_c, int *perm_r, int *etree, char *equed, double *R, double *C, SuperMatrix *L, SuperMatrix *U, void *work, int_t lwork, SuperMatrix *B, SuperMatrix *X, double *recip_pivot_growth, double *rcond, double *ferr, double *berr, GlobalLU_t *Glu, mem_usage_t *mem_usage, SuperLUStat_t *stat, int_t *info)
void dgssvx (superlu_options_t *options, SuperMatrix *A, int *perm_c, int *perm_r, int *etree, char *equed, double *R, double *C, SuperMatrix *L, SuperMatrix *U, void *work, int_t lwork, SuperMatrix *B, SuperMatrix *X, double *recip_pivot_growth, double *rcond, double *ferr, double *berr, GlobalLU_t *Glu, mem_usage_t *mem_usage, SuperLUStat_t *stat, int_t *info)
 

Detailed Description

@@ -164,7 +164,7 @@

- int_t  + int_t  lwork, @@ -224,7 +224,7 @@

- int_t *  + int_t *  info  @@ -239,7 +239,7 @@

dgstrf(). Error bounds on the solution and +the LU factorization from dgstrf(). Error bounds on the solution and a condition estimate are also provided. It performs the following steps: 1. If A is stored column-wise (A->Stype = SLU_NC): @@ -260,7 +260,7 @@

sp_preorder.c. + For more details of this step, see sp_preorder.c. 1.3. If options->Fact != FACTORED, the LU decomposition is used to factor the matrix A (after equilibration if options->Equil = YES) @@ -307,7 +307,7 @@

sp_preorder.c. + For more details of this step, see sp_preorder.c. 2.3. If options->Fact != FACTORED, the LU decomposition is used to factor the transpose(A) (after equilibration if @@ -571,49 +571,49 @@

- - + + - - + + - - + + - + - + - + - + - + - + - + diff --git a/DOC/html/dgstrs_8c.html b/DOC/html/dgstrs_8c.html index 003c4cde..07ec8598 100644 --- a/DOC/html/dgstrs_8c.html +++ b/DOC/html/dgstrs_8c.html @@ -61,16 +61,16 @@ - - - - - - - + + + + + + + - - + +

@@ -184,12 +184,12 @@

dgstrf(). Use compressed row subscripts storage for supernodes, + dgstrf(). Use compressed row subscripts storage for supernodes, i.e., L has types: Stype = SLU_SC, Dtype = SLU_D, Mtype = SLU_TRLU. U (input) SuperMatrix* The factor U from the factorization Pr*A*Pc=L*U as computed by - dgstrf(). Use column-wise storage scheme, i.e., U has types: + dgstrf(). Use column-wise storage scheme, i.e., U has types: Stype = SLU_NC, Dtype = SLU_D, Mtype = SLU_TRU. perm_c (input) int*, dimension (L->ncol) @@ -222,8 +222,8 @@

- - + + diff --git a/DOC/html/ditersol1_8c.html b/DOC/html/ditersol1_8c.html index 252c0b42..b33f5e90 100644 --- a/DOC/html/ditersol1_8c.html +++ b/DOC/html/ditersol1_8c.html @@ -62,16 +62,16 @@ - - - - - - - + + + + + + + - - + +

@@ -228,38 +228,38 @@

- - + + - + - + - + - + - + - - + + - + - + @@ -270,7 +270,7 @@

- + @@ -312,11 +312,11 @@

- - - + + + - + @@ -332,31 +332,31 @@

- - - + + + - + - + - - + + - + diff --git a/DOC/html/ditersol_8c.html b/DOC/html/ditersol_8c.html index 2a042de9..92a75dbf 100644 --- a/DOC/html/ditersol_8c.html +++ b/DOC/html/ditersol_8c.html @@ -62,16 +62,16 @@ - - - - - - - + + + + + + + - - + +

@@ -224,38 +224,38 @@

- - + + - + - + - + - + - + - - + + - + - + @@ -266,7 +266,7 @@

- + @@ -308,11 +308,11 @@

- - - + + + - + @@ -327,31 +327,31 @@

- - - + + + - + - + - - + + - + diff --git a/DOC/html/dlangs_8c.html b/DOC/html/dlangs_8c.html index 71b57a39..83a9a838 100644 --- a/DOC/html/dlangs_8c.html +++ b/DOC/html/dlangs_8c.html @@ -58,20 +58,20 @@
- - - - - - - - - - - - - - + + + + + + + + + + + + + +

diff --git a/DOC/html/dlaqgs_8c.html b/DOC/html/dlaqgs_8c.html index c7a0288e..b69edee3 100644 --- a/DOC/html/dlaqgs_8c.html +++ b/DOC/html/dlaqgs_8c.html @@ -59,20 +59,20 @@
- - - - - - - - - - - - - - + + + + + + + + + + + + + +
diff --git a/DOC/html/dldperm_8c.html b/DOC/html/dldperm_8c.html index d1a996b7..2f20604e 100644 --- a/DOC/html/dldperm_8c.html +++ b/DOC/html/dldperm_8c.html @@ -61,26 +61,26 @@ - - - - - - - + + + + + + + - - + +
- + - + - +

Functions

int_t mc64id_ (int_t *)
int_t mc64id_ (int_t *)
 
int_t mc64ad_ (int_t *job, int_t *n, int_t *ne, int_t *ip, int_t *irn, double *a, int_t *num, int *cperm, int_t *liw, int_t *iw, int_t *ldw, double *dw, int_t *icntl, int_t *info)
int_t mc64ad_ (int_t *job, int_t *n, int_t *ne, int_t *ip, int_t *irn, double *a, int_t *num, int *cperm, int_t *liw, int_t *iw, int_t *ldw, double *dw, int_t *icntl, int_t *info)
 
int dldperm (int job, int n, int_t nnz, int_t colptr[], int_t adjncy[], double nzval[], int *perm, double u[], double v[])
int dldperm (int job, int n, int_t nnz, int_t colptr[], int_t adjncy[], double nzval[], int *perm, double u[], double v[])
 

Detailed Description

@@ -113,19 +113,19 @@

- int_t  + int_t  nnz, - int_t  + int_t  colptr[], - int_t  + int_t  adjncy[], @@ -228,7 +228,7 @@

- +

@@ -241,33 +241,33 @@

- + - + - + - + - + - + @@ -279,7 +279,7 @@

- + @@ -291,19 +291,19 @@

- + - + - + @@ -315,13 +315,13 @@

- + - + @@ -341,9 +341,9 @@

int_t mc64ad_ int_t mc64ad_ (int_t * int_t *  job,
int_t * int_t *  n,
int_t * int_t *  ne,
int_t * int_t *  ip,
int_t * int_t *  irn,
int_t * int_t *  num,
int_t * int_t *  liw,
int_t * int_t *  iw,
int_t * int_t *  ldw,
int_t * int_t *  icntl,
int_t * int_t *  info 
- + - + diff --git a/DOC/html/dlinsol1_8c.html b/DOC/html/dlinsol1_8c.html index e91255f7..f2436024 100644 --- a/DOC/html/dlinsol1_8c.html +++ b/DOC/html/dlinsol1_8c.html @@ -61,16 +61,16 @@ - - - - - - - + + + + + + + - - + +
int_t mc64id_ int_t mc64id_ (int_t * int_t *  icntl)
@@ -113,46 +113,46 @@

- - - + + + - + - + - - - + + + - - - + + + - + - + - - + + - - + + diff --git a/DOC/html/dlinsol_8c.html b/DOC/html/dlinsol_8c.html index 97ea68ea..6584ba66 100644 --- a/DOC/html/dlinsol_8c.html +++ b/DOC/html/dlinsol_8c.html @@ -61,16 +61,16 @@ - - - - - - - + + + + + + + - - + +

@@ -113,46 +113,46 @@

- - - + + + - + - + - - - + + + - - - + + + - + - + - - + + - + diff --git a/DOC/html/dlinsolx1_8c.html b/DOC/html/dlinsolx1_8c.html index 9359aad9..e739d412 100644 --- a/DOC/html/dlinsolx1_8c.html +++ b/DOC/html/dlinsolx1_8c.html @@ -63,27 +63,27 @@ - - - - - - - + + + + + + + - - + +

- - - + + +

Functions

int main (int argc, char *argv[])
 The driver program DLINSOLX1. More...
 
void parse_command_line (int argc, char *argv[], int *lwork, double *u, yes_no_t *equil, trans_t *trans)
 Parse command line options to get relaxed snode size, panel size, etc. More...
 
int main (int argc, char *argv[])
 The driver program DLINSOLX1. More...
 

Function Documentation

 @@ -120,46 +120,46 @@

- - - + + + - + - - - + + + - + - - + + - - + + - + - + diff --git a/DOC/html/dlinsolx2_8c.html b/DOC/html/dlinsolx2_8c.html index 35eac493..709696b4 100644 --- a/DOC/html/dlinsolx2_8c.html +++ b/DOC/html/dlinsolx2_8c.html @@ -63,27 +63,27 @@ - - - - - - - + + + + + + + - - + +

- - - + + +

Functions

int main (int argc, char *argv[])
 The driver program DLINSOLX2. More...
 
void parse_command_line (int argc, char *argv[], int *lwork, double *u, yes_no_t *equil, trans_t *trans)
 Parse command line options to get relaxed snode size, panel size, etc. More...
 
int main (int argc, char *argv[])
 The driver program DLINSOLX2. More...
 

Function Documentation

 @@ -120,46 +120,46 @@

- - - + + + - + - - - + + + - - + + - - + + - - + + - + - + diff --git a/DOC/html/dlinsolx_8c.html b/DOC/html/dlinsolx_8c.html index 448fa79f..72e5eb80 100644 --- a/DOC/html/dlinsolx_8c.html +++ b/DOC/html/dlinsolx_8c.html @@ -60,26 +60,26 @@ - - - - - - - + + + + + + + - - + +

- - + +

Functions

int main (int argc, char *argv[])
 
void parse_command_line (int argc, char *argv[], int *lwork, double *u, yes_no_t *equil, trans_t *trans)
 Parse command line inputs. More...
 
int main (int argc, char *argv[])
 

Detailed Description

\briefLU factorization from dgstrf (DGSSVX)

@@ -114,56 +114,56 @@

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

@@ -218,6 +218,7 @@

+

Parse command line options to get relaxed snode size, panel size, etc.

diff --git a/DOC/html/dpanel__bmod_8c.html b/DOC/html/dpanel__bmod_8c.html index 97d648ae..080c9c55 100644 --- a/DOC/html/dpanel__bmod_8c.html +++ b/DOC/html/dpanel__bmod_8c.html @@ -59,20 +59,20 @@
- - - - - - - - - - - - - - + + + + + + + + + + + + + +
@@ -199,7 +199,7 @@

- + diff --git a/DOC/html/dpanel__dfs_8c.html b/DOC/html/dpanel__dfs_8c.html index 6c1a4168..8f3fa30a 100644 --- a/DOC/html/dpanel__dfs_8c.html +++ b/DOC/html/dpanel__dfs_8c.html @@ -61,22 +61,22 @@ - - - - - - - + + + + + + + - - + +

- +

Functions

void dpanel_dfs (const int m, const int w, const int jcol, SuperMatrix *A, int *perm_r, int *nseg, double *dense, int *panel_lsub, int *segrep, int *repfnz, int_t *xprune, int *marker, int *parent, int_t *xplore, GlobalLU_t *Glu)
void dpanel_dfs (const int m, const int w, const int jcol, SuperMatrix *A, int *perm_r, int *nseg, double *dense, int *panel_lsub, int *segrep, int *repfnz, int_t *xprune, int *marker, int *parent, int_t *xplore, GlobalLU_t *Glu)
 

Detailed Description

@@ -169,7 +169,7 @@

- int_t *  + int_t *  xprune, @@ -187,7 +187,7 @@

- int_t *  + int_t *  xplore, diff --git a/DOC/html/dpivotL_8c.html b/DOC/html/dpivotL_8c.html index 9e967ccb..098ca890 100644 --- a/DOC/html/dpivotL_8c.html +++ b/DOC/html/dpivotL_8c.html @@ -59,20 +59,20 @@
- + - - - - - - - - - - - - + + + + + + + + + + + +

diff --git a/DOC/html/dpivotgrowth_8c.html b/DOC/html/dpivotgrowth_8c.html index c41c9006..7f72ef5a 100644 --- a/DOC/html/dpivotgrowth_8c.html +++ b/DOC/html/dpivotgrowth_8c.html @@ -58,20 +58,20 @@
- - - - - - - - - - - - - - + + + + + + + + + + + + + +
diff --git a/DOC/html/dpruneL_8c.html b/DOC/html/dpruneL_8c.html index 940553ea..4220d26a 100644 --- a/DOC/html/dpruneL_8c.html +++ b/DOC/html/dpruneL_8c.html @@ -61,22 +61,22 @@ - - - - - - - + + + + + + + - - + +
- +

Functions

void dpruneL (const int jcol, const int *perm_r, const int pivrow, const int nseg, const int *segrep, const int *repfnz, int_t *xprune, GlobalLU_t *Glu)
void dpruneL (const int jcol, const int *perm_r, const int pivrow, const int nseg, const int *segrep, const int *repfnz, int_t *xprune, GlobalLU_t *Glu)
 

Detailed Description

@@ -145,7 +145,7 @@

- int_t *  + int_t *  xprune, diff --git a/DOC/html/dreadhb_8c.html b/DOC/html/dreadhb_8c.html index b0d7e696..fbeadaac 100644 --- a/DOC/html/dreadhb_8c.html +++ b/DOC/html/dreadhb_8c.html @@ -59,20 +59,20 @@
- - - - - - - - - - - - - - + + + + + + + + + + + + + +

@@ -85,13 +85,13 @@ - + - + - +
 
int dParseFloatFormat (char *buf, int *num, int *size)
 
static int ReadVector (FILE *fp, int_t n, int_t *where, int perline, int persize)
static int ReadVector (FILE *fp, int_t n, int_t *where, int perline, int persize)
 
int dReadValues (FILE *fp, int n, double *destination, int perline, int persize)
 
static void FormFullA (int n, int_t *nonz, double **nzval, int_t **rowind, int_t **colptr)
static void FormFullA (int n, int_t *nonz, double **nzval, int_t **rowind, int_t **colptr)
 
void dreadhb (FILE *fp, int *nrow, int *ncol, int_t *nonz, double **nzval, int_t **rowind, int_t **colptr)
void dreadhb (FILE *fp, int *nrow, int *ncol, int_t *nonz, double **nzval, int_t **rowind, int_t **colptr)
 Auxiliary routines. More...
 
@@ -283,7 +283,7 @@

- int_t *  + int_t *  nonz, @@ -295,13 +295,13 @@

- int_t **  + int_t **  rowind, - int_t **  + int_t **  colptr  @@ -317,14 +317,14 @@

- + - +
@@ -395,7 +395,7 @@

- int_t *  + int_t *  nonz, @@ -407,13 +407,13 @@

- int_t **  + int_t **  rowind, - int_t **  + int_t **  colptr  @@ -461,13 +461,13 @@

- int_t  + int_t  n, - int_t *  + int_t *  where, diff --git a/DOC/html/dreadrb_8c.html b/DOC/html/dreadrb_8c.html index d0637cdd..d665ec2e 100644 --- a/DOC/html/dreadrb_8c.html +++ b/DOC/html/dreadrb_8c.html @@ -59,20 +59,20 @@
- - - - - - - - - - - - - - + + + + + + + + + + + + + +

@@ -85,13 +85,13 @@ - + - + - +
 
static int dParseFloatFormat (char *buf, int *num, int *size)
 
static int ReadVector (FILE *fp, int n, int_t *where, int perline, int persize)
static int ReadVector (FILE *fp, int n, int_t *where, int perline, int persize)
 
static int dReadValues (FILE *fp, int n, double *destination, int perline, int persize)
 
static void FormFullA (int n, int_t *nonz, double **nzval, int_t **rowind, int_t **colptr)
static void FormFullA (int n, int_t *nonz, double **nzval, int_t **rowind, int_t **colptr)
 
void dreadrb (int *nrow, int *ncol, int_t *nonz, double **nzval, int_t **rowind, int_t **colptr)
void dreadrb (int *nrow, int *ncol, int_t *nonz, double **nzval, int_t **rowind, int_t **colptr)
 

Detailed Description

@@ -295,7 +295,7 @@

- int_t *  + int_t *  nonz, @@ -307,13 +307,13 @@

- int_t **  + int_t **  rowind, - int_t **  + int_t **  colptr  @@ -329,14 +329,14 @@

- + - +
@@ -415,7 +415,7 @@

- int_t *  + int_t *  nonz, @@ -427,13 +427,13 @@

- int_t **  + int_t **  rowind, - int_t **  + int_t **  colptr  @@ -487,7 +487,7 @@

- int_t *  + int_t *  where, diff --git a/DOC/html/dreadtriple_8c.html b/DOC/html/dreadtriple_8c.html index a31171d2..ec3be59b 100644 --- a/DOC/html/dreadtriple_8c.html +++ b/DOC/html/dreadtriple_8c.html @@ -61,22 +61,22 @@ - - - - - - - + + + + + + + - - + +

- + @@ -139,7 +139,7 @@

- + @@ -151,13 +151,13 @@

- + - + @@ -173,9 +173,9 @@

- + - + diff --git a/DOC/html/dsnode__bmod_8c.html b/DOC/html/dsnode__bmod_8c.html index 97d8fef7..3c4cb296 100644 --- a/DOC/html/dsnode__bmod_8c.html +++ b/DOC/html/dsnode__bmod_8c.html @@ -61,16 +61,16 @@ - - - - - - - + + + + + + + - - + +

Functions

void dreadtriple (int *m, int *n, int_t *nonz, double **nzval, int_t **rowind, int_t **colptr)
void dreadtriple (int *m, int *n, int_t *nonz, double **nzval, int_t **rowind, int_t **colptr)
 
void dreadrhs (int m, double *b)
 
int_t * int_t *  nonz,
int_t ** int_t **  rowind,
int_t ** int_t **  colptr 
diff --git a/DOC/html/dsnode__dfs_8c.html b/DOC/html/dsnode__dfs_8c.html index ba4df5df..cd33e6ad 100644 --- a/DOC/html/dsnode__dfs_8c.html +++ b/DOC/html/dsnode__dfs_8c.html @@ -61,22 +61,22 @@ - - - - - - - + + + + + + + - - + +
- +

Functions

int_t dsnode_dfs (const int jcol, const int kcol, const int_t *asub, const int_t *xa_begin, const int_t *xa_end, int_t *xprune, int *marker, GlobalLU_t *Glu)
int_t dsnode_dfs (const int jcol, const int kcol, const int_t *asub, const int_t *xa_begin, const int_t *xa_end, int_t *xprune, int *marker, GlobalLU_t *Glu)
 

Detailed Description

@@ -107,7 +107,7 @@

- + @@ -121,25 +121,25 @@

- + - + - + - + @@ -179,12 +179,12 @@

- - - - - - + + + + + + diff --git a/DOC/html/dsp__blas2_8c.html b/DOC/html/dsp__blas2_8c.html index 38d2c78c..0af746fb 100644 --- a/DOC/html/dsp__blas2_8c.html +++ b/DOC/html/dsp__blas2_8c.html @@ -61,16 +61,16 @@ - - - - - - - + + + + + + + - - + +

int_t dsnode_dfs int_t dsnode_dfs ( const int  jcol, const int_t * const int_t *  asub,
const int_t * const int_t *  xa_begin,
const int_t * const int_t *  xa_end,
int_t * int_t *  xprune,
@@ -345,7 +345,7 @@

- + diff --git a/DOC/html/dsp__blas3_8c.html b/DOC/html/dsp__blas3_8c.html index 3fea3660..124ab8d4 100644 --- a/DOC/html/dsp__blas3_8c.html +++ b/DOC/html/dsp__blas3_8c.html @@ -61,16 +61,16 @@ - - - - - - - + + + + + + + - - + +

diff --git a/DOC/html/dutil_8c.html b/DOC/html/dutil_8c.html index f6dcc33c..493df495 100644 --- a/DOC/html/dutil_8c.html +++ b/DOC/html/dutil_8c.html @@ -58,29 +58,29 @@
- - - - - - - - - - - - - - + + + + + + + + + + + + + +
- + - + @@ -89,9 +89,9 @@ - + - + @@ -101,7 +101,7 @@ - + @@ -194,7 +194,7 @@

- + @@ -206,13 +206,13 @@

- + - + @@ -224,13 +224,13 @@

- + - + @@ -246,7 +246,7 @@

- + @@ -362,7 +362,7 @@

- + @@ -374,13 +374,13 @@

- + - + @@ -438,7 +438,7 @@

- + @@ -450,13 +450,13 @@

- + - + @@ -578,7 +578,7 @@

- + @@ -590,19 +590,19 @@

- + - + - + @@ -899,7 +899,7 @@

- + diff --git a/DOC/html/files.html b/DOC/html/files.html index 72145a40..986be60a 100644 --- a/DOC/html/files.html +++ b/DOC/html/files.html @@ -56,35 +56,37 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + @@ -115,7 +117,7 @@ - + @@ -144,14 +146,14 @@ - + - + @@ -203,7 +205,7 @@ - + @@ -238,7 +240,7 @@ - + @@ -254,7 +256,7 @@ - + diff --git a/DOC/html/functions.html b/DOC/html/functions.html index bee7fe6b..a1f6cc72 100644 --- a/DOC/html/functions.html +++ b/DOC/html/functions.html @@ -97,7 +97,7 @@

- h -

Functions

void dCreate_CompCol_Matrix (SuperMatrix *A, int m, int n, int_t nnz, double *nzval, int_t *rowind, int_t *colptr, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
void dCreate_CompCol_Matrix (SuperMatrix *A, int m, int n, int_t nnz, double *nzval, int_t *rowind, int_t *colptr, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
 Supernodal LU factor related. More...
 
void dCreate_CompRow_Matrix (SuperMatrix *A, int m, int n, int_t nnz, double *nzval, int_t *colind, int_t *rowptr, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
void dCreate_CompRow_Matrix (SuperMatrix *A, int m, int n, int_t nnz, double *nzval, int_t *colind, int_t *rowptr, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
 
void dCopy_CompCol_Matrix (SuperMatrix *A, SuperMatrix *B)
 Copy matrix A into matrix B. More...
 
void dCopy_Dense_Matrix (int M, int N, double *X, int ldx, double *Y, int ldy)
 
void dCreate_SuperNode_Matrix (SuperMatrix *L, int m, int n, int_t nnz, double *nzval, int_t *nzval_colptr, int_t *rowind, int_t *rowind_colptr, int *col_to_sup, int *sup_to_col, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
void dCreate_SuperNode_Matrix (SuperMatrix *L, int m, int n, int_t nnz, double *nzval, int_t *nzval_colptr, int_t *rowind, int_t *rowind_colptr, int *col_to_sup, int *sup_to_col, Stype_t stype, Dtype_t dtype, Mtype_t mtype)
 
void dCompRow_to_CompCol (int m, int n, int_t nnz, double *a, int_t *colind, int_t *rowptr, double **at, int_t **rowind, int_t **colptr)
void dCompRow_to_CompCol (int m, int n, int_t nnz, double *a, int_t *colind, int_t *rowptr, double **at, int_t **rowind, int_t **colptr)
 Convert a row compressed storage into a column compressed storage. More...
 
void dPrint_CompCol_Matrix (char *what, SuperMatrix *A)
 
void dPrint_Dense_Matrix (char *what, SuperMatrix *A)
 
void dprint_lu_col (char *msg, int jcol, int pivrow, int_t *xprune, GlobalLU_t *Glu)
void dprint_lu_col (char *msg, int jcol, int pivrow, int_t *xprune, GlobalLU_t *Glu)
 Diagnostic print of column "jcol" in the U/L factor. More...
 
void dcheck_tempv (int n, double *tempv)
int_t int_t  nnz,
int_t * int_t *  colind,
int_t * int_t *  rowptr,
int_t ** int_t **  rowind,
int_t ** int_t **  colptr 
int_t int_t  nnz,
int_t * int_t *  rowind,
int_t * int_t *  colptr,
int_t int_t  nnz,
int_t * int_t *  colind,
int_t * int_t *  rowptr,
int_t int_t  nnz,
int_t * int_t *  nzval_colptr,
int_t * int_t *  rowind,
int_t * int_t *  rowind_colptr,
int_t * int_t *  xprune,
 ► FORTRAN
- + - + + - + + - + + - + + +

Functions

int genmmd_ (int *neqns, int_t *xadj, int_t *adjncy, int *invp, int *perm, int_t *delta, int_t *dhead, int_t *qsize, int_t *llist, int_t *marker, int_t *maxint, int_t *nofsub)
int genmmd_ (int *neqns, int_t *xadj, int_t *adjncy, int *invp, int *perm, int_t *delta, int_t *dhead, int_t *qsize, int_t *llist, int_t *marker, int_t *maxint, int_t *nofsub)
 
void get_colamd (const int m, const int n, const int_t nnz, int_t *colptr, int_t *rowind, int *perm_c)
void get_colamd (const int m, const int n, const int_t nnz, int_t *colptr, int_t *rowind, int *perm_c)
 Get COLAMD's permutation for matrix A. More...
 
void get_metis (int n, int_t bnz, int_t *b_colptr, int_t *b_rowind, int *perm_c)
void get_metis (int n, int_t bnz, int_t *b_colptr, int_t *b_rowind, int *perm_c)
 Get METIS' permutation for matrix B. More...
 
void getata (const int m, const int n, const int_t nz, int_t *colptr, int_t *rowind, int_t *atanz, int_t **ata_colptr, int_t **ata_rowind)
void getata (const int m, const int n, const int_t nz, int_t *colptr, int_t *rowind, int_t *atanz, int_t **ata_colptr, int_t **ata_rowind)
 Form the structure of A'*A. More...
 
void at_plus_a (const int n, const int_t nz, int_t *colptr, int_t *rowind, int_t *bnz, int_t **b_colptr, int_t **b_rowind)
void at_plus_a (const int n, const int_t nz, int_t *colptr, int_t *rowind, int_t *bnz, int_t **b_colptr, int_t **b_rowind)
 Form the structure of A'+A. More...
 
void get_perm_c (int ispec, SuperMatrix *A, int *perm_c)
 Obtains a permutation matrix by applying the multiple minimum degree ordering code. More...
 
-

Detailed Description

-

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

-

All rights reserved.

-

The source code is distributed under BSD license, see the file License.txt at the top-level directory.

-
--- SuperLU routine (version 3.1) --
-Univ. of California Berkeley, Xerox Palo Alto Research Center,
-and Lawrence Berkeley National Lab.
-August 1, 2008
-March 25, 2023  add METIS option
-

Function Documentation

+

Function Documentation

◆ at_plus_a()

@@ -117,37 +112,37 @@

- const int_t  + const int_t  nz, - int_t *  + int_t *  colptr, - int_t *  + int_t *  rowind, - int_t *  + int_t *  bnz, - int_t **  + int_t **  b_colptr, - int_t **  + int_t **  b_rowind  @@ -157,15 +152,20 @@

-
-Purpose
-=======
+
A is an n-by-n matrix in column oriented format represented by (colptr, rowind). The output A'+A is in column oriented format (symmetrically, also row oriented), represented by (b_colptr, b_rowind).

+
Parameters

+  
+    
+    
+    
+    
+    
+    
+    
+  
[in]nnumber of columns in matrix A. 
[in]nznumber of nonzeros in matrix A 
[in]colptrcolumn pointer of size n+1 for matrix A. 
[in]rowindrow indices of size nz for matrix A. 
[out]bnzon exit, returns the actual number of nonzeros in matrix A'*A. 
[out]b_colptrcolumn pointer of size n+1 for matrix A'+A. 
[out]b_rowindrow indices of size bnz for matrix A'+A. 

+  

+

 
-Form the structure of A'+A. A is an n-by-n matrix in column oriented
-format represented by (colptr, rowind). The output A'+A is in column
-oriented format (symmetrically, also row oriented), represented by
-(b_colptr, b_rowind).
-
 @@ -183,13 +183,13 @@

- int_t *  + int_t *  xadj, - int_t *  + int_t *  adjncy, @@ -207,43 +207,43 @@

- int_t *  + int_t *  delta, - int_t *  + int_t *  dhead, - int_t *  + int_t *  qsize, - int_t *  + int_t *  llist, - int_t *  + int_t *  marker, - int_t *  + int_t *  maxint, - int_t *  + int_t *  nofsub  @@ -290,19 +290,19 @@

- const int_t  + const int_t  nnz, - int_t *  + int_t *  colptr, - int_t *  + int_t *  rowind, @@ -318,12 +318,23 @@

+
Parameters
+ + + + + + + +
[in]mNumber of rows in matrix A.
[in]nNumber of columns in matrix A.
[in]nnzNumber of nonzeros in matrix A.
[in]colptrColumn pointer of size n+1 for matrix A.
[in]rowindRow indices of size nnz for matrix A.
[out]perm_cColumn permutation vector.
+
+
Here is the call graph for this function:
- + @@ -357,19 +368,19 @@

- int_t  + int_t  bnz, - int_t *  + int_t *  b_colptr, - int_t *  + int_t *  b_rowind, @@ -385,12 +396,22 @@

+
Parameters
+ + + + + + +
[in]nNumber of columns in matrix B.
[in]bnzNumber of nonzeros in matrix B.
[in]b_colptrColumn pointer of size n+1 for matrix B.
[in]b_rowindRow indices of size bnz for matrix B.
[out]perm_cColumn permutation vector.
+
+
Here is the call graph for this function:
- +
@@ -428,48 +449,31 @@

-
-Purpose
-=======
-
-GET_PERM_C obtains a permutation matrix Pc, by applying the multiple
-minimum degree ordering code by Joseph Liu to matrix A'*A or A+A'.
-or using approximate minimum degree column ordering by Davis et. al.
-The LU factorization of A*Pc tends to have less fill than the LU 
-factorization of A.
-
-Arguments
-=========
-
-ispec   (input) int
-        Specifies the type of column ordering to reduce fill:
-        = 1: minimum degree on the structure of A^T * A
-        = 2: minimum degree on the structure of A^T + A
-        = 3: approximate minimum degree for unsymmetric matrices
-        If ispec == 0, the natural ordering (i.e., Pc = I) is returned.
-
-A       (input) SuperMatrix*
-        Matrix A in A*X=B, of dimension (A->nrow, A->ncol). The number
-        of the linear equations is A->nrow. Currently, the type of A 
-        can be: Stype = NC; Dtype = _D; Mtype = GE. In the future,
-        more general A can be handled.
-
-perm_c  (output) int*
-        Column permutation vector of size A->ncol, which defines the 
-        permutation matrix Pc; perm_c[i] = j means column i of A is 
-        in position j in A*Pc.
-
+

Obtains a permutation matrix Pc by applying the multiple minimum degree ordering code by Joseph Liu to matrix A'*A or A+A' or using approximate minimum degree column ordering by Davis et. al. The LU factorization of A*Pc tends to have less fill than the LU factorization of A.

+
Parameters
+ + + + +
[in]ispecSpecifies the type of column ordering to reduce fill:
+ = 1: minimum degree on the structure of A^T * A
+ = 2: minimum degree on the structure of A^T + A
+ = 3: approximate minimum degree for unsymmetric matrices
+ If ispec == 0, the natural ordering (i.e., Pc = I) is returned.
[in]AMatrix A in A*X=B, of dimension (A->nrow, A->ncol). The number of the linear equations is A->nrow. Currently, the type of A can be: Stype = NC; Dtype = _D; Mtype = GE. In the future, more general A can be handled.
[out]perm_cColumn permutation vector of size A->ncol, which defines the permutation matrix Pc; perm_c[i] = j means column i of A is in position j in A*Pc.
+
+
+
Here is the call graph for this function:
- - + + - + - - + + @@ -514,37 +518,37 @@

- const int_t  + const int_t  nz, - int_t *  + int_t *  colptr, - int_t *  + int_t *  rowind, - int_t *  + int_t *  atanz, - int_t **  + int_t **  ata_colptr, - int_t **  + int_t **  ata_rowind  @@ -554,24 +558,29 @@

-
-Purpose
-=======
-
-Form the structure of A'*A. A is an m-by-n matrix in column oriented
-format represented by (colptr, rowind). The output A'*A is in column
-oriented format (symmetrically, also row oriented), represented by
-(ata_colptr, ata_rowind).
-
-This routine is modified from GETATA routine by Tim Davis.
-The complexity of this algorithm is: SUM_{i=1,m} r(i)^2,
-i.e., the sum of the square of the row counts.
+
A is an m-by-n matrix in column oriented format represented by (colptr, rowind). The output A'*A is in column oriented format (symmetrically, also row oriented), represented by (ata_colptr, ata_rowind).

+
This routine is modified from GETATA routine by Tim Davis. The complexity of this algorithm is: SUM_{i=1,m} r(i)^2, i.e., the sum of the square of the row counts.

+
Questions

+ 
    
+
  • 
+Do I need to withhold the dense rows? 
    • 
+
  • 
+How do I know the number of nonzeros in A'*A? 
    • 
+

+
Parameters

+  
+    
+    
+    
+    
+    
+    
+    
+    
+  
[in]mnumber of rows in matrix A. 
[in]nnumber of columns in matrix A. 
[in]nznumber of nonzeros in matrix A 
[in]colptrcolumn pointer of size n+1 for matrix A. 
[in]rowindrow indices of size nz for matrix A. 
[out]atanzon exit, returns the actual number of nonzeros in matrix A'*A. 
[out]ata_colptrcolumn pointer of size n+1 for matrix A'*A. 
[out]ata_rowindrow indices of size atanz for matrix A'*A. 

+  

+

 
-Questions
-=========
-    o  Do I need to withhold the *dense* rows?
-    o  How do I know the number of nonzeros in A'*A?
-

diff --git a/DOC/html/globals.html b/DOC/html/globals.html index 7e8897ec..404dd85e 100644 --- a/DOC/html/globals.html +++ b/DOC/html/globals.html @@ -41,8 +41,15 @@
Here is a list of all functions, variables, defines, enums, and typedefs with links to the files they belong to:
-

- _ -

diff --git a/DOC/html/globals_defs.html b/DOC/html/globals_defs.html index 908a5217..3a9955fb 100644 --- a/DOC/html/globals_defs.html +++ b/DOC/html/globals_defs.html @@ -41,8 +41,14 @@
  -

- _ -

diff --git a/DOC/html/globals_type.html b/DOC/html/globals_type.html index 86472b85..b743c2a0 100644 --- a/DOC/html/globals_type.html +++ b/DOC/html/globals_type.html @@ -45,7 +45,7 @@
  • ExpHeader : slu_util.h
  • flops_t : slu_util.h
  • fptr : c_fortran_cgssv.c, c_fortran_dgssv.c, c_fortran_sgssv.c, c_fortran_zgssv.c
    • -
  • int_t : superlu_config.h
    • +
  • int_t : superlu_config.h
  • Logical : slu_util.h
  • NRformat_loc3d : supermatrix.h
  • shortint : mmd.c
    • diff --git a/DOC/html/globals_vars.html b/DOC/html/globals_vars.html index ffa065bd..0f1035cc 100644 --- a/DOC/html/globals_vars.html +++ b/DOC/html/globals_vars.html @@ -48,13 +48,13 @@

    - c -