CGEHRD(3)
CGEHRD(3) β π Library Functions Manual β¨
NAME
The file this page is serving is literally:
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/cgehrd.f
Yes, the whole path. Sheβs long but sheβs valid π .
SYNOPSIS
Functions/Subroutines
subroutine CGEHRD (n, ilo, ihi, a, lda, tau, work, lwork, info)
CGEHRD β thatβs the main character π«.
Function/Subroutine Documentation
subroutine CGEHRD (integer n, integer ilo, integer ihi, complex, dimension(
lda, * ) a, integer lda, complex, dimension( * ) tau, complex,
dimension( * ) work, integer lwork, integer info)
CGEHRD again, because the docs said so π«Ά.
Purpose
okay so the whole point: CGEHRD reduces a complex general matrix A to upper Hessenberg form H by a unitary similarity transformation: Q**H * A * Q = H. Thatβs the vibe. β¨
Parameters
NβN is INTEGER. The order of matrixA.N >= 0.ILOβILO is INTEGER.IHIβIHI is INTEGER. It is assumed thatAis already upper triangular in rows and columns1:ILO-1andIHI+1:N.ILOandIHIare normally set by a previous call toCGEBAL; otherwise they should be set to1andNrespectively. See Further Details. Constraints:1 <= ILO <= IHI <= N, ifN > 0;ILO=1andIHI=0, ifN=0.AβA is COMPLEX array, dimension (LDA,N). On entry, theN-by-Ngeneral matrix to be reduced. On exit, the upper triangle and the first subdiagonal ofAare overwritten with the upper Hessenberg matrixH, and the elements below the first subdiagonal, with the arrayTAU, represent the unitary matrixQas a product of elementary reflectors. See Further Details.LDAβLDA is INTEGER. The leading dimension of the arrayA.LDA >= max(1,N).TAUβTAU is COMPLEX array, dimension (N-1). The scalar factors of the elementary reflectors (see Further Details). Elements1:ILO-1andIHI:N-1ofTAUare set to zero.WORKβWORK is COMPLEX array, dimension (LWORK). On exit, ifINFO = 0,WORK(1)returns the optimalLWORK.LWORKβLWORK is INTEGER. The length of the arrayWORK.LWORK >= max(1,N). For good performance,LWORKshould generally be larger. IfLWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of theWORKarray, returns this value as the first entry of theWORKarray, and no error message related toLWORKis issued byXERBLA.INFOβINFO is INTEGER.= 0: successful exit.< 0: ifINFO = -i, thei-th argument had an illegal value.
Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Further Details
The matrix Q is represented as a product of (ihi-ilo) elementary reflectors:
Q = H(ilo) H(ilo+1) . . . H(ihi-1).
Each H(i) has the form:
H(i) = I - tau * v * v**H
where tau is a complex scalar, and v is a complex vector with v(1:i) = 0, v(i+1) = 1 and v(ihi+1:n) = 0; v(i+2:ihi) is stored on exit in A(i+2:ihi,i), and tau in TAU(i).
The contents of A are illustrated by the following example, with n = 7, ilo = 2 and ihi = 6:
on entry, on exit,
( a a a a a a a ) ( a a h h h h a )
( a a a a a a ) ( a h h h h a )
( a a a a a a ) ( h h h h h h )
( a a a a a a ) ( v2 h h h h h )
( a a a a a a ) ( v2 v3 h h h h )
( a a a a a a ) ( v2 v3 v4 h h h )
( a ) ( a )
where a denotes an element of the original matrix A, h denotes a modified element of the upper Hessenberg matrix H, and vi denotes an element of the vector defining H(i).
This file is a slight modification of LAPACK-3.0's CGEHRD subroutine incorporating improvements proposed by Quintana-Orti and Van de Geijn (2006). (See CLAHR2.)
Definition at line 166 of file cgehrd.f.
Author β generated automatically edition
Generated automatically by Doxygen for LAPACK from the source code.
π cute sign-off: source/version is LAPACK Version 3.12.0, footer path is /home/abui...RC/cgehrd.f(3), and thereβs no date printed on this footer, so no fake date, bestie. bye π
π¦ where this page comes from
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms