LAP_DoublePackedSymmetricMatrix.h

Go to the documentation of this file.

#ifndef LAP_DoublePackedSymmetricMatrix_H
#define LAP_DoublePackedSymmetricMatrix_H

#include "LAP_DoubleSymmetricMatrix.h"

#include "LAP_DoublePackedStorage.h"

#include "LAP_DoubleFullGeneralMatrix.h"

#include "LAP_DoublePackedUpperMatrix.h"

#include "LAP_DoubleVector.h"
#include "LAP_IntegerVector.h"

#include "dpackedsymmatrix_functions.h"

//friend classes
class LAP_DoubleFullSymmetricMatrix;


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

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

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

    inline static SP::LAP_DoublePackedSymmetricMatrix New(const tLVectorIndex& n) {
        SP::LAP_DoublePackedSymmetricMatrix 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):getPackedStorage()(j,i);
    };
    
    virtual const double& operator()(const tLVectorIndex& i,const tLVectorIndex& j) const {
        return (i<=j)?getPackedStorage()(i,j):getPackedStorage()(j,i);
    };
    
   
  
    //copy operator
    //=============
    
    LAP_DoublePackedSymmetricMatrix& operator=(const double& s)  {
        getStorage().init(s);
        return (*this);
    };
    LAP_DoublePackedSymmetricMatrix& operator=(const LAP_DoubleMatrix& s)  {
        copy(s);
        return (*this);
    };
 
    //scalar operators
    //================
    
    inline LAP_DoublePackedSymmetricMatrix& operator^=(const lapack_real&  s) {
        getPackedStorage()^=s;
        return (*this);
    }
    
    inline LAP_DoublePackedSymmetricMatrix& operator*=(const lapack_real&  s) {
        getPackedStorage()*=s;
        return (*this);
    }
    inline LAP_DoublePackedSymmetricMatrix& operator/=(const lapack_real&  s) {
        getPackedStorage()/=s;
        return (*this);
    }
 
    inline LAP_DoublePackedSymmetricMatrix& operator+=(const lapack_real&  s) {
        getPackedStorage()+=s;
        return (*this);
    }
  
  
    inline LAP_DoublePackedSymmetricMatrix& operator-=(const lapack_real&  s) {
        getPackedStorage()-=s;
        return (*this);
    }
    
    //pack matrix operator
    //=====================
    
    inline LAP_DoublePackedSymmetricMatrix& operator*=(const LAP_DoublePackedSymmetricMatrix& s) {
        getPackedStorage()*=s.getPackedStorage();
        return (*this);
    }
    inline LAP_DoublePackedSymmetricMatrix& operator/=(const LAP_DoublePackedSymmetricMatrix& s) {
        getPackedStorage()/=s.getPackedStorage();
        return (*this);
    }
    
    inline LAP_DoublePackedSymmetricMatrix& operator-=(const LAP_DoublePackedSymmetricMatrix& s) {
        getPackedStorage()-=s.getPackedStorage();
        return (*this);
    }
    inline LAP_DoublePackedSymmetricMatrix& operator+=(const LAP_DoublePackedSymmetricMatrix& s) {
        getPackedStorage()+=s.getPackedStorage();
        return (*this);
    }
    //full matrix operator
    //=====================
    
    LAP_DoublePackedSymmetricMatrix& operator*=(const LAP_DoubleFullSymmetricMatrix& s);
    LAP_DoublePackedSymmetricMatrix& operator/=(const LAP_DoubleFullSymmetricMatrix& s);
    
    LAP_DoublePackedSymmetricMatrix& operator-=(const LAP_DoubleFullSymmetricMatrix& s); 
    LAP_DoublePackedSymmetricMatrix& operator+=(const LAP_DoubleFullSymmetricMatrix& s);
    
    
    
    

public:
 
    //dimension setting
    //=================
     
    virtual void setSize(const tLVectorIndex & nRows,const tLVectorIndex& nCols) {
        tLVectorIndex d=(nRows<nCols)?nRows:nCols;
        LAP_DoubleSymmetricMatrix::setSize(d,d);
        
        getStorage().setValuesNumber((tLVectorIndex) ((tLVectorIndex)d)*(((tLVectorIndex)d)+1)/2);
    }
    
    virtual void setSize(const tLVectorIndex & n) {
        LAP_DoubleSymmetricMatrix::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_DoubleSymmetricMatrix::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_DoubleSymmetricMatrix::setSize(nRows,nRows);

        //set the values 
        getStorage().setValues(n,values);
        
    }
  
    //======
    
public:
    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 LAP_DoubleVector& X,LAP_DoubleVector& Y) {
        LAP_DoubleMatrix::vectorProduct(X,Y);
    }
 
    virtual void vectorProduct(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 nX=X.getSize();
        
        //verify the dimension of X
        if (nX!=nRows) {
            throw LAP_Exception("math/linalg/core","LAP_DoublePackedSymmetricMatrix::product()","incompatible size of X vector");
        }
        
        //set the dimension of Y is beta=0
        if (beta==0) {
            Y.setSize(nRows);
        }
        tLVectorIndex nY=Y.getSize();
        if (nY!=nRows) {
            throw LAP_Exception("math/linalg/core","LAP_DoublePackedSymmetricMatrix::product()","incompatible size of Y vector");
        }
        //make the product
        vectorProduct(nX,X.getIncrement(),&X(0),
                      alpha,
                      beta,
                      nY,Y.getIncrement(),&Y(0));
    };
  
    virtual void vectorProduct(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 nX=X.getSize();
        
        //verify the dimension of X
        if (nX!=nRows) {
            throw LAP_Exception("math/linalg/core","LAP_DoublePackedSymmetricMatrix::product()","incompatible size of X vector");
        }
        
        //set the dimension of Y is beta=0
        if (beta==0) {
            Y.setSize(nRows);
        }
        tLVectorIndex nY=Y.getSize();
        if (nY!=nRows) {
            throw LAP_Exception("math/linalg/core","LAP_DoublePackedSymmetricMatrix::product()","incompatible size of Y vector");
        }
        //make the product
        vectorProduct(nX,X.getIncrement(),&X(0),
                      alpha,
                      beta,
                      nY,Y.getIncrement(),&Y(0));
    };
    
    
public:
    virtual void vectorProduct(const tBoolean& isTrans,
                               const tLVectorIndex& nX,const tLVectorIncrement& incX,const double *X,
                               const lapack_real& alpha, const lapack_real& beta,
                               const tLVectorIndex& nY,const tLVectorIncrement& incY,double *Y) const {
        vectorProduct(nX,incX,X,alpha,beta,nY,incY,Y);
    }
    
    virtual void vectorProduct(const tLVectorIndex& nx,const tLVectorIncrement& incx,const double* x,
                               const lapack_real& alpha,
                               const lapack_real& beta,
                               const tLVectorIndex& ny,const tLVectorIncrement&incy,double* y) const {
       
        tLVectorIndex nRows=getRowsNumber();
        if (nRows==0) return;
        if (nRows!=nx) {
            throw LAP_Exception("math/linal/core","LAP_DoublePackedSymmetricMatrix::product","incompatible size of X vector");
        }
        if (nRows!=ny) {
            throw LAP_Exception("math/linal/core","LAP_DoublePackedSymmetricMatrix::product","incompatible size of Y vector");
        }
        if (x==y) {
            throw LAP_Exception("math/linal/core","LAP_DoublePackedSymmetricMatrix::product","x & y must have different pointer");
        }
        
        DoublePackedSymmetricMatrixVectorProduct(nx,incx,x,
                                                 nRows,                                          
                                                 &(*this)(0,0),
                                                 alpha,beta,
                                                 ny,incy,y);
    }
    
    
    

public:
    virtual void dotProduct(const LAP_DoubleVector& v) {
        dotProduct(1,v);
    };
    virtual void dotProduct(const double& alpha,const LAP_DoubleVector& X) {
        //A is considered to be of size 1 x Nx : X is the first row
        tLVectorIndex nRows=X.getSize();
        setSize(nRows);
        
        DoublePackedSymmetricMatrixRankSymmetricProduct(X.getIncrement(),&X(0),//X
                                                        alpha,//alpha
                                                        nRows,&(*this)(0,0));
        
    }
    void rankSymmetricProduct(const LAP_DoubleFullGeneralMatrix& A) {
        rankSymmetricProduct(1.,0.,false,A);
    }
    void rankSymmetricProduct(const double& alpha,const tBoolean& isTrans,const LAP_DoubleFullGeneralMatrix& A) {
        rankSymmetricProduct(alpha,0,isTrans,A);
    }
    
    virtual void rankSymmetricProduct(const double& alpha,const double& beta,const tBoolean& isTrans,
                                      const LAP_DoubleFullGeneralMatrix& A) {
        //A is considered to be of size 1 x Nx : X is the first row
        tLVectorIndex nARows=A.getRowsNumber();
        tLVectorIndex nACols=A.getColumnsNumber();
        tLVectorIndex ldA=A.getLeadingDimension();
        const tLVectorIncrement& incA=A.getRowIncrement();
        if (nARows*nACols==0) return;
        rankSymmetricProduct(alpha,beta,nARows,nACols,incA,ldA,isTrans,&A(0,0));
        
    }
  
    virtual void rankSymmetricProduct(const double& alpha,const double& beta,
                                      const tLVectorIndex& nARows,const tLVectorIndex& nACols,const tLVectorIncrement& incA,const tLVectorIndex& ldA,
                                      const tBoolean& isTransA,const double* A) {
        if (alpha==0) {
            (*this)*=beta;
            return;
        }
        tLVectorIndex nRows=nARows;
        tLVectorIndex nCols=nACols;
        if (isTransA) std::swap(nRows,nCols);
        if (beta==0) {
            setSize(nRows);
        } else {
            if (getRowsNumber()!=nRows) {
                throw LAP_Exception("math/linalg/core",
                                    "LAP_DoublePackedSymmetricMatrix::rankSymmetricProduct",
                                    "matrices size incompatible");
            }
        }
        
        DoublePackedSymmetricMatrixKRankSymmetricProduct(nARows,nACols,incA,ldA,isTransA,A,
                                                         alpha,beta,
                                                         0,0,null,
                                                         nRows,&(*this)(0,0));
    }
    
    void rankSymmetricProduct(const LAP_DoubleVector& D,const LAP_DoubleFullGeneralMatrix& A) {
        rankSymmetricProduct(D,1.,0.,false,A);
    }
    void rankSymmetricProduct(const LAP_DoubleVector& D,const double& alpha,const tBoolean& isTrans,const LAP_DoubleFullGeneralMatrix& A) {
        rankSymmetricProduct(D,alpha,0,isTrans,A);
    }
    
    virtual void rankSymmetricProduct(const LAP_DoubleVector& D,const double& alpha,const double& beta,const tBoolean& isTrans,const LAP_DoubleFullGeneralMatrix& A) {
        if (alpha==0) {
            (*this)*=beta;
            return;
        }
        //A is considered to be of size 1 x Nx : X is the first row
        tLVectorIndex nRows=A.getRowsNumber();
        tLVectorIndex nCols=A.getColumnsNumber();
        if (nRows*nCols==0) return;
        
        if (isTrans) std::swap(nRows,nCols);
        if (beta==0) {
            setSize(nRows);
        } else {
            if (getRowsNumber()!=nRows) {
                throw LAP_Exception("math/linalg/core",
                                    "LAP_DoublePackedSymmetricMatrix::rankSymmetricProduct",
                                    "matrices size incompatible");
            }
        }
        if (nCols!=D.getSize()) { 
            throw LAP_Exception("math/linalg/core",
                                "LAP_DoublePackedSymmetricMatrix::rankSymmetricProduct",
                                "matrix & diagonal have incompatible size");
        }
        DoublePackedSymmetricMatrixKRankSymmetricProduct(A.getRowsNumber(),A.getColumnsNumber(),
                                                         A.getRowIncrement(),A.getLeadingDimension(),isTrans,&A(0,0),
                                                         alpha,beta,
                                                         D.getSize(),D.getIncrement(),&D(0),
                                                         nRows,&(*this)(0,0));
    }
  
   
 

    
    
    // ----------------
    // matrix product
    // ----------------
    virtual SP::LAP_DoubleMatrix  matrixProduct(const LAP_DoubleMatrix& B) const {
        SP::LAP_DoubleFullGeneralMatrix C=LAP_DoubleFullGeneralMatrix::New();
        const LAP_DoublePackedSymmetricMatrix* dsyM=dynamic_cast<const LAP_DoublePackedSymmetricMatrix*>(&B);
        if (dsyM!=null) {
            matrixProduct(*dsyM,*C.get());
            return C;
        }
        const LAP_DoubleFullGeneralMatrix* dgeM=dynamic_cast<const LAP_DoubleFullGeneralMatrix*>(&B);
        if (dgeM!=null) {
            matrixProduct(*dgeM,*C.get());
            return C;
        }
        return C;
    };
    
    void matrixProduct(const LAP_DoublePackedSymmetricMatrix& B,
                       LAP_DoubleFullGeneralMatrix& C) const {
        
        C.setSize(getRowsNumber(),B.getColumnsNumber());
        matrixProduct(true,(*this),B,1.0,0,C);
    };
    void matrixProduct(const LAP_DoubleFullGeneralMatrix& B,
                       LAP_DoubleFullGeneralMatrix& C) const {
        
        matrixProduct(true,(*this),B,1.0,0,C);
    };
    
    
    virtual void  matrixProduct(const tBoolean& leftSide,
                                const LAP_DoubleFullGeneralMatrix& B,
                                const lapack_real& alpha,
                                const lapack_real& beta,
                                LAP_DoubleFullGeneralMatrix& C) const {
        
        matrixProduct(leftSide,*this,B,alpha,beta,C);
        
    }
     
    virtual void  matrixProduct(const tBoolean& leftSide,
                                const tLVectorIndex& nBRows,
                                const tLVectorIndex& nBCols,
                                const tLVectorIncrement& incB,
                                const tLVectorIndex& ldB,
                                const double* B,
                                const lapack_real& alpha,
                                const lapack_real& beta,
                                LAP_DoubleFullGeneralMatrix& C) const {
        ASSERT_IN(B!=&C(0,0));
        
        //verify the dimension
        tLVectorIndex N=getRowsNumber();
        
        tLVectorIndex M=nBRows;
        tLVectorIndex P=nBCols;
        if (!leftSide) std::swap(M,P);
        
        if (N!=M) throw LAP_Exception("math/linalg/core","LAP_DoubleFullSymmetricMatrix::product()","incompatible size of matrix");
        if (beta==0) {
            if (leftSide) C.setSize(N,P);
            else C.setSize(P,N);
        } else {
            if (leftSide && ((C.getRowsNumber()!=N) || (C.getColumnsNumber()!=P))) C.setSize(N,P);
            else if (!leftSide && ((C.getRowsNumber()!=P) || (C.getColumnsNumber()!=N))) C.setSize(P,N);
        }
      
        if (nBRows!=nBCols) throw LAP_Exception("math/linalg/core","LAP_DoubleFullSymmetricMatrix::product()","incompatible size of matrix");
        if (beta==0) {
            if (leftSide) C.setSize(N,P);
            else C.setSize(P,N);
        } else {
            if (leftSide && ((C.getRowsNumber()!=N) || (C.getColumnsNumber()!=P))) C.setSize(N,P);
            else if (!leftSide && ((C.getRowsNumber()!=P) || (C.getColumnsNumber()!=N))) C.setSize(P,N);
        }
        DoublePackedSymmetricMatrixMatrixProduct(leftSide,
                                                 getRowsNumber(),&(*this)(0,0),//S
                                                 nBRows,nBCols,incB,ldB,false,true,B,//B
                                                 alpha,beta,
                                                 C.getRowsNumber(),C.getColumnsNumber(),C.getRowIncrement(),C.getLeadingDimension(),&C(0,0));
    }
   
    static  void matrixProduct(const tBoolean& leftSide,
                               const LAP_DoublePackedSymmetricMatrix& S,
                               const LAP_DoubleFullGeneralMatrix& B,
                               const lapack_real& alpha,
                               const lapack_real& beta,
                               LAP_DoubleFullGeneralMatrix& C) {
        ASSERT_IN(&B!=&C);
        
        //verify the dimension
        tLVectorIndex N=S.getRowsNumber();
        tLVectorIndex M=B.getRowsNumber();
        tLVectorIndex P=B.getColumnsNumber();
        if (!leftSide) std::swap(M,P);
        
        if (N!=M) throw LAP_Exception("math/linalg/core","LAP_DoublePackedSymmetricMatrix::product()","incompatible size of matrix");
        if (beta==0) {
            if (leftSide) C.setSize(N,P);
            else C.setSize(P,N);
        } else {
            if (leftSide && ((C.getRowsNumber()!=N) || (C.getColumnsNumber()!=P))) C.setSize(N,P);
            else if (!leftSide && ((C.getRowsNumber()!=P) || (C.getColumnsNumber()!=N))) C.setSize(P,N);
        }
        DoublePackedSymmetricMatrixMatrixProduct(leftSide,
                                                 S.getRowsNumber(),&S(0,0),//S
                                                 B.getRowsNumber(),B.getColumnsNumber(),B.getRowIncrement(),B.getLeadingDimension(),false,true,&B(0,0),//B
                                                 alpha,beta,
                                                 C.getRowsNumber(),C.getColumnsNumber(),C.getRowIncrement(),C.getLeadingDimension(),&C(0,0));
        
    }
    static  void matrixProduct(const tBoolean& leftSide,
                               const LAP_DoublePackedSymmetricMatrix& S1,
                               const LAP_DoublePackedSymmetricMatrix& S2,
                               const lapack_real& alpha,
                               const lapack_real& beta,
                               LAP_DoubleFullGeneralMatrix& C) {  //verify the dimension
        tLVectorIndex N=S1.getRowsNumber();
        tLVectorIndex M=S2.getRowsNumber();
        tLVectorIndex P=S2.getColumnsNumber();
        if (!leftSide) std::swap(M,P);
        
        if (N!=M) throw LAP_Exception("math/linalg/core","LAP_DoublePackedSymmetricMatrix::product()","incompatible size of matrix");
        if (beta==0) {
            if (leftSide) C.setSize(N,P);
            else C.setSize(P,N);
        } else {
            if (leftSide && ((C.getRowsNumber()!=N) || (C.getColumnsNumber()!=P))) C.setSize(N,P);
            else if (!leftSide && ((C.getRowsNumber()!=P) || (C.getColumnsNumber()!=N))) C.setSize(P,N);
        }
        if (leftSide) {
            
            DoublePackedSymmetricMatrixMatrixProduct(true,
                                                     S1.getRowsNumber(),&S1(0,0),//S1
                                                     S2.getRowsNumber(),S2.getColumnsNumber(),1,S2.getRowsNumber(),true,false,&S2(0,0),//S2
                                                     alpha,beta,
                                                     C.getRowsNumber(),C.getColumnsNumber(),C.getRowIncrement(),C.getLeadingDimension(),&C(0,0));
        } else {
            DoublePackedSymmetricMatrixMatrixProduct(true,
                                                     S2.getRowsNumber(),&S2(0,0),//S1
                                                     S1.getRowsNumber(),S1.getColumnsNumber(),1,S1.getRowsNumber(),true,false,&S2(0,0),//S2
                                                     alpha,beta,
                                                     C.getRowsNumber(),C.getColumnsNumber(),C.getRowIncrement(),C.getLeadingDimension(),&C(0,0));
        }
    }
    void matrixProduct(const tBoolean& leftSide,
                       const LAP_DoubleFullSymmetricMatrix& S,
                       const lapack_real& alpha,
                       const lapack_real& beta,
                       LAP_DoubleFullGeneralMatrix& C) const {
        matrixProduct(leftSide,*this,S,alpha,beta,C);
    }
    static  void matrixProduct(const tBoolean& leftSide,
                               const LAP_DoublePackedSymmetricMatrix& S1,
                               const LAP_DoubleFullSymmetricMatrix& S2,
                               const lapack_real& alpha,
                               const lapack_real& beta,
                               LAP_DoubleFullGeneralMatrix& C);

  
    // ----------------------
    // eigen values & vectors
    // ------------------------
public:
    virtual tBoolean computeEigenValues(LAP_DoubleVector& U) const {
        LAP_DoublePackedSymmetricMatrix C(*this);
        return computeEigenValues(C,U);
    };
    static tBoolean computeEigenValues(LAP_DoublePackedSymmetricMatrix&A,LAP_DoubleVector& U) {
        tLVectorIndex nRows=A.getRowsNumber();
        tLVectorIndex nCols=A.getColumnsNumber();
        
        if (nRows>nCols)
            throw LAP_Exception("math/linal/core","LAP_DoublePackedSymmetricMatrix::computeEigenValues","matrix columns number must be greater than its rows number");
        
        U.resetView();
        U.setSize(nRows);
        
        return DoublePackedSymmetricMatrixEigenValues(nRows,&A(0,0),nRows,&U(0),1,null);
        
    }

public:
    tBoolean computeEigenValueDecomposition(LAP_DoubleVector& U,LAP_DoubleFullGeneralMatrix&W) const {
        LAP_DoublePackedSymmetricMatrix A;
        A.copy(*this);
        return computeEigenValueDecomposition(A,U,W);  
    };

public:
    static tBoolean computeEigenValueDecomposition(LAP_DoublePackedSymmetricMatrix&A,
                                                   LAP_DoubleVector& U,
                                                   LAP_DoubleFullGeneralMatrix&W) {
        tLVectorIndex nRows=A.getRowsNumber();;
        
        U.resetView();
        U.setSize(nRows);
        W.setSize(nRows,nRows);
        return DoublePackedSymmetricMatrixEigenValues(nRows,&A(0,0),nRows,&U(0),W.getLeadingDimension(),&W(0,0));
    }

    
   
   
public:
    tBoolean computeEigenValueDecomposition(LAP_DoubleVector& U,
                                            LAP_DoubleFullGeneralMatrix& VR,
                                            const int& il,const int& iu) const {
        LAP_DoublePackedSymmetricMatrix C(*this);
        return computeEigenValueDecomposition(C,U,VR,il,iu);
    };
    
   
    static tBoolean computeEigenValueDecomposition(LAP_DoublePackedSymmetricMatrix&A,
                                                   LAP_DoubleVector& U,
                                                   LAP_DoubleFullGeneralMatrix& Z,
                                                   const lapack_int &il,const lapack_int& ul) {
        tLVectorIndex nRows=A.getRowsNumber();
        
        //eigen values
        int nEigens=ul-il+1;
        U.resetView();
        U.setSize(nEigens);
        
        //eigen vectors
        Z.setSize(nRows,nEigens);
        
        return DoublePackedSymmetricMatrixBoundedEigenValues(nRows,&A(0,0),//A
                                                             nEigens,&U(0),
                                                             il,ul,0,0,Z.getLeadingDimension(),&Z(0,0));
    }
    
    // -----------------------
    // linear system solver
    // -----------------------
    tBoolean inverse() {
        return inverse(*this);
    };
    
public:
    
    inline static tBoolean inverse(LAP_DoublePackedSymmetricMatrix& A) {
       
        int nRows=A.getRowsNumber();
        if (nRows==0) return true;
        
        LAP_IntegerVector ipiv;
        ipiv.setSize(nRows);
        if (!DoublePackedSymmetricMatrixBunchKaufmanFactorization(nRows,&A(0,0),&ipiv(0))) return false;
       
        return DoublePackedSymmetricMatrixInverse(nRows,&ipiv(0),&A(0,0));
        
    };
    
private:
    static SP::LAP_DoublePackedUpperMatrix choleskyFactorization(LAP_DoublePackedSymmetricMatrix& A) {
      
        tLVectorIndex nRows=A.getRowsNumber();
        tBoolean succeeds=DoublePackedSymmetricMatrixCholeskyFactorization(nRows,&A(0,0));
        SP::LAP_DoublePackedUpperMatrix U=LAP_DoublePackedUpperMatrix::New();
        SP::LAP_DoubleVector vs;
        A.getStorage().getValuesPointer(vs);
        if (succeeds) U->setValues(vs);
        return U;
    }
public:

    virtual  SP::LAP_DoubleUpperMatrix choleskyFactorization() {
        return LAP_DoublePackedSymmetricMatrix::choleskyFactorization(*this);
    }
        
  
};
#endif