cpofa

NAME

cpofa - (obsolete) compute a Cholesky factorization of a symmetric positive definite matrix A. It is typical to follow a call to CPOFA with a call to CPOSL to solve Ax = b or to CPODI to compute the determinant and inverse of A.

SYNOPSIS

  SUBROUTINE CPOFA( A, LDA, N, INFO)
  COMPLEX A(LDA,*)
  INTEGER LDA, N, INFO
 
  SUBROUTINE CPOFA_64( A, LDA, N, INFO)
  COMPLEX A(LDA,*)
  INTEGER*8 LDA, N, INFO

C INTERFACE

#include <sunperf.h>

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

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

ARGUMENTS

* A (input/output)

On entry, the upper triangle of the matrix A. On exit, a Cholesky factorization of the matrix A. The strict lower triangle of A is not referenced.

* LDA (input)

Leading dimension of the array A as specified in a dimension or type statement. LDA >= max(1,N).

* N (input)

Order of the matrix A. N >= 0.

* INFO (output)

On exit:

INFO = 0 Subroutine completed normally.

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