From 81d4bfa8d9c9f17a58d827956f7d529085151afe Mon Sep 17 00:00:00 2001 From: Desire NUENTSA Date: Fri, 25 Jan 2013 18:17:17 +0100 Subject: add support for solving with sparse right hand side --- Eigen/src/PardisoSupport/PardisoSupport.h | 25 +------------------------ 1 file changed, 1 insertion(+), 24 deletions(-) (limited to 'Eigen/src/PardisoSupport') diff --git a/Eigen/src/PardisoSupport/PardisoSupport.h b/Eigen/src/PardisoSupport/PardisoSupport.h index d623bf518..1c48f0df7 100644 --- a/Eigen/src/PardisoSupport/PardisoSupport.h +++ b/Eigen/src/PardisoSupport/PardisoSupport.h @@ -206,29 +206,6 @@ class PardisoImpl template bool _solve(const MatrixBase &b, MatrixBase& x) const; - /** \internal */ - template - void _solve_sparse(const Rhs& b, SparseMatrix &dest) const - { - eigen_assert(m_size==b.rows()); - - // we process the sparse rhs per block of NbColsAtOnce columns temporarily stored into a dense matrix. - static const int NbColsAtOnce = 4; - int rhsCols = b.cols(); - int size = b.rows(); - // Pardiso cannot solve in-place, - // so we need two temporaries - Eigen::Matrix tmp_rhs(size,rhsCols); - Eigen::Matrix tmp_res(size,rhsCols); - for(int k=0; k(rhsCols-k, NbColsAtOnce); - tmp_rhs.leftCols(actualCols) = b.middleCols(k,actualCols); - tmp_res.leftCols(actualCols) = derived().solve(tmp_rhs.leftCols(actualCols)); - dest.middleCols(k,actualCols) = tmp_res.leftCols(actualCols).sparseView(); - } - } - protected: void pardisoRelease() { @@ -604,7 +581,7 @@ struct sparse_solve_retval, Rhs> template void evalTo(Dest& dst) const { - dec().derived()._solve_sparse(rhs(),dst); + this->defaultEvalTo(dst); } }; -- cgit v1.2.3