GeneralMatrixMatrixTriangular_MKL.h File Reference

Go to the source code of this file.

Classes
struct	Eigen::internal::general_matrix_matrix_rankupdate< Index, Scalar, AStorageOrder, ConjugateA, ResStorageOrder, UpLo >

Namespaces
	Eigen
	iterative scaling algorithm to equilibrate rows and column norms in matrices
	Eigen::internal

Macros
#define	EIGEN_MKL_RANKUPDATE_C(EIGTYPE, MKLTYPE, RTYPE, MKLFUNC)
#define	EIGEN_MKL_RANKUPDATE_R(EIGTYPE, MKLTYPE, MKLFUNC)
#define	EIGEN_MKL_RANKUPDATE_SPECIALIZE(Scalar)

Macro Definition Documentation

#define EIGEN_MKL_RANKUPDATE_C	(		EIGTYPE,
			MKLTYPE,
			RTYPE,
			MKLFUNC
	)

Definition at line 99 of file GeneralMatrixMatrixTriangular_MKL.h.

#define EIGEN_MKL_RANKUPDATE_R	(		EIGTYPE,
			MKLTYPE,
			MKLFUNC
	)

Value:

template <typename Index, int AStorageOrder, bool ConjugateA, int  UpLo> \
struct general_matrix_matrix_rankupdate<Index,EIGTYPE,AStorageOrder,ConjugateA,ColMajor,UpLo> { \
  enum { \
    IsLower = (UpLo&Lower) == Lower, \
    LowUp = IsLower ? Lower : Upper, \
    conjA = ((AStorageOrder==ColMajor) && ConjugateA) ? 1 : 0 \
  }; \
  static EIGEN_STRONG_INLINE void run(Index size, Index depth,const EIGTYPE* lhs, Index lhsStride, \
                          const EIGTYPE* rhs, Index rhsStride, EIGTYPE* res, Index resStride, EIGTYPE alpha) \
  { \
  /* typedef Matrix<EIGTYPE, Dynamic, Dynamic, RhsStorageOrder> MatrixRhs;*/ \
\
   MKL_INT lda=lhsStride, ldc=resStride, n=size, k=depth; \
   char uplo=(IsLower) ? 'L' : 'U', trans=(AStorageOrder==RowMajor) ? 'T':'N'; \
   MKLTYPE alpha_, beta_; \
\
/* Set alpha_ & beta_ */ \
   assign_scalar_eig2mkl<MKLTYPE, EIGTYPE>(alpha_, alpha); \
   assign_scalar_eig2mkl<MKLTYPE, EIGTYPE>(beta_, EIGTYPE(1)); \
   MKLFUNC(&uplo, &trans, &n, &k, &alpha_, lhs, &lda, &beta_, res, &ldc); \
  } \
};

Definition at line 74 of file GeneralMatrixMatrixTriangular_MKL.h.

#define EIGEN_MKL_RANKUPDATE_SPECIALIZE

(

Scalar

)

Value:

template <typename Index, int LhsStorageOrder, bool ConjugateLhs, \
                          int RhsStorageOrder, bool ConjugateRhs, int  UpLo> \
struct general_matrix_matrix_triangular_product<Index,Scalar,LhsStorageOrder,ConjugateLhs, \
               Scalar,RhsStorageOrder,ConjugateRhs,ColMajor,UpLo,Specialized> { \
  static EIGEN_STRONG_INLINE void run(Index size, Index depth,const Scalar* lhs, Index lhsStride, \
                          const Scalar* rhs, Index rhsStride, Scalar* res, Index resStride, Scalar alpha) \
  { \
    if (lhs==rhs) { \
      general_matrix_matrix_rankupdate<Index,Scalar,LhsStorageOrder,ConjugateLhs,ColMajor,UpLo> \
      ::run(size,depth,lhs,lhsStride,rhs,rhsStride,res,resStride,alpha); \
    } else { \
      general_matrix_matrix_triangular_product<Index, \
        Scalar, LhsStorageOrder, ConjugateLhs, \
        Scalar, RhsStorageOrder, ConjugateRhs, \
        ColMajor, UpLo, BuiltIn> \
      ::run(size,depth,lhs,lhsStride,rhs,rhsStride,res,resStride,alpha); \
    } \
  } \
};

Definition at line 47 of file GeneralMatrixMatrixTriangular_MKL.h.