Submodule containing the implementation of the QR-invert algorithm. The original problem is written as a standard eigenvalue problem through . This is done using a LU decomposition via LAPACKS's zgbsv. Eventually a call to LAPACK's zgeev routine is done to obtain all eigenvalues and eigenvectors.
Solves the eigenvalue problem by rewriting it to a standard form through inversion of the B-matrix.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(matrix_t), | intent(in) | :: | matrix_A | matrix A |
||
type(matrix_t), | intent(in) | :: | matrix_B | matrix B |
||
type(settings_t), | intent(in) | :: | settings | settings object |
||
complex(kind=dp), | intent(out) | :: | omega(:) | array with eigenvalues |
||
complex(kind=dp), | intent(out) | :: | vr(:,:) | array with right eigenvectors |