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

Clang-format tests, examples, libraries, benchmarks, etc.

Browse Source
This commit is contained in:
Antonio Sánchez
2023-12-05 21:22:55 +00:00
committed by Rasmus Munk Larsen
parent 3252ecc7a4
commit 46e9cdb7fe
876 changed files with 33453 additions and 37795 deletions
Download Patch File Download Diff File Expand all files Collapse all files

102
test/real_qz.cpp
View File

@@ -12,83 +12,83 @@
#include <limits>
#include <Eigen/Eigenvalues>
template<typename MatrixType> void real_qz(const MatrixType& m)
{
template <typename MatrixType>
void real_qz(const MatrixType& m) {
/* this test covers the following files:
RealQZ.h
*/
using std::abs;
Index dim = m.cols();
MatrixType A = MatrixType::Random(dim,dim),
B = MatrixType::Random(dim,dim);
Index dim = m.cols();
MatrixType A = MatrixType::Random(dim, dim), B = MatrixType::Random(dim, dim);
// Regression test for bug 985: Randomly set rows or columns to zero
Index k=internal::random<Index>(0, dim-1);
switch(internal::random<int>(0,10)) {
case 0:
A.row(k).setZero(); break;
case 1:
A.col(k).setZero(); break;
case 2:
B.row(k).setZero(); break;
case 3:
B.col(k).setZero(); break;
default:
break;
Index k = internal::random<Index>(0, dim - 1);
switch (internal::random<int>(0, 10)) {
case 0:
A.row(k).setZero();
break;
case 1:
A.col(k).setZero();
break;
case 2:
B.row(k).setZero();
break;
case 3:
B.col(k).setZero();
break;
default:
break;
}
RealQZ<MatrixType> qz(dim);
// TODO enable full-prealocation of required memory, this probably requires an in-place mode for HessenbergDecomposition
//Eigen::internal::set_is_malloc_allowed(false);
qz.compute(A,B);
//Eigen::internal::set_is_malloc_allowed(true);
// TODO enable full-prealocation of required memory, this probably requires an in-place mode for
// HessenbergDecomposition
// Eigen::internal::set_is_malloc_allowed(false);
qz.compute(A, B);
// Eigen::internal::set_is_malloc_allowed(true);
VERIFY_IS_EQUAL(qz.info(), Success);
// check for zeros
bool all_zeros = true;
for (Index i=0; i<A.cols(); i++)
for (Index j=0; j<i; j++) {
if (!numext::is_exactly_zero(abs(qz.matrixT()(i, j))))
{
std::cerr << "Error: T(" << i << "," << j << ") = " << qz.matrixT()(i,j) << std::endl;
for (Index i = 0; i < A.cols(); i++)
for (Index j = 0; j < i; j++) {
if (!numext::is_exactly_zero(abs(qz.matrixT()(i, j)))) {
std::cerr << "Error: T(" << i << "," << j << ") = " << qz.matrixT()(i, j) << std::endl;
all_zeros = false;
}
if (j<i-1 && !numext::is_exactly_zero(abs(qz.matrixS()(i, j))))
{
std::cerr << "Error: S(" << i << "," << j << ") = " << qz.matrixS()(i,j) << std::endl;
if (j < i - 1 && !numext::is_exactly_zero(abs(qz.matrixS()(i, j)))) {
std::cerr << "Error: S(" << i << "," << j << ") = " << qz.matrixS()(i, j) << std::endl;
all_zeros = false;
}
if (j==i-1 && j>0 && !numext::is_exactly_zero(abs(qz.matrixS()(i, j))) &&
!numext::is_exactly_zero(abs(qz.matrixS()(i - 1, j - 1))))
{
std::cerr << "Error: S(" << i << "," << j << ") = " << qz.matrixS()(i,j) << " && S(" << i-1 << "," << j-1 << ") = " << qz.matrixS()(i-1,j-1) << std::endl;
if (j == i - 1 && j > 0 && !numext::is_exactly_zero(abs(qz.matrixS()(i, j))) &&
!numext::is_exactly_zero(abs(qz.matrixS()(i - 1, j - 1)))) {
std::cerr << "Error: S(" << i << "," << j << ") = " << qz.matrixS()(i, j) << " && S(" << i - 1 << "," << j - 1
<< ") = " << qz.matrixS()(i - 1, j - 1) << std::endl;
all_zeros = false;
}
}
VERIFY_IS_EQUAL(all_zeros, true);
VERIFY_IS_APPROX(qz.matrixQ()*qz.matrixS()*qz.matrixZ(), A);
VERIFY_IS_APPROX(qz.matrixQ()*qz.matrixT()*qz.matrixZ(), B);
VERIFY_IS_APPROX(qz.matrixQ()*qz.matrixQ().adjoint(), MatrixType::Identity(dim,dim));
VERIFY_IS_APPROX(qz.matrixZ()*qz.matrixZ().adjoint(), MatrixType::Identity(dim,dim));
VERIFY_IS_APPROX(qz.matrixQ() * qz.matrixS() * qz.matrixZ(), A);
VERIFY_IS_APPROX(qz.matrixQ() * qz.matrixT() * qz.matrixZ(), B);
VERIFY_IS_APPROX(qz.matrixQ() * qz.matrixQ().adjoint(), MatrixType::Identity(dim, dim));
VERIFY_IS_APPROX(qz.matrixZ() * qz.matrixZ().adjoint(), MatrixType::Identity(dim, dim));
}
EIGEN_DECLARE_TEST(real_qz)
{
EIGEN_DECLARE_TEST(real_qz) {
int s = 0;
for(int i = 0; i < g_repeat; i++) {
CALL_SUBTEST_1( real_qz(Matrix4f()) );
s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4);
CALL_SUBTEST_2( real_qz(MatrixXd(s,s)) );
for (int i = 0; i < g_repeat; i++) {
CALL_SUBTEST_1(real_qz(Matrix4f()));
s = internal::random<int>(1, EIGEN_TEST_MAX_SIZE / 4);
CALL_SUBTEST_2(real_qz(MatrixXd(s, s)));
// some trivial but implementation-wise tricky cases
CALL_SUBTEST_2( real_qz(MatrixXd(1,1)) );
CALL_SUBTEST_2( real_qz(MatrixXd(2,2)) );
CALL_SUBTEST_3( real_qz(Matrix<double,1,1>()) );
CALL_SUBTEST_4( real_qz(Matrix2d()) );
CALL_SUBTEST_2(real_qz(MatrixXd(1, 1)));
CALL_SUBTEST_2(real_qz(MatrixXd(2, 2)));
CALL_SUBTEST_3(real_qz(Matrix<double, 1, 1>()));
CALL_SUBTEST_4(real_qz(Matrix2d()));
}
TEST_SET_BUT_UNUSED_VARIABLE(s)
}