| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| |
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | #ifndef SPARSELU_PANEL_BMOD_H |
| | #define SPARSELU_PANEL_BMOD_H |
| |
|
| | namespace Eigen { |
| | namespace internal { |
| |
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | template <typename Scalar, typename StorageIndex> |
| | void SparseLUImpl<Scalar,StorageIndex>::panel_bmod(const Index m, const Index w, const Index jcol, |
| | const Index nseg, ScalarVector& dense, ScalarVector& tempv, |
| | IndexVector& segrep, IndexVector& repfnz, GlobalLU_t& glu) |
| | { |
| | |
| | Index ksub,jj,nextl_col; |
| | Index fsupc, nsupc, nsupr, nrow; |
| | Index krep, kfnz; |
| | Index lptr; |
| | Index luptr; |
| | Index segsize,no_zeros ; |
| | |
| | Index k = nseg - 1; |
| | const Index PacketSize = internal::packet_traits<Scalar>::size; |
| | |
| | for (ksub = 0; ksub < nseg; ksub++) |
| | { |
| | |
| | |
| | |
| | |
| | |
| | krep = segrep(k); k--; |
| | fsupc = glu.xsup(glu.supno(krep)); |
| | nsupc = krep - fsupc + 1; |
| | nsupr = glu.xlsub(fsupc+1) - glu.xlsub(fsupc); |
| | nrow = nsupr - nsupc; |
| | lptr = glu.xlsub(fsupc); |
| | |
| | |
| | Index u_rows = 0; |
| | Index u_cols = 0; |
| | for (jj = jcol; jj < jcol + w; jj++) |
| | { |
| | nextl_col = (jj-jcol) * m; |
| | VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); |
| | |
| | kfnz = repfnz_col(krep); |
| | if ( kfnz == emptyIdxLU ) |
| | continue; |
| | |
| | segsize = krep - kfnz + 1; |
| | u_cols++; |
| | u_rows = (std::max)(segsize,u_rows); |
| | } |
| | |
| | if(nsupc >= 2) |
| | { |
| | Index ldu = internal::first_multiple<Index>(u_rows, PacketSize); |
| | Map<ScalarMatrix, Aligned, OuterStride<> > U(tempv.data(), u_rows, u_cols, OuterStride<>(ldu)); |
| | |
| | |
| | Index u_col = 0; |
| | for (jj = jcol; jj < jcol + w; jj++) |
| | { |
| | nextl_col = (jj-jcol) * m; |
| | VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); |
| | VectorBlock<ScalarVector> dense_col(dense, nextl_col, m); |
| | |
| | kfnz = repfnz_col(krep); |
| | if ( kfnz == emptyIdxLU ) |
| | continue; |
| | |
| | segsize = krep - kfnz + 1; |
| | luptr = glu.xlusup(fsupc); |
| | no_zeros = kfnz - fsupc; |
| | |
| | Index isub = lptr + no_zeros; |
| | Index off = u_rows-segsize; |
| | for (Index i = 0; i < off; i++) U(i,u_col) = 0; |
| | for (Index i = 0; i < segsize; i++) |
| | { |
| | Index irow = glu.lsub(isub); |
| | U(i+off,u_col) = dense_col(irow); |
| | ++isub; |
| | } |
| | u_col++; |
| | } |
| | |
| | luptr = glu.xlusup(fsupc); |
| | Index lda = glu.xlusup(fsupc+1) - glu.xlusup(fsupc); |
| | no_zeros = (krep - u_rows + 1) - fsupc; |
| | luptr += lda * no_zeros + no_zeros; |
| | MappedMatrixBlock A(glu.lusup.data()+luptr, u_rows, u_rows, OuterStride<>(lda) ); |
| | U = A.template triangularView<UnitLower>().solve(U); |
| | |
| | |
| | luptr += u_rows; |
| | MappedMatrixBlock B(glu.lusup.data()+luptr, nrow, u_rows, OuterStride<>(lda) ); |
| | eigen_assert(tempv.size()>w*ldu + nrow*w + 1); |
| | |
| | Index ldl = internal::first_multiple<Index>(nrow, PacketSize); |
| | Index offset = (PacketSize-internal::first_default_aligned(B.data(), PacketSize)) % PacketSize; |
| | MappedMatrixBlock L(tempv.data()+w*ldu+offset, nrow, u_cols, OuterStride<>(ldl)); |
| | |
| | L.noalias() = B * U; |
| | |
| | |
| | u_col = 0; |
| | for (jj = jcol; jj < jcol + w; jj++) |
| | { |
| | nextl_col = (jj-jcol) * m; |
| | VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); |
| | VectorBlock<ScalarVector> dense_col(dense, nextl_col, m); |
| | |
| | kfnz = repfnz_col(krep); |
| | if ( kfnz == emptyIdxLU ) |
| | continue; |
| | |
| | segsize = krep - kfnz + 1; |
| | no_zeros = kfnz - fsupc; |
| | Index isub = lptr + no_zeros; |
| | |
| | Index off = u_rows-segsize; |
| | for (Index i = 0; i < segsize; i++) |
| | { |
| | Index irow = glu.lsub(isub++); |
| | dense_col(irow) = U.coeff(i+off,u_col); |
| | U.coeffRef(i+off,u_col) = 0; |
| | } |
| | |
| | |
| | for (Index i = 0; i < nrow; i++) |
| | { |
| | Index irow = glu.lsub(isub++); |
| | dense_col(irow) -= L.coeff(i,u_col); |
| | L.coeffRef(i,u_col) = 0; |
| | } |
| | u_col++; |
| | } |
| | } |
| | else |
| | { |
| | |
| | for (jj = jcol; jj < jcol + w; jj++) |
| | { |
| | nextl_col = (jj-jcol) * m; |
| | VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); |
| | VectorBlock<ScalarVector> dense_col(dense, nextl_col, m); |
| | |
| | kfnz = repfnz_col(krep); |
| | if ( kfnz == emptyIdxLU ) |
| | continue; |
| | |
| | segsize = krep - kfnz + 1; |
| | luptr = glu.xlusup(fsupc); |
| | |
| | Index lda = glu.xlusup(fsupc+1)-glu.xlusup(fsupc); |
| | |
| | |
| | |
| | no_zeros = kfnz - fsupc; |
| | if(segsize==1) LU_kernel_bmod<1>::run(segsize, dense_col, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros); |
| | else if(segsize==2) LU_kernel_bmod<2>::run(segsize, dense_col, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros); |
| | else if(segsize==3) LU_kernel_bmod<3>::run(segsize, dense_col, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros); |
| | else LU_kernel_bmod<Dynamic>::run(segsize, dense_col, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros); |
| | } |
| | } |
| | |
| | } |
| | } |
| |
|
| | } |
| |
|
| | } |
| |
|
| | #endif |
| |
|