cgesl

NAME

cgesl - (obsolete) solve the linear system Ax = b for a general matrix A, which has been LU- factored by CGECO or CGEFA, and vectors b and x.

SYNOPSIS 

  SUBROUTINE CGESL( A, LDA, N, IPIVOT, B, JOB)
  COMPLEX A(LDA,*), B(*)
  INTEGER LDA, N, JOB
  INTEGER IPIVOT(*)
 
  SUBROUTINE CGESL_64( A, LDA, N, IPIVOT, B, JOB)
  COMPLEX A(LDA,*), B(*)
  INTEGER*8 LDA, N, JOB
  INTEGER*8 IPIVOT(*)

C INTERFACE

#include <sunperf.h>

void cgesl(complex *a, int lda, int n, int *ipivot, complex *b, int job);

void cgesl_64(complex *a, long lda, long n, long *ipivot, complex *b, long job);

ARGUMENTS

* A (input)
LU factorization of the matrix A, as computed by CGECO or CGEFA.

* 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.

* IPIVOT (input)
Pivot vector as computed by CGECO or CGEFA.

* B (input/output)
On entry, the right-hand side vector b. On exit, the solution vector x.

* JOB (input)
Determines which operation the subroutine will perform: 

        not 0   Solve the linear system AHx = b.  Note that ATx = AHx
for real matrices.