11 #ifndef SPARSELU_KERNEL_BMOD_H 12 #define SPARSELU_KERNEL_BMOD_H 33 template <
typename BlockScalarVector,
typename ScalarVector,
typename IndexVector,
typename Index>
34 static EIGEN_DONT_INLINE void run(
const int segsize, BlockScalarVector& dense, ScalarVector& tempv, ScalarVector& lusup, Index& luptr,
const Index lda,
35 const Index nrow, IndexVector& lsub,
const Index lptr,
const Index no_zeros);
38 template <
int SegSizeAtCompileTime>
39 template <
typename BlockScalarVector,
typename ScalarVector,
typename IndexVector,
typename Index>
41 const Index nrow, IndexVector& lsub,
const Index lptr,
const Index no_zeros)
43 typedef typename ScalarVector::Scalar Scalar;
47 Index isub = lptr + no_zeros;
50 for (i = 0; i < ((SegSizeAtCompileTime==
Dynamic)?segsize:SegSizeAtCompileTime); i++)
53 tempv(i) = dense(irow);
57 luptr += lda * no_zeros + no_zeros;
62 u =
A.template triangularView<UnitLower>().solve(u);
77 isub = lptr + no_zeros;
78 for (i = 0; i < ((SegSizeAtCompileTime==
Dynamic)?segsize:SegSizeAtCompileTime); i++)
81 dense(irow) = tempv(i);
85 for (i = 0; i < nrow; i++)
94 template <
typename BlockScalarVector,
typename ScalarVector,
typename IndexVector,
typename Index>
95 static EIGEN_DONT_INLINE void run(
const int , BlockScalarVector& dense, ScalarVector& , ScalarVector& lusup, Index& luptr,
96 const Index lda,
const Index nrow, IndexVector& lsub,
const Index lptr,
const Index no_zeros);
100 template <
typename BlockScalarVector,
typename ScalarVector,
typename IndexVector,
typename Index>
102 const Index lda,
const Index nrow, IndexVector& lsub,
const Index lptr,
const Index no_zeros)
104 typedef typename ScalarVector::Scalar Scalar;
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 Index* 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 static Index first_multiple(Index size, Index base)
A matrix or vector expression mapping an existing array of data.
iterative scaling algorithm to equilibrate rows and column norms in matrices
Index outerStride() const
static EIGEN_DONT_INLINE void run(const int segsize, BlockScalarVector &dense, ScalarVector &tempv, ScalarVector &lusup, Index &luptr, const Index lda, const Index nrow, IndexVector &lsub, const Index lptr, const Index no_zeros)
Performs numeric block updates from a given supernode to a single column.
#define EIGEN_DONT_INLINE
static Derived::Index first_aligned(const Derived &m)
Convenience specialization of Stride to specify only an outer stride See class Map for some examples...