cpbfa

NAME

cpbfa - (obsolete) compute a Cholesky factorization of a symmetric positive definite matrix A in banded storage. It is typical to follow a call to CPBFA with a call to CPBSL to solve Ax = b or to CPBDI to compute the determinant of A.

SYNOPSIS

  SUBROUTINE CPBFA( A, LDA, N, NDIAG, INFO)
  COMPLEX A(LDA,*)
  INTEGER LDA, N, NDIAG, INFO
 
  SUBROUTINE CPBFA_64( A, LDA, N, NDIAG, INFO)
  COMPLEX A(LDA,*)
  INTEGER*8 LDA, N, NDIAG, INFO

C INTERFACE

#include <sunperf.h>

void cpbfa(complex *a, int lda, int n, int ndiag, int *info);

void cpbfa_64(complex *a, long lda, long n, long ndiag, long *info);

ARGUMENTS

* A (input/output)

On entry, the upper triangle of the matrix A. On exit, a Cholesky factorization of the matrix A.

* LDA (input)

Leading dimension of the array A as specified in a dimension or type statement. LDA >= NDIAG + 1.

* N (input)

Order of the matrix A. N >= 0.

* NDIAG (input)

Number of diagonals. N-1 >= NDIAG >= 0 but if N = 0 then NDIAG = 0.

* INFO (output)

On exit:

INFO = 0 Subroutine completed normally.

INFO > 0 Returns a value of k if the leading minor of order k is not positive definite.