QuerySpace man page on OpenIndiana

Man page or keyword search:  
man Server   20441 pages
apropos Keyword Search (all sections)
Output format
OpenIndiana logo
[printable version]

QuerySpace(3P)		    Sun 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.

COPYRIGHT
       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)

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.

				  6 Mar 2009			QuerySpace(3P)
[top]

List of man pages available for OpenIndiana

Copyright (c) for man pages and the logo by the respective OS vendor.

For those who want to learn more, the polarhome community provides shell access and support.

[legal] [privacy] [GNU] [policy] [cookies] [netiquette] [sponsors] [FAQ]
Tweet
Polarhome, production since 1999.
Member of Polarhome portal.
Based on Fawad Halim's script.
....................................................................
Vote for polarhome
Free Shell Accounts :: the biggest list on the net