SRC/dlaqz3.f(3)

πŸŽ€ NAME πŸŽ€

SRC/dlaqz3.f β€” that's the file, bestie, and this page lives in the Library Functions Manual.


✨ SYNOPSIS ✨

Functions/Subroutines

recursive subroutine dlaqz3 (ilschur, ilq, ilz, n, ilo, ihi, nw, a, lda,
    b, ldb, q, ldq, z, ldz, ns, nd, alphar, alphai, beta, qc, ldqc, zc,
    ldzc, work, lwork, rec, info)
    DLAQZ3

🧚 Function/Subroutine Documentation 🌸

Here's the full signature, character-for-character:

recursive subroutine dlaqz3 (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, double
    precision, dimension( lda, * ), intent(inout) a, integer, intent(in)
    lda, double precision, dimension( ldb, * ), intent(inout) b, integer,
    intent(in) ldb, double precision, dimension( ldq, * ), intent(inout) q,
    integer, intent(in) ldq, double precision, dimension( ldz, * ),
    intent(inout) z, integer, intent(in) ldz, integer, intent(out) ns,
    integer, intent(out) nd, double precision, dimension( * ), intent(inout)
    alphar, double precision, dimension( * ), intent(inout) alphai, double
    precision, dimension( * ), intent(inout) beta, double precision,
    dimension( ldqc, * ) qc, integer, intent(in) ldqc, double precision,
    dimension( ldzc, * ) zc, integer, intent(in) ldzc, double precision,
    dimension( * ) work, integer, intent(in) lwork, integer, intent(in) rec,
    integer, intent(out) info)
    DLAQZ3

✨ Purpose ✨

!>
!> DLAQZ3 performs AED
!>

πŸ’… Parameters πŸ’…

  • ILSCHUR β€” LOGICAL, intent(in). It decides whether or not the full Schur form gets updated.
  • ILQ β€” LOGICAL, intent(in). It decides whether or not matrix Q gets updated.
  • ILZ β€” LOGICAL, intent(in). It decides whether or not matrix Z gets updated.
  • N β€” INTEGER, intent(in). The order of matrices A, B, Q, and Z. N >= 0.
  • ILO β€” INTEGER, intent(in). No extra note on this one in the original.
  • IHI β€” INTEGER, intent(in). ILO and IHI mark the rows and columns of (A,B) which are to be normalized.
  • NW β€” INTEGER, intent(in). The desired size of the deflation window.
  • A β€” DOUBLE PRECISION array, dimension (LDA, N), intent(inout).
  • LDA β€” INTEGER, intent(in). The leading dimension of the array A. LDA >= max( 1, N ).
  • B β€” DOUBLE PRECISION array, dimension (LDB, N), intent(inout).
  • LDB β€” INTEGER, intent(in). The leading dimension of the array B. LDB >= max( 1, N ).
  • Q β€” DOUBLE PRECISION array, dimension (LDQ, N), intent(inout).
  • LDQ β€” INTEGER, intent(in). No extra note in the original here.
  • Z β€” DOUBLE PRECISION array, dimension (LDZ, N), intent(inout).
  • LDZ β€” INTEGER, intent(in). No extra note in the original here.
  • NS β€” INTEGER, intent(out). The number of unconverged eigenvalues available to use as shifts.
  • ND β€” INTEGER, intent(out). The number of converged eigenvalues found.
  • ALPHAR β€” DOUBLE PRECISION array, dimension (N), intent(inout). The real parts of each scalar alpha defining an eigenvalue of GNEP.
  • ALPHAI β€” DOUBLE PRECISION array, dimension (N), intent(inout). The imaginary parts of each scalar alpha defining an eigenvalue of GNEP. If ALPHAI(j) is zero, then the j-th eigenvalue is real; if positive, then the j-th and (j+1)-st eigenvalues are a complex conjugate pair, with ALPHAI(j+1) = -ALPHAI(j).
  • BETA β€” DOUBLE PRECISION array, dimension (N), intent(inout). The scalars beta that define the eigenvalues of GNEP. Together, the quantities alpha = (ALPHAR(j),ALPHAI(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.
  • QC β€” DOUBLE PRECISION array, dimension (LDQC, NW).
  • LDQC β€” INTEGER, intent(in).
  • ZC β€” DOUBLE PRECISION array, dimension (LDZC, NW).
  • LDZC β€” INTEGER, intent(in). Heads up: the original also literally includes the line LDZ is INTEGER right here β€” yes, LDZ, not LDZC β€” and I'm keeping it exactly as written.
  • WORK β€” DOUBLE PRECISION array, dimension (MAX(1,LWORK)). On exit, if INFO >= 0, WORK(1) returns the optimal LWORK.
  • LWORK β€” INTEGER, intent(in). 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.
  • REC β€” INTEGER, intent(in). REC indicates the current recursion level. Should be set to 0 on first call.
  • INFO β€” INTEGER, intent(out). = 0: successful exit. < 0: if INFO = -i, the i-th argument had an illegal value.

πŸ‘‘ Author πŸ‘‘

Thijs Steel, KU Leuven. Absolute icon behavior.

πŸ¦‹ Date πŸ¦‹

May 2020.

Definition at line 235 of file dlaqz3.f.

πŸ€– Author πŸ€–

Generated automatically by Doxygen for LAPACK from the source code.


That's the whole page, bestie. This beauty is LAPACK Version 3.12.0, from SRC/dlaqz3.f(3), dated May 2020. πŸ’–βœ¨πŸŽ€

πŸ“¦ where this page comes from