| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| |
|
| | #ifndef SPARSELU_KERNEL_BMOD_H |
| | #define SPARSELU_KERNEL_BMOD_H |
| |
|
| | namespace Eigen { |
| | namespace internal { |
| | |
| | template <int SegSizeAtCompileTime> struct LU_kernel_bmod |
| | { |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | template <typename BlockScalarVector, typename ScalarVector, typename IndexVector> |
| | static EIGEN_DONT_INLINE void run(const Index segsize, BlockScalarVector& dense, ScalarVector& tempv, ScalarVector& lusup, Index& luptr, const Index lda, |
| | const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros); |
| | }; |
| |
|
| | template <int SegSizeAtCompileTime> |
| | template <typename BlockScalarVector, typename ScalarVector, typename IndexVector> |
| | EIGEN_DONT_INLINE void LU_kernel_bmod<SegSizeAtCompileTime>::run(const Index segsize, BlockScalarVector& dense, ScalarVector& tempv, ScalarVector& lusup, Index& luptr, const Index lda, |
| | const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros) |
| | { |
| | typedef typename ScalarVector::Scalar Scalar; |
| | |
| | |
| | |
| | Index isub = lptr + no_zeros; |
| | Index i; |
| | Index irow; |
| | for (i = 0; i < ((SegSizeAtCompileTime==Dynamic)?segsize:SegSizeAtCompileTime); i++) |
| | { |
| | irow = lsub(isub); |
| | tempv(i) = dense(irow); |
| | ++isub; |
| | } |
| | |
| | luptr += lda * no_zeros + no_zeros; |
| | |
| | Map<Matrix<Scalar,SegSizeAtCompileTime,SegSizeAtCompileTime, ColMajor>, 0, OuterStride<> > A( &(lusup.data()[luptr]), segsize, segsize, OuterStride<>(lda) ); |
| | Map<Matrix<Scalar,SegSizeAtCompileTime,1> > u(tempv.data(), segsize); |
| | |
| | u = A.template triangularView<UnitLower>().solve(u); |
| | |
| | |
| | luptr += segsize; |
| | const Index PacketSize = internal::packet_traits<Scalar>::size; |
| | Index ldl = internal::first_multiple(nrow, PacketSize); |
| | Map<Matrix<Scalar,Dynamic,SegSizeAtCompileTime, ColMajor>, 0, OuterStride<> > B( &(lusup.data()[luptr]), nrow, segsize, OuterStride<>(lda) ); |
| | Index aligned_offset = internal::first_default_aligned(tempv.data()+segsize, PacketSize); |
| | Index aligned_with_B_offset = (PacketSize-internal::first_default_aligned(B.data(), PacketSize))%PacketSize; |
| | Map<Matrix<Scalar,Dynamic,1>, 0, OuterStride<> > l(tempv.data()+segsize+aligned_offset+aligned_with_B_offset, nrow, OuterStride<>(ldl) ); |
| | |
| | l.noalias() = B * u; |
| | |
| | |
| | isub = lptr + no_zeros; |
| | for (i = 0; i < ((SegSizeAtCompileTime==Dynamic)?segsize:SegSizeAtCompileTime); i++) |
| | { |
| | irow = lsub(isub++); |
| | dense(irow) = tempv(i); |
| | } |
| | |
| | |
| | for (i = 0; i < nrow; i++) |
| | { |
| | irow = lsub(isub++); |
| | dense(irow) -= l(i); |
| | } |
| | } |
| |
|
| | template <> struct LU_kernel_bmod<1> |
| | { |
| | template <typename BlockScalarVector, typename ScalarVector, typename IndexVector> |
| | static EIGEN_DONT_INLINE void run(const Index , BlockScalarVector& dense, ScalarVector& , ScalarVector& lusup, Index& luptr, |
| | const Index lda, const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros); |
| | }; |
| |
|
| |
|
| | template <typename BlockScalarVector, typename ScalarVector, typename IndexVector> |
| | EIGEN_DONT_INLINE void LU_kernel_bmod<1>::run(const Index , BlockScalarVector& dense, ScalarVector& , ScalarVector& lusup, Index& luptr, |
| | const Index lda, const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros) |
| | { |
| | typedef typename ScalarVector::Scalar Scalar; |
| | typedef typename IndexVector::Scalar StorageIndex; |
| | Scalar f = dense(lsub(lptr + no_zeros)); |
| | luptr += lda * no_zeros + no_zeros + 1; |
| | const Scalar* a(lusup.data() + luptr); |
| | const StorageIndex* irow(lsub.data()+lptr + no_zeros + 1); |
| | Index i = 0; |
| | for (; i+1 < nrow; i+=2) |
| | { |
| | Index i0 = *(irow++); |
| | Index i1 = *(irow++); |
| | Scalar a0 = *(a++); |
| | Scalar a1 = *(a++); |
| | Scalar d0 = dense.coeff(i0); |
| | Scalar d1 = dense.coeff(i1); |
| | d0 -= f*a0; |
| | d1 -= f*a1; |
| | dense.coeffRef(i0) = d0; |
| | dense.coeffRef(i1) = d1; |
| | } |
| | if(i<nrow) |
| | dense.coeffRef(*(irow++)) -= f * *(a++); |
| | } |
| |
|
| | } |
| |
|
| | } |
| | #endif |
| |
|