GitHub-Proxy/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2025-06-20 22:52:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix LSCG::solve with a sparse destination.

Browse Source
This commit is contained in:
Gael Guennebaud 2015-09-02 15:34:03 +02:00
parent b5ad3d2cf7
commit 6b99afa5ae
1 changed files with 6 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
View File

@ -212,13 +212,17 @@ public:
Index rhsCols = b.cols(); Index rhsCols = b.cols();
Index size = b.rows(); Index size = b.rows();
Eigen::Matrix<DestScalar,Dynamic,1> tb(size); Eigen::Matrix<DestScalar,Dynamic,1> tb(size);
Eigen::Matrix<DestScalar,Dynamic,1> tx(size); Eigen::Matrix<DestScalar,Dynamic,1> tx(cols());
// We do not directly fill dest because sparse expressions have to be free of aliasing issue.
// For non square least-square problems, b and dest might not have the same size whereas they might alias each-other.
SparseMatrix<DestScalar,DestOptions,DestIndex> tmp(cols(),rhsCols);
for(Index k=0; k<rhsCols; ++k) for(Index k=0; k<rhsCols; ++k)
{ {
tb = b.col(k); tb = b.col(k);
tx = derived().solve(tb); tx = derived().solve(tb);
dest.col(k) = tx.sparseView(0); tmp.col(k) = tx.sparseView(0);
} }
tmp.swap(dest);
} }
protected: protected: