zsptri - compute the inverse of a complex symmetric indefinite matrix A in packed storage using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF
SUBROUTINE ZSPTRI( UPLO, N, A, IPIVOT, WORK, INFO) CHARACTER * 1 UPLO DOUBLE COMPLEX A(*), WORK(*) INTEGER N, INFO INTEGER IPIVOT(*)
SUBROUTINE ZSPTRI_64( UPLO, N, A, IPIVOT, WORK, INFO) CHARACTER * 1 UPLO DOUBLE COMPLEX A(*), WORK(*) INTEGER*8 N, INFO INTEGER*8 IPIVOT(*)
SUBROUTINE SPTRI( UPLO, N, A, IPIVOT, [WORK], [INFO]) CHARACTER(LEN=1) :: UPLO COMPLEX(8), DIMENSION(:) :: A, WORK INTEGER :: N, INFO INTEGER, DIMENSION(:) :: IPIVOT
SUBROUTINE SPTRI_64( UPLO, N, A, IPIVOT, [WORK], [INFO]) CHARACTER(LEN=1) :: UPLO COMPLEX(8), DIMENSION(:) :: A, WORK INTEGER(8) :: N, INFO INTEGER(8), DIMENSION(:) :: IPIVOT
#include <sunperf.h>
void zsptri(char uplo, int n, doublecomplex *a, int *ipivot, int *info);
void zsptri_64(char uplo, long n, doublecomplex *a, long *ipivot, long *info);
zsptri computes the inverse of a complex symmetric indefinite matrix A in packed storage using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF.
= 'L': Lower triangular, form is A = L*D*L**T.
On exit, if INFO = 0, the (symmetric) inverse of the original
matrix, stored as a packed triangular matrix. The j-th column
of inv(A)
is stored in the array A as follows:
if UPLO = 'U', A(i + (j-1)*j/2) = inv(A)(i,j)
for 1 < =i < =j;
if UPLO = 'L',
A(i + (j-1)*(2n-j)/2) = inv(A)(i,j)
for j < =i < =n.
dimension(N)
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, D(i,i) = 0; the matrix is singular and its inverse could not be computed.