/home/abui...RC/cgeev.f(3)

πŸ“¦ version 3.12.0, in opensuse-leap 16.0

πŸ’… cgeev.f β€” Library Functions Manual

okay bestie, welcome to /home/abui...RC/cgeev.f(3) from the Library Functions Manual. The actual source file for this page is the one below in NAME, and it is giving very serious linear algebra energy. ✨


🌸 NAME

/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/cgeev.f


✨ SYNOPSIS

Functions/Subroutines

subroutine CGEEV (jobvl, jobvr, n, a, lda, w, vl, ldvl, vr, ldvr, work,
    lwork, rwork, info)
     CGEEV computes the eigenvalues and, optionally, the left and/or
    right eigenvectors for GE matrices

🫢 Function/Subroutine Documentation

subroutine CGEEV

subroutine CGEEV (character jobvl, character jobvr, integer n, complex,
    dimension( lda, * ) a, integer lda, complex, dimension( * ) w, complex,
    dimension( ldvl, * ) vl, integer ldvl, complex, dimension( ldvr, * ) vr,
    integer ldvr, complex, dimension( * ) work, integer lwork, real,
    dimension( * ) rwork, integer info)

CGEEV computes the eigenvalues and, optionally, the left and/or right eigenvectors for GE matrices. iconic behavior, honestly. πŸ‘‘

Purpose

okay so CGEEV computes, for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors. πŸ¦‹

The right eigenvector v(j) of A satisfies:

A * v(j) = lambda(j) * v(j)

where lambda(j) is its eigenvalue.

The left eigenvector u(j) of A satisfies:

u(j)**H * A = lambda(j) * u(j)**H

where u(j)**H denotes the conjugate transpose of u(j).

The computed eigenvectors are normalized to have Euclidean norm equal to 1 and largest component real. slay, normalized, and real-largest-component-coded. πŸ’…

Parameters

  • JOBVL β€” JOBVL is CHARACTER*1
    • = 'N': left eigenvectors of A are not computed;
    • = 'V': left eigenvectors of are computed.
  • JOBVR β€” JOBVR is CHARACTER*1
    • = 'N': right eigenvectors of A are not computed;
    • = 'V': right eigenvectors of A are computed.
  • N β€” N is INTEGER
    • The order of the matrix A. N >= 0.
  • A β€” A is COMPLEX array, dimension (LDA,N)
    • On entry, the N-by-N matrix A.
    • On exit, A has been overwritten.
  • LDA β€” LDA is INTEGER
    • The leading dimension of the array A. LDA >= max(1,N).
  • W β€” W is COMPLEX array, dimension (N)
    • W contains the computed eigenvalues.
  • VL β€” VL is COMPLEX array, dimension (LDVL,N)
    • If JOBVL = 'V', the left eigenvectors u(j) are stored one after another in the columns of VL, in the same order as their eigenvalues.
    • If JOBVL = 'N', VL is not referenced.
    • u(j) = VL(:,j), the j-th column of VL.
  • LDVL β€” LDVL is INTEGER
    • The leading dimension of the array VL. LDVL >= 1; if JOBVL = 'V', LDVL >= N.
  • VR β€” VR is COMPLEX array, dimension (LDVR,N)
    • If JOBVR = 'V', the right eigenvectors v(j) are stored one after another in the columns of VR, in the same order as their eigenvalues.
    • If JOBVR = 'N', VR is not referenced.
    • v(j) = VR(:,j), the j-th column of VR.
  • LDVR β€” LDVR is INTEGER
    • The leading dimension of the array VR. LDVR >= 1; if JOBVR = 'V', LDVR >= N.
  • WORK β€” WORK is COMPLEX array, dimension (MAX(1,LWORK))
    • On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
  • LWORK β€” LWORK is INTEGER
    • The dimension of the array WORK. LWORK >= max(1,2*N).
    • For good performance, LWORK must generally be larger.
    • 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.
  • RWORK β€” RWORK is REAL array, dimension (2*N)
  • INFO β€” INFO is INTEGER
    • = 0: successful exit
    • < 0: if INFO = -i, the i-th argument had an illegal value.
    • > 0: if INFO = i, the QR algorithm failed to compute all the eigenvalues, and no eigenvectors have been computed; elements i+1:N of W contain eigenvalues which have converged.

Author

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

Definition at line 178 of file cgeev.f.

Author

Generated automatically by Doxygen for LAPACK from the source code.


and that's the whole page, bestie πŸŽ€πŸ’– The cute little sign-off footer says this is from LAPACK, Version 3.12.0, page /home/abui...RC/cgeev.f(3). πŸ¦‹βœ¨

πŸ“¦ where this page comes from