devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add a sparse QR factorization and update the elimination tree in SparseLU

Browse Source
This commit is contained in:
Desire NUENTSA
2013-01-11 17:16:14 +01:00
parent 1ccd90a927
commit 91b3b3aaab
10 changed files with 618 additions and 36 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Eigen/src/SparseLU/SparseLU_heap_relax_snode.h
View File

@@ -44,7 +44,7 @@ void SparseLUBase<Scalar,Index>::LU_heap_relax_snode (const int n, IndexVector&
// The etree may not be postordered, but its heap ordered
IndexVector post;
LU_TreePostorder(n, et, post); // Post order etree
internal::treePostorder(n, et, post); // Post order etree
IndexVector inv_post(n+1);
int i;
for (i = 0; i < n+1; ++i) inv_post(post(i)) = i; // inv_post = post.inverse()???