#include "tlapack/base/utils.hpp"
#include "tlapack/lapack/lahqr.hpp"
#include "tlapack/lapack/multishift_qr.hpp"

Include dependency graph for qr_iteration.hpp:

Classes
struct	tlapack::QRIterationOpts
	Options struct for qr_iteration() More...

Namespaces
namespace	tlapack
	Sort the numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' ).

Enumerations
enum class	tlapack::QRIterationVariant : char { MultiShift = 'M' , DoubleShift = 'D' }
	Variant of the algorithm that performs QR iterations on an upper Hessenberg matrix.

Functions
template<TLAPACK_MATRIX matrix_t, TLAPACK_VECTOR vector_t, enable_if_t< is_complex< type_t< vector_t > >, int > = 0>
int	tlapack::qr_iteration (bool want_t, bool want_z, size_type< matrix_t > ilo, size_type< matrix_t > ihi, matrix_t &A, vector_t &w, matrix_t &Z, QRIterationOpts &opts)
	Computes the eigenvalues and optionally the Schur factorization of an upper Hessenberg matrix.

template<TLAPACK_MATRIX matrix_t, TLAPACK_VECTOR vector_t, TLAPACK_WORKSPACE work_t, enable_if_t< is_complex< type_t< vector_t > >, int > = 0>
int	tlapack::qr_iteration_work (bool want_t, bool want_z, size_type< matrix_t > ilo, size_type< matrix_t > ihi, matrix_t &A, vector_t &w, matrix_t &Z, work_t &work, QRIterationOpts &opts)
	Computes the eigenvalues and optionally the Schur factorization of an upper Hessenberg matrix. Workspace is provided as an argument.

template<class T , TLAPACK_MATRIX matrix_t, TLAPACK_VECTOR vector_t, enable_if_t< is_complex< type_t< vector_t > >, int > = 0>
constexpr WorkInfo	tlapack::qr_iteration_worksize (bool want_t, bool want_z, size_type< matrix_t > ilo, size_type< matrix_t > ihi, const matrix_t &A, const vector_t &w, const matrix_t &Z, const QRIterationOpts &opts={})
	Worspace query of qr_iteration()

Detailed Description

Classes