public interface tpsv
TPSV solves one of the systems of equations
Ax = b, or ATx = b, or A*Hx = b,
where b and x are n element vectors and A is an n by n unit, or
non-unit, upper or lower triangular matrix, supplied in packed form.
No test for singularity or near-singularity is included in this
routine. Such tests must be performed before calling this routine.
Subroutines
Arguments
Type |
Intent | Optional | Attributes |
|
Name |
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
character(len=1),
|
intent(in) |
|
|
:: |
trans |
|
character(len=1),
|
intent(in) |
|
|
:: |
diag |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
complex(kind=sp),
|
intent(in) |
|
|
:: |
ap(*) |
|
complex(kind=sp),
|
intent(inout) |
|
|
:: |
x(*) |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incx |
|
Arguments
Type |
Intent | Optional | Attributes |
|
Name |
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
character(len=1),
|
intent(in) |
|
|
:: |
trans |
|
character(len=1),
|
intent(in) |
|
|
:: |
diag |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
real(kind=dp),
|
intent(in) |
|
|
:: |
ap(*) |
|
real(kind=dp),
|
intent(inout) |
|
|
:: |
x(*) |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incx |
|
Arguments
Type |
Intent | Optional | Attributes |
|
Name |
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
character(len=1),
|
intent(in) |
|
|
:: |
trans |
|
character(len=1),
|
intent(in) |
|
|
:: |
diag |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
real(kind=sp),
|
intent(in) |
|
|
:: |
ap(*) |
|
real(kind=sp),
|
intent(inout) |
|
|
:: |
x(*) |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incx |
|
Arguments
Type |
Intent | Optional | Attributes |
|
Name |
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
character(len=1),
|
intent(in) |
|
|
:: |
trans |
|
character(len=1),
|
intent(in) |
|
|
:: |
diag |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
complex(kind=dp),
|
intent(in) |
|
|
:: |
ap(*) |
|
complex(kind=dp),
|
intent(inout) |
|
|
:: |
x(*) |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incx |
|
Module Procedures
CTPSV solves one of the systems of equations
Ax = b, or ATx = b, or A*Hx = b,
where b and x are n element vectors and A is an n by n unit, or
non-unit, upper or lower triangular matrix, supplied in packed form.
No test for singularity or near-singularity is included in this
routine. Such tests must be performed before calling this routine.
Arguments
Type |
Intent | Optional | Attributes |
|
Name |
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
character(len=1),
|
intent(in) |
|
|
:: |
trans |
|
character(len=1),
|
intent(in) |
|
|
:: |
diag |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
complex(kind=sp),
|
intent(in) |
|
|
:: |
ap(*) |
|
complex(kind=sp),
|
intent(inout) |
|
|
:: |
x(*) |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incx |
|
DTPSV solves one of the systems of equations
Ax = b, or ATx = b,
where b and x are n element vectors and A is an n by n unit, or
non-unit, upper or lower triangular matrix, supplied in packed form.
No test for singularity or near-singularity is included in this
routine. Such tests must be performed before calling this routine.
Arguments
Type |
Intent | Optional | Attributes |
|
Name |
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
character(len=1),
|
intent(in) |
|
|
:: |
trans |
|
character(len=1),
|
intent(in) |
|
|
:: |
diag |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
real(kind=dp),
|
intent(in) |
|
|
:: |
ap(*) |
|
real(kind=dp),
|
intent(inout) |
|
|
:: |
x(*) |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incx |
|
STPSV solves one of the systems of equations
Ax = b, or ATx = b,
where b and x are n element vectors and A is an n by n unit, or
non-unit, upper or lower triangular matrix, supplied in packed form.
No test for singularity or near-singularity is included in this
routine. Such tests must be performed before calling this routine.
Arguments
Type |
Intent | Optional | Attributes |
|
Name |
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
character(len=1),
|
intent(in) |
|
|
:: |
trans |
|
character(len=1),
|
intent(in) |
|
|
:: |
diag |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
real(kind=sp),
|
intent(in) |
|
|
:: |
ap(*) |
|
real(kind=sp),
|
intent(inout) |
|
|
:: |
x(*) |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incx |
|
ZTPSV solves one of the systems of equations
Ax = b, or ATx = b, or A*Hx = b,
where b and x are n element vectors and A is an n by n unit, or
non-unit, upper or lower triangular matrix, supplied in packed form.
No test for singularity or near-singularity is included in this
routine. Such tests must be performed before calling this routine.
Arguments
Type |
Intent | Optional | Attributes |
|
Name |
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
character(len=1),
|
intent(in) |
|
|
:: |
trans |
|
character(len=1),
|
intent(in) |
|
|
:: |
diag |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
complex(kind=dp),
|
intent(in) |
|
|
:: |
ap(*) |
|
complex(kind=dp),
|
intent(inout) |
|
|
:: |
x(*) |
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incx |
|