11#ifndef EIGEN_REAL_QZ_H
12#define EIGEN_REAL_QZ_H
15#include "./InternalHeaderCheck.h"
61template <
typename MatrixType_>
64 using MatrixType = MatrixType_;
66 RowsAtCompileTime = MatrixType::RowsAtCompileTime,
67 ColsAtCompileTime = MatrixType::ColsAtCompileTime,
68 Options = internal::plain_object_options<MatrixType>::value,
69 MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime,
70 MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime
72 using Scalar =
typename MatrixType::Scalar;
73 using ComplexScalar = internal::make_complex_t<Scalar>;
95 explicit RealQZ(
Index size = RowsAtCompileTime == Dynamic ? 1 : RowsAtCompileTime)
100 m_workspace(size * 2),
103 m_isInitialized(false),
114 template <
typename InputTypeA,
typename InputTypeB>
118 m_Q(A.rows(), A.cols()),
119 m_Z(A.rows(), A.cols()),
120 m_workspace(A.rows() * 2),
123 m_isInitialized(false),
125 computeInPlace(computeQZ);
138 template <
typename InputTypeA,
typename InputTypeB>
142 m_Q(A.rows(), A.cols()),
143 m_Z(A.rows(), A.cols()),
144 m_workspace(A.rows() * 2),
147 m_isInitialized(false),
149 computeInPlace(computeQZ);
157 eigen_assert(m_isInitialized &&
"RealQZ is not initialized.");
158 eigen_assert(m_computeQZ &&
"The matrices Q and Z have not been computed during the QZ decomposition.");
167 eigen_assert(m_isInitialized &&
"RealQZ is not initialized.");
168 eigen_assert(m_computeQZ &&
"The matrices Q and Z have not been computed during the QZ decomposition.");
177 eigen_assert(m_isInitialized &&
"RealQZ is not initialized.");
186 eigen_assert(m_isInitialized &&
"RealQZ is not initialized.");
197 template <
typename InputTypeA,
typename InputTypeB>
207 eigen_assert(m_isInitialized &&
"RealQZ is not initialized.");
214 eigen_assert(m_isInitialized &&
"RealQZ is not initialized.");
215 return m_global_iter;
222 m_maxIters = maxIters;
230 ColumnVectorType m_hCoeffs;
233 bool m_isInitialized;
243 RealQZ& computeInPlace(
bool computeQZ);
244 void hessenbergTriangular();
246 Index findSmallSubdiagEntry(Index iu);
247 bool hasComplexEigenvalues(Index r)
const;
248 Index findSmallDiagEntry(Index f, Index l);
249 void splitOffTwoRows(Index i);
250 void pushDownZero(Index z, Index f, Index l);
251 void step(Index f, Index l, Index iter, internal::inverse_iteration_rng* randomShift);
256template <
typename MatrixType>
257void RealQZ<MatrixType>::hessenbergTriangular() {
258 const Index dim = m_S.cols();
261 m_hCoeffs.resize(dim);
262 internal::householder_qr_inplace_blocked<MatrixType, ColumnVectorType>::run(m_T, m_hCoeffs, 48, m_workspace.data());
263 Map<ColumnVectorType> workspace(m_workspace.data(), dim);
265 m_T.template triangularView<StrictlyLower>().setZero();
267 m_Z.noalias() = m_Q.adjoint() * m_S;
270 if (m_computeQZ) m_Z = PlainMatrixType::Identity(dim, dim);
272 for (Index j = 0; j <= dim - 3; j++) {
273 for (Index i = dim - 1; i >= j + 2; i--) {
276 if (!numext::is_exactly_zero(m_S.coeff(i, j))) {
277 G.makeGivens(m_S.coeff(i - 1, j), m_S.coeff(i, j), &m_S.coeffRef(i - 1, j));
278 m_S.coeffRef(i, j) = Scalar(0.0);
279 m_S.rightCols(dim - j - 1).applyOnTheLeft(i - 1, i, G.adjoint());
280 m_T.rightCols(dim - i + 1).applyOnTheLeft(i - 1, i, G.adjoint());
282 if (m_computeQZ) m_Q.applyOnTheRight(i - 1, i, G);
285 if (!numext::is_exactly_zero(m_T.coeff(i, i - 1))) {
286 G.makeGivens(m_T.coeff(i, i), m_T.coeff(i, i - 1), &m_T.coeffRef(i, i));
287 m_T.coeffRef(i, i - 1) = Scalar(0.0);
288 m_S.applyOnTheRight(i, i - 1, G);
289 m_T.topRows(i).applyOnTheRight(i, i - 1, G);
291 if (m_computeQZ) m_Z.applyOnTheLeft(i, i - 1, G.adjoint());
298template <
typename MatrixType>
299inline void RealQZ<MatrixType>::computeNorms() {
300 m_normOfT = internal::triangular_abs_sum<Upper>(m_T);
305template <
typename MatrixType>
306inline bool RealQZ<MatrixType>::hasComplexEigenvalues(Index r)
const {
307 const Scalar s00 = m_S.coeff(r, r), s01 = m_S.coeff(r, r + 1), s10 = m_S.coeff(r + 1, r),
308 s11 = m_S.coeff(r + 1, r + 1);
309 const Scalar t00 = m_T.coeff(r, r), t01 = m_T.coeff(r, r + 1), t11 = m_T.coeff(r + 1, r + 1);
310 const Scalar c1 = s10 * t01 - s00 * t11 - s11 * t00;
311 return c1 * c1 < Scalar(4) * (t00 * t11) * (s00 * s11 - s01 * s10);
315template <
typename MatrixType>
316inline Index RealQZ<MatrixType>::findSmallSubdiagEntry(Index iu) {
324 Scalar s = numext::abs(m_S.coeff(res - 1, res - 1)) + numext::abs(m_S.coeff(res, res));
325 if (res > 1 && res + 1 < m_S.rows() && hasComplexEigenvalues(res - 2) && hasComplexEigenvalues(res))
326 s += Scalar(2) * numext::mini(numext::sqrt(numext::abs(m_S.coeff(res - 1, res - 2))) *
327 numext::sqrt(numext::abs(m_S.coeff(res - 2, res - 1))),
328 numext::sqrt(numext::abs(m_S.coeff(res + 1, res))) *
329 numext::sqrt(numext::abs(m_S.coeff(res, res + 1))));
335 if (numext::is_exactly_zero(s)) {
336 if (res > 1 && res + 1 < m_S.rows())
337 s = Scalar(2) * numext::sqrt(numext::abs(m_S.coeff(res - 1, res - 2))) *
338 numext::sqrt(numext::abs(m_S.coeff(res + 1, res)));
339 s = numext::maxi<Scalar>(s, (std::numeric_limits<Scalar>::min)() / NumTraits<Scalar>::epsilon());
342 if (numext::abs(m_S.coeff(res, res - 1)) <= NumTraits<Scalar>::epsilon() * s)
break;
349template <
typename MatrixType>
350inline Index RealQZ<MatrixType>::findSmallDiagEntry(Index f, Index l) {
353 if (numext::abs(m_T.coeff(res, res)) <= NumTraits<Scalar>::epsilon() * m_normOfT)
break;
360template <
typename MatrixType>
361inline void RealQZ<MatrixType>::splitOffTwoRows(Index i) {
362 const Index dim = m_S.cols();
363 if (numext::is_exactly_zero(numext::abs(m_S.coeff(i + 1, i))))
return;
364 Index j = findSmallDiagEntry(i, i + 1);
375 const Matrix2s blockS = m_S.template block<2, 2>(i, i);
376 const Matrix2s blockT = m_T.template block<2, 2>(i, i).template triangularView<Upper>();
377 const Matrix2s A = blockS / blockS.cwiseAbs().maxCoeff(), B = blockT / blockT.cwiseAbs().maxCoeff();
379 B.cwiseAbs().maxCoeff(&p, &q);
380 const Scalar sigmaA = A(p, q), sigmaB = B(p, q);
381 Matrix2s D = sigmaB * A - sigmaA * B;
384 const Scalar c2 = B(0, 0) * B(1, 1);
385 const Scalar c1 = D(1, 0) * B(0, 1) - D(0, 0) * B(1, 1) - D(1, 1) * B(0, 0);
386 const Scalar c0 = D(0, 0) * D(1, 1) - D(0, 1) * D(1, 0);
387 const Scalar discriminant = c1 * c1 - Scalar(4) * c2 * c0;
388 if (discriminant >= Scalar(0)) {
392 const Scalar root = numext::sqrt(discriminant);
393 const bool c1Negative = c1 < Scalar(0);
394 const Scalar r = Scalar(-0.5) * (c1Negative ? c1 - root : c1 + root);
395 const bool firstIsLarger = (c1Negative == (c2 > Scalar(0))) == (sigmaB > Scalar(0));
399 const bool deflateLarger = (A(0, 0) * B(1, 1) - A(1, 1) * B(0, 0) + A(1, 0) * B(0, 1)) * c2 >= Scalar(0);
400 Scalar w = r, beta = c2;
401 if (!numext::is_exactly_zero(r) && deflateLarger != firstIsLarger) {
406 const Scalar alpha = w + sigmaA * beta;
407 const Matrix2s H = beta * D - w * B;
410 if (H.row(0).cwiseAbs().maxCoeff() >= H.row(1).cwiseAbs().maxCoeff())
411 G.makeGivens(H(0, 1), -H(0, 0));
413 G.makeGivens(H(1, 1), -H(1, 0));
414 m_S.topRows(i + 2).applyOnTheRight(i, i + 1, G);
415 m_T.topRows(i + 2).applyOnTheRight(i, i + 1, G);
416 if (m_computeQZ) m_Z.applyOnTheLeft(i, i + 1, G.adjoint());
418 if (numext::abs(beta) >= numext::abs(alpha))
419 G.makeGivens(m_T.coeff(i, i), m_T.coeff(i + 1, i));
421 G.makeGivens(m_S.coeff(i, i), m_S.coeff(i + 1, i));
422 m_S.rightCols(dim - i).applyOnTheLeft(i, i + 1, G.adjoint());
423 m_T.rightCols(dim - i).applyOnTheLeft(i, i + 1, G.adjoint());
424 if (m_computeQZ) m_Q.applyOnTheRight(i, i + 1, G);
426 m_S.coeffRef(i + 1, i) = Scalar(0.0);
427 m_T.coeffRef(i + 1, i) = Scalar(0.0);
430 pushDownZero(j, i, i + 1);
435template <
typename MatrixType>
436inline void RealQZ<MatrixType>::pushDownZero(Index z, Index f, Index l) {
438 const Index dim = m_S.cols();
439 for (Index zz = z; zz < l; zz++) {
441 Index firstColS = zz > f ? (zz - 1) : zz;
442 G.makeGivens(m_T.coeff(zz, zz + 1), m_T.coeff(zz + 1, zz + 1));
443 m_S.rightCols(dim - firstColS).applyOnTheLeft(zz, zz + 1, G.adjoint());
444 m_T.rightCols(dim - zz).applyOnTheLeft(zz, zz + 1, G.adjoint());
445 m_T.coeffRef(zz + 1, zz + 1) = Scalar(0.0);
447 if (m_computeQZ) m_Q.applyOnTheRight(zz, zz + 1, G);
450 G.makeGivens(m_S.coeff(zz + 1, zz), m_S.coeff(zz + 1, zz - 1));
451 m_S.topRows(zz + 2).applyOnTheRight(zz, zz - 1, G);
452 m_T.topRows(zz + 1).applyOnTheRight(zz, zz - 1, G);
453 m_S.coeffRef(zz + 1, zz - 1) = Scalar(0.0);
455 if (m_computeQZ) m_Z.applyOnTheLeft(zz, zz - 1, G.adjoint());
459 G.makeGivens(m_S.coeff(l, l), m_S.coeff(l, l - 1));
460 m_S.applyOnTheRight(l, l - 1, G);
461 m_T.applyOnTheRight(l, l - 1, G);
462 m_S.coeffRef(l, l - 1) = Scalar(0.0);
464 if (m_computeQZ) m_Z.applyOnTheLeft(l, l - 1, G.adjoint());
468template <
typename MatrixType>
469inline void RealQZ<MatrixType>::step(Index f, Index l, Index iter, internal::inverse_iteration_rng* randomShift) {
470 const Index dim = m_S.cols();
476 const Scalar a11 = m_S.coeff(f + 0, f + 0), a12 = m_S.coeff(f + 0, f + 1), a21 = m_S.coeff(f + 1, f + 0),
477 a22 = m_S.coeff(f + 1, f + 1), a32 = m_S.coeff(f + 2, f + 1), b12 = m_T.coeff(f + 0, f + 1),
478 b11i = Scalar(1.0) / m_T.coeff(f + 0, f + 0), b22i = Scalar(1.0) / m_T.coeff(f + 1, f + 1),
479 a87 = m_S.coeff(l - 1, l - 2), a98 = m_S.coeff(l - 0, l - 1),
480 b77i = Scalar(1.0) / m_T.coeff(l - 2, l - 2), b88i = Scalar(1.0) / m_T.coeff(l - 1, l - 1);
481 Scalar ss = numext::abs(a87 * b77i) + numext::abs(a98 * b88i), lpl = Scalar(1.5) * ss, ll = ss * ss;
482 x = ll + a11 * a11 * b11i * b11i - lpl * a11 * b11i + a12 * a21 * b11i * b22i -
483 a11 * a21 * b12 * b11i * b11i * b22i;
484 y = a11 * a21 * b11i * b11i - lpl * a21 * b11i + a21 * a22 * b11i * b22i - a21 * a21 * b12 * b11i * b11i * b22i;
485 z = a21 * a32 * b11i * b22i;
486 }
else if (iter == 16) {
488 x = m_S.coeff(f, f) / m_T.coeff(f, f) - m_S.coeff(l, l) / m_T.coeff(l, l) +
489 m_S.coeff(l, l - 1) * m_T.coeff(l - 1, l) / (m_T.coeff(l - 1, l - 1) * m_T.coeff(l, l));
490 y = m_S.coeff(f + 1, f) / m_T.coeff(f, f);
492 }
else if (randomShift) {
494 x = Scalar(randomShift->next<
double>());
495 y = Scalar(randomShift->next<
double>());
496 z = Scalar(randomShift->next<
double>());
504 const Scalar a11 = m_S.coeff(f, f), a12 = m_S.coeff(f, f + 1), a21 = m_S.coeff(f + 1, f),
505 a22 = m_S.coeff(f + 1, f + 1), a32 = m_S.coeff(f + 2, f + 1),
507 a88 = m_S.coeff(l - 1, l - 1), a89 = m_S.coeff(l - 1, l), a98 = m_S.coeff(l, l - 1),
508 a99 = m_S.coeff(l, l),
510 b11 = m_T.coeff(f, f), b12 = m_T.coeff(f, f + 1), b22 = m_T.coeff(f + 1, f + 1),
512 b88 = m_T.coeff(l - 1, l - 1), b89 = m_T.coeff(l - 1, l), b99 = m_T.coeff(l, l);
514 x = ((a88 / b88 - a11 / b11) * (a99 / b99 - a11 / b11) - (a89 / b99) * (a98 / b88) +
515 (a98 / b88) * (b89 / b99) * (a11 / b11)) *
517 a12 / b22 - (a11 / b11) * (b12 / b22);
518 y = (a22 / b22 - a11 / b11) - (a21 / b11) * (b12 / b22) - (a88 / b88 - a11 / b11) - (a99 / b99 - a11 / b11) +
519 (a98 / b88) * (b89 / b99);
523 if (!(numext::isfinite)(x)) {
524 const Scalar scale = a21 / b11;
525 x = (a88 / b88 - a11 / b11) * (a99 / b99 - a11 / b11) - (a89 / b99) * (a98 / b88) +
526 (a98 / b88) * (b89 / b99) * (a11 / b11) + (a12 / b22 - (a11 / b11) * (b12 / b22)) * scale;
534 for (Index k = f; k <= l - 2; k++) {
539 Vector3s hr(x, y, z);
542 hr.makeHouseholderInPlace(tau, beta);
543 essential2 = hr.template bottomRows<2>();
544 Index fc = (std::max)(k - 1, Index(0));
545 m_S.template middleRows<3>(k).rightCols(dim - fc).applyHouseholderOnTheLeft(essential2, tau, m_workspace.data());
546 m_T.template middleRows<3>(k).rightCols(dim - fc).applyHouseholderOnTheLeft(essential2, tau, m_workspace.data());
547 if (m_computeQZ) m_Q.template middleCols<3>(k).applyHouseholderOnTheRight(essential2, tau, m_workspace.data());
548 if (k > f) m_S.coeffRef(k + 2, k - 1) = m_S.coeffRef(k + 1, k - 1) = Scalar(0.0);
551 hr << m_T.coeff(k + 2, k + 2), m_T.coeff(k + 2, k), m_T.coeff(k + 2, k + 1);
552 hr.makeHouseholderInPlace(tau, beta);
553 essential2 = hr.template bottomRows<2>();
555 Index lr = (std::min)(k + 4, dim);
558 tmp.noalias() = m_S.template middleCols<2>(k).topRows(lr) * essential2;
559 tmp += m_S.col(k + 2).head(lr);
560 m_S.col(k + 2).head(lr) -= tau * tmp;
561 m_S.template middleCols<2>(k).topRows(lr).noalias() -= (tau * tmp) * essential2.adjoint();
563 tmp.noalias() = m_T.template middleCols<2>(k).topRows(lr) * essential2;
564 tmp += m_T.col(k + 2).head(lr);
565 m_T.col(k + 2).head(lr) -= tau * tmp;
566 m_T.template middleCols<2>(k).topRows(lr).noalias() -= (tau * tmp) * essential2.adjoint();
571 tmp.noalias() = essential2.adjoint() * (m_Z.template middleRows<2>(k));
572 tmp += m_Z.row(k + 2);
573 m_Z.row(k + 2) -= tau * tmp;
574 m_Z.template middleRows<2>(k).noalias() -= essential2 * (tau * tmp);
576 m_T.coeffRef(k + 2, k) = m_T.coeffRef(k + 2, k + 1) = Scalar(0.0);
579 G.makeGivens(m_T.coeff(k + 1, k + 1), m_T.coeff(k + 1, k));
580 m_S.applyOnTheRight(k + 1, k, G);
581 m_T.applyOnTheRight(k + 1, k, G);
583 if (m_computeQZ) m_Z.applyOnTheLeft(k + 1, k, G.adjoint());
584 m_T.coeffRef(k + 1, k) = Scalar(0.0);
587 x = m_S.coeff(k + 1, k);
588 y = m_S.coeff(k + 2, k);
589 if (k < l - 2) z = m_S.coeff(k + 3, k);
594 m_S.applyOnTheLeft(l - 1, l, G.adjoint());
595 m_T.applyOnTheLeft(l - 1, l, G.adjoint());
596 if (m_computeQZ) m_Q.applyOnTheRight(l - 1, l, G);
597 m_S.coeffRef(l, l - 2) = Scalar(0.0);
600 G.makeGivens(m_T.coeff(l, l), m_T.coeff(l, l - 1));
601 m_S.applyOnTheRight(l, l - 1, G);
602 m_T.applyOnTheRight(l, l - 1, G);
603 if (m_computeQZ) m_Z.applyOnTheLeft(l, l - 1, G.adjoint());
604 m_T.coeffRef(l, l - 1) = Scalar(0.0);
607template <
typename MatrixType>
608template <
typename InputTypeA,
typename InputTypeB>
611 EIGEN_INTERNAL_ASSERT_SQUARE_MSG(A_in,
"Need square matrices of the same dimension");
612 EIGEN_INTERNAL_ASSERT_SAME_SHAPE_MSG(A_in, B_in,
"Need square matrices of the same dimension");
613 m_S = A_in.derived();
614 m_T = B_in.derived();
615 return computeInPlace(computeQZ);
619template <
typename MatrixType>
621 const Index dim = m_S.cols();
623 EIGEN_INTERNAL_ASSERT_SQUARE_MSG(m_S,
"Need square matrices of the same dimension");
624 EIGEN_INTERNAL_ASSERT_SAME_SHAPE_MSG(m_S, m_T,
"Need square matrices of the same dimension");
626 m_isInitialized =
true;
627 m_computeQZ = computeQZ;
628 m_workspace.resize(dim * 2);
633 using Scaling = internal::safe_scaling<Scalar>;
635 dim == 0 ? Scalar(0) : Scaling::recover_flushed_max_coeff(m_S, m_S.cwiseAbs().template maxCoeff<
PropagateNaN>());
637 dim == 0 ? Scalar(0) : Scaling::recover_flushed_max_coeff(m_T, m_T.cwiseAbs().template maxCoeff<
PropagateNaN>());
638 const internal::safe_scaling_factors<Scalar> factorsS = Scaling::scale_in_place(m_S, maxS);
639 const internal::safe_scaling_factors<Scalar> factorsT = Scaling::scale_in_place(m_T, maxT);
642 hessenbergTriangular();
646 Index l = dim - 1, f, local_iter = 0;
651 internal::inverse_iteration_rng shiftRng(1);
652 Scalar bottomAfterTry = NumTraits<Scalar>::highest();
655 f = findSmallSubdiagEntry(l);
657 if (f > 0) m_S.coeffRef(f, f - 1) = Scalar(0.0);
662 }
else if (f == l - 1)
671 if (local_iter >= m_maxIters)
break;
672 const Scalar bottom = numext::mini(numext::abs(m_S.coeff(l, l - 1)), numext::abs(m_S.coeff(l - 1, l - 2)));
673 const bool stagnating = local_iter >= 24 && local_iter % 8 == 0 && !(bottom < bottomAfterTry / Scalar(16));
674 if (local_iter % 8 == 1) bottomAfterTry = bottom;
676 Index z = findSmallDiagEntry(f, l);
679 pushDownZero(z, f, l);
684 step(f, l, local_iter, stagnating ? &shiftRng :
nullptr);
699 for (Index i = 0; i < dim - 1; ++i) {
700 if (!numext::is_exactly_zero(m_S.coeff(i + 1, i))) {
702 internal::real_2x2_jacobi_svd(m_T, i, i + 1, &j_left, &j_right);
705 m_S.applyOnTheLeft(i, i + 1, j_left);
706 m_S.applyOnTheRight(i, i + 1, j_right);
707 m_T.applyOnTheLeft(i, i + 1, j_left);
708 m_T.applyOnTheRight(i, i + 1, j_right);
709 m_T(i + 1, i) = m_T(i, i + 1) = Scalar(0);
712 m_Q.applyOnTheRight(i, i + 1, j_left.transpose());
713 m_Z.applyOnTheLeft(i, i + 1, j_right.transpose());
724 m_T.template triangularView<StrictlyLower>().setZero();
726 Scaling::unscale_in_place(m_S, maxS, factorsS);
727 Scaling::unscale_in_place(m_T, maxT, factorsT);
Rotation given by a cosine-sine pair.
Definition Jacobi.h:39
A matrix or vector expression mapping an existing array of data.
Definition Map.h:97
The matrix class, also used for vectors and row-vectors.
Definition Matrix.h:188
Performs a real QZ decomposition of a pair of square matrices.
Definition RealQZ.h:62
RealQZ(EigenBase< InputTypeA > &A, EigenBase< InputTypeB > &B, bool computeQZ=true)
Constructor for inplace decomposition .
Definition RealQZ.h:139
const MatrixType & matrixT() const
Returns matrix S in the QZ decomposition.
Definition RealQZ.h:185
const MatrixType & matrixS() const
Returns matrix S in the QZ decomposition.
Definition RealQZ.h:176
Index iterations() const
Returns number of performed QR-like iterations.
Definition RealQZ.h:213
Eigen::Index Index
Definition RealQZ.h:74
const PlainMatrixType & matrixQ() const
Returns matrix Q in the QZ decomposition.
Definition RealQZ.h:156
ComputationInfo info() const
Reports whether previous computation was successful.
Definition RealQZ.h:206
Matrix< Scalar, RowsAtCompileTime, ColsAtCompileTime, Options, MaxRowsAtCompileTime, MaxColsAtCompileTime > PlainMatrixType
Type of the matrices returned by matrixQ() and matrixZ(): a plain matrix with the shape and storage o...
Definition RealQZ.h:81
const PlainMatrixType & matrixZ() const
Returns matrix Z in the QZ decomposition.
Definition RealQZ.h:166
RealQZ & compute(const EigenBase< InputTypeA > &A, const EigenBase< InputTypeB > &B, bool computeQZ=true)
Computes QZ decomposition of given matrix.
RealQZ(Index size=RowsAtCompileTime==Dynamic ? 1 :RowsAtCompileTime)
Default constructor.
Definition RealQZ.h:95
RealQZ(const EigenBase< InputTypeA > &A, const EigenBase< InputTypeB > &B, bool computeQZ=true)
Constructor; computes real QZ decomposition of given matrices.
Definition RealQZ.h:115
RealQZ & setMaxIterations(Index maxIters)
Definition RealQZ.h:221
HouseholderSequence< VectorsType, CoeffsType > householderSequence(const VectorsType &v, const CoeffsType &h)
Convenience function for constructing a Householder sequence.
Definition HouseholderSequence.h:739
ComputationInfo
Definition Constants.h:455
@ PropagateNaN
Definition Constants.h:343
@ NumericalIssue
Definition Constants.h:459
@ Success
Definition Constants.h:457
@ NoConvergence
Definition Constants.h:461
Definition EigenBase.h:34