NAME

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


SYNOPSIS

  SUBROUTINE CPBTRF( UPLO, N, NDIAG, A, LDA, INFO)
  CHARACTER * 1 UPLO
  COMPLEX A(LDA,*)
  INTEGER N, NDIAG, LDA, INFO
  SUBROUTINE CPBTRF_64( UPLO, N, NDIAG, A, LDA, INFO)
  CHARACTER * 1 UPLO
  COMPLEX A(LDA,*)
  INTEGER*8 N, NDIAG, LDA, INFO

F95 INTERFACE

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

C INTERFACE

#include <sunperf.h>

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

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


PURPOSE

cpbtrf computes the Cholesky factorization of a complex Hermitian positive definite band 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.


ARGUMENTS


FURTHER DETAILS

The band storage scheme is illustrated by the following example, when N = 6, NDIAG = 2, and UPLO = 'U':

On entry: On exit:

    *    *   a13  a24  a35  a46      *    *   u13  u24  u35  u46
    *   a12  a23  a34  a45  a56      *   u12  u23  u34  u45  u56
   a11  a22  a33  a44  a55  a66     u11  u22  u33  u44  u55  u66

Similarly, if UPLO = 'L' the format of A is as follows:

On entry: On exit:

   a11  a22  a33  a44  a55  a66     l11  l22  l33  l44  l55  l66
   a21  a32  a43  a54  a65   *      l21  l32  l43  l54  l65   *
   a31  a42  a53  a64   *    *      l31  l42  l53  l64   *    *

Array elements marked * are not used by the routine.

Contributed by

Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989