cppfa
cppfa - (obsolete) compute a Cholesky factorization of a symmetric positive definite matrix
A in packed storage. It is typical to follow a call to CPPFA with a call to CPPSL to solve Ax = b or to CPPDI to
compute the determinant and inverse of A.
SUBROUTINE CPPFA( A, N, INFO)
COMPLEX A(*)
INTEGER N, INFO
SUBROUTINE CPPFA_64( A, N, INFO)
COMPLEX A(*)
INTEGER*8 N, INFO
#include <sunperf.h>
void cppfa(complex *a, int n, int *info);
void cppfa_64(complex *a, long n, long *info);
-
* A (input/output)
-
On entry, the upper triangle of the matrix A.
On exit, a Cholesky factorization of the matrix A.
-
* 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 U(k,k) = 0 to indicate that CPPSL will divide by zero if called.