public interface pstrf
PSTRF computes the Cholesky factorization with complete
pivoting of a complex Hermitian positive semidefinite matrix A.
The factorization has the form
PT * A * P = UH * U , if UPLO = 'U',
PT * A * P = L * LH, if UPLO = 'L',
where U is an upper triangular matrix and L is lower triangular, and
P is stored as vector PIV.
This algorithm does not attempt to check that A is positive
semidefinite. This version of the algorithm calls level 3 BLAS.
Subroutines
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
|
complex(kind=sp),
|
intent(inout) |
|
|
:: |
a(lda,*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
lda |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
piv(n) |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
rank |
|
|
real(kind=sp),
|
intent(in) |
|
|
:: |
tol |
|
|
real(kind=sp),
|
intent(out) |
|
|
:: |
work(2*n) |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
info |
|
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
|
real(kind=dp),
|
intent(inout) |
|
|
:: |
a(lda,*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
lda |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
piv(n) |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
rank |
|
|
real(kind=dp),
|
intent(in) |
|
|
:: |
tol |
|
|
real(kind=dp),
|
intent(out) |
|
|
:: |
work(2*n) |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
info |
|
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
|
real(kind=sp),
|
intent(inout) |
|
|
:: |
a(lda,*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
lda |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
piv(n) |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
rank |
|
|
real(kind=sp),
|
intent(in) |
|
|
:: |
tol |
|
|
real(kind=sp),
|
intent(out) |
|
|
:: |
work(2*n) |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
info |
|
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
character(len=1),
|
intent(in) |
|
|
:: |
uplo |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
|
complex(kind=dp),
|
intent(inout) |
|
|
:: |
a(lda,*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
lda |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
piv(n) |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
rank |
|
|
real(kind=dp),
|
intent(in) |
|
|
:: |
tol |
|
|
real(kind=dp),
|
intent(out) |
|
|
:: |
work(2*n) |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
info |
|
Module Procedures