1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
// This file is part of Eigen, a lightweight C++ template library
// for linear algebra. Eigen itself is part of the KDE project.
//
// Copyright (C) 2006-2007 Benoit Jacob <jacob@math.jussieu.fr>
//
// Eigen is free software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the Free Software
// Foundation; either version 2 or (at your option) any later version.
//
// Eigen is distributed in the hope that it will be useful, but WITHOUT ANY
// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
// FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
// details.
//
// You should have received a copy of the GNU General Public License along
// with Eigen; if not, write to the Free Software Foundation, Inc., 51
// Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
//
// As a special exception, if other files instantiate templates or use macros
// or inline functions from this file, or you compile this file and link it
// with other works to produce a work based on this file, this file does not
// by itself cause the resulting work to be covered by the GNU General Public
// License. This exception does not invalidate any other reasons why a work
// based on this file might be covered by the GNU General Public License.
#include "main.h"
#include "../src/linearsolver.h"
template< typename T, int Size, typename LinearSolverType,
typename MatrixType, typename VectorType >
void helper_checkSolver( const char *strType )
{
MatrixType lhs(Size);
VectorType rhs(Size);
do pickRandomMatrix(lhs); while( !lhs.isInvertible() );
do pickRandomVector(rhs); while( rhs.norm() == static_cast<T>(0));
LinearSolverType solver1( lhs, rhs );
QVERIFY( solver1.thereExistSolutions() );
QVERIFY( solver1.dimSolutions() == 0 );
QVERIFY( compareVectors( lhs * solver1.someSolution(), rhs, strType ) );
VectorType row(Size);
row.loadZero();
int dep = rand() % Size;
lhs.setRow( dep, row );
rhs(dep) = static_cast<T>(0);
for( int j = 0; j < Size; j++ )
{
if( j != dep )
{
T t;
pickRandom( t );
VectorType deprow;
deprow = lhs.row( dep );
deprow += t * lhs.row( j );
lhs.setRow( dep, deprow );
rhs( dep ) += t * rhs( j );
}
}
LinearSolverType solver2( lhs, rhs );
if( ! solver2.thereExistSolutions() )
{
qDebug() << strType << endl;
}
QVERIFY( solver2.thereExistSolutions() );
QVERIFY( solver2.dimSolutions() >= 1 );
if( solver2.dimSolutions() > 1 ) return;
QVERIFY( compareVectors( lhs * solver2.someSolution(), rhs, strType ) );
T param;
pickRandom( param );
QVERIFY( compareVectors( lhs * solver2.genericSolution( ¶m ), rhs, strType ) );
}
void MainTest::checkSolver()
{
#define HELPER_CHECKSOLVER_FIX( T, Size ) \
helper_checkSolver< T, Size, LinearSolver< T, Size >,\
Matrix< T, Size >, Vector< T, Size > >\
("fixed<"__STRING(T)","__STRING(Size)">")
#define HELPER_CHECKSOLVER_DYN( T, Size ) \
helper_checkSolver< T, Size, LinearSolverX<T>,\
MatrixX<T>, VectorX<T> >\
("dynamic<"__STRING(T)">("__STRING(Size)")")
for( int repeat = 0; repeat < REPEAT; repeat++ )
{
HELPER_CHECKSOLVER_FIX( float, 1 );
HELPER_CHECKSOLVER_FIX( double, 2 );
HELPER_CHECKSOLVER_FIX( float, 3 );
HELPER_CHECKSOLVER_FIX( double, 4 );
HELPER_CHECKSOLVER_FIX( double, 8 );
HELPER_CHECKSOLVER_FIX( double, 12 );
HELPER_CHECKSOLVER_FIX( complex<double>, 7 );
HELPER_CHECKSOLVER_FIX( complex<float>, 4 );
HELPER_CHECKSOLVER_FIX( complex<double>, 12 );
HELPER_CHECKSOLVER_DYN( float, 1 );
HELPER_CHECKSOLVER_DYN( double, 2 );
HELPER_CHECKSOLVER_DYN( float, 3 );
HELPER_CHECKSOLVER_DYN( double, 4 );
HELPER_CHECKSOLVER_DYN( double, 8 );
HELPER_CHECKSOLVER_DYN( double, 12 );
HELPER_CHECKSOLVER_DYN( complex<double>, 7 );
HELPER_CHECKSOLVER_DYN( complex<float>, 4 );
HELPER_CHECKSOLVER_DYN( complex<double>, 12 );
}
}
|
