Detailed Description

Definition at line 212 of file lalg_adv.F90.

Private Member Functions
subroutine	dlowest_eigensolve (k, n, a, e, v, preserve_mat)
	Computes the k lowest eigenvalues and the eigenvectors of a standard symmetric-definite eigenproblem, of the form Ax=(lambda)x. Here A is assumed to be symmetric. More...

subroutine	zlowest_eigensolve (k, n, a, e, v, preserve_mat)
	Computes the k lowest eigenvalues and the eigenvectors of a standard symmetric-definite eigenproblem, of the form Ax=(lambda)x. Here A is assumed to be symmetric. More...

Member Function/Subroutine Documentation

◆ dlowest_eigensolve()

subroutine lalg_adv_oct_m::lalg_lowest_eigensolve::dlowest_eigensolve	(	integer, intent(in)	k,
		integer, intent(in)	n,
		real(real64), dimension(:,:), intent(inout), contiguous	a,
		real(real64), dimension(:), intent(out), contiguous	e,
		real(real64), dimension(:,:), intent(out), contiguous	v,
		logical, intent(in)	preserve_mat
	)

private

Computes the k lowest eigenvalues and the eigenvectors of a standard symmetric-definite eigenproblem, of the form A*x=(lambda)*x. Here A is assumed to be symmetric.

Parameters

[in]	k	Number of eigenvalues requested
[in]	n	Dimensions of a
[in,out]	a	(n, n)
[out]	e	(n) The first k elements contain the selected eigenvalues in ascending order.
[out]	v	(n, k)
[in]	preserve_mat	If true, the matrix a and b on exit are the same

Definition at line 2714 of file lalg_adv.F90.

◆ zlowest_eigensolve()

subroutine lalg_adv_oct_m::lalg_lowest_eigensolve::zlowest_eigensolve	(	integer, intent(in)	k,
		integer, intent(in)	n,
		complex(real64), dimension(:,:), intent(inout), contiguous	a,
		real(real64), dimension(:), intent(out), contiguous	e,
		complex(real64), dimension(:,:), intent(out), contiguous	v,
		logical, intent(in)	preserve_mat
	)