laeda(3)
π
laeda(3) β Library Functions Manual β¨
okay so bestie, this is laeda(3) from the Library Functions Manual, and it's giving two LAPACK subroutines: one DOUBLE PRECISION girlie and one REAL girlie. Both are here to compute the Z vector for the rank-one modification of the diagonal matrix when the original matrix is dense. No cap.
πΈ NAME
laeda β laeda: D&C step: z vector π
β¨ SYNOPSIS
π οΈ Functions
subroutine dlaeda (n, tlvls, curlvl, curpbm, prmptr, perm, givptr, givcol, givnum, q, qptr, z, ztemp, info)βDLAEDA used by DSTEDC. Computes the Z vector determining the rank-one modification of the diagonal matrix. Used when the original matrix is dense.subroutine slaeda (n, tlvls, curlvl, curpbm, prmptr, perm, givptr, givcol, givnum, q, qptr, z, ztemp, info)βSLAEDA used by SSTEDC. Computes the Z vector determining the rank-one modification of the diagonal matrix. Used when the original matrix is dense.
π DETAILED DESCRIPTION
This part is lowkey just the doorway into the function docs. The page has a Detailed Description section, then it goes straight into Function Documentation. No extra lore, bestie.
π¦ FUNCTION DOCUMENTATION
π dlaeda
subroutine dlaeda (integer n, integer tlvls, integer curlvl, integer curpbm, integer, dimension( * ) prmptr, integer, dimension( * ) perm, integer, dimension( * ) givptr, integer, dimension( 2, * ) givcol, double precision, dimension( 2, * ) givnum, double precision, dimension( * ) q, integer, dimension( * ) qptr, double precision, dimension( * ) z, double precision, dimension( * ) ztemp, integer info)
DLAEDA used by DSTEDC. Computes the Z vector determining the rank-one modification of the diagonal matrix. Used when the original matrix is dense.
π― Purpose
DLAEDA computes the Z vector corresponding to the merge step in the CURLVLth step of the merge process with TLVLS steps for the CURPBMth problem.
π§Έ Parameters
NβN is INTEGER. The dimension of the symmetric tridiagonal matrix.N >= 0.TLVLSβTLVLS is INTEGER. The total number of merging levels in the overall divide and conquer tree.CURLVLβCURLVL is INTEGER. The current level in the overall merge routine,0 <= curlvl <= tlvls.CURPBMβCURPBM is INTEGER. The current problem in the current level in the overall merge routine (counting from upper left to lower right).PRMPTRβPRMPTR is INTEGER array, dimension (N lg N). Contains a list of pointers which indicate where inPERMa level's permutation is stored.PRMPTR(i+1) - PRMPTR(i)indicates the size of the permutation and incidentally the size of the full, non-deflated problem.PERMβPERM is INTEGER array, dimension (N lg N). Contains the permutations (from deflation and sorting) to be applied to each eigenblock.GIVPTRβGIVPTR is INTEGER array, dimension (N lg N). Contains a list of pointers which indicate where inGIVCOLa level's Givens rotations are stored.GIVPTR(i+1) - GIVPTR(i)indicates the number of Givens rotations.GIVCOLβGIVCOL is INTEGER array, dimension (2, N lg N). Each pair of numbers indicates a pair of columns to take place in a Givens rotation.GIVNUMβGIVNUM is DOUBLE PRECISION array, dimension (2, N lg N). Each number indicates the S value to be used in the corresponding Givens rotation.QβQ is DOUBLE PRECISION array, dimension (N**2). Contains the square eigenblocks from previous levels, the starting positions for blocks are given byQPTR.QPTRβQPTR is INTEGER array, dimension (N+2). Contains a list of pointers which indicate where inQan eigenblock is stored.SQRT( QPTR(i+1) - QPTR(i) )indicates the size of the block.ZβZ is DOUBLE PRECISION array, dimension (N). On output 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).ZTEMPβZTEMP is DOUBLE PRECISION array, dimension (N).INFOβINFO is INTEGER= 0: successful exit.< 0: ifINFO = -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 164 of file dlaeda.f.
π slaeda
subroutine slaeda (integer n, integer tlvls, integer curlvl, integer curpbm, integer, dimension( * ) prmptr, integer, dimension( * ) perm, integer, dimension( * ) givptr, integer, dimension( 2, * ) givcol, real, dimension( 2, * ) givnum, real, dimension( * ) q, integer, dimension( * ) qptr, real, dimension( * ) z, real, dimension( * ) ztemp, integer info)
SLAEDA used by SSTEDC. Computes the Z vector determining the rank-one modification of the diagonal matrix. Used when the original matrix is dense.
π― Purpose
SLAEDA computes the Z vector corresponding to the merge step in the CURLVLth step of the merge process with TLVLS steps for the CURPBMth problem.
π§Έ Parameters
NβN is INTEGER. The dimension of the symmetric tridiagonal matrix.N >= 0.TLVLSβTLVLS is INTEGER. The total number of merging levels in the overall divide and conquer tree.CURLVLβCURLVL is INTEGER. The current level in the overall merge routine,0 <= curlvl <= tlvls.CURPBMβCURPBM is INTEGER. The current problem in the current level in the overall merge routine (counting from upper left to lower right).PRMPTRβPRMPTR is INTEGER array, dimension (N lg N). Contains a list of pointers which indicate where inPERMa level's permutation is stored.PRMPTR(i+1) - PRMPTR(i)indicates the size of the permutation and incidentally the size of the full, non-deflated problem.PERMβPERM is INTEGER array, dimension (N lg N). Contains the permutations (from deflation and sorting) to be applied to each eigenblock.GIVPTRβGIVPTR is INTEGER array, dimension (N lg N). Contains a list of pointers which indicate where inGIVCOLa level's Givens rotations are stored.GIVPTR(i+1) - GIVPTR(i)indicates the number of Givens rotations.GIVCOLβGIVCOL is INTEGER array, dimension (2, N lg 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 lg N). Each number indicates the S value to be used in the corresponding Givens rotation.QβQ is REAL array, dimension (N**2). Contains the square eigenblocks from previous levels, the starting positions for blocks are given byQPTR.QPTRβQPTR is INTEGER array, dimension (N+2). Contains a list of pointers which indicate where inQan eigenblock is stored.SQRT( QPTR(i+1) - QPTR(i) )indicates the size of the block.ZβZ is REAL array, dimension (N). On output 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).ZTEMPβZTEMP is REAL array, dimension (N).INFOβINFO is INTEGER= 0: successful exit.< 0: ifINFO = -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 164 of file slaeda.f.
π AUTHOR
Generated automatically by Doxygen for LAPACK from the source code.
okay that's the whole page, bestie. Signing off with LAPACK Version 3.12.0 and laeda(3) β the footer doesn't list a date, so I'm not inventing one. Periodt. π
β¨
π¦ where this page comes from
- arch rolling: lapack-doc 3.12.1-2 Β· custom
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms