NAME

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


SYNOPSIS

  SUBROUTINE CPOTF2( UPLO, N, A, LDA, INFO)
  CHARACTER * 1 UPLO
  COMPLEX A(LDA,*)
  INTEGER N, LDA, INFO
  SUBROUTINE CPOTF2_64( UPLO, N, A, LDA, INFO)
  CHARACTER * 1 UPLO
  COMPLEX A(LDA,*)
  INTEGER*8 N, LDA, INFO

F95 INTERFACE

  SUBROUTINE POTF2( UPLO, [N], A, [LDA], [INFO])
  CHARACTER(LEN=1) :: UPLO
  COMPLEX, DIMENSION(:,:) :: A
  INTEGER :: N, LDA, INFO
  SUBROUTINE POTF2_64( UPLO, [N], A, [LDA], [INFO])
  CHARACTER(LEN=1) :: UPLO
  COMPLEX, DIMENSION(:,:) :: A
  INTEGER(8) :: N, LDA, INFO

C INTERFACE

#include <sunperf.h>

void cpotf2(char uplo, int n, complex *a, int lda, int *info);

void cpotf2_64(char uplo, long n, complex *a, long lda, long *info);


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