zpotrf (3p)

Name

zpotrf - itive definite matrix A

Synopsis

SUBROUTINE ZPOTRF(UPLO, N, A, LDA, INFO)

CHARACTER*1 UPLO
DOUBLE COMPLEX A(LDA,*)
INTEGER N, LDA, INFO

SUBROUTINE ZPOTRF_64(UPLO, N, A, LDA, INFO)

CHARACTER*1 UPLO
DOUBLE COMPLEX A(LDA,*)
INTEGER*8 N, LDA, INFO




F95 INTERFACE
SUBROUTINE POTRF(UPLO, N, A, LDA, INFO)

CHARACTER(LEN=1) :: UPLO
COMPLEX(8), DIMENSION(:,:) :: A
INTEGER :: N, LDA, INFO

SUBROUTINE POTRF_64(UPLO, N, A, LDA, INFO)

CHARACTER(LEN=1) :: UPLO
COMPLEX(8), DIMENSION(:,:) :: A
INTEGER(8) :: N, LDA, INFO




C INTERFACE
#include <sunperf.h>

void zpotrf(char uplo, int n, doublecomplex *a, int lda, int *info);

void zpotrf_64(char uplo, long n,  doublecomplex  *a,  long  lda,  long
*info);

Description

Oracle Solaris Studio Performance Library                           zpotrf(3P)



NAME
       zpotrf - compute the Cholesky factorization of a complex Hermitian pos-
       itive definite matrix A


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

       CHARACTER*1 UPLO
       DOUBLE COMPLEX A(LDA,*)
       INTEGER N, LDA, INFO

       SUBROUTINE ZPOTRF_64(UPLO, N, A, LDA, INFO)

       CHARACTER*1 UPLO
       DOUBLE COMPLEX A(LDA,*)
       INTEGER*8 N, LDA, INFO




   F95 INTERFACE
       SUBROUTINE POTRF(UPLO, N, A, LDA, INFO)

       CHARACTER(LEN=1) :: UPLO
       COMPLEX(8), DIMENSION(:,:) :: A
       INTEGER :: N, LDA, INFO

       SUBROUTINE POTRF_64(UPLO, N, A, LDA, INFO)

       CHARACTER(LEN=1) :: UPLO
       COMPLEX(8), DIMENSION(:,:) :: A
       INTEGER(8) :: N, LDA, INFO




   C INTERFACE
       #include <sunperf.h>

       void zpotrf(char uplo, int n, doublecomplex *a, int lda, int *info);

       void zpotrf_64(char uplo, long n,  doublecomplex  *a,  long  lda,  long
                 *info);



PURPOSE
       zpotrf computes the Cholesky factorization of a complex Hermitian posi-
       tive 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 block version of the algorithm, calling Level 3 BLAS.


ARGUMENTS
       UPLO (input)
                 = 'U':  Upper triangle of A is stored;
                 = 'L':  Lower triangle of A is stored.


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


       A (input/output)
                 On entry, the Hermitian matrix A.  If UPLO = 'U', the leading
                 N-by-N upper triangular part of A contains the upper triangu-
                 lar 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 (input)
                 The leading dimension of the array A.  LDA >= max(1,N).


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




                                  7 Nov 2015                        zpotrf(3P)