gsMatrix.h

Go to the documentation of this file.

 
# pragma once
 
 
namespace gismo
{
 
template<class T, int _Rows, int _Cols, int _Options>
class gsMatrix : public gsEigen::Matrix<T,_Rows, _Cols, _Options>
//i.e. gsEigen::PlainObjectBase<gsEigen::Matrix>
//i.e. gsEigen::EigenBase<gsEigen::Matrix>
{
public:
    // Base is the dense matrix class of Eigen
    typedef gsEigen::Matrix<T,_Rows, _Cols, _Options> Base;
 
    // Self type
    typedef gsMatrix<T,_Rows, _Cols, _Options> Self;
 
    // The type of the coefficients of the matrix
    typedef T Scalar_t;
 
    typedef typename gsEigen::aligned_allocator<Self> aalloc;
 
    // Type pointing to a block view of the matrix
    typedef gsMatrixBlockView<Base> BlockView;
 
    // Type pointing to a block of the matrix
    typedef gsEigen::Block<Base> Block;
 
    // Type pointing to a (const) block of the matrix
    typedef gsEigen::Block<const Base> constBlock;
 
    // Type pointing to a row of the matrix
    typedef gsEigen::Block<Base, 1, _Cols, false> Row;
 
    // Type pointing to a (const) row of the matrix
    typedef gsEigen::Block<const Base, 1, _Cols, false> constRow;
 
    // Type pointing to a set of successive rows of the matrix
    typedef gsEigen::Block<Base, Dynamic, _Cols, false> Rows;
 
    // Type pointing to a a set of successive (const) rows of the matrix
    typedef gsEigen::Block<const Base, Dynamic, _Cols, false> constRows;
 
    // Type pointing to a column of the matrix
    typedef gsEigen::Block<Base, _Rows, 1, true > Column;
 
    // Type pointing to a (const) column of the matrix
    typedef gsEigen::Block<const Base, _Rows, 1, true > constColumn;
 
    // Type pointing to a set of successive columns of the matrix
    typedef gsEigen::Block<Base, _Rows, Dynamic, true > Columns;
 
    // Type pointing to a set of successive (const) columns of the matrix
    typedef gsEigen::Block<const Base, _Rows, Dynamic, true > constColumns;
 
    // Type pointing to the transpose of the matrix
    typedef gsEigen::Transpose<Base> Tr;
 
    // Type pointing to the (const) transpose of the matrix
    typedef const gsEigen::Transpose<const Base> constTr;
 
    // Type refering to any possible Eigen type that can be copied
    // into a gsMatrix
    typedef gsEigen::Ref<Base> Ref;
 
    // Type refering to any (const) possible Eigen types that can be
    // copied into a gsMatrix
    typedef const gsEigen::Ref<const Base> constRef;
 
    typedef memory::shared_ptr<gsMatrix> Ptr;
 
    typedef memory::unique_ptr<gsMatrix> uPtr;
 
    // type of first minor matrix: rows and cols reduced by one
    typedef gsMatrix< T, ChangeDim<_Rows, -1>::D, ChangeDim<_Cols, -1>::D>
        FirstMinorMatrixType;
 
    // type of row minor matrix: rows reduced by one
    typedef gsMatrix< T, ChangeDim<_Rows, -1>::D, _Cols>
        RowMinorMatrixType;
 
    // type of col minor matrix: cols reduced by one
    typedef gsMatrix< T, _Rows, ChangeDim<_Cols, -1>::D>
        ColMinorMatrixType;
 
    // block of fixed size 3
    typedef gsEigen::VectorBlock<gsEigen::Block<gsEigen::Matrix<T,_Rows,_Cols>,-1,1,true>,3> Col3DType;
    typedef gsEigen::VectorBlock<const gsEigen::Block<const gsEigen::Matrix<T,_Rows,_Cols>,-1,1,true>,3> CCol3DType;
 
public:  // Solvers related to gsMatrix
    typedef typename gsEigen::EigenSolver<Base> EigenSolver;
 
    typedef typename gsEigen::SelfAdjointEigenSolver<Base> SelfAdjEigenSolver;
 
    typedef typename gsEigen::GeneralizedSelfAdjointEigenSolver<Base> GenSelfAdjEigenSolver;
 
    // Jacobi SVD using ColPivHouseholderQRPreconditioner
    typedef typename gsEigen::JacobiSVD<Base> JacobiSVD;
 
    // Bidiagonal Divide and Conquer SVD
    //typedef typename gsEigen::BDCSVD<Base> BDCSVD;
 
    //typedef typename gsEigen::CompleteOrthogonalDecomposition CODecomposition;
 
public:
 
    gsMatrix() { }
 
    gsMatrix(const Base& a) ;
 
    // implicitly deleted in C++11
    //gsMatrix(const gsMatrix& a) : Base(a) { }
 
    gsMatrix(int rows, int cols) ;
 
    template<typename OtherDerived>
    gsMatrix(const gsEigen::EigenBase<OtherDerived>& other) : Base(other) { }
 
    template<typename OtherDerived>
    gsMatrix(const gsEigen::MatrixBase<OtherDerived>& other) : Base(other) { }
 
    template<typename OtherDerived>
    gsMatrix(const gsEigen::ReturnByValue<OtherDerived>& other) : Base(other) { }
 
    inline operator Ref () { return Ref(*this); }
 
    inline operator const constRef () { return constRef(*this); }
 
    uPtr moveToPtr()
    {
        uPtr m(new gsMatrix);
        m->swap(*this);
        return m;
        //return uPtr(new gsMatrix<T>(give(*this)));
    }
 
    void clear() { this->resize(0,0); }
/*
    // Using the assignment operators of Eigen
    // Note: using Base::operator=; is ambiguous in MSVC
#ifdef _MSC_VER // && !__INTEL_COMPILER
    template <class EigenExpr>
    gsMatrix& operator= (const EigenExpr & other)
    {
        this->Base::operator=(other);
        return *this;
    }
#else
    using Base::operator=;
#endif
*/
 
#if !EIGEN_HAS_RVALUE_REFERENCES
    // swap assignment operator
    gsMatrix & operator=(typename gsEigen::internal::conditional<
                         -1==_Rows,gsMatrix, const gsMatrix &>::type other)
    {
        if (-1==_Rows)
            this->swap(other);
        else
            this->Base::operator=(other);
        return *this;
    }
#endif
 
    std::pair<index_t,index_t> dim() const
    { return std::make_pair(this->rows(), this->cols() ); }
 
    T   at (index_t i) const { return *(this->data()+i);}
 
    T & at (index_t i)       { return *(this->data()+i);}
 
    // \brief Returns the last element of the matrix (maximum row and column)
    //T   lastCoeff() { return *(this->data()+this->size()-1);}
 
    gsAsMatrix<T, Dynamic, Dynamic> reshape(index_t n, index_t m )
    { return gsAsMatrix<T, Dynamic, Dynamic>(this->data(), n, m); }
 
    gsAsConstMatrix<T, Dynamic, Dynamic> reshape(index_t n, index_t m ) const
    { return gsAsConstMatrix<T, Dynamic, Dynamic>(this->data(), n, m); }
 
    gsAsMatrix<T, Dynamic, Dynamic> reshapeCol( index_t c, index_t n, index_t m )
    { return gsAsMatrix<T, Dynamic, Dynamic>(this->col(c).data(), n, m); }
 
    gsAsConstMatrix<T, Dynamic, Dynamic> reshapeCol( index_t c, index_t n, index_t m ) const
    { return gsAsConstMatrix<T, Dynamic, Dynamic>(this->col(c).data(), n, m); }
 
    gsAsVector<T, Dynamic> asVector()
    { return gsAsVector<T, Dynamic>(this->data(), this->rows()*this->cols() ); }
 
    Col3DType  col3d(index_t c) { return this->col(c).template head<3>(); }
    CCol3DType col3d(index_t c) const { return this->col(c).template head<3>(); }
 
    gsAsConstVector<T, Dynamic> asVector() const
    { return gsAsConstVector<T, Dynamic>(this->data(), this->rows()*this->cols() ); }
 
    gsAsMatrix<T, 1, Dynamic> asRowVector()
    { return gsAsMatrix<T, 1, Dynamic>(this->data(), 1, this->rows()*this->cols() ); }
 
    gsAsConstMatrix<T, 1, Dynamic> asRowVector() const
    { return gsAsConstMatrix<T, 1, Dynamic>(this->data(), 1, this->rows()*this->cols() ); }
 
    template<class container>
    void submatrixCols(const container & colInd, gsMatrix<T> & result) const
    {
        //GISMO_ASSERT(colInd.cols() == 1, "Invalid column index vector");
        const index_t nc = colInd.size();
        result.resize(this->rows(), nc );
        for ( index_t i = 0; i!= nc; ++i )
            result.col(i) = this->col( colInd[i] );
    }
 
    template<class container>
    void submatrixRows(const container & rowInd, gsMatrix<T> & result) const
    {
        //GISMO_ASSERT(rowInd.cols() == 1, "Invalid row index vector");
        const index_t nr = rowInd.size();
        result.resize(nr, this->cols() );
        for ( index_t i = 0; i!= nr; ++i )
            result.row(i) = this->row( rowInd[i] );
    }
 
    template<class container>
    void submatrix(const container & rowInd,
                   const container & colInd,
                   gsMatrix<T> & result) const
    {
        //GISMO_ASSERT(rowInd.cols() == 1 && colInd.cols() == 1, "Invalid index vector");
        const index_t nr = rowInd.size();
        const index_t nc = colInd.size();
        result.resize(nr, nc );
        for ( index_t i = 0; i!= nr; ++i )
            for ( index_t j = 0; j!= nc; ++j )
                result(i,j) = this->coeff(rowInd[i], colInd[j] );
    }
 
    void removeCol( index_t i )
    {
        index_t cc= this->cols();
        GISMO_ASSERT( i < cc, "Invalid column." );
        for ( index_t c = i+1; c!= cc; ++c )
            this->col(c-1) = this->col(c);
        this->conservativeResize(this->rows(), cc-1);
    }
 
    void firstMinor(index_t i, index_t j, FirstMinorMatrixType & result ) const
    {
        const index_t mrows = this->rows()-1,
            mcols = this->cols()-1;
        GISMO_ASSERT( i <= mrows, "Invalid row." );
        GISMO_ASSERT( j <= mcols, "Invalid column." );
        result.resize(mrows,mcols);
        result.block(0,0,i,j)             = this->block(0,0,i,j);
        result.block(i,0,mrows-i,j)       = this->block(i+1,0,mrows-i,j);
        result.block(0,j,i,mcols-j)       = this->block(0,j+1,i,mcols-j);
        result.block(i,j,mrows-i,mcols-j) = this->block(i+1,j+1,mrows-i,mcols-j);
    }
 
    void rowMinor(index_t i, RowMinorMatrixType & result ) const
    {
        const index_t mrows = this->rows()-1;
        GISMO_ASSERT( i <= mrows, "Invalid row." );
        result.resize(mrows, this->cols());
        result.topRows(i)          = this->topRows(i);
        result.bottomRows(mrows-i) = this->bottomRows(mrows-i);
    }
 
    void colMinor(index_t j, ColMinorMatrixType & result ) const
    {
        const index_t mcols = this->cols()-1;
        GISMO_ASSERT( j <= mcols, "Invalid column." );
        result.resize(this->rows(), mcols);
        result.leftCols(j)        = this->leftCols(j);
        result.rightCols(mcols-j) = this->rightCols(mcols-j);
    }
 
    void duplicateRow( index_t k )
    {
        this->conservativeResize(this->rows() + 1, this->cols());
 
        /*
        // Test this
        this->bottomRows(this->rows() - k ) =
        this->middleRows(this->rows() - k, k+1 );
 
        this->row(k+1) = this->row(k);
        return;
 
        */
 
        for (index_t i = this->rows() - 1; i > k+1 ; --i)
            this->row(i).swap(this->row(i-1));
 
        this->row(k+1) = this->row(k);
    }
 
    void removeNoise(const T tol)
    {
        this->noalias() = this->unaryExpr(removeNoise_helper(tol));
    }
 
    // Clone function. Used to make a copy of the matrix
    //gsMatrix * clone() const;
 
    BlockView blockView(const gsVector<index_t> & rowSizes,
                        const gsVector<index_t> & colSizes)
    {
        return BlockView(*this, rowSizes, colSizes);
    }
 
    void sortByColumn(const index_t j )
    {
        GISMO_ASSERT( j < this->cols(), "Invalid column.");
 
        index_t lastSwapDone = this->rows() - 1;
        index_t lastCheckIdx = lastSwapDone;
 
        bool didSwap;
        gsMatrix<T> tmp(1, this->cols() );
        do{ //caution! A stable sort algorithm is needed here for lexSortColumns function below
            didSwap = false;
            lastCheckIdx = lastSwapDone;
 
            for( index_t i=0; i < lastCheckIdx; i++)
                if( this->coeff(i,j) > this->coeff(i+1,j) )
                {
                    tmp.row(0) = this->row(i);
                    this->row(i) = this->row(i+1);
                    this->row(i+1) = tmp.row(0);
 
                    didSwap = true;
                    lastSwapDone = i;
                }
        }while( didSwap );
    }
 
    std::vector<index_t> idxByColumn(const index_t j )
    {
        std::vector<index_t> permutation;
        GISMO_ASSERT( j < this->cols(), "Invalid column.");
 
        index_t lastSwapDone = this->rows() - 1;
        index_t lastCheckIdx = lastSwapDone;
 
        for( index_t i=0; i < this->rows(); i++)
          permutation.push_back(i);
 
        bool didSwap;
        gsMatrix<T> tmp(1, this->cols() );
 
        do{ //caution! A stable sort algorithm is needed here for lexSortColumns function below
            didSwap = false;
            lastCheckIdx = lastSwapDone;
 
            for( index_t i=0; i < lastCheckIdx; i++)
                if( this->coeff(i,j) > this->coeff(i+1,j) )
                {
                    // gsInfo << this->coeff(i,j) << " > " << this->coeff(i+1,j) << "\n";
 
                    tmp.row(0) = this->row(i);
                    index_t tdx = permutation[i];
 
                    this->row(i) = this->row(i+1);
                    permutation[i] = permutation[i+1];
 
                    this->row(i+1) = tmp.row(0);
                    permutation[i+1] = tdx;
 
                    didSwap = true;
                    lastSwapDone = i;
                }
        }while( didSwap );
        return permutation;
    }
 
    void lexSortRows(const std::vector<index_t> & lorder)
    {
        GISMO_ASSERT(lorder.size() == static_cast<size_t>(this->cols()),
                     "Error in dimensions");
 
        for(std::vector<index_t>::const_reverse_iterator k = lorder.rbegin();
            k != lorder.rend(); ++k) //sort from last to first given column
            this->sortByColumn( *k ); // stable sort wrt column
    }
 
    //  treated a 1 x (cols()/colBlock) block matrix, and every block
    //  of size rows() x colBlock is transposed in place
    void blockTransposeInPlace(const index_t colBlock)
    {
        const index_t nc = this->cols();
        const index_t nr = this->rows();
 
        GISMO_ASSERT( nc % colBlock == 0,
                      "The blocksize is not compatible with number of columns.");
 
        if (nr == 1 || colBlock == 1)
        {
            this->resize(colBlock, this->size()/colBlock);
        }
        else if ( nr == colBlock )
        {
            for (index_t j = 0; j!= nc; j+=colBlock)
                this->middleCols(j,colBlock).transposeInPlace();
        }
        else
        {
            gsEigen::Map<Base> m(this->data(), nr, nc);
            this->resize(colBlock, this->size()/colBlock);
 
            index_t i = 0;
            for (index_t j = 0; j!= nc; j+=colBlock, i+=nr)
                this->middleCols(i,nr) = m.middleCols(j,colBlock).transpose().eval();
        }
    }
 
    void rrefInPlace() { rref_impl(*this); }
 
    void rcefInPlace() { rref_impl(this->transpose()); }
 
    void refInPlace() { ref_impl(*this); }
 
    void cefInPlace() { ref_impl(this->transpose()); }
 
    std::string printSparsity() const
    {
        std::ostringstream os;
        os <<", sparsity: "<< std::fixed << std::setprecision(2)<<"nnz: "<<this->size()
           <<(double)100*(this->array() != 0).count()/this->size() <<'%'<<"\n";
        for (index_t i = 0; i!=this->rows(); ++i)
        {
            for (index_t j = 0; j!=this->cols(); ++j)
                os<< ( 0 == this->coeff(i,j) ? "\u00B7" : "x");
            os<<"  "<<(this->row(i).array()!=0).count()<<"\n";
        }
        return os.str();
    }
 
    template<typename OtherDerived>
    gsMatrix kron(const gsEigen::MatrixBase<OtherDerived>& other) const
    {
        const index_t r  = this->rows(), c = this->cols();
        const index_t ro = other.rows(), co = other.cols();
        gsMatrix result(r*ro, c*co);
        for (index_t i = 0; i != r; ++i) // for all rows
            for (index_t j = 0; j != c; ++j) // for all cols
                result.block(i*ro, j*co, ro, co) = this->coeff(i,j) * other;
        return result;
    }
 
    template<typename OtherDerived>
    gsMatrix khatriRao(const gsEigen::MatrixBase<OtherDerived>& other) const
    {
        const index_t r  = this->rows(), c = this->cols();
        const index_t ro = other.rows();
        GISMO_ASSERT(c==other.cols(), "Column sizes do not match.");
        gsMatrix result(r*ro, c);
        for (index_t j = 0; j != c; ++j) // for all cols
            for (index_t i = 0; i != ro; ++i) // for all rows
                result.block(i*r, j, r, 1) = this->coeff(i,j) * other.col(j);
        return result;
    }
 
private:
 
    // Implementation of (inplace) Reduced Row Echelon Form computation
    template <typename Derived>
    static void rref_impl(const gsEigen::MatrixBase<Derived>& Mat)
    {
        // todo: const T tol = 0
        gsEigen::MatrixBase<Derived> & M = const_cast<gsEigen::MatrixBase<Derived>& >(Mat);
        index_t i, piv = 0;
        const index_t nr = M.rows();
        const index_t nc = M.cols();
        for (index_t r=0; r!=nr; ++r)
        {
            if (nc <= piv) return;
            i = r;
            while (0 == M(i, piv)) //~
            {
                ++i;
                if (nr == i)
                {
                    i = r;
                    ++piv;
                    if (nc == piv) return;
                }
            }
 
            if (i != r) M.row(i).swap(M.row(r));
            const index_t br = nr-r-1;
            const index_t bc = nc-piv-1;
 
            // pivot row
            M.row(r).tail(bc).array() /= M(r, piv);
            M(r, piv) = (T)(1);
 
            // upper block
            M.block(0, piv+1, r, bc).noalias() -=
                M.col(piv).head(r) * M.row(r).tail(bc);
            M.col(piv).head(r).setZero();
 
            // lower block
            M.block(r+1, piv+1, br, bc).noalias() -= M.col(piv).tail(br) * M.row(r).tail(bc);
            M.col(piv).tail(br).setZero();
 
            ++piv;
        }
    }
 
    // Implementation of (inplace) Row Echelon Form computation
    template <typename Derived>
    static void ref_impl(const gsEigen::MatrixBase<Derived>& Mat)
    {
        // todo: const T tol = 0
        gsEigen::MatrixBase<Derived> & M = const_cast<gsEigen::MatrixBase<Derived>& >(Mat);
        index_t i, piv = 0;
        const index_t nr = M.rows();
        const index_t nc = M.cols();
        for (index_t r=0; r!=nr; ++r)
        {
            if (nc <= piv) return;
            i = r;
            while (0 == M(i, piv)) //~
            {
                ++i;
                if (nr == i)
                {
                    i = r;
                    ++piv;
                    if (nc == piv) return;
                }
            }
 
            if (i != r) M.row(i).swap(M.row(r));
            const index_t br = nr-r-1;
            const index_t bc = nc-piv-1;
 
            // lower block
            M.block(r+1, piv+1, br, bc).noalias() -=
                M.col(piv).tail(br) * M.row(r).tail(bc) / M(r, piv);
            M.col(piv).tail(br).setZero();
 
            ++piv;
        }
    }
 
    struct removeNoise_helper
    {
        removeNoise_helper(const T & tol)
        : m_tol(tol) { }
 
        inline const T operator() (const T & val) const
        { return ( math::abs(val) < m_tol ? 0 : val ); }
 
        const T & m_tol;
    };
 
}; // class gsMatrix
 
 
/*
template<class T, int _Rows, int _Cols, int _Options> inline
gsMatrix<T,_Rows, _Cols, _Options>::gsMatrix() { }
*/
 
template<class T, int _Rows, int _Cols, int _Options> inline
gsMatrix<T,_Rows, _Cols, _Options>::gsMatrix(const Base& a) : Base(a) { }
 
template<class T, int _Rows, int _Cols, int _Options> inline
gsMatrix<T,_Rows, _Cols, _Options>::gsMatrix(int rows, int cols) : Base(rows,cols) { }
 
// template<class T, int _Rows, int _Cols, int _Options>
//  template<typename OtherDerived>
// gsMatrix<T,_Rows, _Cols, _Options>::gsMatrix(const gsEigen::MatrixBase<OtherDerived>& other) : Base(other) { }
 
/* Clone function. Used to make a copy of the matrix
template<class T, int _Rows, int _Cols, int _Options> inline
gsMatrix<T,_Rows, _Cols, _Options> * gsMatrix<T,_Rows, _Cols, _Options>::clone() const
{ return new gsMatrix<T,_Rows, _Cols, _Options>(*this); }
*/
 
 
#ifdef GISMO_WITH_PYBIND11
 
  template<typename T>
  void pybind11_init_gsMatrix(pybind11::module &m, const std::string & typestr)
  {
    using Class = gsMatrix<T>;
    std::string pyclass_name = std::string("gsMatrix") + typestr;
    pybind11::class_<Class>(m, pyclass_name.c_str(), pybind11::buffer_protocol(), pybind11::dynamic_attr())
    // Constructors
    .def(pybind11::init<>())
    .def(pybind11::init<index_t, index_t>())
    // Member functions
    .def("size",       &Class::size)
    .def("rows",       &Class::rows)
    .def("cols",       &Class::cols)
    // .def("transpose",  &Class::transpose)
    ;
  }
 
#endif // GISMO_WITH_PYBIND11
 
 
} // namespace gismo
 
 
namespace gsEigen { namespace internal {
template<class T, int _Rows, int _Cols, int _Options>
struct traits<gismo::gsMatrix<T,_Rows,_Cols,_Options> > :
gsEigen::internal::traits<gsEigen::Matrix<T,_Rows,_Cols,_Options> > { };
} }