# cpotf2.f(3) [debian man page]

```cpotf2.f(3)							      LAPACK							       cpotf2.f(3)

NAME
cpotf2.f -

SYNOPSIS
Functions/Subroutines
subroutine cpotf2 (UPLO, N, A, LDA, INFO)
CPOTF2

Function/Subroutine Documentation
subroutine cpotf2 (characterUPLO, integerN, complex, dimension( lda, * )A, integerLDA, integerINFO)
CPOTF2

Purpose:

CPOTF2 computes the Cholesky factorization of a complex Hermitian
positive definite matrix A.

The factorization has the form
A = U**H * U ,  if UPLO = 'U', or
A = L  * L**H,  if UPLO = 'L',
where U is an upper triangular matrix and L is lower triangular.

This is the unblocked version of the algorithm, calling Level 2 BLAS.

Parameters:
UPLO

UPLO is CHARACTER*1
Specifies whether the upper or lower triangular part of the
Hermitian matrix A is stored.
= 'U':  Upper triangular
= 'L':  Lower triangular

N

N is INTEGER
The order of the matrix A.  N >= 0.

A

A is COMPLEX array, dimension (LDA,N)
On entry, the Hermitian matrix A.	If UPLO = 'U', the leading
n by n upper triangular part of A contains the upper
triangular part of the matrix A, and the strictly lower
triangular part of A is not referenced.  If UPLO = 'L', the
leading n by n lower triangular part of A contains the lower
triangular part of the matrix A, and the strictly upper
triangular part of A is not referenced.

On exit, if INFO = 0, the factor U or L from the Cholesky
factorization A = U**H *U	or A = L*L**H.

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
> 0: if INFO = k, the leading minor of order k is not
positive definite, and the factorization could not be
completed.

Author:
Univ. of Tennessee

Univ. of California Berkeley

NAG Ltd.

Date:
November 2011

Definition at line 110 of file cpotf2.f.

Author
Generated automatically by Doxygen for LAPACK from the source code.

Version 3.4.1							  Sun May 26 2013						       cpotf2.f(3)```

## Check Out this Related Man Page

```CPOTF2(l)								 )								 CPOTF2(l)

NAME
CPOTF2 - compute the Cholesky factorization of a complex Hermitian positive definite matrix A

SYNOPSIS
SUBROUTINE CPOTF2( UPLO, N, A, LDA, INFO )

CHARACTER	  UPLO

INTEGER	  INFO, LDA, N

COMPLEX	  A( LDA, * )

PURPOSE
CPOTF2 computes the Cholesky factorization of a complex Hermitian positive definite matrix A.  The factorization has the form
A = U' * U ,	if UPLO = 'U', or
A = L  * L',	if UPLO = 'L',
where U is an upper triangular matrix and L is lower triangular.

This is the unblocked version of the algorithm, calling Level 2 BLAS.

ARGUMENTS
UPLO    (input) CHARACTER*1
Specifies whether the upper or lower triangular part of the Hermitian matrix A is stored.  = 'U':  Upper triangular
= 'L':  Lower triangular

N       (input) INTEGER
The order of the matrix A.  N >= 0.

A       (input/output) COMPLEX array, dimension (LDA,N)
On  entry, the Hermitian matrix A.  If UPLO = 'U', the leading n by n upper triangular part of A contains the upper triangular part
of the matrix A, and the strictly lower triangular part of A is not referenced.	If UPLO = 'L', the leading n by n lower triangular
part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced.

On exit, if INFO = 0, the factor U or L from the Cholesky factorization A = U'*U  or A = L*L'.

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

INFO    (output) INTEGER
= 0: successful exit
< 0: if INFO = -k, the k-th argument had an illegal value
> 0: if INFO = k, the leading minor of order k is not positive definite, and the factorization could not be completed.

LAPACK version 3.0						   15 June 2000 							 CPOTF2(l)```
Man Page