dynare/dynare++/sylv/cc/SymSchurDecomp.cc

99 lines
2.6 KiB
C++
Raw Normal View History

/* $Header$ */
/* Tag $Name$ */
#include "SymSchurDecomp.hh"
#include "SylvException.hh"
#include <dynlapack.h>
#include <algorithm>
#include <cmath>
#include <vector>
SymSchurDecomp::SymSchurDecomp(const ConstGeneralMatrix &mata)
: 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();
std::vector<lapack_int> isuppz(2*std::max(1, (int) m));
double tmpwork;
lapack_int lwork = -1;
lapack_int tmpiwork;
lapack_int liwork = -1;
lapack_int info;
// query for lwork and liwork
dsyevr("V", "A", "U", &n, a, &lda, vl, vu, il, iu, &abstol,
&m, w, z, &ldz, isuppz.data(), &tmpwork, &lwork, &tmpiwork, &liwork, &info);
lwork = (int) tmpwork;
liwork = tmpiwork;
// allocate work arrays
std::vector<double> work(lwork);
std::vector<lapack_int> iwork(liwork);
// do the calculation
dsyevr("V", "A", "U", &n, a, &lda, vl, vu, il, iu, &abstol,
&m, w, z, &ldz, isuppz.data(), work.data(), &lwork, iwork.data(), &liwork, &info);
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++)
{
Vector fi{f.getCol(i)};
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;
}