LASD1: computes the SVD of an upper bidiagonal N-by-M matrix B, where N = NL + NR + 1 and M = N + SQRE. LASD1 is called from DLASD0. A related subroutine DLASD7 handles the case in which the singular values (and the singular vectors in factored form) are desired. LASD1 computes the SVD as follows: ( D1(in) 0 0 0 ) B = U(in) * ( Z1**T a Z2**T b ) * VT(in) ( 0 0 D2(in) 0 ) = U(out) * ( D(out) 0) * VT(out) where Z**T = (Z1**T a Z2**T b) = u**T VT**T, and u is a vector of dimension M with ALPHA and BETA in the NL+1 and NL+2 th entries and zeros elsewhere; and the entry b is empty if SQRE = 0. The left singular vectors of the original matrix are stored in U, and the transpose of the right singular vectors are stored in VT, and the singular values are in D. The algorithm consists of three stages: The first stage consists of deflating the size of the problem when there are multiple singular values or when there are zeros in the Z vector. For each such occurrence the dimension of the secular equation problem is reduced by one. This stage is performed by the routine DLASD2. The second stage consists of calculating the updated singular values. This is done by finding the square roots of the roots of the secular equation via the routine DLASD4 (as called by DLASD3). This routine also calculates the singular vectors of the current problem. The final stage consists of computing the updated singular vectors directly using the updated singular values. The singular vectors for the current problem are multiplied with the singular vectors from the overall problem.
More...
|
| pure subroutine | dlasd1 (nl, nr, sqre, d, alpha, beta, u, ldu, vt, ldvt, idxq, iwork, work, info) |
| |
| | la_dlasd1 |
| |
| | la_qlasd1 |
| |
| pure subroutine | slasd1 (nl, nr, sqre, d, alpha, beta, u, ldu, vt, ldvt, idxq, iwork, work, info) |
| |
| | la_slasd1 |
| |
LASD1: computes the SVD of an upper bidiagonal N-by-M matrix B, where N = NL + NR + 1 and M = N + SQRE. LASD1 is called from DLASD0. A related subroutine DLASD7 handles the case in which the singular values (and the singular vectors in factored form) are desired. LASD1 computes the SVD as follows: ( D1(in) 0 0 0 ) B = U(in) * ( Z1**T a Z2**T b ) * VT(in) ( 0 0 D2(in) 0 ) = U(out) * ( D(out) 0) * VT(out) where Z**T = (Z1**T a Z2**T b) = u**T VT**T, and u is a vector of dimension M with ALPHA and BETA in the NL+1 and NL+2 th entries and zeros elsewhere; and the entry b is empty if SQRE = 0. The left singular vectors of the original matrix are stored in U, and the transpose of the right singular vectors are stored in VT, and the singular values are in D. The algorithm consists of three stages: The first stage consists of deflating the size of the problem when there are multiple singular values or when there are zeros in the Z vector. For each such occurrence the dimension of the secular equation problem is reduced by one. This stage is performed by the routine DLASD2. The second stage consists of calculating the updated singular values. This is done by finding the square roots of the roots of the secular equation via the routine DLASD4 (as called by DLASD3). This routine also calculates the singular vectors of the current problem. The final stage consists of computing the updated singular vectors directly using the updated singular values. The singular vectors for the current problem are multiplied with the singular vectors from the overall problem.
◆ dlasd1()
| pure subroutine la_lapack::lasd1::dlasd1 |
( |
integer(ilp), intent(in) |
nl, |
|
|
integer(ilp), intent(in) |
nr, |
|
|
integer(ilp), intent(in) |
sqre, |
|
|
real(dp), dimension(*), intent(inout) |
d, |
|
|
real(dp), intent(inout) |
alpha, |
|
|
real(dp), intent(inout) |
beta, |
|
|
real(dp), dimension(ldu,*), intent(inout) |
u, |
|
|
integer(ilp), intent(in) |
ldu, |
|
|
real(dp), dimension(ldvt,*), intent(inout) |
vt, |
|
|
integer(ilp), intent(in) |
ldvt, |
|
|
integer(ilp), dimension(*), intent(inout) |
idxq, |
|
|
integer(ilp), dimension(*), intent(out) |
iwork, |
|
|
real(dp), dimension(*), intent(out) |
work, |
|
|
integer(ilp), intent(out) |
info |
|
) |
| |
◆ la_dlasd1()
| la_lapack::lasd1::la_dlasd1 |
◆ la_qlasd1()
| la_lapack::lasd1::la_qlasd1 |
◆ la_slasd1()
| la_lapack::lasd1::la_slasd1 |
◆ slasd1()
| pure subroutine la_lapack::lasd1::slasd1 |
( |
integer(ilp), intent(in) |
nl, |
|
|
integer(ilp), intent(in) |
nr, |
|
|
integer(ilp), intent(in) |
sqre, |
|
|
real(sp), dimension(*), intent(inout) |
d, |
|
|
real(sp), intent(inout) |
alpha, |
|
|
real(sp), intent(inout) |
beta, |
|
|
real(sp), dimension(ldu,*), intent(inout) |
u, |
|
|
integer(ilp), intent(in) |
ldu, |
|
|
real(sp), dimension(ldvt,*), intent(inout) |
vt, |
|
|
integer(ilp), intent(in) |
ldvt, |
|
|
integer(ilp), dimension(*), intent(inout) |
idxq, |
|
|
integer(ilp), dimension(*), intent(out) |
iwork, |
|
|
real(sp), dimension(*), intent(out) |
work, |
|
|
integer(ilp), intent(out) |
info |
|
) |
| |
The documentation for this interface was generated from the following file:
1.9.8