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
|
/***********************************************/
/**
* @file matrixGeneratorEigenValues.h
*
* @brief EigenValues of a matrix.
*
* @author Torsten Mayer-Guerr
* @date 2017-09-01
*
*/
/***********************************************/
#ifndef __GROOPS_MATRIXGENERATOREIGENVALUES__
#define __GROOPS_MATRIXGENERATOREIGENVALUES__
// Latex documentation
#ifdef DOCSTRING_MatrixGenerator
static const char *docstringMatrixGeneratorEigenValues = R"(
\subsection{EigenValues}
Computes the eigenvalues of a square matrix and gives a vector of eigenvalues for symmetric matrices
or a matrix with 2 columns with real and imaginary parts in general case.
)";
#endif
/***********************************************/
#include "base/import.h"
#include "matrixGenerator.h"
/***** CLASS ***********************************/
/** @brief EigenValues of a matrix.
* @ingroup matrixGeneratorGroup
* @see MatrixGenerator */
class MatrixGeneratorEigenValues : public MatrixGeneratorBase
{
MatrixGeneratorPtr matrix;
Bool eigenVectors;
public:
MatrixGeneratorEigenValues(Config &config);
void compute(Matrix &A, UInt rowsBefore, UInt columnsBefore, UInt &startRow, UInt &startCol);
};
/***********************************************/
/***** Inlines *********************************/
/***********************************************/
inline MatrixGeneratorEigenValues::MatrixGeneratorEigenValues(Config &config)
{
try
{
readConfig(config, "matrix", matrix, Config::MUSTSET, "", "");
readConfig(config, "eigenVectors", eigenVectors, Config::DEFAULT, "0", "return eigen vectors instead of eigen values");
if(isCreateSchema(config)) return;
}
catch(std::exception &e)
{
GROOPS_RETHROW(e)
}
}
/***********************************************/
inline void MatrixGeneratorEigenValues::compute(Matrix &A, UInt /*rowsBefore*/, UInt /*columnsBefore*/, UInt &/*startRow*/, UInt &/*startCol*/)
{
try
{
A = matrix->compute().trans();
Matrix eigen, VL, VR;
if(A.getType() == Matrix::SYMMETRIC)
{
eigen = eigenValueDecomposition(A, eigenVectors);
// reverse order
if(eigenVectors)
for(UInt k=0; k<A.columns()/2; k++)
{
Vector tmp(A.column(k));
copy(A.column((A.columns()-1-k)), A.column(k));
copy(tmp, A.column((A.columns()-1-k)));
}
else
{
A = Matrix(eigen.rows(), eigen.columns());
for(UInt i=0; i<eigen.rows(); i++)
copy(eigen.row(i), A.row((A.rows()-1-i)));
}
}
else
{
eigen = eigenValueDecomposition(A, VL, VR, eigenVectors);
if(!eigenVectors)
A = eigen;
}
}
catch(std::exception &e)
{
GROOPS_RETHROW(e)
}
}
/***********************************************/
#endif
|
