claqz2()

recursive subroutine claqz2	(	logical, intent(in)	ilschur,
		logical, intent(in)	ilq,
		logical, intent(in)	ilz,
		integer, intent(in)	n,
		integer, intent(in)	ilo,
		integer, intent(in)	ihi,
		integer, intent(in)	nw,
		complex, dimension( lda, * ), intent(inout)	a,
		integer, intent(in)	lda,
		complex, dimension( ldb, * ), intent(inout)	b,
		integer, intent(in)	ldb,
		complex, dimension( ldq, * ), intent(inout)	q,
		integer, intent(in)	ldq,
		complex, dimension( ldz, * ), intent(inout)	z,
		integer, intent(in)	ldz,
		integer, intent(out)	ns,
		integer, intent(out)	nd,
		complex, dimension( * ), intent(inout)	alpha,
		complex, dimension( * ), intent(inout)	beta,
		complex, dimension( ldqc, * )	qc,
		integer, intent(in)	ldqc,
		complex, dimension( ldzc, * )	zc,
		integer, intent(in)	ldzc,
		complex, dimension( * )	work,
		integer, intent(in)	lwork,
		real, dimension( * )	rwork,
		integer, intent(in)	rec,
		integer, intent(out)	info )

CLAQZ2

Download CLAQZ2 + dependencies [TGZ] [ZIP] [TXT]

Purpose:

!>
!> CLAQZ2 performs AED
!> 

Parameters

[in]	ILSCHUR	!> ILSCHUR is LOGICAL !> Determines whether or not to update the full Schur form !>
[in]	ILQ	!> ILQ is LOGICAL !> Determines whether or not to update the matrix Q !>
[in]	ILZ	!> ILZ is LOGICAL !> Determines whether or not to update the matrix Z !>
[in]	N	!> N is INTEGER !> The order of the matrices A, B, Q, and Z. N >= 0. !>
[in]	ILO	!> ILO is INTEGER !>
[in]	IHI	!> IHI is INTEGER !> ILO and IHI mark the rows and columns of (A,B) which !> are to be normalized !>
[in]	NW	!> NW is INTEGER !> The desired size of the deflation window. !>
[in,out]	A	!> A is COMPLEX array, dimension (LDA, N) !>
[in]	LDA	!> LDA is INTEGER !> The leading dimension of the array A. LDA >= max( 1, N ). !>
[in,out]	B	!> B is COMPLEX array, dimension (LDB, N) !>
[in]	LDB	!> LDB is INTEGER !> The leading dimension of the array B. LDB >= max( 1, N ). !>
[in,out]	Q	!> Q is COMPLEX array, dimension (LDQ, N) !>
[in]	LDQ	!> LDQ is INTEGER !>
[in,out]	Z	!> Z is COMPLEX array, dimension (LDZ, N) !>
[in]	LDZ	!> LDZ is INTEGER !>
[out]	NS	!> NS is INTEGER !> The number of unconverged eigenvalues available to !> use as shifts. !>
[out]	ND	!> ND is INTEGER !> The number of converged eigenvalues found. !>
[out]	ALPHA	!> ALPHA is COMPLEX array, dimension (N) !> Each scalar alpha defining an eigenvalue !> of GNEP. !>
[out]	BETA	!> BETA is COMPLEX array, dimension (N) !> The scalars beta that define the eigenvalues of GNEP. !> Together, the quantities alpha = ALPHA(j) and !> beta = BETA(j) represent the j-th eigenvalue of the matrix !> pair (A,B), in one of the forms lambda = alpha/beta or !> mu = beta/alpha. Since either lambda or mu may overflow, !> they should not, in general, be computed. !>
[in,out]	QC	!> QC is COMPLEX array, dimension (LDQC, NW) !>
[in]	LDQC	!> LDQC is INTEGER !>
[in,out]	ZC	!> ZC is COMPLEX array, dimension (LDZC, NW) !>
[in]	LDZC	!> LDZ is INTEGER !>
[out]	WORK	!> WORK is COMPLEX array, dimension (MAX(1,LWORK)) !> On exit, if INFO >= 0, WORK(1) returns the optimal LWORK. !>
[in]	LWORK	!> LWORK is INTEGER !> The dimension of the array WORK. LWORK >= max(1,N). !> !> If LWORK = -1, then a workspace query is assumed; the routine !> only calculates the optimal size of the WORK array, returns !> this value as the first entry of the WORK array, and no error !> message related to LWORK is issued by XERBLA. !>
[out]	RWORK	!> RWORK is REAL array, dimension (N) !>
[in]	REC	!> REC is INTEGER !> REC indicates the current recursion level. Should be set !> to 0 on first call. !>
[out]	INFO	!> INFO is INTEGER !> = 0: successful exit !> < 0: if INFO = -i, the i-th argument had an illegal value !>

Author

Thijs Steel, KU Leuven, KU Leuven

Date

May 2020