cpbsl

NAME

cpbsl - (obsolete) section solve the linear system Ax = b for a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by CPBCO or CPBFA, and vectors b and x.

SYNOPSIS

  SUBROUTINE CPBSL( A, LDA, N, NDIAG, B)
  COMPLEX A(LDA,*), B(*)
  INTEGER LDA, N, NDIAG
 
  SUBROUTINE CPBSL_64( A, LDA, N, NDIAG, B)
  COMPLEX A(LDA,*), B(*)
  INTEGER*8 LDA, N, NDIAG

C INTERFACE

#include <sunperf.h>

void cpbsl(complex *a, int lda, int n, int ndiag, complex *b);

void cpbsl_64(complex *a, long lda, long n, long ndiag, complex *b);

ARGUMENTS

* A (input): Cholesky factorization of the matrix A, as computed by CPBCO or CPBFA.
* 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 of matrix A. N-1 >= NDIAG >= 0 but if N = 0 then NDIAG = 0.
* B (input/output): On entry, the right-hand side vector b. On exit, the solution vector x.