Attachment 399 Details for Bug 706 – Updated patch for SparseQR.h

This bugzilla service is closed. All entries have been migrated to https://gitlab.com/libeigen/eigen

[patch] Updated patch for SparseQR.h

patch.SparseQR.h (text/plain), 993 bytes, created by adam.p.harrison on 2013-11-21 01:48:27 UTC

(hide)

Description:

Filename:

MIME Type:

Creator: adam.p.harrison

Created: 2013-11-21 01:48:27 UTC

Size: 993 bytes

patch

obsolete

>--- SparseQR_old.h	2013-11-20 17:38:59.502945600 -0700
>+++ SparseQR.h	2013-11-20 17:38:16.990514000 -0700
>@@ -353,7 +353,7 @@
>     // all the nodes (with indexes lower than rank) reachable through the column elimination tree (etree) rooted at node k.
>     // Note: if the diagonal entry does not exist, then its contribution must be explicitly added,
>     // thus the trick with found_diag that permits to do one more iteration on the diagonal element if this one has not been found.
>-    for (typename MatrixType::InnerIterator itp(m_pmat, col); itp || !found_diag; ++itp)
>+    for (typename QRMatrixType::InnerIterator itp(m_pmat, col); itp || !found_diag; ++itp)
>     {
>       Index curIdx = nonzeroCol ;
>       if(itp) curIdx = itp.row();
>@@ -504,7 +504,7 @@
>   if(nonzeroCol<n)
>   {
>     // Permute the triangular factor to put the 'dead' columns to the end
>-    MatrixType tempR(m_R);
>+    QRMatrixType tempR(m_R);
>     m_R = tempR * m_pivotperm;
> 
>     // Update the column permutation

Actions: View | Diff

Attachments on bug 706: 396 | 397 | 398 | 399