2019-01-08 17:12:05 +01:00
|
|
|
/* $Header$ */
|
|
|
|
|
|
|
|
/* Tag $Name$ */
|
|
|
|
|
|
|
|
#include "SymSchurDecomp.hh"
|
|
|
|
#include "SylvException.hh"
|
|
|
|
|
|
|
|
#include <dynlapack.h>
|
|
|
|
|
|
|
|
#include <algorithm>
|
|
|
|
#include <cmath>
|
2019-01-16 17:52:16 +01:00
|
|
|
#include <vector>
|
2019-01-08 17:12:05 +01:00
|
|
|
|
2019-01-24 15:22:36 +01:00
|
|
|
SymSchurDecomp::SymSchurDecomp(const ConstGeneralMatrix &mata)
|
2019-01-08 17:12:05 +01:00
|
|
|
: lambda(mata.numRows()), q(mata.numRows())
|
|
|
|
{
|
|
|
|
// check mata is square
|
|
|
|
if (mata.numRows() != mata.numCols())
|
|
|
|
throw SYLV_MES_EXCEPTION("Matrix is not square in SymSchurDecomp constructor");
|
|
|
|
|
|
|
|
// prepare for dsyevr
|
|
|
|
lapack_int n = mata.numRows();
|
|
|
|
GeneralMatrix tmpa(mata);
|
|
|
|
double *a = tmpa.base();
|
|
|
|
lapack_int lda = tmpa.getLD();
|
|
|
|
double dum;
|
|
|
|
double *vl = &dum;
|
|
|
|
double *vu = &dum;
|
|
|
|
lapack_int idum;
|
|
|
|
lapack_int *il = &idum;
|
|
|
|
lapack_int *iu = &idum;
|
|
|
|
double abstol = 0.0;
|
|
|
|
lapack_int m = n;
|
|
|
|
double *w = lambda.base();
|
|
|
|
double *z = q.base();
|
|
|
|
lapack_int ldz = q.getLD();
|
2019-01-16 17:52:16 +01:00
|
|
|
std::vector<lapack_int> isuppz(2*std::max(1, (int) m));
|
2019-01-08 17:12:05 +01:00
|
|
|
double tmpwork;
|
|
|
|
lapack_int lwork = -1;
|
|
|
|
lapack_int tmpiwork;
|
|
|
|
lapack_int liwork = -1;
|
|
|
|
lapack_int info;
|
|
|
|
|
|
|
|
// query for lwork and liwork
|
2019-01-25 15:27:20 +01:00
|
|
|
dsyevr("V", "A", "U", &n, a, &lda, vl, vu, il, iu, &abstol,
|
2019-01-16 17:52:16 +01:00
|
|
|
&m, w, z, &ldz, isuppz.data(), &tmpwork, &lwork, &tmpiwork, &liwork, &info);
|
2019-01-08 17:12:05 +01:00
|
|
|
lwork = (int) tmpwork;
|
|
|
|
liwork = tmpiwork;
|
|
|
|
// allocate work arrays
|
2019-01-16 17:52:16 +01:00
|
|
|
std::vector<double> work(lwork);
|
|
|
|
std::vector<lapack_int> iwork(liwork);
|
2019-01-08 17:12:05 +01:00
|
|
|
|
|
|
|
// do the calculation
|
2019-01-25 15:27:20 +01:00
|
|
|
dsyevr("V", "A", "U", &n, a, &lda, vl, vu, il, iu, &abstol,
|
2019-01-16 17:52:16 +01:00
|
|
|
&m, w, z, &ldz, isuppz.data(), work.data(), &lwork, iwork.data(), &liwork, &info);
|
2019-01-08 17:12:05 +01:00
|
|
|
|
|
|
|
if (info < 0)
|
|
|
|
throw SYLV_MES_EXCEPTION("Internal error in SymSchurDecomp constructor");
|
|
|
|
if (info > 0)
|
|
|
|
throw SYLV_MES_EXCEPTION("Internal LAPACK error in DSYEVR");
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
SymSchurDecomp::getFactor(GeneralMatrix &f) const
|
|
|
|
{
|
|
|
|
if (f.numRows() != q.numRows())
|
|
|
|
throw SYLV_MES_EXCEPTION("Wrong dimension of factor matrix in SymSchurDecomp::getFactor");
|
|
|
|
if (f.numRows() != f.numCols())
|
|
|
|
throw SYLV_MES_EXCEPTION("Factor matrix is not square in SymSchurDecomp::getFactor");
|
|
|
|
if (!isPositiveSemidefinite())
|
|
|
|
throw SYLV_MES_EXCEPTION("Symmetric decomposition not positive semidefinite in SymSchurDecomp::getFactor");
|
|
|
|
|
|
|
|
f = q;
|
|
|
|
for (int i = 0; i < f.numCols(); i++)
|
|
|
|
{
|
Dynare++ / sylvester equation solver: refactor Vector and ConstVector classes
- these classes now encapsulate a std::shared_ptr<{const, }double>, so that
they do not perform memory management, and several {Const,}Vector instances
can transparently share the same underlying data
- make converting constructor from ConstVector to Vector explicit, since that
entails memory allocation (but the reverse conversion is almost costless, so
keep it implicit); do the same for GeneralMatrix/ConstGeneralMatrix,
TwoDMatrix/ConstTwoDMatrix
- remove the constructors that were extracting a row/column from a matrix, and
replace them by getRow() and getCol() methods on {Const,}GeneralMatrix
- rename and change the API of the complex version Vector::add(), so that it is
explicit that it deals with complex numbers
- add constructors that take a MATLAB mxArray
2019-01-22 16:07:44 +01:00
|
|
|
Vector fi{f.getCol(i)};
|
2019-01-08 17:12:05 +01:00
|
|
|
fi.mult(std::sqrt(lambda[i]));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// LAPACK says that eigenvalues are ordered in ascending order, but we
|
|
|
|
// do not rely her on it
|
|
|
|
bool
|
|
|
|
SymSchurDecomp::isPositiveSemidefinite() const
|
|
|
|
{
|
|
|
|
for (int i = 0; i < lambda.length(); i++)
|
|
|
|
if (lambda[i] < 0)
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
SymSchurDecomp::correctDefinitness(double tol)
|
|
|
|
{
|
|
|
|
for (int i = 0; i < lambda.length(); i++)
|
|
|
|
if (lambda[i] < 0 && lambda[i] > -tol)
|
|
|
|
lambda[i] = 0.0;
|
|
|
|
}
|