You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

zggev3.f 18 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560
  1. *> \brief <b> ZGGEV3 computes the eigenvalues and, optionally, the left and/or right eigenvectors for GE matrices (blocked algorithm)</b>
  2. *
  3. * =========== DOCUMENTATION ===========
  4. *
  5. * Online html documentation available at
  6. * http://www.netlib.org/lapack/explore-html/
  7. *
  8. *> \htmlonly
  9. *> Download ZGGEV3 + dependencies
  10. *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zggev3.f">
  11. *> [TGZ]</a>
  12. *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zggev3.f">
  13. *> [ZIP]</a>
  14. *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zggev3.f">
  15. *> [TXT]</a>
  16. *> \endhtmlonly
  17. *
  18. * Definition:
  19. * ===========
  20. *
  21. * SUBROUTINE ZGGEV3( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHA, BETA,
  22. * VL, LDVL, VR, LDVR, WORK, LWORK, RWORK, INFO )
  23. *
  24. * .. Scalar Arguments ..
  25. * CHARACTER JOBVL, JOBVR
  26. * INTEGER INFO, LDA, LDB, LDVL, LDVR, LWORK, N
  27. * ..
  28. * .. Array Arguments ..
  29. * DOUBLE PRECISION RWORK( * )
  30. * COMPLEX*16 A( LDA, * ), ALPHA( * ), B( LDB, * ),
  31. * $ BETA( * ), VL( LDVL, * ), VR( LDVR, * ),
  32. * $ WORK( * )
  33. * ..
  34. *
  35. *
  36. *> \par Purpose:
  37. * =============
  38. *>
  39. *> \verbatim
  40. *>
  41. *> ZGGEV3 computes for a pair of N-by-N complex nonsymmetric matrices
  42. *> (A,B), the generalized eigenvalues, and optionally, the left and/or
  43. *> right generalized eigenvectors.
  44. *>
  45. *> A generalized eigenvalue for a pair of matrices (A,B) is a scalar
  46. *> lambda or a ratio alpha/beta = lambda, such that A - lambda*B is
  47. *> singular. It is usually represented as the pair (alpha,beta), as
  48. *> there is a reasonable interpretation for beta=0, and even for both
  49. *> being zero.
  50. *>
  51. *> The right generalized eigenvector v(j) corresponding to the
  52. *> generalized eigenvalue lambda(j) of (A,B) satisfies
  53. *>
  54. *> A * v(j) = lambda(j) * B * v(j).
  55. *>
  56. *> The left generalized eigenvector u(j) corresponding to the
  57. *> generalized eigenvalues lambda(j) of (A,B) satisfies
  58. *>
  59. *> u(j)**H * A = lambda(j) * u(j)**H * B
  60. *>
  61. *> where u(j)**H is the conjugate-transpose of u(j).
  62. *> \endverbatim
  63. *
  64. * Arguments:
  65. * ==========
  66. *
  67. *> \param[in] JOBVL
  68. *> \verbatim
  69. *> JOBVL is CHARACTER*1
  70. *> = 'N': do not compute the left generalized eigenvectors;
  71. *> = 'V': compute the left generalized eigenvectors.
  72. *> \endverbatim
  73. *>
  74. *> \param[in] JOBVR
  75. *> \verbatim
  76. *> JOBVR is CHARACTER*1
  77. *> = 'N': do not compute the right generalized eigenvectors;
  78. *> = 'V': compute the right generalized eigenvectors.
  79. *> \endverbatim
  80. *>
  81. *> \param[in] N
  82. *> \verbatim
  83. *> N is INTEGER
  84. *> The order of the matrices A, B, VL, and VR. N >= 0.
  85. *> \endverbatim
  86. *>
  87. *> \param[in,out] A
  88. *> \verbatim
  89. *> A is COMPLEX*16 array, dimension (LDA, N)
  90. *> On entry, the matrix A in the pair (A,B).
  91. *> On exit, A has been overwritten.
  92. *> \endverbatim
  93. *>
  94. *> \param[in] LDA
  95. *> \verbatim
  96. *> LDA is INTEGER
  97. *> The leading dimension of A. LDA >= max(1,N).
  98. *> \endverbatim
  99. *>
  100. *> \param[in,out] B
  101. *> \verbatim
  102. *> B is COMPLEX*16 array, dimension (LDB, N)
  103. *> On entry, the matrix B in the pair (A,B).
  104. *> On exit, B has been overwritten.
  105. *> \endverbatim
  106. *>
  107. *> \param[in] LDB
  108. *> \verbatim
  109. *> LDB is INTEGER
  110. *> The leading dimension of B. LDB >= max(1,N).
  111. *> \endverbatim
  112. *>
  113. *> \param[out] ALPHA
  114. *> \verbatim
  115. *> ALPHA is COMPLEX*16 array, dimension (N)
  116. *> \endverbatim
  117. *>
  118. *> \param[out] BETA
  119. *> \verbatim
  120. *> BETA is COMPLEX*16 array, dimension (N)
  121. *> On exit, ALPHA(j)/BETA(j), j=1,...,N, will be the
  122. *> generalized eigenvalues.
  123. *>
  124. *> Note: the quotients ALPHA(j)/BETA(j) may easily over- or
  125. *> underflow, and BETA(j) may even be zero. Thus, the user
  126. *> should avoid naively computing the ratio alpha/beta.
  127. *> However, ALPHA will be always less than and usually
  128. *> comparable with norm(A) in magnitude, and BETA always less
  129. *> than and usually comparable with norm(B).
  130. *> \endverbatim
  131. *>
  132. *> \param[out] VL
  133. *> \verbatim
  134. *> VL is COMPLEX*16 array, dimension (LDVL,N)
  135. *> If JOBVL = 'V', the left generalized eigenvectors u(j) are
  136. *> stored one after another in the columns of VL, in the same
  137. *> order as their eigenvalues.
  138. *> Each eigenvector is scaled so the largest component has
  139. *> abs(real part) + abs(imag. part) = 1.
  140. *> Not referenced if JOBVL = 'N'.
  141. *> \endverbatim
  142. *>
  143. *> \param[in] LDVL
  144. *> \verbatim
  145. *> LDVL is INTEGER
  146. *> The leading dimension of the matrix VL. LDVL >= 1, and
  147. *> if JOBVL = 'V', LDVL >= N.
  148. *> \endverbatim
  149. *>
  150. *> \param[out] VR
  151. *> \verbatim
  152. *> VR is COMPLEX*16 array, dimension (LDVR,N)
  153. *> If JOBVR = 'V', the right generalized eigenvectors v(j) are
  154. *> stored one after another in the columns of VR, in the same
  155. *> order as their eigenvalues.
  156. *> Each eigenvector is scaled so the largest component has
  157. *> abs(real part) + abs(imag. part) = 1.
  158. *> Not referenced if JOBVR = 'N'.
  159. *> \endverbatim
  160. *>
  161. *> \param[in] LDVR
  162. *> \verbatim
  163. *> LDVR is INTEGER
  164. *> The leading dimension of the matrix VR. LDVR >= 1, and
  165. *> if JOBVR = 'V', LDVR >= N.
  166. *> \endverbatim
  167. *>
  168. *> \param[out] WORK
  169. *> \verbatim
  170. *> WORK is COMPLEX*16 array, dimension (MAX(1,LWORK))
  171. *> On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
  172. *> \endverbatim
  173. *>
  174. *> \param[in] LWORK
  175. *> \verbatim
  176. *> LWORK is INTEGER
  177. *> The dimension of the array WORK. LWORK >= MAX(1,2*N).
  178. *> For good performance, LWORK must generally be larger.
  179. *>
  180. *> If LWORK = -1, then a workspace query is assumed; the routine
  181. *> only calculates the optimal size of the WORK array, returns
  182. *> this value as the first entry of the WORK array, and no error
  183. *> message related to LWORK is issued by XERBLA.
  184. *> \endverbatim
  185. *>
  186. *> \param[out] RWORK
  187. *> \verbatim
  188. *> RWORK is DOUBLE PRECISION array, dimension (8*N)
  189. *> \endverbatim
  190. *>
  191. *> \param[out] INFO
  192. *> \verbatim
  193. *> INFO is INTEGER
  194. *> = 0: successful exit
  195. *> < 0: if INFO = -i, the i-th argument had an illegal value.
  196. *> =1,...,N:
  197. *> The QZ iteration failed. No eigenvectors have been
  198. *> calculated, but ALPHA(j) and BETA(j) should be
  199. *> correct for j=INFO+1,...,N.
  200. *> > N: =N+1: other then QZ iteration failed in ZHGEQZ,
  201. *> =N+2: error return from ZTGEVC.
  202. *> \endverbatim
  203. *
  204. * Authors:
  205. * ========
  206. *
  207. *> \author Univ. of Tennessee
  208. *> \author Univ. of California Berkeley
  209. *> \author Univ. of Colorado Denver
  210. *> \author NAG Ltd.
  211. *
  212. *> \ingroup ggev3
  213. *
  214. * =====================================================================
  215. SUBROUTINE ZGGEV3( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHA, BETA,
  216. $ VL, LDVL, VR, LDVR, WORK, LWORK, RWORK, INFO )
  217. *
  218. * -- LAPACK driver routine --
  219. * -- LAPACK is a software package provided by Univ. of Tennessee, --
  220. * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
  221. *
  222. * .. Scalar Arguments ..
  223. CHARACTER JOBVL, JOBVR
  224. INTEGER INFO, LDA, LDB, LDVL, LDVR, LWORK, N
  225. * ..
  226. * .. Array Arguments ..
  227. DOUBLE PRECISION RWORK( * )
  228. COMPLEX*16 A( LDA, * ), ALPHA( * ), B( LDB, * ),
  229. $ BETA( * ), VL( LDVL, * ), VR( LDVR, * ),
  230. $ WORK( * )
  231. * ..
  232. *
  233. * =====================================================================
  234. *
  235. * .. Parameters ..
  236. DOUBLE PRECISION ZERO, ONE
  237. PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 )
  238. COMPLEX*16 CZERO, CONE
  239. PARAMETER ( CZERO = ( 0.0D0, 0.0D0 ),
  240. $ CONE = ( 1.0D0, 0.0D0 ) )
  241. * ..
  242. * .. Local Scalars ..
  243. LOGICAL ILASCL, ILBSCL, ILV, ILVL, ILVR, LQUERY
  244. CHARACTER CHTEMP
  245. INTEGER ICOLS, IERR, IHI, IJOBVL, IJOBVR, ILEFT, ILO,
  246. $ IN, IRIGHT, IROWS, IRWRK, ITAU, IWRK, JC, JR,
  247. $ LWKMIN, LWKOPT
  248. DOUBLE PRECISION ANRM, ANRMTO, BIGNUM, BNRM, BNRMTO, EPS,
  249. $ SMLNUM, TEMP
  250. COMPLEX*16 X
  251. * ..
  252. * .. Local Arrays ..
  253. LOGICAL LDUMMA( 1 )
  254. * ..
  255. * .. External Subroutines ..
  256. EXTERNAL XERBLA, ZGEQRF, ZGGBAK, ZGGBAL, ZGGHD3, ZLAQZ0,
  257. $ ZLACPY, ZLASCL, ZLASET, ZTGEVC, ZUNGQR, ZUNMQR
  258. * ..
  259. * .. External Functions ..
  260. LOGICAL LSAME
  261. DOUBLE PRECISION DLAMCH, ZLANGE
  262. EXTERNAL LSAME, DLAMCH, ZLANGE
  263. * ..
  264. * .. Intrinsic Functions ..
  265. INTRINSIC ABS, DBLE, DIMAG, MAX, SQRT
  266. * ..
  267. * .. Statement Functions ..
  268. DOUBLE PRECISION ABS1
  269. * ..
  270. * .. Statement Function definitions ..
  271. ABS1( X ) = ABS( DBLE( X ) ) + ABS( DIMAG( X ) )
  272. * ..
  273. * .. Executable Statements ..
  274. *
  275. * Decode the input arguments
  276. *
  277. IF( LSAME( JOBVL, 'N' ) ) THEN
  278. IJOBVL = 1
  279. ILVL = .FALSE.
  280. ELSE IF( LSAME( JOBVL, 'V' ) ) THEN
  281. IJOBVL = 2
  282. ILVL = .TRUE.
  283. ELSE
  284. IJOBVL = -1
  285. ILVL = .FALSE.
  286. END IF
  287. *
  288. IF( LSAME( JOBVR, 'N' ) ) THEN
  289. IJOBVR = 1
  290. ILVR = .FALSE.
  291. ELSE IF( LSAME( JOBVR, 'V' ) ) THEN
  292. IJOBVR = 2
  293. ILVR = .TRUE.
  294. ELSE
  295. IJOBVR = -1
  296. ILVR = .FALSE.
  297. END IF
  298. ILV = ILVL .OR. ILVR
  299. *
  300. * Test the input arguments
  301. *
  302. INFO = 0
  303. LQUERY = ( LWORK.EQ.-1 )
  304. LWKMIN = MAX( 1, 2*N )
  305. IF( IJOBVL.LE.0 ) THEN
  306. INFO = -1
  307. ELSE IF( IJOBVR.LE.0 ) THEN
  308. INFO = -2
  309. ELSE IF( N.LT.0 ) THEN
  310. INFO = -3
  311. ELSE IF( LDA.LT.MAX( 1, N ) ) THEN
  312. INFO = -5
  313. ELSE IF( LDB.LT.MAX( 1, N ) ) THEN
  314. INFO = -7
  315. ELSE IF( LDVL.LT.1 .OR. ( ILVL .AND. LDVL.LT.N ) ) THEN
  316. INFO = -11
  317. ELSE IF( LDVR.LT.1 .OR. ( ILVR .AND. LDVR.LT.N ) ) THEN
  318. INFO = -13
  319. ELSE IF( LWORK.LT.LWKMIN .AND. .NOT.LQUERY ) THEN
  320. INFO = -15
  321. END IF
  322. *
  323. * Compute workspace
  324. *
  325. IF( INFO.EQ.0 ) THEN
  326. CALL ZGEQRF( N, N, B, LDB, WORK, WORK, -1, IERR )
  327. LWKOPT = MAX( LWKMIN, N+INT( WORK( 1 ) ) )
  328. CALL ZUNMQR( 'L', 'C', N, N, N, B, LDB, WORK, A, LDA, WORK,
  329. $ -1, IERR )
  330. LWKOPT = MAX( LWKOPT, N+INT( WORK( 1 ) ) )
  331. IF( ILVL ) THEN
  332. CALL ZUNGQR( N, N, N, VL, LDVL, WORK, WORK, -1, IERR )
  333. LWKOPT = MAX( LWKOPT, N+INT( WORK( 1 ) ) )
  334. END IF
  335. IF( ILV ) THEN
  336. CALL ZGGHD3( JOBVL, JOBVR, N, 1, N, A, LDA, B, LDB, VL,
  337. $ LDVL, VR, LDVR, WORK, -1, IERR )
  338. LWKOPT = MAX( LWKOPT, N+INT( WORK( 1 ) ) )
  339. CALL ZLAQZ0( 'S', JOBVL, JOBVR, N, 1, N, A, LDA, B, LDB,
  340. $ ALPHA, BETA, VL, LDVL, VR, LDVR, WORK, -1,
  341. $ RWORK, 0, IERR )
  342. LWKOPT = MAX( LWKOPT, N+INT( WORK( 1 ) ) )
  343. ELSE
  344. CALL ZGGHD3( JOBVL, JOBVR, N, 1, N, A, LDA, B, LDB, VL,
  345. $ LDVL, VR, LDVR, WORK, -1, IERR )
  346. LWKOPT = MAX( LWKOPT, N+INT( WORK( 1 ) ) )
  347. CALL ZLAQZ0( 'E', JOBVL, JOBVR, N, 1, N, A, LDA, B, LDB,
  348. $ ALPHA, BETA, VL, LDVL, VR, LDVR, WORK, -1,
  349. $ RWORK, 0, IERR )
  350. LWKOPT = MAX( LWKOPT, N+INT( WORK( 1 ) ) )
  351. END IF
  352. IF( N.EQ.0 ) THEN
  353. WORK( 1 ) = 1
  354. ELSE
  355. WORK( 1 ) = DCMPLX( LWKOPT )
  356. END IF
  357. END IF
  358. *
  359. IF( INFO.NE.0 ) THEN
  360. CALL XERBLA( 'ZGGEV3 ', -INFO )
  361. RETURN
  362. ELSE IF( LQUERY ) THEN
  363. RETURN
  364. END IF
  365. *
  366. * Quick return if possible
  367. *
  368. IF( N.EQ.0 )
  369. $ RETURN
  370. *
  371. * Get machine constants
  372. *
  373. EPS = DLAMCH( 'E' )*DLAMCH( 'B' )
  374. SMLNUM = DLAMCH( 'S' )
  375. BIGNUM = ONE / SMLNUM
  376. SMLNUM = SQRT( SMLNUM ) / EPS
  377. BIGNUM = ONE / SMLNUM
  378. *
  379. * Scale A if max element outside range [SMLNUM,BIGNUM]
  380. *
  381. ANRM = ZLANGE( 'M', N, N, A, LDA, RWORK )
  382. ILASCL = .FALSE.
  383. IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN
  384. ANRMTO = SMLNUM
  385. ILASCL = .TRUE.
  386. ELSE IF( ANRM.GT.BIGNUM ) THEN
  387. ANRMTO = BIGNUM
  388. ILASCL = .TRUE.
  389. END IF
  390. IF( ILASCL )
  391. $ CALL ZLASCL( 'G', 0, 0, ANRM, ANRMTO, N, N, A, LDA, IERR )
  392. *
  393. * Scale B if max element outside range [SMLNUM,BIGNUM]
  394. *
  395. BNRM = ZLANGE( 'M', N, N, B, LDB, RWORK )
  396. ILBSCL = .FALSE.
  397. IF( BNRM.GT.ZERO .AND. BNRM.LT.SMLNUM ) THEN
  398. BNRMTO = SMLNUM
  399. ILBSCL = .TRUE.
  400. ELSE IF( BNRM.GT.BIGNUM ) THEN
  401. BNRMTO = BIGNUM
  402. ILBSCL = .TRUE.
  403. END IF
  404. IF( ILBSCL )
  405. $ CALL ZLASCL( 'G', 0, 0, BNRM, BNRMTO, N, N, B, LDB, IERR )
  406. *
  407. * Permute the matrices A, B to isolate eigenvalues if possible
  408. *
  409. ILEFT = 1
  410. IRIGHT = N + 1
  411. IRWRK = IRIGHT + N
  412. CALL ZGGBAL( 'P', N, A, LDA, B, LDB, ILO, IHI, RWORK( ILEFT ),
  413. $ RWORK( IRIGHT ), RWORK( IRWRK ), IERR )
  414. *
  415. * Reduce B to triangular form (QR decomposition of B)
  416. *
  417. IROWS = IHI + 1 - ILO
  418. IF( ILV ) THEN
  419. ICOLS = N + 1 - ILO
  420. ELSE
  421. ICOLS = IROWS
  422. END IF
  423. ITAU = 1
  424. IWRK = ITAU + IROWS
  425. CALL ZGEQRF( IROWS, ICOLS, B( ILO, ILO ), LDB, WORK( ITAU ),
  426. $ WORK( IWRK ), LWORK+1-IWRK, IERR )
  427. *
  428. * Apply the orthogonal transformation to matrix A
  429. *
  430. CALL ZUNMQR( 'L', 'C', IROWS, ICOLS, IROWS, B( ILO, ILO ), LDB,
  431. $ WORK( ITAU ), A( ILO, ILO ), LDA, WORK( IWRK ),
  432. $ LWORK+1-IWRK, IERR )
  433. *
  434. * Initialize VL
  435. *
  436. IF( ILVL ) THEN
  437. CALL ZLASET( 'Full', N, N, CZERO, CONE, VL, LDVL )
  438. IF( IROWS.GT.1 ) THEN
  439. CALL ZLACPY( 'L', IROWS-1, IROWS-1, B( ILO+1, ILO ), LDB,
  440. $ VL( ILO+1, ILO ), LDVL )
  441. END IF
  442. CALL ZUNGQR( IROWS, IROWS, IROWS, VL( ILO, ILO ), LDVL,
  443. $ WORK( ITAU ), WORK( IWRK ), LWORK+1-IWRK, IERR )
  444. END IF
  445. *
  446. * Initialize VR
  447. *
  448. IF( ILVR )
  449. $ CALL ZLASET( 'Full', N, N, CZERO, CONE, VR, LDVR )
  450. *
  451. * Reduce to generalized Hessenberg form
  452. *
  453. IF( ILV ) THEN
  454. *
  455. * Eigenvectors requested -- work on whole matrix.
  456. *
  457. CALL ZGGHD3( JOBVL, JOBVR, N, ILO, IHI, A, LDA, B, LDB, VL,
  458. $ LDVL, VR, LDVR, WORK( IWRK ), LWORK+1-IWRK, IERR )
  459. ELSE
  460. CALL ZGGHD3( 'N', 'N', IROWS, 1, IROWS, A( ILO, ILO ), LDA,
  461. $ B( ILO, ILO ), LDB, VL, LDVL, VR, LDVR,
  462. $ WORK( IWRK ), LWORK+1-IWRK, IERR )
  463. END IF
  464. *
  465. * Perform QZ algorithm (Compute eigenvalues, and optionally, the
  466. * Schur form and Schur vectors)
  467. *
  468. IWRK = ITAU
  469. IF( ILV ) THEN
  470. CHTEMP = 'S'
  471. ELSE
  472. CHTEMP = 'E'
  473. END IF
  474. CALL ZLAQZ0( CHTEMP, JOBVL, JOBVR, N, ILO, IHI, A, LDA, B, LDB,
  475. $ ALPHA, BETA, VL, LDVL, VR, LDVR, WORK( IWRK ),
  476. $ LWORK+1-IWRK, RWORK( IRWRK ), 0, IERR )
  477. IF( IERR.NE.0 ) THEN
  478. IF( IERR.GT.0 .AND. IERR.LE.N ) THEN
  479. INFO = IERR
  480. ELSE IF( IERR.GT.N .AND. IERR.LE.2*N ) THEN
  481. INFO = IERR - N
  482. ELSE
  483. INFO = N + 1
  484. END IF
  485. GO TO 70
  486. END IF
  487. *
  488. * Compute Eigenvectors
  489. *
  490. IF( ILV ) THEN
  491. IF( ILVL ) THEN
  492. IF( ILVR ) THEN
  493. CHTEMP = 'B'
  494. ELSE
  495. CHTEMP = 'L'
  496. END IF
  497. ELSE
  498. CHTEMP = 'R'
  499. END IF
  500. *
  501. CALL ZTGEVC( CHTEMP, 'B', LDUMMA, N, A, LDA, B, LDB, VL, LDVL,
  502. $ VR, LDVR, N, IN, WORK( IWRK ), RWORK( IRWRK ),
  503. $ IERR )
  504. IF( IERR.NE.0 ) THEN
  505. INFO = N + 2
  506. GO TO 70
  507. END IF
  508. *
  509. * Undo balancing on VL and VR and normalization
  510. *
  511. IF( ILVL ) THEN
  512. CALL ZGGBAK( 'P', 'L', N, ILO, IHI, RWORK( ILEFT ),
  513. $ RWORK( IRIGHT ), N, VL, LDVL, IERR )
  514. DO 30 JC = 1, N
  515. TEMP = ZERO
  516. DO 10 JR = 1, N
  517. TEMP = MAX( TEMP, ABS1( VL( JR, JC ) ) )
  518. 10 CONTINUE
  519. IF( TEMP.LT.SMLNUM )
  520. $ GO TO 30
  521. TEMP = ONE / TEMP
  522. DO 20 JR = 1, N
  523. VL( JR, JC ) = VL( JR, JC )*TEMP
  524. 20 CONTINUE
  525. 30 CONTINUE
  526. END IF
  527. IF( ILVR ) THEN
  528. CALL ZGGBAK( 'P', 'R', N, ILO, IHI, RWORK( ILEFT ),
  529. $ RWORK( IRIGHT ), N, VR, LDVR, IERR )
  530. DO 60 JC = 1, N
  531. TEMP = ZERO
  532. DO 40 JR = 1, N
  533. TEMP = MAX( TEMP, ABS1( VR( JR, JC ) ) )
  534. 40 CONTINUE
  535. IF( TEMP.LT.SMLNUM )
  536. $ GO TO 60
  537. TEMP = ONE / TEMP
  538. DO 50 JR = 1, N
  539. VR( JR, JC ) = VR( JR, JC )*TEMP
  540. 50 CONTINUE
  541. 60 CONTINUE
  542. END IF
  543. END IF
  544. *
  545. * Undo scaling if necessary
  546. *
  547. 70 CONTINUE
  548. *
  549. IF( ILASCL )
  550. $ CALL ZLASCL( 'G', 0, 0, ANRMTO, ANRM, N, 1, ALPHA, N, IERR )
  551. *
  552. IF( ILBSCL )
  553. $ CALL ZLASCL( 'G', 0, 0, BNRMTO, BNRM, N, 1, BETA, N, IERR )
  554. *
  555. WORK( 1 ) = DCMPLX( LWKOPT )
  556. RETURN
  557. *
  558. * End of ZGGEV3
  559. *
  560. END