.TH "lauu2" 3 "Wed Feb 7 2024 11:30:40" "Version 3.12.0" "LAPACK" \" -*- nroff -*- .ad l .nh .SH NAME lauu2 \- lauu2: triangular multiply: U^H U, level 2 .SH SYNOPSIS .br .PP .SS "Functions" .in +1c .ti -1c .RI "subroutine \fBclauu2\fP (uplo, n, a, lda, info)" .br .RI "\fBCLAUU2\fP computes the product UUH or LHL, where U and L are upper or lower triangular matrices (unblocked algorithm)\&. " .ti -1c .RI "subroutine \fBdlauu2\fP (uplo, n, a, lda, info)" .br .RI "\fBDLAUU2\fP computes the product UUH or LHL, where U and L are upper or lower triangular matrices (unblocked algorithm)\&. " .ti -1c .RI "subroutine \fBslauu2\fP (uplo, n, a, lda, info)" .br .RI "\fBSLAUU2\fP computes the product UUH or LHL, where U and L are upper or lower triangular matrices (unblocked algorithm)\&. " .ti -1c .RI "subroutine \fBzlauu2\fP (uplo, n, a, lda, info)" .br .RI "\fBZLAUU2\fP computes the product UUH or LHL, where U and L are upper or lower triangular matrices (unblocked algorithm)\&. " .in -1c .SH "Detailed Description" .PP .SH "Function Documentation" .PP .SS "subroutine clauu2 (character uplo, integer n, complex, dimension( lda, * ) a, integer lda, integer info)" .PP \fBCLAUU2\fP computes the product UUH or LHL, where U and L are upper or lower triangular matrices (unblocked algorithm)\&. .PP \fBPurpose:\fP .RS 4 .PP .nf CLAUU2 computes the product U * U**H or L**H * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A\&. If UPLO = 'U' or 'u' then the upper triangle of the result is stored, overwriting the factor U in A\&. If UPLO = 'L' or 'l' then the lower triangle of the result is stored, overwriting the factor L in A\&. This is the unblocked form of the algorithm, calling Level 2 BLAS\&. .fi .PP .RE .PP \fBParameters\fP .RS 4 \fIUPLO\fP .PP .nf UPLO is CHARACTER*1 Specifies whether the triangular factor stored in the array A is upper or lower triangular: = 'U': Upper triangular = 'L': Lower triangular .fi .PP .br \fIN\fP .PP .nf N is INTEGER The order of the triangular factor U or L\&. N >= 0\&. .fi .PP .br \fIA\fP .PP .nf A is COMPLEX array, dimension (LDA,N) On entry, the triangular factor U or L\&. On exit, if UPLO = 'U', the upper triangle of A is overwritten with the upper triangle of the product U * U**H; if UPLO = 'L', the lower triangle of A is overwritten with the lower triangle of the product L**H * L\&. .fi .PP .br \fILDA\fP .PP .nf LDA is INTEGER The leading dimension of the array A\&. LDA >= max(1,N)\&. .fi .PP .br \fIINFO\fP .PP .nf INFO is INTEGER = 0: successful exit < 0: if INFO = -k, the k-th argument had an illegal value .fi .PP .RE .PP \fBAuthor\fP .RS 4 Univ\&. of Tennessee .PP Univ\&. of California Berkeley .PP Univ\&. of Colorado Denver .PP NAG Ltd\&. .RE .PP .SS "subroutine dlauu2 (character uplo, integer n, double precision, dimension( lda, * ) a, integer lda, integer info)" .PP \fBDLAUU2\fP computes the product UUH or LHL, where U and L are upper or lower triangular matrices (unblocked algorithm)\&. .PP \fBPurpose:\fP .RS 4 .PP .nf DLAUU2 computes the product U * U**T or L**T * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A\&. If UPLO = 'U' or 'u' then the upper triangle of the result is stored, overwriting the factor U in A\&. If UPLO = 'L' or 'l' then the lower triangle of the result is stored, overwriting the factor L in A\&. This is the unblocked form of the algorithm, calling Level 2 BLAS\&. .fi .PP .RE .PP \fBParameters\fP .RS 4 \fIUPLO\fP .PP .nf UPLO is CHARACTER*1 Specifies whether the triangular factor stored in the array A is upper or lower triangular: = 'U': Upper triangular = 'L': Lower triangular .fi .PP .br \fIN\fP .PP .nf N is INTEGER The order of the triangular factor U or L\&. N >= 0\&. .fi .PP .br \fIA\fP .PP .nf A is DOUBLE PRECISION array, dimension (LDA,N) On entry, the triangular factor U or L\&. On exit, if UPLO = 'U', the upper triangle of A is overwritten with the upper triangle of the product U * U**T; if UPLO = 'L', the lower triangle of A is overwritten with the lower triangle of the product L**T * L\&. .fi .PP .br \fILDA\fP .PP .nf LDA is INTEGER The leading dimension of the array A\&. LDA >= max(1,N)\&. .fi .PP .br \fIINFO\fP .PP .nf INFO is INTEGER = 0: successful exit < 0: if INFO = -k, the k-th argument had an illegal value .fi .PP .RE .PP \fBAuthor\fP .RS 4 Univ\&. of Tennessee .PP Univ\&. of California Berkeley .PP Univ\&. of Colorado Denver .PP NAG Ltd\&. .RE .PP .SS "subroutine slauu2 (character uplo, integer n, real, dimension( lda, * ) a, integer lda, integer info)" .PP \fBSLAUU2\fP computes the product UUH or LHL, where U and L are upper or lower triangular matrices (unblocked algorithm)\&. .PP \fBPurpose:\fP .RS 4 .PP .nf SLAUU2 computes the product U * U**T or L**T * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A\&. If UPLO = 'U' or 'u' then the upper triangle of the result is stored, overwriting the factor U in A\&. If UPLO = 'L' or 'l' then the lower triangle of the result is stored, overwriting the factor L in A\&. This is the unblocked form of the algorithm, calling Level 2 BLAS\&. .fi .PP .RE .PP \fBParameters\fP .RS 4 \fIUPLO\fP .PP .nf UPLO is CHARACTER*1 Specifies whether the triangular factor stored in the array A is upper or lower triangular: = 'U': Upper triangular = 'L': Lower triangular .fi .PP .br \fIN\fP .PP .nf N is INTEGER The order of the triangular factor U or L\&. N >= 0\&. .fi .PP .br \fIA\fP .PP .nf A is REAL array, dimension (LDA,N) On entry, the triangular factor U or L\&. On exit, if UPLO = 'U', the upper triangle of A is overwritten with the upper triangle of the product U * U**T; if UPLO = 'L', the lower triangle of A is overwritten with the lower triangle of the product L**T * L\&. .fi .PP .br \fILDA\fP .PP .nf LDA is INTEGER The leading dimension of the array A\&. LDA >= max(1,N)\&. .fi .PP .br \fIINFO\fP .PP .nf INFO is INTEGER = 0: successful exit < 0: if INFO = -k, the k-th argument had an illegal value .fi .PP .RE .PP \fBAuthor\fP .RS 4 Univ\&. of Tennessee .PP Univ\&. of California Berkeley .PP Univ\&. of Colorado Denver .PP NAG Ltd\&. .RE .PP .SS "subroutine zlauu2 (character uplo, integer n, complex*16, dimension( lda, * ) a, integer lda, integer info)" .PP \fBZLAUU2\fP computes the product UUH or LHL, where U and L are upper or lower triangular matrices (unblocked algorithm)\&. .PP \fBPurpose:\fP .RS 4 .PP .nf ZLAUU2 computes the product U * U**H or L**H * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A\&. If UPLO = 'U' or 'u' then the upper triangle of the result is stored, overwriting the factor U in A\&. If UPLO = 'L' or 'l' then the lower triangle of the result is stored, overwriting the factor L in A\&. This is the unblocked form of the algorithm, calling Level 2 BLAS\&. .fi .PP .RE .PP \fBParameters\fP .RS 4 \fIUPLO\fP .PP .nf UPLO is CHARACTER*1 Specifies whether the triangular factor stored in the array A is upper or lower triangular: = 'U': Upper triangular = 'L': Lower triangular .fi .PP .br \fIN\fP .PP .nf N is INTEGER The order of the triangular factor U or L\&. N >= 0\&. .fi .PP .br \fIA\fP .PP .nf A is COMPLEX*16 array, dimension (LDA,N) On entry, the triangular factor U or L\&. On exit, if UPLO = 'U', the upper triangle of A is overwritten with the upper triangle of the product U * U**H; if UPLO = 'L', the lower triangle of A is overwritten with the lower triangle of the product L**H * L\&. .fi .PP .br \fILDA\fP .PP .nf LDA is INTEGER The leading dimension of the array A\&. LDA >= max(1,N)\&. .fi .PP .br \fIINFO\fP .PP .nf INFO is INTEGER = 0: successful exit < 0: if INFO = -k, the k-th argument had an illegal value .fi .PP .RE .PP \fBAuthor\fP .RS 4 Univ\&. of Tennessee .PP Univ\&. of California Berkeley .PP Univ\&. of Colorado Denver .PP NAG Ltd\&. .RE .PP .SH "Author" .PP Generated automatically by Doxygen for LAPACK from the source code\&.