TESTING/EIG/dsgt01.f(3)

πŸ“¦
version 3.12.1 Β· 3 versions
, in arch rolling

πŸ’– NAME πŸ’–

TESTING/EIG/dsgt01.f β€” okay bestie, you found the page for TESTING/EIG/dsgt01.f(3) in the Library Functions Manual. It’s giving one Fortran file, one subroutine, and a whole lot of eigenproblem energy. The subroutine is dsgt01, and yes, we’re keeping every detail. πŸŽ€


✨ SYNOPSIS ✨

πŸ¦‹ Functions/Subroutines πŸ¦‹

subroutine dsgt01 (itype, uplo, n, m, a, lda, b, ldb, z, ldz, d, work,
    result)
    DSGT01

DSGT01 is literally right there in the synopsis, bestie. πŸ’…


🌸 Function/Subroutine Documentation 🌸

subroutine dsgt01 (integer itype, character uplo, integer n, integer m,
    double precision, dimension( lda, * ) a, integer lda, double precision,
    dimension( ldb, * ) b, integer ldb, double precision, dimension( ldz, *
    ) z, integer ldz, double precision, dimension( * ) d, double precision,
    dimension( * ) work, double precision, dimension( * ) result)

DSGT01

πŸ”₯ Purpose πŸ”₯

Okay so the purpose block says DDGT01 checks a decomposition of the form:

A Z   =  B Z D or
A B Z =  Z D or
B A Z =  Z D

where A is a symmetric matrix, B is symmetric positive definite, Z is orthogonal, and D is diagonal. No cap. 🫢

One of the following test ratios is computed:

ITYPE = 1:  RESULT(1) = | A Z - B Z D | / ( |A| |Z| n ulp )

ITYPE = 2:  RESULT(1) = | A B Z - Z D | / ( |A| |Z| n ulp )

ITYPE = 3:  RESULT(1) = | B A Z - Z D | / ( |A| |Z| n ulp )

🌈 Parameters 🌈

  • ITYPE β€” ITYPE is INTEGER. It’s the form of the symmetric generalized eigenproblem:
= 1:  A*z = (lambda)*B*z
= 2:  A*B*z = (lambda)*z
= 3:  B*A*z = (lambda)*z
  • UPLO β€” UPLO is CHARACTER*1. It specifies whether the upper or lower triangular part of the symmetric matrices A and B is stored. = 'U': Upper triangular, = 'L': Lower triangular.
  • N β€” N is INTEGER. The order of the matrix A. N >= 0.
  • M β€” M is INTEGER. The number of eigenvalues found. 0 <= M <= N.
  • A β€” A is DOUBLE PRECISION array, dimension (LDA, N). The original symmetric matrix A.
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. LDA >= max(1,N).
  • B β€” B is DOUBLE PRECISION array, dimension (LDB, N). The original symmetric positive definite matrix B.
  • LDB β€” LDB is INTEGER. The leading dimension of the array B. LDB >= max(1,N).
  • Z β€” Z is DOUBLE PRECISION array, dimension (LDZ, M). The computed eigenvectors of the generalized eigenproblem.
  • LDZ β€” LDZ is INTEGER. The leading dimension of the array Z. LDZ >= max(1,N).
  • D β€” D is DOUBLE PRECISION array, dimension (M). The computed eigenvalues of the generalized eigenproblem.
  • WORK β€” WORK is DOUBLE PRECISION array, dimension (N*N)
  • RESULT β€” RESULT is DOUBLE PRECISION array, dimension (1). The test ratio as described above.

πŸ‘‘ Author πŸ‘‘

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

Definition at line 144 of file dsgt01.f.


πŸ’« Author πŸ’«

Generated automatically by Doxygen for LAPACK from the source code.


That’s the whole manual page, bestie β€” LAPACK Version 3.12.0, TESTING/EIG/dsgt01.f(3), and all the eigenproblem tea. Slay and stay orthogonal. πŸ’–βœ¨

πŸ“¦ where this page comes from