CMgramsparse.hxx

Go to the documentation of this file.

#ifndef CONICBUNDLE_CMGRAMSPARSE_HXX
#define CONICBUNDLE_CMGRAMSPARSE_HXX

#include "Coeffmat.hxx"
#include "CMgramdense.hxx"

namespace ConicBundle {



  class CMgramsparse: public Coeffmat
  {
  private:
    CH_Matrix_Classes::Sparsemat A;  
    bool positive; 
  public:
    CMgramsparse(const CH_Matrix_Classes::Sparsemat& Ain,bool pos=true,CoeffmatInfo* cip=0)
    {A=Ain;positive=pos;CM_type=CM_gramsparse;infop=cip;}
    virtual ~CMgramsparse(){}

    virtual Coeffmat* clone() const 
    { return new CMgramsparse(A,positive,ConicBundle::clone(infop));}

    virtual CH_Matrix_Classes::Integer dim() const  { return A.rowdim(); }
    
    virtual CH_Matrix_Classes::Real operator()(CH_Matrix_Classes::Integer i,CH_Matrix_Classes::Integer j) const 
    {return  (positive? 1.:-1.)*CH_Matrix_Classes::ip(A.row(i),A.row(j));}

    virtual void make_symmatrix(CH_Matrix_Classes::Symmatrix& S) const
    {if (positive) { CH_Matrix_Classes::rankadd(A,S);}
     else { CH_Matrix_Classes::rankadd(A,S,-1.);}}

    virtual CH_Matrix_Classes::Real norm(void) const 
    {CH_Matrix_Classes::Symmatrix B; return CH_Matrix_Classes::norm2(CH_Matrix_Classes::rankadd(A,B,1.,0.,1));}
 
    virtual Coeffmat* subspace(const CH_Matrix_Classes::Matrix& P) const
    { CH_Matrix_Classes::Matrix B; return new CMgramdense(CH_Matrix_Classes::genmult(P,A,B,1.,0.,1),positive,ConicBundle::clone(infop)); }
    
    virtual void multiply(CH_Matrix_Classes::Real d)
    { if (d<0.) {A*=sqrt(-d); positive=!positive;} else {A*=sqrt(d);} 
      if (infop) infop->multiply(d);}

    virtual CH_Matrix_Classes::Real ip(const CH_Matrix_Classes::Symmatrix& S) const
    {CH_Matrix_Classes::Matrix B; if (positive) return CH_Matrix_Classes::ip(CH_Matrix_Classes::genmult(S,A,B),A);
     else return -CH_Matrix_Classes::ip(CH_Matrix_Classes::genmult(S,A,B),A); }
    
    virtual CH_Matrix_Classes::Real gramip(const CH_Matrix_Classes::Matrix& P) const
    {CH_Matrix_Classes::Matrix B; CH_Matrix_Classes::genmult(P,A,B,1.,0.,1);
     if (positive) return CH_Matrix_Classes::ip(B,B); else return -CH_Matrix_Classes::ip(B,B);}

    virtual CH_Matrix_Classes::Real gramip(const CH_Matrix_Classes::Matrix& P,CH_Matrix_Classes::Integer start_row,const CH_Matrix_Classes::Matrix* Lam=0) const
    {
      CH_Matrix_Classes::Matrix B(A.coldim(),P.coldim(),0.);
      CH_Matrix_Classes::Real *bp=B.get_store();
      const CH_Matrix_Classes::Integer brd=B.rowdim();
      const CH_Matrix_Classes::Integer pcd=P.coldim();
      const CH_Matrix_Classes::Integer prd=P.rowdim();
      const CH_Matrix_Classes::Real *pp=P.get_store()+start_row;
      const CH_Matrix_Classes::Indexmatrix &colinfo=A.get_colinfo();
      const CH_Matrix_Classes::Real *vp=(A.get_colval()).get_store();
      const CH_Matrix_Classes::Integer *ip=(A.get_colindex()).get_store();
      for(CH_Matrix_Classes::Integer j=0;j<colinfo.rowdim();j++){
        CH_Matrix_Classes::Integer indj=colinfo(j,0);
        for(CH_Matrix_Classes::Integer i=colinfo(j,1);--i>=0;){
          CH_Matrix_Classes::mat_xpeya(pcd,bp+indj,brd,pp+(*ip++),prd,(*vp++));
        }
      }
      CH_Matrix_Classes::Real trval=0;
      if (Lam==0) {
        trval=CH_Matrix_Classes::ip(B,B);
      }
      else {
        assert(Lam->dim()==P.coldim());
        const CH_Matrix_Classes::Real *bp=B.get_store();
        const CH_Matrix_Classes::Real *lp=Lam->get_store();
        for (CH_Matrix_Classes::Integer i=0;i<B.coldim();i++,bp+=B.rowdim())
          trval+=(*lp++)*CH_Matrix_Classes::mat_ip(B.rowdim(),bp);
      }
      return (positive?trval:-trval);
    }

    virtual void addmeto(CH_Matrix_Classes::Symmatrix& S,CH_Matrix_Classes::Real d=1.) const
    {if (positive) CH_Matrix_Classes::rankadd(A,S,d,1.); else CH_Matrix_Classes::rankadd(A,S,-d,1.);}

    virtual void addprodto(CH_Matrix_Classes::Matrix& B,const CH_Matrix_Classes::Matrix&C ,CH_Matrix_Classes::Real d=1.) const
    {CH_Matrix_Classes::Matrix D;
     if (positive) CH_Matrix_Classes::genmult(A,CH_Matrix_Classes::genmult(A,C,D,1.,0.,1),B,d,1.);
     else CH_Matrix_Classes::genmult(A,CH_Matrix_Classes::genmult(A,C,D,1.,0.,1),B,-d,1.);}

    virtual void addprodto(CH_Matrix_Classes::Matrix& B,const CH_Matrix_Classes::Sparsemat&C ,CH_Matrix_Classes::Real d=1.) const
    {CH_Matrix_Classes::Matrix D;
     if (positive) CH_Matrix_Classes::genmult(A,CH_Matrix_Classes::genmult(A,C,D,1.,0.,1),B,d,1.);
     else CH_Matrix_Classes::genmult(A,CH_Matrix_Classes::genmult(A,C,D,1.,0.,1),B,-d,1.);}

    virtual void left_right_prod(const CH_Matrix_Classes::Matrix& P,const CH_Matrix_Classes::Matrix& Q,CH_Matrix_Classes::Matrix& R) const
    {
      CH_Matrix_Classes::Matrix tmp1; CH_Matrix_Classes::genmult(P,A,tmp1,1.,0.,1,0);
      CH_Matrix_Classes::Matrix tmp2; CH_Matrix_Classes::genmult(A,Q,tmp2,1.,0.,1,0);
      if (positive) CH_Matrix_Classes::genmult(tmp1,tmp2,R,1.,0.,0,0);
      else CH_Matrix_Classes::genmult(tmp1,tmp2,R,-1.,0.,0,0);
    }

    virtual CH_Matrix_Classes::Integer prodvec_flops() const 
    { return 4*A.nonzeros(); }

    virtual int dense() const
    {return 0;}
    
    virtual int sparse() const
    { return 0;}
    
    virtual int sparse(CH_Matrix_Classes::Indexmatrix& /* I */,
                       CH_Matrix_Classes::Indexmatrix& /* J */,
                       CH_Matrix_Classes::Matrix& /* val */,
                       CH_Matrix_Classes::Real /* d=1. */)const
    {return 0;}
    
    virtual int support_in(const CH_Matrix_Classes::Sparsesym& /* S */) const
    {return 0;}

    virtual CH_Matrix_Classes::Real ip(const CH_Matrix_Classes::Sparsesym& S) const
    {if (positive) return CH_Matrix_Classes::ip(A,S*A); else return -CH_Matrix_Classes::ip(A,S*A); }
    
    virtual void project(CH_Matrix_Classes::Symmatrix& S,const CH_Matrix_Classes::Matrix& P) const
    {CH_Matrix_Classes::Matrix B; CH_Matrix_Classes::genmult(P,A,B,1.,0.,1);
     if (positive) CH_Matrix_Classes::rankadd(B,S); else CH_Matrix_Classes::rankadd(B,S,-1.);
    }

    virtual void add_projection(CH_Matrix_Classes::Symmatrix& S,const CH_Matrix_Classes::Matrix& P,CH_Matrix_Classes::Real alpha=1.,CH_Matrix_Classes::Integer start_row=0) const
    {
      CH_Matrix_Classes::Matrix B(A.coldim(),P.coldim(),0.);
      CH_Matrix_Classes::Real *bp=B.get_store();
      const CH_Matrix_Classes::Integer brd=B.rowdim();
      const CH_Matrix_Classes::Integer pcd=P.coldim();
      const CH_Matrix_Classes::Integer prd=P.rowdim();
      const CH_Matrix_Classes::Real *pp=P.get_store()+start_row;
      const CH_Matrix_Classes::Indexmatrix &colinfo=A.get_colinfo();
      const CH_Matrix_Classes::Real *vp=(A.get_colval()).get_store();
      const CH_Matrix_Classes::Integer *ip=(A.get_colindex()).get_store();
      for(CH_Matrix_Classes::Integer j=0;j<colinfo.rowdim();j++){
        CH_Matrix_Classes::Integer indj=colinfo(j,0);
        for(CH_Matrix_Classes::Integer i=colinfo(j,1);--i>=0;){
          CH_Matrix_Classes::mat_xpeya(pcd,bp+indj,brd,pp+(*ip++),prd,(*vp++));
        }
      }
      if (positive) CH_Matrix_Classes::rankadd(B,S,alpha,1.,1); else CH_Matrix_Classes::rankadd(B,S,-alpha,1.,1);      
    }

    virtual const CH_Matrix_Classes::Matrix& postgenmult(const CH_Matrix_Classes::Matrix& B,CH_Matrix_Classes::Matrix& C,
                             CH_Matrix_Classes::Real alpha=1.,CH_Matrix_Classes::Real beta=0.,int btrans=0) const
    { 
      CH_Matrix_Classes::Matrix D; 
      return CH_Matrix_Classes::genmult(A,CH_Matrix_Classes::genmult(A,B,D,1.,0.,1,btrans),C,(positive? 1.:-1.)*alpha,beta);
    }

    virtual const CH_Matrix_Classes::Matrix& pregenmult(const CH_Matrix_Classes::Matrix& B,CH_Matrix_Classes::Matrix& C,
                             CH_Matrix_Classes::Real alpha=1.,CH_Matrix_Classes::Real beta=0.,int btrans=0) const
    { 
      CH_Matrix_Classes::Matrix D; 
      return CH_Matrix_Classes::genmult(CH_Matrix_Classes::genmult(B,A,D,1.,0.,btrans),A,C,(positive? 1.:-1.)*alpha,beta,0,1);
    }

    virtual int equal(const Coeffmat* p,double tol=1e-6) const
    {
      const CMgramsparse *pp=dynamic_cast<const CMgramsparse *>(p);
      if (pp==0) 
        return 0;
      return (positive==pp->positive)&&CH_Matrix_Classes::equal(A,pp->A,tol);
    }

    virtual std::ostream& display(std::ostream& o) const 
    {o<<"CMgramsparse\n"; A.display(o); return o;}
    
    virtual std::ostream& out(std::ostream& o) const
    {return o<<"GRAM_SPARSE\n"<<positive<<"\n"<<A;}

    virtual std::istream& in(std::istream& i)
    {return i>>positive>>A;}

    CMgramsparse(std::istream& is,CoeffmatInfo* cip=0)
    {CM_type=CM_gramsparse;infop=cip;in(is);}

    //--- specific routines
    const CH_Matrix_Classes::Sparsemat& get_A() const {return A;}
    bool get_positive() const {return positive;}
};


}
#endif