dQuerySpace (3p)

Name

dQuerySpace - A inquiry function that provides information on the memory statistics of the SuperLU solver.

Synopsis

#include <sunperf.h>


int sQuerySpace(SuperMatrix *L, SuperMatrix *U, mem_usage_t *memusage);


int dQuerySpace(SuperMatrix *L, SuperMatrix *U, mem_usage_t *memusage);


int cQuerySpace(SuperMatrix *L, SuperMatrix *U, mem_usage_t *memusage);


int zQuerySpace(SuperMatrix *L, SuperMatrix *U, mem_usage_t *memusage);


long     sQuerySpace_64(SuperMatrix_64     *L,    SuperMatrix_64    *U,
mem_usage_t_64 *memusage);


long    dQuerySpace_64(SuperMatrix_64    *L,     SuperMatrix_64     *U,
mem_usage_t_64 *memusage);


long     cQuerySpace_64(SuperMatrix_64     *L,    SuperMatrix_64    *U,
mem_usage_t_64 *memusage);


long    zQuerySpace_64(SuperMatrix_64    *L,     SuperMatrix_64     *U,
mem_usage_t_64 *memusage);

Description

Oracle Solaris Studio Performance Library                       QuerySpace(3P)



NAME
       QuerySpace:  cQuerySpace,  dQuerySpace,  sQuerySpace,  zQuerySpace  - A
       inquiry function that provides information on the memory statistics  of
       the SuperLU solver.


SYNOPSIS
       #include <sunperf.h>


       int sQuerySpace(SuperMatrix *L, SuperMatrix *U, mem_usage_t *memusage);


       int dQuerySpace(SuperMatrix *L, SuperMatrix *U, mem_usage_t *memusage);


       int cQuerySpace(SuperMatrix *L, SuperMatrix *U, mem_usage_t *memusage);


       int zQuerySpace(SuperMatrix *L, SuperMatrix *U, mem_usage_t *memusage);


       long     sQuerySpace_64(SuperMatrix_64     *L,    SuperMatrix_64    *U,
                 mem_usage_t_64 *memusage);


       long    dQuerySpace_64(SuperMatrix_64    *L,     SuperMatrix_64     *U,
                 mem_usage_t_64 *memusage);


       long     cQuerySpace_64(SuperMatrix_64     *L,    SuperMatrix_64    *U,
                 mem_usage_t_64 *memusage);


       long    zQuerySpace_64(SuperMatrix_64    *L,     SuperMatrix_64     *U,
                 mem_usage_t_64 *memusage);


PURPOSE
       QuerySpace  is called after the LU factorization to calculate the stor-
       age requirement based on the size of the L and U  data  structures  and
       working arrays.  The information is stored in a structure as follows:

       typedef struct {
           float for_lu;
           float total_needed;
           int   expansions;
       } mem_usage_t;

       typedef struct {
           float for_lu;
           float total_needed;
           long  expansions;
       } mem_usage_t_64;

       where


       for_lu is the amount of space used in bytes for the L and U data struc-
              tures.


       total_needed is the amount of space needed in bytes to perform  factor-
              ization.


       expansions  is the number of memory expansions during the LU factoriza-
              tion.

QuerySpace returns zero.


ARGUMENTS
       SuperMatrix *L (input)
                 Factor L from the A=LU factorization.


       SuperMatrix *U (input)
                 Factor U from the A=LU factorization.


       mem_usage_t *memusage (output)
                 Structure holding the memory requirement  of  the  factoriza-
                 tion.


SEE ALSO
       SuperMatrix

       http://crd.lbl.gov/~xiaoye/SuperLU/

       James  W.  Demmel,  Stanley C. Eisenstat, John R. Gilbert, Xiaoye S. Li
       and Joseph W. H. Liu, "A supernodal approach to sparse  partial  pivot-
       ing",  SIAM J. Matrix Analysis and Applications, Vol. 20, Num. 3, 1999,
       pp. 720-755.



                                  7 Nov 2015                    QuerySpace(3P)