• NAME
• SYNOPSIS
• F95 INTERFACE
• C INTERFACE
• PURPOSE
• ARGUMENTS

NAME

zsptrs - solve a system of linear equations A*X = B with a complex symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF

SYNOPSIS

  SUBROUTINE ZSPTRS( UPLO, N, NRHS, A, IPIVOT, B, LDB, INFO)
  CHARACTER * 1 UPLO
  DOUBLE COMPLEX A(*), B(LDB,*)
  INTEGER N, NRHS, LDB, INFO
  INTEGER IPIVOT(*)

  SUBROUTINE ZSPTRS_64( UPLO, N, NRHS, A, IPIVOT, B, LDB, INFO)
  CHARACTER * 1 UPLO
  DOUBLE COMPLEX A(*), B(LDB,*)
  INTEGER*8 N, NRHS, LDB, INFO
  INTEGER*8 IPIVOT(*)

F95 INTERFACE

  SUBROUTINE SPTRS( UPLO, N, NRHS, A, IPIVOT, B, [LDB], [INFO])
  CHARACTER(LEN=1) :: UPLO
  COMPLEX(8), DIMENSION(:) :: A
  COMPLEX(8), DIMENSION(:,:) :: B
  INTEGER :: N, NRHS, LDB, INFO
  INTEGER, DIMENSION(:) :: IPIVOT

  SUBROUTINE SPTRS_64( UPLO, N, NRHS, A, IPIVOT, B, [LDB], [INFO])
  CHARACTER(LEN=1) :: UPLO
  COMPLEX(8), DIMENSION(:) :: A
  COMPLEX(8), DIMENSION(:,:) :: B
  INTEGER(8) :: N, NRHS, LDB, INFO
  INTEGER(8), DIMENSION(:) :: IPIVOT

C INTERFACE

#include <sunperf.h>

void zsptrs(char uplo, int n, int nrhs, doublecomplex *a, int *ipivot, doublecomplex *b, int ldb, int *info);

void zsptrs_64(char uplo, long n, long nrhs, doublecomplex *a, long *ipivot, doublecomplex *b, long ldb, long *info);

PURPOSE

zsptrs solves a system of linear equations A*X = B with a complex symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF.

ARGUMENTS

• UPLO (input)
  Specifies whether the details of the factorization are stored as an upper or lower triangular matrix. = 'U': Upper triangular, form is A = U*D*U**T;

   = 'L':  Lower triangular, form is A  = L*D*L**T.

• N (input)
  The order of the matrix A. N > = 0.

• NRHS (input)
  The number of right hand sides, i.e., the number of columns of the matrix B. NRHS > = 0.

• A (input)
  The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by CSPTRF, stored as a packed triangular matrix.

• IPIVOT (input)
  Details of the interchanges and the block structure of D as determined by CSPTRF.

• B (input/output)
  On entry, the right hand side matrix B. On exit, the solution matrix X.

• LDB (input)
  The leading dimension of the array B. LDB > = max(1,N).

• INFO (output)
  

   = 0:  successful exit

   < 0: if INFO  = -i, the i-th argument had an illegal value