smod_qr_cholesky Submodule

Submodule containing the implementation of the QR-cholesky algorithm. Using LAPACKS's zpbtrf and BLAS's zgbtrs, the original problem is written as a standard eigenvalue problem as $$U^{-H}\mathcal{A}U^{-1}\textbf{Y} = \omega\textbf{Y}\ $$ where $\mathcal{B} = U^HU$ is positive definite and $\textbf{Y}=U\textbf{X}$. Eventually a call to LAPACK's zgeev routine is done to obtain all eigenvalues and eigenvectors.

Contents

Module Procedures

qr_cholesky

Module Procedures

module procedure qr_cholesky module module subroutine qr_cholesky(matrix_A, matrix_B, settings, omega, vr) Interface →

Solves the eigenvalue problem by rewriting it to a standard form through splitting of the B-matrix.

Read more…

Arguments

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