public interface lapll
Given two column vectors X and Y, let
A = ( X Y ).
The subroutine first computes the QR factorization of A = Q*R,
and then computes the SVD of the 2-by-2 upper triangular matrix R.
The smaller singular value of R is returned in SSMIN, which is used
as the measurement of the linear dependency of the vectors X and Y.
Subroutines
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
|
complex(kind=sp),
|
intent(inout) |
|
|
:: |
x(*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incx |
|
|
complex(kind=sp),
|
intent(inout) |
|
|
:: |
y(*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incy |
|
|
real(kind=sp),
|
intent(out) |
|
|
:: |
ssmin |
|
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
|
real(kind=dp),
|
intent(inout) |
|
|
:: |
x(*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incx |
|
|
real(kind=dp),
|
intent(inout) |
|
|
:: |
y(*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incy |
|
|
real(kind=dp),
|
intent(out) |
|
|
:: |
ssmin |
|
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
|
real(kind=sp),
|
intent(inout) |
|
|
:: |
x(*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incx |
|
|
real(kind=sp),
|
intent(inout) |
|
|
:: |
y(*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incy |
|
|
real(kind=sp),
|
intent(out) |
|
|
:: |
ssmin |
|
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n |
|
|
complex(kind=dp),
|
intent(inout) |
|
|
:: |
x(*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incx |
|
|
complex(kind=dp),
|
intent(inout) |
|
|
:: |
y(*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
incy |
|
|
real(kind=dp),
|
intent(out) |
|
|
:: |
ssmin |
|
Module Procedures