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
|
/***********************************************/
/**
* @file matrixGeneratorFromDiagonal.h
*
* @brief Generate a matrix from a diagonal vector.
*
* @author Andreas Kvas
* @date 2018-09-01
*
*/
/***********************************************/
#ifndef __GROOPS_MATRIXGENERATORFROMDIAGONAL__
#define __GROOPS_MATRIXGENERATORFROMDIAGONAL__
// Latex documentation
#ifdef DOCSTRING_MatrixGenerator
static const char *docstringMatrixGeneratorFromDiagonal = R"(
\subsection{FromDiagonal}
Generate a matrix from a diagonal vector.
)";
#endif
/***********************************************/
#include "base/import.h"
#include "matrixGenerator.h"
/***** CLASS ***********************************/
/** @brief Generate a matrix from a diagonal vector.
* @ingroup matrixGeneratorGroup
* @see MatrixGenerator */
class MatrixGeneratorFromDiagonal : public MatrixGeneratorBase
{
MatrixGeneratorPtr matrix;
Int index;
public:
MatrixGeneratorFromDiagonal(Config &config);
void compute(Matrix &A, UInt rowsBefore, UInt columnsBefore, UInt &startRow, UInt &startCol);
};
/***********************************************/
/***** Inlines *********************************/
/***********************************************/
inline MatrixGeneratorFromDiagonal::MatrixGeneratorFromDiagonal(Config &config)
{
try
{
readConfig(config, "matrix", matrix, Config::MUSTSET, "", "(nx1) or (1xn) diagonal vector");
readConfig(config, "diagonal", index, Config::DEFAULT, "0", "zero: main diagonal, positive: superdiagonal, negative: subdiagonal");
if(isCreateSchema(config)) return;
}
catch(std::exception &e)
{
GROOPS_RETHROW(e)
}
}
/***********************************************/
inline void MatrixGeneratorFromDiagonal::compute(Matrix &A, UInt /*rowsBefore*/, UInt /*columnsBefore*/, UInt &/*startRow*/, UInt &/*startCol*/)
{
try
{
A = matrix->compute();
if(std::min(A.rows(), A.columns()) != 1)
throw(Exception("Input must be a (nx1) or (1xn) vector."));
Vector d(flatten(A));
const UInt outputSize = d.rows() + std::abs(index);
A = Matrix(outputSize, outputSize);
for(UInt k = 0; k<d.rows(); k++)
A(k-std::min(0, index), k+std::max(0, index)) = d(k);
}
catch(std::exception &e)
{
GROOPS_RETHROW(e)
}
}
/***********************************************/
#endif
|
