1DLASD0(1) LAPACK auxiliary routine (version 3.2) DLASD0(1)
2
3
4
6 DLASD0 - a divide and conquer approach, DLASD0 computes the singular
7 value decomposition (SVD) of a real upper bidiagonal N-by-M matrix B
8 with diagonal D and offdiagonal E, where M = N + SQRE
9
11 SUBROUTINE DLASD0( N, SQRE, D, E, U, LDU, VT, LDVT, SMLSIZ, IWORK,
12 WORK, INFO )
13
14 INTEGER INFO, LDU, LDVT, N, SMLSIZ, SQRE
15
16 INTEGER IWORK( * )
17
18 DOUBLE PRECISION D( * ), E( * ), U( LDU, * ), VT( LDVT, *
19 ), WORK( * )
20
22 Using a divide and conquer approach, DLASD0 computes the singular value
23 decomposition (SVD) of a real upper bidiagonal N-by-M matrix B with
24 diagonal D and offdiagonal E, where M = N + SQRE. The algorithm com‐
25 putes orthogonal matrices U and VT such that B = U * S * VT. The singu‐
26 lar values S are overwritten on D. A related subroutine, DLASDA, com‐
27 putes only the singular values, and optionally, the singular vectors in
28 compact form.
29
31 N (input) INTEGER
32 On entry, the row dimension of the upper bidiagonal matrix.
33 This is also the dimension of the main diagonal array D.
34
35 SQRE (input) INTEGER
36 Specifies the column dimension of the bidiagonal matrix. = 0:
37 The bidiagonal matrix has column dimension M = N;
38 = 1: The bidiagonal matrix has column dimension M = N+1;
39
40 D (input/output) DOUBLE PRECISION array, dimension (N)
41 On entry D contains the main diagonal of the bidiagonal matrix.
42 On exit D, if INFO = 0, contains its singular values.
43
44 E (input) DOUBLE PRECISION array, dimension (M-1)
45 Contains the subdiagonal entries of the bidiagonal matrix. On
46 exit, E has been destroyed.
47
48 U (output) DOUBLE PRECISION array, dimension at least (LDQ, N)
49 On exit, U contains the left singular vectors.
50
51 LDU (input) INTEGER
52 On entry, leading dimension of U.
53
54 VT (output) DOUBLE PRECISION array, dimension at least (LDVT, M)
55 On exit, VT' contains the right singular vectors.
56
57 LDVT (input) INTEGER
58 On entry, leading dimension of VT. SMLSIZ (input) INTEGER On
59 entry, maximum size of the subproblems at the bottom of the com‐
60 putation tree.
61
62 IWORK (workspace) INTEGER work array.
63 Dimension must be at least (8 * N)
64
65 WORK (workspace) DOUBLE PRECISION work array.
66 Dimension must be at least (3 * M**2 + 2 * M)
67
68 INFO (output) INTEGER
69 = 0: successful exit.
70 < 0: if INFO = -i, the i-th argument had an illegal value.
71 > 0: if INFO = 1, an singular value did not converge
72
74 Based on contributions by
75 Ming Gu and Huan Ren, Computer Science Division, University of
76 California at Berkeley, USA
77
78
79
80 LAPACK auxiliary routine (versionNo3v.e2m)ber 2008 DLASD0(1)