cppsl

NAME

cppsl - (obsolete) solve the linear system Ax = b for a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by CPPCO or CPPFA, and vectors b and x.

SYNOPSIS

  SUBROUTINE CPPSL( A, N, B)
  COMPLEX A(*), B(*)
  INTEGER N
 
  SUBROUTINE CPPSL_64( A, N, B)
  COMPLEX A(*), B(*)
  INTEGER*8 N

C INTERFACE

#include <sunperf.h>

void cppsl(complex *a, int n, complex *b);

void cppsl_64(complex *a, long n, complex *b);

ARGUMENTS

* A (input): Cholesky factorization of the matrix A, as computed by CPPCO or CPPFA.
* N (input): Order of the matrix A. N >= 0.
* B (input/output): On entry, the right-hand side vector b. On exit, the solution vector x.