LAP_DoublePackedUpperMatrix.h

Go to the documentation of this file.

#ifndef LAP_DoublePackedUpperMatrix_H
#define LAP_DoublePackedUpperMatrix_H


#include "LAP_DoublePackedStorage.h"
#include "LAP_DoubleUpperMatrix.h"

#include "LAP_DoubleVector.h"


#include "LAP_DoubleFullGeneralMatrix.h"


#include "dfulluppermatrix_functions.h"
#include "dpackeduppermatrix_functions.h"
#include "dvector_functions.h"

DEFINE_SPTR(LAP_DoublePackedMatrix);

DEFINE_SPTR(LAP_DoublePackedUpperMatrix);
class LAP_DoublePackedUpperMatrix: public virtual LAP_DoubleUpperMatrix {
    
    SP_OBJECT(LAP_DoublePackedUpperMatrix);
    
private:
    // ATTRIBUTES
    
    // ASSOCIATIONS
 
    
    // METHOD
  
  
public:
    // CONSTRUCTORS
    LAP_DoublePackedUpperMatrix();
    LAP_DoublePackedUpperMatrix(const LAP_DoublePackedUpperMatrix& mat);
  
    // DESTRUCTORS
    virtual ~LAP_DoublePackedUpperMatrix();

    
    
    // -------------
    // NEW METHODS
    // -------------
public:

    inline static SP::LAP_DoublePackedUpperMatrix New() {
        SP::LAP_DoublePackedUpperMatrix p(new LAP_DoublePackedUpperMatrix(),
                                          LAP_DoublePackedUpperMatrix::Delete());
        p->setThis(p);
        return p;
    };

    inline static SP::LAP_DoublePackedUpperMatrix New(const tLVectorIndex& n) {
        SP::LAP_DoublePackedUpperMatrix p=New();
        p->setSize(n);
        return p;
    };
    virtual SP::LAP_DoubleMatrix NewInstance() const {
        return New();
    }
   
    //-----------
    // OPERATORS
    // ----------

    
    virtual double& operator()(const tLVectorIndex& i,const tLVectorIndex& j) {
        return (i<=j)?getPackedStorage()(i,j):getNullValue();
    };
    
    virtual const double& operator()(const tLVectorIndex& i,const tLVectorIndex& j) const {
        return (i<=j)?getPackedStorage()(i,j):getNullValue();
    };
    
   
    //scalar operators
    //================
    
    inline LAP_DoublePackedUpperMatrix& operator^=(const lapack_real&  s) {
        getPackedStorage()^=s;
        return (*this);
    }
    
    inline LAP_DoublePackedUpperMatrix& operator*=(const lapack_real&  s) {
        getPackedStorage()*=s;
        return (*this);
    }
    inline LAP_DoublePackedUpperMatrix& operator/=(const lapack_real&  s) {
        getPackedStorage()/=s;
        return (*this);
    }
 
    inline LAP_DoublePackedUpperMatrix& operator+=(const lapack_real&  s) {
        getPackedStorage()+=s;
        return (*this);
    }
  
  
    inline LAP_DoublePackedUpperMatrix& operator-=(const lapack_real&  s) {
        getPackedStorage()-=s;
        return (*this);
    }
    
    //pack matrix operator
    //=====================
    
    inline LAP_DoublePackedUpperMatrix& operator*=(const LAP_DoublePackedUpperMatrix& s) {
        getPackedStorage()*=s.getPackedStorage();
        return (*this);
    }
    inline LAP_DoublePackedUpperMatrix& operator/=(const LAP_DoublePackedUpperMatrix& s) {
        getPackedStorage()/=s.getPackedStorage();
        return (*this);
    }
    
    inline LAP_DoublePackedUpperMatrix& operator-=(const LAP_DoublePackedUpperMatrix& s) {
        getPackedStorage()-=s.getPackedStorage();
        return (*this);
    }
    inline LAP_DoublePackedUpperMatrix& operator+=(const LAP_DoublePackedUpperMatrix& s) {
        getPackedStorage()+=s.getPackedStorage();
        return (*this);
    }
    
    
    
    
    //copy operator
    //=============
    
    LAP_DoublePackedUpperMatrix& operator=(const double& s)  {
        getStorage().init(s);
        return (*this);
    };
    LAP_DoublePackedUpperMatrix& operator=(const LAP_DoubleMatrix& s)  {
        copy(s);
        return (*this);
    };
 
    
  

public:
    
  
    virtual tBoolean copyLower(const LAP_DoubleFullGeneralMatrix& f);

    
    //dimension setting
    //=================
     
    virtual void setSize(const tLVectorIndex & nRows,const tLVectorIndex& nCols) {
        tLVectorIndex d=(nRows<nCols)?nRows:nCols;
        LAP_DoubleUpperMatrix::setSize(d,d);
        
        getStorage().setValuesNumber((tLVectorIndex) ((tLVectorIndex)d)*(((tLVectorIndex)d)+1)/2);
    }
    
    virtual void setSize(const tLVectorIndex & n) {
        LAP_DoubleUpperMatrix::setSize(n,n);

        getStorage().setValuesNumber( ( (tLVectorIndex)n)*((tLVectorIndex)(n+1)) /2 );
    }
    
     // values setting
    //================
    
    virtual void setValues(SP::LAP_DoubleVector values) {
        ASSERT_IN(values.get()!=null);

        //compute the number of columns
        tLVectorIndex n=values->getSize();
        n=( ((sqrt(1+8*n)-1)/2) +0.5);
        
        LAP_DoubleUpperMatrix::setSize(n,n);

        //set the values pointer
        getStorage().setValuesPointer(values);
        
    }
    
    virtual void setValues(const tLVectorIndex& n,const double* values) {
        
        tLVectorIndex nRows=( ((sqrt(1+8*n)-1)/2) +0.5);
        LAP_DoubleUpperMatrix::setSize(nRows,nRows);

        //set the values 
        getStorage().setValues(n,values);
        
    }
  
    //======
private:
    inline LAP_DoublePackedStorage& getPackedStorage() {
        return *dynamic_cast<LAP_DoublePackedStorage*>(&getStorage());
    };
    inline const LAP_DoublePackedStorage& getPackedStorage() const {
        return *dynamic_cast<const LAP_DoublePackedStorage*>(&getStorage());
    };
    
public:
    virtual void getColumn(const tLVectorIndex& j,LAP_DoubleVector& v) const;
    virtual void getColumn(const tLVectorIndex& j,SP::LAP_DoubleVector v) const {
        ASSERT_IN(v.get()!=null);
        getColumn(j,*v.get());
    };

    virtual void getRow(const tLVectorIndex& i,LAP_DoubleVector& v) const;
    
    virtual void getRow(const tLVectorIndex& i,SP::LAP_DoubleVector v) const {
        ASSERT_IN(v.get()!=null);
        getRow(i,*v.get());
    };
    
 
   

  
    // ------------------------
    // operation on matrix
    // ------------------------
public:
    
    
    virtual tReal norm2() const;
    
    virtual tReal norm2(LAP_DoubleVector& v) const;
    
 
  
    

    virtual tReal sum(const tFlag& d,LAP_DoubleVector& s) const;
    
    virtual tReal sum(const tFlag& d,const tLVectorIndex& index) const;
    
  

   
    
   
    // ----------------
    // vector product
    // ----------------
    
public:
    virtual void vectorProduct(const tBoolean& isTrans,LAP_DoubleVector& X) const {
        vectorProduct(isTrans,1,X);
    } /* \brief compute X:=alpha.op(This).X
     * @param isTrans : if (isTrans) op(A)=A else op(A)=tA
     * @param alpha: alpha value
     * @param X: X 
     */
    inline void vectorProduct(const tBoolean& isTrans,const double& alpha,LAP_DoubleVector& X) const {
        if (alpha==0) X=0;
        else {
            tLVectorIndex nRows=getRowsNumber();
            tLVectorIndex nCols=getColumnsNumber();
            if (nRows==nCols) {
                //X:=op(This).X
                vectorProduct(isTrans,nRows,X.getIncrement(),&X(0));
                //X*=alpha
                if (alpha!=1) X*=alpha;
            }
            else {
                LAP_DoubleVector Y;
                Y.setSize(nRows);
                vectorProduct(isTrans,
                              X.getSize(),X.getIncrement(),&X(0),
                              alpha,0.,
                              Y.getSize(),Y.getIncrement(),&Y(0));
                X.copy(Y);
            }
        }
        
    };
   
   
    virtual void vectorProduct(const tBoolean& isTrans,const LAP_DoubleVector& X,LAP_DoubleVector& Y) const {
        vectorProduct(isTrans,X,1.,0.,Y);
    }
    
    void vectorProduct(const tBoolean& isTrans,
                       const LAP_DoubleVector& X,
                       const lapack_real& alpha,
                       const lapack_real& beta,
                       LAP_DoubleVector& Y) const {
        //get the dimenson of Matrix
        tLVectorIndex nRows=getRowsNumber();
        tLVectorIndex nCols=getColumnsNumber();

        if (nRows==0) return;
        
        if (isTrans) std::swap(nRows,nCols);
        
        tLVectorIndex nX=X.getSize();
        
        //verify the dimension of X
        if (nX!=nCols) {
            throw LAP_Exception("math/linalg/core","LAP_DoublePackedUpperMatrix::product()","incompatible size of X vector");
        }
        //verify the packed upper marix is squared
        if (nRows!=nCols) {
            throw LAP_Exception("math/linalg/core","LAP_DoublePackedUpperMatrix::product()","only squared matrix");
        }

        //create the right dimension of return vector Y
        if (beta==0) {
            //Y=X
            Y.copy(X);
            //Y=op(A).X
            vectorProduct(isTrans,nRows,Y.getIncrement(),&Y(0));
            //Y=alpha.op(A).X
            if (alpha!=1) Y*=alpha;
            return;
        }
        
        //verify the dimension of Y
        tLVectorIndex nY=Y.getSize();
        if (nY!=nRows) {
            throw LAP_Exception("math/linalg/core","LAP_DoublePackedUpperMatrix::product()","incompatible size of Y vector");
        }

        //test if the lapack mat-vector routine can be called : Y:=alpha.op(A).X
      
        vectorProduct(isTrans,
                      nX,X.getIncrement(),&X(0),
                      alpha,
                      beta,
                      nY,Y.getIncrement(),&Y(0));
    };
    
    void vectorProduct(const tBoolean& isTrans,
                       const LAP_ConstDoubleVector& X,
                       const lapack_real& alpha,
                       const lapack_real& beta,
                       LAP_DoubleVector& Y) const {
        //get the dimenson of Matrix
        tLVectorIndex nRows=getRowsNumber();
        tLVectorIndex nCols=getColumnsNumber();
        if (isTrans) std::swap(nRows,nCols);
        
        tLVectorIndex nX=X.getSize();
        
        //verify the dimension of X
        if (nX!=nCols) {
            throw LAP_Exception("math/linalg/core","LAP_DoublePackedUpperMatrix::product()","incompatible size of X vector");
        }
       
        if (beta==0) {
            Y.setSize(nRows);
        }
        tLVectorIndex nY=Y.getSize();
        if (nY!=nRows) {
            throw LAP_Exception("math/linalg/core","LAP_DoublePackedUpperMatrix::product()","incompatible size of Y vector");
        }
      
        vectorProduct(isTrans,
                      nX,X.getIncrement(),&X(0),
                      alpha,
                      beta,
                      nY,Y.getIncrement(),&Y(0));
    };
   
   
    
public:

    
    inline void vectorProduct(const tBoolean& isTrans,const tLVectorIndex& nX,const tLVectorIncrement& incX,double* X) const {
        
        tLVectorIndex nRows=getRowsNumber();
        tLVectorIndex nCols=getColumnsNumber();
        if (nRows==0) return;
        
        if (nRows!=nCols) {
            throw LAP_Exception("math/linalg/core","LAP_DoublePackedUpperMatrix::product()",
                                "X=A.X needs to have a squared matrix");
        }
        if (nCols!=nX) {
            throw LAP_Exception("math/linal/core","LAP_DoublePackedUpperMatrix::product","incompatible size of X vector");
        }
        
        DoublePackedUpperMatrixVectorProduct(isTrans,
                                           nRows,
                                           &(*this)(0,0),
                                           nX,incX,X);
    }
    void vectorProduct(const tBoolean& isTrans,
                       const tLVectorIndex& nX,const tLVectorIncrement& incX,const double *x,
                       const double& alpha,const double& beta,
                       const tLVectorIndex& nY,const tLVectorIncrement& incY,double *y) const;
    
    
public:
  
    virtual void rankProduct(const tBoolean& isTransU,
                             const LAP_DoubleVector& Diag,
                             LAP_DoubleVector& X) const{
        tLVectorIndex nX=X.getSize();
       
        if (nX!=getRowsNumber()) {
            throw LAP_Exception("math/linal/core"," LAP_DoublePackedUpperMatrix:rankDProduct","incompatible dimension of vector");
        }
        if (nX!=getColumnsNumber()) {
            throw LAP_Exception("math/linal/core"," LAP_DoublePackedUpperMatrix:rankDProduct","incompatible dimension of vector");
        }
        if (nX!=Diag.getSize()) {
            throw LAP_Exception("math/linal/core"," LAP_DoublePackedUpperMatrix:rankDProduct","incompatible dimension of vectors");
        }
        DoublePackedUpperMatrixVectorProduct(isTransU,
                                           getRowsNumber(),
                                           &(*this)(0,0),
                                           X.getSize(),X.getIncrement(),&X(0));
        
        X*=Diag;
        
        DoublePackedUpperMatrixVectorProduct(!isTransU,
                                             getRowsNumber(),
                                             &(*this)(0,0),
                                             X.getSize(),X.getIncrement(),&X(0));
    }
    
    
    virtual void rankProduct(const tBoolean& isTransU,LAP_DoubleVector& X) const{
        tLVectorIndex nX=X.getSize();
        
        if (nX!=getRowsNumber()) {
            throw LAP_Exception("math/linal/core"," LAP_DoublePackedUpperMatrix:rankProduct","incompatible dimension of vector");
        }
        if (nX!=getColumnsNumber()) {
            throw LAP_Exception("math/linal/core"," LAP_DoublePackedUpperMatrix:rankProduct","incompatible dimension of vector");
        }
        DoublePackedUpperMatrixVectorProduct(isTransU,
                                           getRowsNumber(),
                                           &(*this)(0,0),
                                           X.getSize(),X.getIncrement(),&X(0));
        DoublePackedUpperMatrixVectorProduct(!isTransU,
                                           getRowsNumber(),
                                           &(*this)(0,0),
                                           X.getSize(),X.getIncrement(),&X(0));
        
    }
    
    
  
    
    
public:

  
    // ----------------
    // matrix product
    // ----------------
    virtual SP::LAP_DoubleMatrix matrixProduct(const LAP_DoubleMatrix& B) const;
    
    
    // ----------------
    tBoolean matrixProduct(const LAP_DoubleMatrix& B,
                           LAP_DoubleFullGeneralMatrix& C) const;
    
    
    
    //product with full matrix
    //-------------------------
    
    void matrixProduct(const LAP_DoubleFullGeneralMatrix& B,
                       LAP_DoubleFullGeneralMatrix& C) const {
        
        matrixProduct(false,false,B,1.,C);
    };
     
    void matrixProduct(const LAP_DoublePackedUpperMatrix& B,
                      LAP_DoubleFullGeneralMatrix& C) const;
    
        
    void matrixProduct(const tBoolean& isLeft,
                       const tBoolean& isTrans,
                       const LAP_DoubleFullGeneralMatrix& B,
                       const double& alpha,
                       LAP_DoubleFullGeneralMatrix& C) const;
    

    virtual void matrixProduct(const tBoolean& isLeft,
                               const tBoolean& isTrans,
                               const double& alpha,
                               LAP_DoubleFullGeneralMatrix& A) const {
        matrixProduct(isLeft,isTrans,*this,alpha,A);
    }
    virtual void matrixProduct(const tBoolean& isTrans,
                               const double& alpha,
                               LAP_DoubleFullGeneralMatrix& A) const {
        matrixProduct(true,isTrans,*this,alpha,A);
    }
    
    
    
    static void matrixProduct(const tBoolean& isLeft,
                              const tBoolean& isTransA,
                              const LAP_DoublePackedUpperMatrix& A,
                              const lapack_real& alpha,
                              LAP_DoubleFullGeneralMatrix& B);

    
    
  
    // ----------------------
    // eigen values & vectors
    // ------------------------
public:
    
    
    static tBoolean computeEigenValues(const LAP_DoublePackedUpperMatrix&A,
                                       LAP_DoubleVector& U) {

        tLVectorIndex i,nRows=A.getRowsNumber();
        U.setSize(nRows);
        double *U_i=&U(0);
        const  tLVectorIncrement&incU=U.getIncrement();
        const double *A_ii=&A(0,0);
        for (i=0;i<nRows;i++) {
            *U_i=*A_ii;
            U_i+=incU;
            A_ii+=(i+2);
        }
        return true;
    }
    
    virtual tBoolean computeEigenValues(LAP_DoubleVector& U) const {
        return computeEigenValues(*this,U);
    };    
   
  


  
    // -----------------------
    // linear system solver
    // -----------------------
     
    virtual void solve(const tBoolean& isTrans,
                       LAP_DoubleVector& B) const {
        tLVectorIndex nB=B.getSize();
        if (nB!=0)
            solve(isTrans,B.getSize(),B.getIncrement(),&B(0));
    }
    virtual void solve(const tBoolean& isTrans,
                       const tLVectorIndex& nB,const tLVectorIncrement& incB,double *B) const {
        
        tLVectorIndex nRows=getRowsNumber();
        tLVectorIndex nCols=getColumnsNumber();
        if (nRows==0) return;
        if (nRows!=nB)
            throw LAP_Exception("math/linal/core"," LAP_DoublePackedUpperMatrix:solve","incompatible dimension of vector");
        if (nRows!=nCols)
            throw LAP_Exception("math/linal/core"," LAP_DoublePackedUpperMatrix:solve","only be used with squared matrix");
        
        DoublePackedUpperMatrixVectorSolve(isTrans,nRows,&(*this)(0,0),nB,incB,B);
    }
    
    virtual tBoolean solve(const tBoolean& isTrans,
                           LAP_DoubleFullGeneralMatrix& X) const {
        return solve(isTrans,*this,X);
    }
    
    static tBoolean solve(const tBoolean& isTransA,
                          const LAP_DoublePackedUpperMatrix& A,
                          LAP_DoubleFullGeneralMatrix& B) {

        tLVectorIndex nARows=A.getRowsNumber();
        tLVectorIndex nBRows=B.getRowsNumber();
        tLVectorIndex nBCols=B.getColumnsNumber();
        tLVectorIndex ldb=B.getLeadingDimension();
        
        if (nARows==0) return true;
        
        if (nARows!=nBRows)
            throw LAP_Exception("math/linal/core"," LAP_DoublePackedUpperMatrix:solve","incompatible size of matrices");
        
        return DoublePackedUpperMatrixSolve(isTransA,nARows,&A(0,0),nBCols,ldb,&B(0,0));
        
        
    }
    
    
    tBoolean inverse() {
        return inverse(*this);
    };
    
public:
    
    inline static tBoolean inverse(LAP_DoublePackedUpperMatrix& A) {
        
        
        int nRows=A.getRowsNumber();
        if (nRows==0) return true;
        
        return DoublePackedUpperMatrixInverse(nRows,&A(0,0));
        
    }
    

  
};
#endif