LASD6: computes the SVD of an updated upper bidiagonal matrix B obtained by merging two smaller ones by appending a row. This routine is used only for the problem which requires all singular values and optionally singular vector matrices in factored form. B is an N-by-M matrix with N = NL + NR + 1 and M = N + SQRE. A related subroutine, DLASD1, handles the case in which all singular values and singular vectors of the bidiagonal matrix are desired. LASD6 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 singular values of B can be computed using D1, D2, the first components of all the right singular vectors of the lower block, and the last components of all the right singular vectors of the upper block. These components are stored and updated in VF and VL, respectively, in LASD6. Hence U and VT are not explicitly referenced. The singular values are stored in D. The algorithm consists of two stages: The first stage consists of deflating the size of the problem when there are multiple singular values or if there is a zero 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 DLASD7. The second stage consists of calculating the updated singular values. This is done by finding the roots of the secular equation via the routine DLASD4 (as called by DLASD8). This routine also updates VF and VL and computes the distances between the updated singular values and the old singular values. LASD6 is called from DLASDA.
More...
|
| pure subroutine | dlasd6 (icompq, nl, nr, sqre, d, vf, vl, alpha, beta, idxq, perm, givptr, givcol, ldgcol, givnum, ldgnum, poles, difl, difr, z, k, c, s, work, iwork, info) |
| |
| | la_dlasd6 |
| |
| | la_qlasd6 |
| |
| pure subroutine | slasd6 (icompq, nl, nr, sqre, d, vf, vl, alpha, beta, idxq, perm, givptr, givcol, ldgcol, givnum, ldgnum, poles, difl, difr, z, k, c, s, work, iwork, info) |
| |
| | la_slasd6 |
| |
LASD6: computes the SVD of an updated upper bidiagonal matrix B obtained by merging two smaller ones by appending a row. This routine is used only for the problem which requires all singular values and optionally singular vector matrices in factored form. B is an N-by-M matrix with N = NL + NR + 1 and M = N + SQRE. A related subroutine, DLASD1, handles the case in which all singular values and singular vectors of the bidiagonal matrix are desired. LASD6 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 singular values of B can be computed using D1, D2, the first components of all the right singular vectors of the lower block, and the last components of all the right singular vectors of the upper block. These components are stored and updated in VF and VL, respectively, in LASD6. Hence U and VT are not explicitly referenced. The singular values are stored in D. The algorithm consists of two stages: The first stage consists of deflating the size of the problem when there are multiple singular values or if there is a zero 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 DLASD7. The second stage consists of calculating the updated singular values. This is done by finding the roots of the secular equation via the routine DLASD4 (as called by DLASD8). This routine also updates VF and VL and computes the distances between the updated singular values and the old singular values. LASD6 is called from DLASDA.
◆ dlasd6()
| pure subroutine la_lapack::lasd6::dlasd6 |
( |
integer(ilp), intent(in) |
icompq, |
|
|
integer(ilp), intent(in) |
nl, |
|
|
integer(ilp), intent(in) |
nr, |
|
|
integer(ilp), intent(in) |
sqre, |
|
|
real(dp), dimension(*), intent(inout) |
d, |
|
|
real(dp), dimension(*), intent(inout) |
vf, |
|
|
real(dp), dimension(*), intent(inout) |
vl, |
|
|
real(dp), intent(inout) |
alpha, |
|
|
real(dp), intent(inout) |
beta, |
|
|
integer(ilp), dimension(*), intent(inout) |
idxq, |
|
|
integer(ilp), dimension(*), intent(out) |
perm, |
|
|
integer(ilp), intent(out) |
givptr, |
|
|
integer(ilp), dimension(ldgcol,*), intent(out) |
givcol, |
|
|
integer(ilp), intent(in) |
ldgcol, |
|
|
real(dp), dimension(ldgnum,*), intent(out) |
givnum, |
|
|
integer(ilp), intent(in) |
ldgnum, |
|
|
real(dp), dimension(ldgnum,*), intent(out) |
poles, |
|
|
real(dp), dimension(*), intent(out) |
difl, |
|
|
real(dp), dimension(*), intent(out) |
difr, |
|
|
real(dp), dimension(*), intent(out) |
z, |
|
|
integer(ilp), intent(out) |
k, |
|
|
real(dp), intent(out) |
c, |
|
|
real(dp), intent(out) |
s, |
|
|
real(dp), dimension(*), intent(out) |
work, |
|
|
integer(ilp), dimension(*), intent(out) |
iwork, |
|
|
integer(ilp), intent(out) |
info |
|
) |
| |
◆ la_dlasd6()
| la_lapack::lasd6::la_dlasd6 |
◆ la_qlasd6()
| la_lapack::lasd6::la_qlasd6 |
◆ la_slasd6()
| la_lapack::lasd6::la_slasd6 |
◆ slasd6()
| pure subroutine la_lapack::lasd6::slasd6 |
( |
integer(ilp), intent(in) |
icompq, |
|
|
integer(ilp), intent(in) |
nl, |
|
|
integer(ilp), intent(in) |
nr, |
|
|
integer(ilp), intent(in) |
sqre, |
|
|
real(sp), dimension(*), intent(inout) |
d, |
|
|
real(sp), dimension(*), intent(inout) |
vf, |
|
|
real(sp), dimension(*), intent(inout) |
vl, |
|
|
real(sp), intent(inout) |
alpha, |
|
|
real(sp), intent(inout) |
beta, |
|
|
integer(ilp), dimension(*), intent(inout) |
idxq, |
|
|
integer(ilp), dimension(*), intent(out) |
perm, |
|
|
integer(ilp), intent(out) |
givptr, |
|
|
integer(ilp), dimension(ldgcol,*), intent(out) |
givcol, |
|
|
integer(ilp), intent(in) |
ldgcol, |
|
|
real(sp), dimension(ldgnum,*), intent(out) |
givnum, |
|
|
integer(ilp), intent(in) |
ldgnum, |
|
|
real(sp), dimension(ldgnum,*), intent(out) |
poles, |
|
|
real(sp), dimension(*), intent(out) |
difl, |
|
|
real(sp), dimension(*), intent(out) |
difr, |
|
|
real(sp), dimension(*), intent(out) |
z, |
|
|
integer(ilp), intent(out) |
k, |
|
|
real(sp), intent(out) |
c, |
|
|
real(sp), intent(out) |
s, |
|
|
real(sp), dimension(*), intent(out) |
work, |
|
|
integer(ilp), dimension(*), intent(out) |
iwork, |
|
|
integer(ilp), intent(out) |
info |
|
) |
| |
The documentation for this interface was generated from the following file:
1.9.8