11 #ifndef SPARSELU_KERNEL_BMOD_H 12 #define SPARSELU_KERNEL_BMOD_H 17 template <
int SegSizeAtCompileTime>
struct LU_kernel_bmod
32 template <
typename BlockScalarVector,
typename ScalarVector,
typename IndexVector>
33 static EIGEN_DONT_INLINE
void run(
const Index segsize, BlockScalarVector& dense, ScalarVector& tempv, ScalarVector& lusup,
Index& luptr,
const Index lda,
34 const Index nrow, IndexVector& lsub,
const Index lptr,
const Index no_zeros);
37 template <
int SegSizeAtCompileTime>
38 template <
typename BlockScalarVector,
typename ScalarVector,
typename IndexVector>
39 EIGEN_DONT_INLINE
void LU_kernel_bmod<SegSizeAtCompileTime>::run(
const Index segsize, BlockScalarVector& dense, ScalarVector& tempv, ScalarVector& lusup,
Index& luptr,
const Index lda,
40 const Index nrow, IndexVector& lsub,
const Index lptr,
const Index no_zeros)
42 typedef typename ScalarVector::Scalar Scalar;
46 Index isub = lptr + no_zeros;
49 for (i = 0; i < ((SegSizeAtCompileTime==
Dynamic)?segsize:SegSizeAtCompileTime); i++)
52 tempv(i) = dense(irow);
56 luptr += lda * no_zeros + no_zeros;
58 Map<Matrix<Scalar,SegSizeAtCompileTime,SegSizeAtCompileTime, ColMajor>, 0, OuterStride<> > A( &(lusup.data()[luptr]), segsize, segsize, OuterStride<>(lda) );
59 Map<Matrix<Scalar,SegSizeAtCompileTime,1> > u(tempv.data(), segsize);
61 u = A.template triangularView<UnitLower>().solve(u);
65 const Index PacketSize = internal::packet_traits<Scalar>::size;
66 Index ldl = internal::first_multiple(nrow, PacketSize);
67 Map<Matrix<Scalar,Dynamic,SegSizeAtCompileTime, ColMajor>, 0, OuterStride<> > B( &(lusup.data()[luptr]), nrow, segsize, OuterStride<>(lda) );
68 Index aligned_offset = internal::first_default_aligned(tempv.data()+segsize, PacketSize);
69 Index aligned_with_B_offset = (PacketSize-internal::first_default_aligned(B.data(), PacketSize))%PacketSize;
70 Map<Matrix<Scalar,Dynamic,1>, 0, OuterStride<> > l(tempv.data()+segsize+aligned_offset+aligned_with_B_offset, nrow, OuterStride<>(ldl) );
73 internal::sparselu_gemm<Scalar>(l.rows(), l.cols(), B.cols(), B.data(), B.outerStride(), u.data(), u.outerStride(), l.data(), l.outerStride());
76 isub = lptr + no_zeros;
77 for (i = 0; i < ((SegSizeAtCompileTime==
Dynamic)?segsize:SegSizeAtCompileTime); i++)
80 dense(irow) = tempv(i);
84 for (i = 0; i < nrow; i++)
91 template <>
struct LU_kernel_bmod<1>
93 template <
typename BlockScalarVector,
typename ScalarVector,
typename IndexVector>
94 static EIGEN_DONT_INLINE
void run(
const Index , BlockScalarVector& dense, ScalarVector& , ScalarVector& lusup,
Index& luptr,
99 template <
typename BlockScalarVector,
typename ScalarVector,
typename IndexVector>
100 EIGEN_DONT_INLINE
void LU_kernel_bmod<1>::run(
const Index , BlockScalarVector& dense, ScalarVector& , ScalarVector& lusup,
Index& luptr,
103 typedef typename ScalarVector::Scalar Scalar;
104 typedef typename IndexVector::Scalar StorageIndex;
105 Scalar f = dense(lsub(lptr + no_zeros));
106 luptr += lda * no_zeros + no_zeros + 1;
107 const Scalar* a(lusup.data() + luptr);
108 const StorageIndex* irow(lsub.data()+lptr + no_zeros + 1);
110 for (; i+1 < nrow; i+=2)
112 Index i0 = *(irow++);
113 Index i1 = *(irow++);
116 Scalar d0 = dense.coeff(i0);
117 Scalar d1 = dense.coeff(i1);
120 dense.coeffRef(i0) = d0;
121 dense.coeffRef(i1) = d1;
124 dense.coeffRef(*(irow++)) -= f * *(a++);
130 #endif // SPARSELU_KERNEL_BMOD_H Namespace containing all symbols from the Eigen library.
Definition: Core:287
EIGEN_DEFAULT_DENSE_INDEX_TYPE Index
The Index type as used for the API.
Definition: Meta.h:33
Definition: Eigen_Colamd.h:50
const int Dynamic
Definition: Constants.h:21