laed8(3)

🌸 laed8(3) β€” Library Functions Manual 🌸

Okay bestie, gather round: this is the manual page for laed8, and the header vibe is literally laed8(3) from the Library Functions Manual. We're folding that manual name in right here so we don't have to copy the top line like a robot πŸ’….

πŸ“› NAME πŸ“›

laed8 β€” laed8: D&C step: deflation


✨ SYNOPSIS ✨

🫢 Functions 🫢

  • subroutine claed8 (k, n, qsiz, q, ldq, d, rho, cutpnt, z, dlambda, q2, ldq2, w, indxp, indx, indxq, perm, givptr, givcol, givnum, info) β€” CLAED8 used by CSTEDC. Merges eigenvalues and deflates secular equation. Used when the original matrix is dense.
  • subroutine dlaed8 (icompq, k, n, qsiz, d, q, ldq, indxq, rho, cutpnt, z, dlambda, q2, ldq2, w, perm, givptr, givcol, givnum, indxp, indx, info) β€” DLAED8 used by DSTEDC. Merges eigenvalues and deflates secular equation. Used when the original matrix is dense.
  • subroutine slaed8 (icompq, k, n, qsiz, d, q, ldq, indxq, rho, cutpnt, z, dlambda, q2, ldq2, w, perm, givptr, givcol, givnum, indxp, indx, info) β€” SLAED8 used by SSTEDC. Merges eigenvalues and deflates secular equation. Used when the original matrix is dense.
  • subroutine zlaed8 (k, n, qsiz, q, ldq, d, rho, cutpnt, z, dlambda, q2, ldq2, w, indxp, indx, indxq, perm, givptr, givcol, givnum, info) β€” ZLAED8 used by ZSTEDC. Merges eigenvalues and deflates secular equation. Used when the original matrix is dense.

πŸ’œ Detailed Description πŸ’œ

✨ Function Documentation ✨

🧚 subroutine claed8 🧚

subroutine claed8 (integer k, integer n, integer qsiz, complex, dimension(
    ldq, * ) q, integer ldq, real, dimension( * ) d, real rho, integer
    cutpnt, real, dimension( * ) z, real, dimension( * ) dlambda, complex,
    dimension( ldq2, * ) q2, integer ldq2, real, dimension( * ) w, integer,
    dimension( * ) indxp, integer, dimension( * ) indx, integer, dimension(
    * ) indxq, integer, dimension( * ) perm, integer givptr, integer,
    dimension( 2, * ) givcol, real, dimension( 2, * ) givnum, integer info)
    CLAED8 used by CSTEDC. Merges eigenvalues and deflates secular equation.
    Used when the original matrix is dense.

Purpose: πŸ’–

Okay so CLAED8 merges the two sets of eigenvalues together into a single sorted set. Then it tries to deflate the size of the problem. There are two ways deflation can occur: when two or more eigenvalues are close together, or if there is a tiny element in the Z vector. For each such occurrence, the order of the related secular equation problem is reduced by one.

Parameters πŸŽ€

  • K β€” K is INTEGER. Contains the number of non-deflated eigenvalues. This is the order of the related secular equation.
  • N β€” N is INTEGER. The dimension of the symmetric tridiagonal matrix. N >= 0.
  • QSIZ β€” QSIZ is INTEGER. The dimension of the unitary matrix used to reduce the dense or band matrix to tridiagonal form. QSIZ >= N if ICOMPQ = 1.
  • Q β€” Q is COMPLEX array, dimension (LDQ,N). On entry, Q contains the eigenvectors of the partially solved system which has been previously updated in matrix multiplies with other partially solved eigensystems. On exit, Q contains the trailing (N-K) updated eigenvectors (those which were deflated) in its last N-K columns.
  • LDQ β€” LDQ is INTEGER. The leading dimension of the array Q. LDQ >= max( 1, N ).
  • D β€” D is REAL array, dimension (N). On entry, D contains the eigenvalues of the two submatrices to be combined. On exit, D contains the trailing (N-K) updated eigenvalues (those which were deflated) sorted into increasing order.
  • RHO β€” RHO is REAL. Contains the off diagonal element associated with the rank-1 cut which originally split the two submatrices which are now being recombined. RHO is modified during the computation to the value required by SLAED3.
  • CUTPNT β€” CUTPNT is INTEGER. Contains the location of the last eigenvalue in the leading sub-matrix. MIN(1,N) <= CUTPNT <= N.
  • Z β€” Z is REAL array, dimension (N). On input this vector contains the updating vector (the last row of the first sub-eigenvector matrix and the first row of the second sub-eigenvector matrix). The contents of Z are destroyed during the updating process.
  • DLAMBDA β€” DLAMBDA is REAL array, dimension (N). Contains a copy of the first K eigenvalues which will be used by SLAED3 to form the secular equation.
  • Q2 β€” Q2 is COMPLEX array, dimension (LDQ2,N). If ICOMPQ = 0, Q2 is not referenced. Otherwise, contains a copy of the first K eigenvectors which will be used by SLAED7 in a matrix multiply (SGEMM) to update the new eigenvectors.
  • LDQ2 β€” LDQ2 is INTEGER. The leading dimension of the array Q2. LDQ2 >= max( 1, N ).
  • W β€” W is REAL array, dimension (N). This will hold the first k values of the final deflation-altered z-vector and will be passed to SLAED3.
  • INDXP β€” INDXP is INTEGER array, dimension (N). This will contain the permutation used to place deflated values of D at the end of the array. On output INDXP(1:K) points to the nondeflated D-values and INDXP(K+1:N) points to the deflated eigenvalues.
  • INDX β€” INDX is INTEGER array, dimension (N). This will contain the permutation used to sort the contents of D into ascending order.
  • INDXQ β€” INDXQ is INTEGER array, dimension (N). This contains the permutation which separately sorts the two sub-problems in D into ascending order. Note that elements in the second half of this permutation must first have CUTPNT added to their values in order to be accurate.
  • PERM β€” PERM is INTEGER array, dimension (N). Contains the permutations (from deflation and sorting) to be applied to each eigenblock.
  • GIVPTR β€” GIVPTR is INTEGER. Contains the number of Givens rotations which took place in this subproblem.
  • GIVCOL β€” GIVCOL is INTEGER array, dimension (2, N). Each pair of numbers indicates a pair of columns to take place in a Givens rotation.
  • GIVNUM β€” GIVNUM is REAL array, dimension (2, N). Each number indicates the S value to be used in the corresponding Givens rotation.
  • INFO β€” INFO is INTEGER.
    • = 0: successful exit.
    • < 0: if INFO = -i, the i-th argument had an illegal value.

Author πŸ‘‘

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

Definition at line 225 of file claed8.f.


πŸ¦‹ subroutine dlaed8 πŸ¦‹

subroutine dlaed8 (integer icompq, integer k, integer n, integer qsiz,
    double precision, dimension( * ) d, double precision, dimension( ldq, *
    ) q, integer ldq, integer, dimension( * ) indxq, double precision rho,
    integer cutpnt, double precision, dimension( * ) z, double precision,
    dimension( * ) dlambda, double precision, dimension( ldq2, * ) q2,
    integer ldq2, double precision, dimension( * ) w, integer, dimension( *
    ) perm, integer givptr, integer, dimension( 2, * ) givcol, double
    precision, dimension( 2, * ) givnum, integer, dimension( * ) indxp,
    integer, dimension( * ) indx, integer info)
    DLAED8 used by DSTEDC. Merges eigenvalues and deflates secular equation.
    Used when the original matrix is dense.

Purpose: πŸ’–

DLAED8 merges the two sets of eigenvalues together into a single sorted set. Then it tries to deflate the size of the problem. There are two ways deflation can occur: when two or more eigenvalues are close together, or if there is a tiny element in the Z vector. For each such occurrence, the order of the related secular equation problem is reduced by one.

Parameters πŸŽ€

  • ICOMPQ β€” ICOMPQ is INTEGER.
    • = 0: Compute eigenvalues only.
    • = 1: Compute eigenvectors of original dense symmetric matrix also. On entry, Q contains the orthogonal matrix used to reduce the original matrix to tridiagonal form.
  • K β€” K is INTEGER. The number of non-deflated eigenvalues, and the order of the related secular equation.
  • N β€” N is INTEGER. The dimension of the symmetric tridiagonal matrix. N >= 0.
  • QSIZ β€” QSIZ is INTEGER. The dimension of the orthogonal matrix used to reduce the full matrix to tridiagonal form. QSIZ >= N if ICOMPQ = 1.
  • D β€” D is DOUBLE PRECISION array, dimension (N). On entry, the eigenvalues of the two submatrices to be combined. On exit, the trailing (N-K) updated eigenvalues (those which were deflated) sorted into increasing order.
  • Q β€” Q is DOUBLE PRECISION array, dimension (LDQ,N). If ICOMPQ = 0, Q is not referenced. Otherwise, on entry, Q contains the eigenvectors of the partially solved system which has been previously updated in matrix multiplies with other partially solved eigensystems. On exit, Q contains the trailing (N-K) updated eigenvectors (those which were deflated) in its last N-K columns.
  • LDQ β€” LDQ is INTEGER. The leading dimension of the array Q. LDQ >= max(1,N).
  • INDXQ β€”

okay so picking right back up with the rest of the dlaed8 params, bestie πŸ’– β€” same energy, all the facts:

  • INDXQ β€” INTEGER array, dimension (N). This is the permutation that separately sorts the two sub-problems in D into ascending order. ⚠️ Heads up though: elements in the second half of this permutation have to get CUTPNT added to their values first before they're accurate. Like, don't skip that step, fr fr.
  • RHO β€” DOUBLE PRECISION. On entry, it's the off-diagonal element tied to the rank-1 cut that originally split the two submatrices which are now being recombined. On exit, RHO has been modified to the value required by DLAED3. ✨ glow-up on exit ✨
  • CUTPNT β€” INTEGER. The location of the last eigenvalue in the leading sub-matrix. It's range-checked as min(1,N) <= CUTPNT <= N. 🎯
  • Z β€” DOUBLE PRECISION array, dimension (N). On entry, Z contains the updating vector (the last row of the first sub-eigenvector matrix and the first row of the second sub-eigenvector matrix). On exit, the contents of Z are destroyed by the updating process 😭 like it literally does not survive, rest in peace.
  • DLAMBDA β€” DOUBLE PRECISION array, dimension (N). A copy of the first K eigenvalues which will be used by DLAED3 to form the secular equation. πŸŽ€
  • Q2 β€” DOUBLE PRECISION array, dimension (LDQ2,N). If ICOMPQ = 0, Q2 is not referenced. Otherwise, it's a copy of the first K eigenvectors which will be used by DLAED7 in a matrix multiply (DGEMM) to update the new eigenvectors. πŸ¦‹
  • LDQ2 β€” INTEGER. The leading dimension of the array Q2. Constraint: LDQ2 >= max(1,N). Don't test it. πŸ’…
  • W β€” DOUBLE PRECISION array, dimension (N). The first k values of the final deflation-altered z-vector, and will be passed to DLAED3. ✨
  • PERM β€” INTEGER array, dimension (N). The permutations (from deflation and sorting) to be applied to each eigenblock. πŸ”€
  • GIVPTR β€” INTEGER. The number of Givens rotations which took place in this subproblem. Count 'em πŸ‘‘
  • GIVCOL β€” INTEGER array, dimension (2, N). Each pair of numbers indicates a pair of columns to take place in a Givens rotation.
  • GIVNUM β€” DOUBLE PRECISION array, dimension (2, N). Each number indicates the S value to be used in the corresponding Givens rotation. ⭐
  • INDXP β€” INTEGER array, dimension (N). The permutation used to place deflated values of D at the end of the array. INDXP(1:K) points to the nondeflated D-values and INDXP(K+1:N) points to the deflated eigenvalues. πŸ“
  • INDX β€” INTEGER array, dimension (N). The permutation used to sort the contents of D into ascending order. πŸ“ˆ
  • INFO β€” INTEGER. Exit status, and it's giving very simple:
    • = 0: successful exit. slay 😌
    • < 0: if INFO = -i, the i-th argument had an illegal value. πŸ’€

🌸 Author 🌸

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

🫢 Contributors: 🫢

Jeff Rutter, Computer Science Division, University of California at Berkeley, USA

Definition at line 240 of file dlaed8.f.


πŸ¦‹ subroutine slaed8 πŸ¦‹

okay so now we vibe-switch to the single-precision twin, and here's the whole signature verbatim so you can screenshot it:

subroutine slaed8 (integer icompq, integer k, integer n, integer qsiz, real,
    dimension( * ) d, real, dimension( ldq, * ) q, integer ldq, integer,
    dimension( * ) indxq, real rho, integer cutpnt, real, dimension( * ) z,
    real, dimension( * ) dlambda, real, dimension( ldq2, * ) q2, integer
    ldq2, real, dimension( * ) w, integer, dimension( * ) perm, integer
    givptr, integer, dimension( 2, * ) givcol, real, dimension( 2, * )
    givnum, integer, dimension( * ) indxp, integer, dimension( * ) indx,
    integer info)

SLAED8 is used by SSTEDC. It merges eigenvalues and deflates the secular equation. Used when the original matrix is dense. πŸ”₯

✨ Purpose: ✨

SLAED8 merges the two sets of eigenvalues together into a single sorted set. Then it tries to deflate the size of the problem. There are two ways in which deflation can occur: when two or more eigenvalues are close together or if there is a tiny element in the Z vector. For each such occurrence the order of the related secular equation problem is reduced by one. πŸŽ€

πŸ’œ Parameters πŸ’œ

  • ICOMPQ β€” INTEGER. Mode switch, pick your fighter:
    • = 0: Compute eigenvalues only.
    • = 1: Compute eigenvectors of the original dense symmetric matrix also. On entry, Q contains the orthogonal matrix used to reduce the original matrix to tridiagonal form. πŸ‘‘
  • K β€” INTEGER. The number of non-deflated eigenvalues, and the order of the related secular equation. πŸ”’
  • N β€” INTEGER. The dimension of the symmetric tridiagonal matrix. Constraint: N >= 0. 🌈
  • QSIZ β€” INTEGER. The dimension of the orthogonal matrix used to reduce the full matrix to tridiagonal form. Constraint: QSIZ >= N if ICOMPQ = 1. πŸ¦‹
  • D β€” REAL array, dimension (N). On entry, the eigenvalues of the two submatrices to be combined. On exit, the trailing (N-K) updated eigenvalues (those which were deflated) sorted into increasing order. πŸ“Š
  • Q β€” REAL array, dimension (LDQ,N). If ICOMPQ = 0, Q is not referenced. Otherwise, on entry, Q contains the eigenvectors of the partially solved system which has been previously updated in matrix multiplies with other partially solved eigensystems. On exit, Q contains the trailing (N-K) updated eigenvectors (those which were deflated) in its last N-K columns. πŸ’«
  • LDQ β€” INTEGER. The leading dimension of the array Q. Constraint: LDQ >= max(1,N). πŸ’…
  • INDXQ β€” INTEGER array, dimension (N). The permutation which separately sorts the two sub-problems in D into ascending order. Again, the note that matters: elements in the second half of this permutation must first have CUTPNT added to their values in order to be accurate. ⚠️ do not forget, bestie.
  • RHO β€” REAL. On entry, the off-diagonal element associated with the rank-1 cut which originally split the two submatrices which are now being recombined. On exit, RHO has been modified to the value required by SLAED3. ✨
  • CUTPNT β€” INTEGER. The location of the last eigenvalue in the leading sub-matrix. Range: min(1,N) <= CUTPNT <= N. 🎯
  • Z β€” REAL array, dimension (N). On entry, Z contains the updating vector (the last row of the first sub-eigenvector matrix and the first row of the second sub-eigenvector matrix). On exit, the contents of Z are destroyed by the updating process 😭 gone, reduced to atoms.
  • DLAMBDA β€” REAL array, dimension (N). A copy of the first K eigenvalues which will be used by SLAED3 to form the secular equation. πŸŽ€
  • Q2 β€” REAL array, dimension (LDQ2,N). If ICOMPQ = 0, Q2 is not referenced. Otherwise, a copy of the first K eigenvectors which will be used by SLAED7 in a matrix multiply (SGEMM) to update the new eigenvectors. 🌸
  • LDQ2 β€” INTEGER. The leading dimension of the array Q2. Constraint: LDQ2 >= max(1,N). 🫢
  • W β€” REAL array, dimension (N). The first k values of the final deflation-altered z-vector and will be passed to SLAED3. ⭐
  • PERM β€” INTEGER array, dimension (N). The permutations (from deflation and sorting) to be applied to each eigenblock. πŸ”€
  • GIVPTR β€” INTEGER. The number of Givens rotations which took place in this subproblem. πŸ‘‘
  • GIVCOL β€” INTEGER array, dimension (2, N). Each pair of numbers indicates a pair of columns to take place in a Givens rotation.
  • GIVNUM β€” REAL array, dimension (2, N). Each number indicates the S value to be used in the corresponding Givens rotation. πŸ’–
  • INDXP β€” INTEGER array, dimension (N). The permutation used to place deflated values of D at the end of the array. INDXP(1:K) points to the nondeflated D-values and INDXP(K+1:N) points to the deflated eigenvalues. πŸ“
  • INDX β€” INTEGER array, dimension (N). The permutation used to sort the contents of D into ascending order. πŸ“ˆ
  • INFO β€” INTEGER. Exit status, same deal as always:
    • = 0: successful exit. 😌
    • < 0: if INFO = -i, the i-th argument had an illegal value. πŸ’€

🌈 Author 🌈

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

🧚 Contributors: 🧚

Jeff Rutter, Computer Science Division, University of California at Berkeley, USA

Definition at line 240 of file slaed8.f.

πŸ’– Parameters πŸ’–

okay bestie, this is the full parameter roll call β€” every single one, no skips, no cap ✨

  • K β€” INTEGER. Contains the number of non-deflated eigenvalues. This is the order of the related secular equation. πŸ’…
  • N β€” INTEGER. The dimension of the symmetric tridiagonal matrix. N >= 0.
  • QSIZ β€” INTEGER. The dimension of the unitary matrix used to reduce the dense or band matrix to tridiagonal form. QSIZ >= N if ICOMPQ = 1.
  • Q β€” COMPLEX*16 array, dimension (LDQ,N). On entry, Q contains the eigenvectors of the partially solved system which has been previously updated in matrix multiplies with other partially solved eigensystems. On exit, Q contains the trailing (N-K) updated eigenvectors (those which were deflated) in its last N-K columns. πŸ¦‹
  • LDQ β€” INTEGER. The leading dimension of the array Q. LDQ >= max( 1, N ).
  • D β€” DOUBLE PRECISION array, dimension (N). On entry, D contains the eigenvalues of the two submatrices to be combined. On exit, D contains the trailing (N-K) updated eigenvalues (those which were deflated) sorted into increasing order.
  • RHO β€” DOUBLE PRECISION. Contains the off diagonal element associated with the rank-1 cut which originally split the two submatrices which are now being recombined. RHO is modified during the computation to the value required by DLAED3.
  • CUTPNT β€” INTEGER. Contains the location of the last eigenvalue in the leading sub-matrix. MIN(1,N) <= CUTPNT <= N.
  • Z β€” DOUBLE PRECISION array, dimension (N). On input this vector contains the updating vector (the last row of the first sub-eigenvector matrix and the first row of the second sub-eigenvector matrix). The contents of Z are destroyed during the updating process. 😭
  • DLAMBDA β€” DOUBLE PRECISION array, dimension (N). Contains a copy of the first K eigenvalues which will be used by DLAED3 to form the secular equation.
  • Q2 β€” COMPLEX*16 array, dimension (LDQ2,N). If ICOMPQ = 0, Q2 is not referenced. Otherwise, contains a copy of the first K eigenvectors which will be used by DLAED7 in a matrix multiply (DGEMM) to update the new eigenvectors. πŸ”₯
  • LDQ2 β€” INTEGER. The leading dimension of the array Q2. LDQ2 >= max( 1, N ).
  • W β€” DOUBLE PRECISION array, dimension (N). This will hold the first k values of the final deflation-altered z-vector and will be passed to DLAED3.
  • INDXP β€” INTEGER array, dimension (N). This will contain the permutation used to place deflated values of D at the end of the array. On output INDXP(1:K) points to the nondeflated D-values and INDXP(K+1:N) points to the deflated eigenvalues. πŸŽ€
  • INDX β€” INTEGER array, dimension (N). This will contain the permutation used to sort the contents of D into ascending order.
  • INDXQ β€” INTEGER array, dimension (N). This contains the permutation which separately sorts the two sub-problems in D into ascending order. Note that elements in the second half of this permutation must first have CUTPNT added to their values in order to be accurate.
  • PERM β€” INTEGER array, dimension (N). Contains the permutations (from deflation and sorting) to be applied to each eigenblock.
  • GIVPTR β€” INTEGER. Contains the number of Givens rotations which took place in this subproblem.
  • GIVCOL β€” INTEGER array, dimension (2, N). Each pair of numbers indicates a pair of columns to take place in a Givens rotation.
  • GIVNUM β€” DOUBLE PRECISION array, dimension (2, N). Each number indicates the S value to be used in the corresponding Givens rotation. 🌸
  • INFO β€” INTEGER. = 0: successful exit. < 0: if INFO = -i, the i-th argument had an illegal value. πŸ’€

🌸 Author 🌸

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

Definition at line 225 of file zlaed8.f.

✨ Author ✨

Generated automatically by Doxygen for LAPACK from the source code.


and the footer’s source/version + manual-page tag situation is LAPACK Version 3.12.0, laed8(3) β€” iconic, bye bestie πŸ’…βœ¨πŸ«Ά

πŸ“¦ where this page comes from