The eigenvalues, and optionally the right eigenvectors, of a general square matrix, as numpy.linalg.eig.
More...
|
| | eigen_decomposition (const matrix< T > &input, bool vectors=true, bool left=false) |
| | Decomposes input.
|
| |
| | eigen_decomposition (matrix< T > &&input, bool vectors=true, bool left=false) |
| | Decomposes input in its own storage, an expiring matrix's elements taken over: its scaled copy is made in place, one matrix less at the peak.
|
| |
| const vector< std::complex< double > > & | values () const noexcept |
| | The eigenvalues, in the order of the Schur form.
|
| |
| const matrix< std::complex< double > > & | left_vectors () const noexcept |
| | The left eigenvectors as columns, ordered to match values (empty where they were not computed): column j is u with uᴴ A = λ_j uᴴ, of unit norm with its component of largest modulus real, as dgeev's VL; from the same Schur form as the right ones, so that each matches its eigenvalue.
|
| |
| const matrix< std::complex< double > > & | vectors () const &noexcept |
| | The eigenvectors as columns, ordered to match values (empty where they were not computed).
|
| |
| matrix< std::complex< double > > | vectors () && |
| | The eigenvectors, moved out of an expiring decomposition.
|
| |
| bool | real () const noexcept |
| | Whether every eigenvalue is real (a real matrix's whose Schur form has no 2 × 2 block): its vectors are then real too.
|
| |
|
| void | finish (std::complex< double > *row, const std::complex< double > &value, double) const |
| | Normalises the eigenvector row (a row of Vᵀ) of a real matrix's eigenvalue value, as dgeev: a real one to unit norm; a pair's first to unit norm, its largest component real (its second conjugate_second's).
|
| |
| void | conjugate_second (std::complex< double > *row, const std::complex< double > &value, double) const |
| | A real matrix's pair's second eigenvector row (value's imaginary part negative): the first's, the row above, conjugated, once finish has normalised it; nothing for any other.
|
| |
| void | conjugate_second (std::complex< double > *, const std::complex< double > &, const std::complex< double > &) const noexcept |
| | No pairs in a complex matrix's eigenvectors.
|
| |
| void | finish (std::complex< double > *row, const std::complex< double > &, const std::complex< double > &) const |
| | Normalises the eigenvector row of a complex matrix, as zgeev: to unit norm, its largest component real and positive.
|
| |
| matrix< std::complex< double > > | finished (buffer< std::complex< double > > rows, const detail::balancing &balanced, bool left) const |
| | The vectors of the rows rows (each a vector of the balanced matrix) in the input's basis, normalised, as columns: D undone (a right vector times it, a left one, left, over it: B = D⁻¹ Pᵀ A P D), then the exchanges P, each row normalised; then a pair's second row, the first's conjugate. Each row its own, on the threads.
|
| |
template<double_field T>
class numerical::eigen_decomposition< T >
The eigenvalues, and optionally the right eigenvectors, of a general square matrix, as numpy.linalg.eig.
T is double or std::complex<double>; the eigenvalues and vectors are complex either way (real says whether a real matrix's are all real). Column j of vectors is the eigenvector of values [j], A V = V Λ, each of unit norm with its component of largest modulus real.
Definition at line 3112 of file eigen.hpp.
The vectors of the rows rows (each a vector of the balanced matrix) in the input's basis, normalised, as columns: D undone (a right vector times it, a left one, left, over it: B = D⁻¹ Pᵀ A P D), then the exchanges P, each row normalised; then a pair's second row, the first's conjugate. Each row its own, on the threads.
Definition at line 3327 of file eigen.hpp.