ZGEBAL(3)
π¦ ZGEBAL(3) β the zgebal.f(3) glow-up β¨
okay so real talk, this page lives at zgebal.f in the LAPACK manual (manual name: zgebal.f(3)), and it's the whole lore drop on ZGEBAL. it's giving "linear algebra but make it a makeover montage" π
. also, prose warning: this manpage is technically about a file path, the synopsis is literally the path, and it's iconic for that. no cap.
β¨ NAME β¨
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/zgebal.f β that's it, that's the whole name bestie, it's the file, she's the file π
πΈ SYNOPSIS πΈ
Functions/Subroutines π«Ά
subroutine ZGEBAL (job, n, a, lda, ilo, ihi, scale, info)β iconic, no notes, this is the one
π Function/Subroutine Documentation π
subroutine ZGEBAL (character job, integer n, complex*16, dimension( lda, * )
a, integer lda, integer ilo, integer ihi, double precision, dimension( *
) scale, integer info)
ZGEBAL π₯
π§ Purpose:
!> !> ZGEBAL balances a general complex matrix A. This involves, first, !> permuting A by a similarity transformation to isolate eigenvalues !> in the first 1 to ILO-1 and last IHI+1 to N elements on the !> diagonal; and second, applying a diagonal similarity transformation !> to rows and columns ILO to IHI to make the rows and columns as !> close in norm as possible. Both steps are optional. !> !> Balancing may reduce the 1-norm of the matrix, and improve the !> accuracy of the computed eigenvalues and/or eigenvectors. !>
translation: she balances your general complex matrix A, and it's a two-part serve π
. step one, permute A by a similarity transformation to isolate eigenvalues in the first 1 to ILO-1 and last IHI+1 to N elements on the diagonal. step two, apply a diagonal similarity transformation to rows and columns ILO to IHI so the rows and columns are as close in norm as possible. and the best part? both steps are optional β she's flexible, she's lowkey chill π
why bother? because balancing may reduce the 1-norm of the matrix and improve the accuracy of the computed eigenvalues and/or eigenvectors. it's a glow-up for your numbers, fr fr β¨
π Parameters
JOBβJOBisCHARACTER*1. specifies the operations to be performed on A, and she has range:= 'N':none: simply setILO = 1,IHI = N,SCALE(I) = 1.0fori = 1,...,N;= 'P':permute only;= 'S':scale only;= 'B':both permute and scale. π
NβNisINTEGER. the order of the matrix A.N >= 0. non-negotiable bestie.AβAisCOMPLEX*16array, dimension(LDA,N). on entry, the input matrix A. on exit, A is overwritten by the balanced matrix. ifJOB = 'N', A is not referenced. see Further Details π (she get a whole section, main character energy)LDAβLDAisINTEGER. the leading dimension of the array A.LDA >= max(1,N). respect the bound πILOβILOisINTEGER. (yes that's the whole description, she's a mystery, she's reserved π)IHIβIHIisINTEGER.ILOandIHIare set to integers such that on exitA(i,j) = 0ifi > jandj = 1,...,ILO-1orI = IHI+1,...,N. ifJOB = 'N'or'S',ILO = 1andIHI = N. (note the capitalIinI = IHI+1,...,Nβ that's how she wrote it, we don't touch it π)SCALEβSCALEisDOUBLE PRECISIONarray, dimension(N). details of the permutations and scaling factors applied to A. ifP(j)is the index of the row and column interchanged with row and columnjandD(j)is the scaling factor applied to row and columnj, then:
SCALE(j) = P(j) for j = 1,...,ILO-1
= D(j) for j = ILO,...,IHI
= P(j) for j = IHI+1,...,N.
the order in which the interchanges are made is N to IHI+1, then 1 to ILO-1. order matters bestie, don't freestyle it π
INFOβINFOisINTEGER:= 0:successful exit. slay π< 0:ifINFO = -i, the i-th argument had an illegal value. not slay π
π Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
a whole collective, a whole squad π«Ά
β Further Details:
!> !> The permutations consist of row and column interchanges which put !> the matrix in the form !> !> ( T1 X Y ) !> P A P = ( 0 B Z ) !> ( 0 0 T2 ) !> !> where T1 and T2 are upper triangular matrices whose eigenvalues lie !> along the diagonal. The column indices ILO and IHI mark the starting !> and ending columns of the submatrix B. Balancing consists of applying !> a diagonal similarity transformation inv(D) * B * D to make the !> 1-norms of each row of B and its corresponding column nearly equal. !> The output matrix is !> !> ( T1 X*D Y ) !> ( 0 inv(D)*B*D inv(D)*Z ). !> ( 0 0 T2 ) !> !> Information about the permutations P and the diagonal matrix D is !> returned in the vector SCALE. !> !> This subroutine is based on the EISPACK routine CBAL. !> !> Modified by Tzu-Yi Chen, Computer Science Division, University of !> California at Berkeley, USA !> !> Refactored by Evert Provoost, Department of Computer Science, !> KU Leuven, Belgium !>
so the permutations are row-and-column interchanges that put the matrix in this exact shape:
( T1 X Y )
P A P = ( 0 B Z )
( 0 0 T2 )
where T1 and T2 are upper triangular matrices whose eigenvalues lie along the diagonal π¦. the column indices ILO and IHI mark the starting and ending columns of the submatrix B. balancing is applying a diagonal similarity transformation inv(D) * B * D to make the 1-norms of each row of B and its corresponding column nearly equal β matching energy, we love to see it π
. and the output matrix is:
( T1 X*D Y )
( 0 inv(D)*B*D inv(D)*Z ).
( 0 0 T2 )
information about the permutations P and the diagonal matrix D is returned in the vector SCALE β she keeps receipts, iykyk π§Ύβ¨
π credit where it's due: this subroutine is based on the EISPACK routine CBAL. modified by Tzu-Yi Chen, Computer Science Division, University of California at Berkeley, USA. refactored by Evert Provoost, Department of Computer Science, KU Leuven, Belgium. legends only π
π Definition at line 164 of file zgebal.f.
that's the coordinate bestie, line 164 of zgebal.f, go look π
π Author π
Generated automatically by Doxygen for LAPACK from the source code. yes she was built by a robot and she still ate π€π
okay bye bestie, go balance that matrix π¦π
LAPACK β Version 3.12.0 β and that path again, for the record: /home/abui...RC/zgebal.f(3) (yes, abbreviated, that's how the footer rolls). mwah, love u, see u in the next manpage ππ·
π¦ 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