NAG FL Interface
f08krf (zgesdd)

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

1: $\mathbf{jobz}$ – Character(1) Input

On entry: specifies options for computing all or part of the matrix $U$.

$\mathbf{jobz}=\text{'A'}$

All $m$ columns of $U$ and all $n$ rows of $V^{\mathrm{H}}$ are returned in the arrays u and vt.

$\mathbf{jobz}=\text{'S'}$

The first $\min (m,n)$ columns of $U$ and the first $\min (m,n)$ rows of $V^{\mathrm{H}}$ are returned in the arrays u and vt.

$\mathbf{jobz}=\text{'O'}$

If $\mathbf{m}\ge \mathbf{n}$, the first $n$ columns of $U$ are overwritten on the array a and all rows of $V^{\mathrm{H}}$ are returned in the array vt. Otherwise, all columns of $U$ are returned in the array u and the first $m$ rows of $V^{\mathrm{H}}$ are overwritten in the array vt.

$\mathbf{jobz}=\text{'N'}$

No columns of $U$ or rows of $V^{\mathrm{H}}$ are computed.

Constraint: $\mathbf{jobz}=\text{'A'}$, $\text{'S'}$, $\text{'O'}$ or $\text{'N'}$.

2: $\mathbf{m}$ – Integer Input

On entry: $m$, the number of rows of the matrix $A$.

Constraint: $\mathbf{m}\ge 0$.

3: $\mathbf{n}$ – Integer Input

On entry: $n$, the number of columns of the matrix $A$.

Constraint: $\mathbf{n}\ge 0$.

4: $\mathbf{a}(\mathbf{lda},*)$ – Complex (Kind=nag_wp) array Input/Output

Note: the second dimension of the array a must be at least $\max (1,\mathbf{n})$.

On entry: the $m\times n$ matrix $A$.

On exit: if $\mathbf{jobz}=\text{'O'}$, a is overwritten with the first $n$ columns of $U$ (the left singular vectors, stored column-wise) if $\mathbf{m}\ge \mathbf{n}$; a is overwritten with the first $m$ rows of $V^{\mathrm{H}}$ (the right singular vectors, stored row-wise) otherwise.

If $\mathbf{jobz}\ne \text{'O'}$, the contents of a are destroyed.

5: $\mathbf{lda}$ – Integer Input

On entry: the first dimension of the array a as declared in the (sub)program from which f08krf is called.

Constraint: $\mathbf{lda}\ge \max (1,\mathbf{m})$.

6: $\mathbf{s}\left(\min (\mathbf{m},\mathbf{n})\right)$ – Real (Kind=nag_wp) array Output

On exit: the singular values of $A$, sorted so that $\mathbf{s}\left(i\right)\ge \mathbf{s}\left(i+1\right)$.

7: $\mathbf{u}(\mathbf{ldu},*)$ – Complex (Kind=nag_wp) array Output

Note: the second dimension of the array u must be at least $\max (1,\mathbf{m})$ if $\mathbf{jobz}=\text{'A'}$ or ($\mathbf{jobz}=\text{'O'}$ and $\mathbf{m}<\mathbf{n}$), $\max (1,\min (\mathbf{m},\mathbf{n}))$ if $\mathbf{jobz}=\text{'S'}$, and at least $1$ otherwise.

On exit:

If $\mathbf{jobz}=\text{'A'}$ or $\mathbf{jobz}=\text{'O'}$ and $\mathbf{m}<\mathbf{n}$, u contains the $m\times m$ unitary matrix $U$.

If $\mathbf{jobz}=\text{'S'}$, u contains the first $\min (m,n)$ columns of $U$ (the left singular vectors, stored column-wise).

If $\mathbf{jobz}=\text{'O'}$ and $\mathbf{m}\ge \mathbf{n}$, or $\mathbf{jobz}=\text{'N'}$, u is not referenced.

8: $\mathbf{ldu}$ – Integer Input

On entry: the first dimension of the array u as declared in the (sub)program from which f08krf is called.

Constraints:

• if $\mathbf{jobz}=\text{'S'}$ or $\text{'A'}$ or ($\mathbf{jobz}=\text{'O'}$ and $\mathbf{m}<\mathbf{n}$), $\mathbf{ldu}\ge \max (1,\mathbf{m})$;
• otherwise $\mathbf{ldu}\ge 1$.

9: $\mathbf{vt}(\mathbf{ldvt},*)$ – Complex (Kind=nag_wp) array Output

Note: the second dimension of the array vt must be at least $\max (1,\mathbf{n})$ if $\mathbf{jobz}=\text{'A'}$ or $\text{'S'}$ or ($\mathbf{jobz}=\text{'O'}$ and $\mathbf{m}\ge \mathbf{n}$), and at least $1$ otherwise.

On exit: if $\mathbf{jobz}=\text{'A'}$ or $\mathbf{jobz}=\text{'O'}$ and $\mathbf{m}\ge \mathbf{n}$, vt contains the $n\times n$ unitary matrix $V^{\mathrm{H}}$.

If $\mathbf{jobz}=\text{'S'}$, vt contains the first $\min (m,n)$ rows of $V^{\mathrm{H}}$ (the right singular vectors, stored row-wise).

If $\mathbf{jobz}=\text{'O'}$ and $\mathbf{m}<\mathbf{n}$, or $\mathbf{jobz}=\text{'N'}$, vt is not referenced.

10: $\mathbf{ldvt}$ – Integer Input

On entry: the first dimension of the array vt as declared in the (sub)program from which f08krf is called.

Constraints:

• if $\mathbf{jobz}=\text{'A'}$ or ($\mathbf{jobz}=\text{'O'}$ and $\mathbf{m}\ge \mathbf{n}$), $\mathbf{ldvt}\ge \max (1,\mathbf{n})$;
• if $\mathbf{jobz}=\text{'S'}$, $\mathbf{ldvt}\ge \max (1,\min (\mathbf{m},\mathbf{n}))$;
• otherwise $\mathbf{ldvt}\ge 1$.

11: $\mathbf{work}\left(\max (1,\mathbf{lwork})\right)$ – Complex (Kind=nag_wp) array Workspace

On exit: if $\mathbf{info}=\mathbf{0}$, the real part of $\mathbf{work}\left(1\right)$ contains the minimum value of lwork required for optimal performance.

12: $\mathbf{lwork}$ – Integer Input

On entry: the dimension of the array work as declared in the (sub)program from which f08krf is called.

If $\mathbf{lwork}=\mathrm{-1}$, a workspace query is assumed; the routine only calculates the optimal size of the work array, returns this value as the first entry of the work array, and no error message related to lwork is issued.

Suggested value: for optimal performance, lwork should generally be larger. Consider increasing lwork by at least $\mathit{nb}\times \min (\mathbf{m},\mathbf{n})$, where $\mathit{nb}$ is the optimal block size.

Constraints:

if $\mathbf{lwork}\ne \mathrm{-1}$,

• if $\mathbf{jobz}=\text{'N'}$, $\mathbf{lwork}\ge 2\times \min (\mathbf{m},\mathbf{n})+\max (1,\mathbf{m},\mathbf{n})$;
• if $\mathbf{jobz}=\text{'O'}$, $\mathbf{lwork}\ge 2\times \min (\mathbf{m},\mathbf{n})\times \min (\mathbf{m},\mathbf{n})+2\times \min (\mathbf{m},\mathbf{n})+\max (1,\mathbf{m},\mathbf{n})$;
• if $\mathbf{jobz}=\text{'S'}$ or $\text{'A'}$, $\mathbf{lwork}\ge \min (\mathbf{m},\mathbf{n})\times \min (\mathbf{m},\mathbf{n})+2\times \min (\mathbf{m},\mathbf{n})+\max (1,\mathbf{m},\mathbf{n})$;
• otherwise $\mathbf{lwork}\ge 1$.

13: $\mathbf{rwork}\left(*\right)$ – Real (Kind=nag_wp) array Workspace

Note: the dimension of the array rwork must be at least $\max (1,7\times \min (\mathbf{m},\mathbf{n}))$ if $\mathbf{jobz}=\text{'N'}$, and at least $\max (1,\min (\mathbf{m},\mathbf{n})\times \max (5\times \min (\mathbf{m},\mathbf{n})+7,2\times \max (\mathbf{m},\mathbf{n})+2\times \min (\mathbf{m},\mathbf{n})+1))$ otherwise.

14: $\mathbf{iwork}\left(8\times \min (\mathbf{m},\mathbf{n})\right)$ – Integer array Workspace

15: $\mathbf{info}$ – Integer Output

On exit: $\mathbf{info}=0$ unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

$\mathbf{info}<0$

If $\mathbf{info}=-i$, argument $i$ had an illegal value. An explanatory message is output, and execution of the program is terminated.

$\mathbf{info}>0$

f08krf did not converge, the updating process failed.

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results