template<> template<typename InputType> inline \
RealSchur<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW> >& \
RealSchur<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW> >
::compute(
const EigenBase<InputType>&
matrix,
bool computeU) \
{ \
\
char jobvs, sort='N'; \
LAPACK_##LAPACKE_PREFIX_U##_SELECT2 select = 0; \
jobvs = (computeU) ? 'V' : 'N'; \
lapack_int ldvs = internal::convert_index<lapack_int>(m_matU.outerStride()); \
lapack_int lda = internal::convert_index<lapack_int>(m_matT.outerStride()); \
Matrix<EIGTYPE, Dynamic, Dynamic> wr, wi; \
wr.resize(
n, 1); wi.resize(
n, 1); \
info = LAPACKE_##LAPACKE_PREFIX##gees( matrix_order, jobvs, sort, select,
n, (LAPACKE_TYPE*)m_matT.data(),
lda, &sdim, (LAPACKE_TYPE*)wr.data(), (LAPACKE_TYPE*)wi.data(), (LAPACKE_TYPE*)m_matU.data(), ldvs ); \
m_info = Success; \
else \
m_info = NoConvergence; \
\
m_isInitialized = true; \
m_matUisUptodate = computeU; \
return *this; \
\
}
int n
Definition BiCGSTAB_simple.cpp:1
Map< Matrix< T, Dynamic, Dynamic, ColMajor >, 0, OuterStride<> > matrix(T *data, int rows, int cols, int stride)
Definition common.h:110
EIGEN_DONT_INLINE void compute(Solver &solver, const MatrixType &A)
Definition dense_solvers.cpp:25
* lda
Definition eigenvalues.cpp:59
else if n * info
Definition cholesky.cpp:18
#define lapack_int
Definition lapacke.h:49