Click here to Skip to main content
15,881,588 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.5K   2.6K   93  
A fast, reference counted, copy-on-write string class
#include "stdafx.h"

/*
 * -- SuperLU routine (version 2.0) --
 * Lawrence Berkeley National Lab, Univ. of California Berkeley,
 * and Xerox Palo Alto Research Center.
 * September 10, 2007
 *
 */
/*
 * File name:	clangs.c
 * History:     Modified from lapack routine CLANGE
 */
#include <math.h>
#include "hnum_pcsp_defs.h"


/* 
    Purpose   
    =======   

    CLANGS returns the value of the one norm, or the Frobenius norm, or 
    the infinity norm, or the element of largest absolute value of a 
    real matrix A.   

    Description   
    ===========   

    CLANGS returns the value   

       CLANGS = ( max(abs(A(i,j))), NORM = 'M' or 'm'   
                (   
                ( norm1(A),         NORM = '1', 'O' or 'o'   
                (   
                ( normI(A),         NORM = 'I' or 'i'   
                (   
                ( normF(A),         NORM = 'F', 'f', 'E' or 'e'   

    where  norm1  denotes the  one norm of a matrix (maximum column sum), 
    normI  denotes the  infinity norm  of a matrix  (maximum row sum) and 
    normF  denotes the  Frobenius norm of a matrix (square root of sum of 
    squares).  Note that  max(abs(A(i,j)))  is not a  matrix norm.   

    Arguments   
    =========   

    NORM    (input) CHARACTER*1   
            Specifies the value to be returned in CLANGE as described above.   
    A       (input) SuperMatrix*
            The M by N sparse matrix A. 

   ===================================================================== 
*/
namespace harlinn
{
    namespace numerics
    {
        namespace SuperLU
        {
            float clangs(char *norm, SuperMatrix *A)
            {
                /* Local variables */
                NCformat *Astore;
                complex   *Aval;
                int      i, j, irow;
                float   value, sum;
                float   *rwork;

                Astore = (NCformat*)A->Store;
                Aval   = (complex*)Astore->nzval;
    
                if ( SUPERLU_MIN(A->nrow, A->ncol) == 0) {
	            value = 0.;
	
                } else if (lsame_(norm, "M")) {
	            /* Find max(abs(A(i,j))). */
	            value = 0.;
	            for (j = 0; j < A->ncol; ++j)
	                for (i = Astore->colptr[j]; i < Astore->colptr[j+1]; i++)
		            value = SUPERLU_MAX( value, c_abs( &Aval[i]) );
	
                } else if (lsame_(norm, "O") || *(unsigned char *)norm == '1') {
	            /* Find norm1(A). */
	            value = 0.;
	            for (j = 0; j < A->ncol; ++j) {
	                sum = 0.;
	                for (i = Astore->colptr[j]; i < Astore->colptr[j+1]; i++) 
		            sum += c_abs( &Aval[i] );
	                value = SUPERLU_MAX(value,sum);
	            }
	
                } else if (lsame_(norm, "I")) {
	            /* Find normI(A). */
	            if ( !(rwork = (float *) SUPERLU_MALLOC((size_t) A->nrow * sizeof(float))) )
	                SUPERLU_ABORT("SUPERLU_MALLOC fails for rwork.");
	            for (i = 0; i < A->nrow; ++i) rwork[i] = 0.;
	            for (j = 0; j < A->ncol; ++j)
	                for (i = Astore->colptr[j]; i < Astore->colptr[j+1]; i++) {
		            irow = Astore->rowind[i];
		            rwork[irow] += c_abs( &Aval[i] );
	                }
	            value = 0.;
	            for (i = 0; i < A->nrow; ++i)
	                value = SUPERLU_MAX(value, rwork[i]);
	
	            SUPERLU_FREE (rwork);
	
                } else if (lsame_(norm, "F") || lsame_(norm, "E")) {
	            /* Find normF(A). */
	            SUPERLU_ABORT("Not implemented.");
                } else
	            SUPERLU_ABORT("Illegal norm specified.");

                return (value);

            } /* clangs */
        };
    };
};            


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