# slauum.f man page

slauum.f

## Synopsis

### Functions/Subroutines

subroutine **slauum** (UPLO, **N**, A, **LDA**, INFO)**SLAUUM** computes the product UUH or LHL, where U and L are upper or lower triangular matrices (blocked algorithm).

## Function/Subroutine Documentation

### subroutine slauum (character UPLO, integer N, real, dimension( lda, * ) A, integer LDA, integer INFO)

**SLAUUM** computes the product UUH or LHL, where U and L are upper or lower triangular matrices (blocked algorithm).

**Purpose:**

SLAUUM 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 blocked form of the algorithm, calling Level 3 BLAS.

**Parameters:**-
*UPLO*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

*N*N is INTEGER The order of the triangular factor U or L. N >= 0.

*A*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.

*LDA*LDA is INTEGER The leading dimension of the array A. LDA >= max(1,N).

*INFO*INFO is INTEGER = 0: successful exit < 0: if INFO = -k, the k-th argument had an illegal value

**Author:**-
Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

**Date:**December 2016

Definition at line 104 of file slauum.f.

## Author

Generated automatically by Doxygen for LAPACK from the source code.

## Referenced By

The man page slauum(3) is an alias of slauum.f(3).

Tue Nov 14 2017 Version 3.8.0 LAPACK