Click here to Skip to main content
15,884,388 members
Articles / High Performance Computing / Vectorization

A C++ String Class

Rate me:
Please Sign up or sign in to vote.
4.96/5 (29 votes)
3 Jan 2015CPOL13 min read 120.6K   2.6K   93  
A fast, reference counted, copy-on-write string class
#include "stdafx.h"

#include <math.h>
#include "hnum_pssp_defs.h"

namespace harlinn
{
    namespace numerics
    {
        namespace SuperLU
        {
            namespace Single
            {

                float
                sPivotGrowth(int ncols, SuperMatrix *A, int *perm_c, 
                             SuperMatrix *L, SuperMatrix *U)
                {
                /*
                 * -- SuperLU MT routine (version 2.0) --
                 * Lawrence Berkeley National Lab, Univ. of California Berkeley,
                 * and Xerox Palo Alto Research Center.
                 * September 10, 2007
                 *
                 *
                 * Purpose
                 * =======
                 *
                 * Compute the reciprocal pivot growth factor of the leading ncols columns
                 * of the matrix, using the formula:
                 *     min_j ( max_i(abs(A_ij)) / max_i(abs(U_ij)) )
                 *
                 * Arguments
                 * =========
                 *
                 * ncols    (input) int
                 *          The number of columns of matrices A, L and U.
                 *
                 * A        (input) SuperMatrix*
                 *          Original matrix A, permuted by columns, of dimension
                 *          (A->nrow, A->ncol). The type of A can be:
                 *          Stype = NC; Dtype = _D; Mtype = GE.
                 *
                 * L        (output) SuperMatrix*
                 *          The factor L from the factorization Pr*A=L*U; use compressed row
                 *          subscripts storage for supernodes, i.e., L has type:
                 *          Stype = SC; Dtype = _D; Mtype = TRLU.
                 *
                 * U        (output) SuperMatrix*
                 *          The factor U from the factorization Pr*A*Pc=L*U. Use column-wise
                 *          storage scheme, i.e., U has types: Stype = NC;
                 *          Dtype = _D; Mtype = TRU.
                 *
                 */
                    NCformat *Astore;
                    SCPformat *Lstore;
                    NCPformat *Ustore;
                    float  *Aval, *Lval, *Uval;
                    int      fsupc, nsupr, luptr, nz_in_U;
                    int      i, j, k, oldcol;
                    int      *inv_perm_c;
                    float   rpg, maxaj, maxuj;
                    
                    float   smlnum;
                    float   *luval;
   
                    /* Get machine constants. */
                    smlnum = slamch_("S");
                    rpg = 1. / smlnum;

                    Astore = (NCformat*)A->Store;
                    Lstore = (SCPformat*)L->Store;
                    Ustore = (NCPformat*)U->Store;
                    Aval = (float*)Astore->nzval;
                    Lval = (float*)Lstore->nzval;
                    Uval = (float*)Ustore->nzval;
    
                    inv_perm_c = (int *) SUPERLU_MALLOC( (size_t) A->ncol*sizeof(int) );
                    for (j = 0; j < A->ncol; ++j) inv_perm_c[perm_c[j]] = j;

                    for (k = 0; k <= Lstore->nsuper; ++k) {
	                fsupc = L_FST_SUPC(k);
	                nsupr = L_SUB_END(fsupc) - L_SUB_START(fsupc);
	                luptr = L_NZ_START(fsupc);
	                luval = &Lval[luptr];
	                nz_in_U = 1;
	
	                for (j = fsupc; j < L_LAST_SUPC(k) && j < ncols; ++j) {
	                    maxaj = 0.;
                            oldcol = inv_perm_c[j];
	                    for (i = Astore->colptr[oldcol]; i < Astore->colptr[oldcol+1]; i++)
		                maxaj = SUPERLU_MAX( maxaj, fabs(Aval[i]) );
	
	                    maxuj = 0.;
	                    for (i = Ustore->colbeg[j]; i < Ustore->colend[j]; i++)
		                maxuj = SUPERLU_MAX( maxuj, fabs(Uval[i]) );
	    
	                    /* Supernode */
	                    for (i = 0; i < nz_in_U; ++i)
		                maxuj = SUPERLU_MAX( maxuj, fabs(luval[i]) );

	                    ++nz_in_U;
	                    luval += nsupr;

	                    if ( maxuj == 0. )
		                rpg = SUPERLU_MIN( rpg, 1.);
	                    else
		                rpg = SUPERLU_MIN( rpg, maxaj / maxuj );
	                }
	
	                if ( j >= ncols ) break;
                    }

                    SUPERLU_FREE(inv_perm_c);
                    return (rpg);
                }

            };
        };
    };
};

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


Written By
Architect Sea Surveillance AS
Norway Norway
Chief Architect - Sea Surveillance AS.

Specializing in integrated operations and high performance computing solutions.

I’ve been fooling around with computers since the early eighties, I’ve even done work on CP/M and MP/M.

Wrote my first “real” program on a BBC micro model B based on a series in a magazine at that time. It was fun and I got hooked on this thing called programming ...

A few Highlights:

  • High performance application server development
  • Model Driven Architecture and Code generators
  • Real-Time Distributed Solutions
  • C, C++, C#, Java, TSQL, PL/SQL, Delphi, ActionScript, Perl, Rexx
  • Microsoft SQL Server, Oracle RDBMS, IBM DB2, PostGreSQL
  • AMQP, Apache qpid, RabbitMQ, Microsoft Message Queuing, IBM WebSphereMQ, Oracle TuxidoMQ
  • Oracle WebLogic, IBM WebSphere
  • Corba, COM, DCE, WCF
  • AspenTech InfoPlus.21(IP21), OsiSoft PI


More information about what I do for a living can be found at: harlinn.com or LinkedIn

You can contact me at espen@harlinn.no

Comments and Discussions