public interface pbstf
PBSTF computes a split Cholesky factorization of a complex
Hermitian positive definite band matrix A.
This routine is designed to be used in conjunction with CHBGST.
The factorization has the form A = S*HS where S is a band matrix
of the same bandwidth as A and the following structure:
S = ( U )
( M L )
where U is upper triangular of order m = (n+kd)/2, and L is lower
triangular of order n-m.
Subroutines
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
kd |
|
|
complex(kind=sp),
|
intent(inout) |
|
|
:: |
ab(ldab,*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
ldab |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
info |
|
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
kd |
|
|
real(kind=dp),
|
intent(inout) |
|
|
:: |
ab(ldab,*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
ldab |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
info |
|
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
kd |
|
|
real(kind=sp),
|
intent(inout) |
|
|
:: |
ab(ldab,*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
ldab |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
info |
|
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
kd |
|
|
complex(kind=dp),
|
intent(inout) |
|
|
:: |
ab(ldab,*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
ldab |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
info |
|
Module Procedures