NAG FL Interface
f08rnf (zuncsd)

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

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

On entry:

• if $\mathbf{jobu1}=\text{'Y'}$, $U_1$ is computed;
• otherwise, $U_1$ is not computed.

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

On entry:

• if $\mathbf{jobu2}=\text{'Y'}$, $U_2$ is computed;
• otherwise, $U_2$ is not computed.

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

On entry:

• if $\mathbf{jobv1t}=\text{'Y'}$, $V_1^{\mathrm{T}}$ is computed;
• otherwise, $V_1^{\mathrm{T}}$ is not computed.

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

On entry:

• if $\mathbf{jobv2t}=\text{'Y'}$, $V_2^{\mathrm{T}}$ is computed;
• otherwise, $V_2^{\mathrm{T}}$ is not computed.

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

On entry:

• if $\mathbf{trans}=\text{'T'}$, $X$, $U_1$, $U_2$, $V_1^{\mathrm{T}}$ and $V_2^{\mathrm{T}}$ are stored in row-major order;
• otherwise, $X$, $U_1$, $U_2$, $V_1^{\mathrm{T}}$ and $V_2^{\mathrm{T}}$ are stored in column-major order.

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

On entry:

• if $\mathbf{signs}=\text{'O'}$, the lower-left block is made nonpositive (the other convention);
• otherwise, the upper-right block is made nonpositive (the default convention).

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

On entry: $m$, the number of rows and columns in the unitary matrix $X$.

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

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

On entry: $p$, the number of rows in $X_{11}$ and $X_{12}$.

Constraint: $0\le \mathbf{p}\le \mathbf{m}$.

9: $\mathbf{q}$ – Integer Input

On entry: $q$, the number of columns in $X_{11}$ and $X_{21}$.

Constraint: $0\le \mathbf{q}\le \mathbf{m}$.

10: $\mathbf{x11}\left(\mathbf{ldx11},*\right)$ – Complex (Kind=nag_wp) array Input/Output

Note: the second dimension of the array x11 must be at least $\max \left(1,\mathbf{p}\right)$ if $\mathbf{trans}=\text{'T'}$, and at least $\mathbf{q}$ otherwise.

On entry: the upper left partition of the unitary matrix $X$ whose CSD is desired.

On exit: contains details of the unitary matrix used in a simultaneous bidiagonalization process.

11: $\mathbf{ldx11}$ – Integer Input

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

Constraints:

• if $\mathbf{trans}=\text{'T'}$, $\mathbf{ldx11}\ge \max \left(1,\mathbf{q}\right)$;
• otherwise $\mathbf{ldx11}\ge \max \left(1,\mathbf{p}\right)$.

12: $\mathbf{x12}\left(\mathbf{ldx12},*\right)$ – Complex (Kind=nag_wp) array Input/Output

Note: the second dimension of the array x12 must be at least $\max \left(1,\mathbf{p}\right)$ if $\mathbf{trans}=\text{'T'}$, and at least $\mathbf{m}-\mathbf{q}$ otherwise.

On entry: the upper right partition of the unitary matrix $X$ whose CSD is desired.

On exit: contains details of the unitary matrix used in a simultaneous bidiagonalization process.

13: $\mathbf{ldx12}$ – Integer Input

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

Constraints:

• if $\mathbf{trans}=\text{'T'}$, $\mathbf{ldx12}\ge \max \left(1,\mathbf{m}-\mathbf{q}\right)$;
• otherwise $\mathbf{ldx12}\ge \max \left(1,\mathbf{p}\right)$.

14: $\mathbf{x21}\left(\mathbf{ldx21},*\right)$ – Complex (Kind=nag_wp) array Input/Output

Note: the second dimension of the array x21 must be at least $\max \left(1,\mathbf{m}-\mathbf{p}\right)$ if $\mathbf{trans}=\text{'T'}$, and at least $\mathbf{q}$ otherwise.

On entry: the lower left partition of the unitary matrix $X$ whose CSD is desired.

On exit: contains details of the unitary matrix used in a simultaneous bidiagonalization process.

15: $\mathbf{ldx21}$ – Integer Input

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

Constraints:

• if $\mathbf{trans}=\text{'T'}$, $\mathbf{ldx21}\ge \max \left(1,\mathbf{q}\right)$;
• otherwise $\mathbf{ldx21}\ge \max \left(1,\mathbf{m}-\mathbf{p}\right)$.

16: $\mathbf{x22}\left(\mathbf{ldx22},*\right)$ – Complex (Kind=nag_wp) array Input/Output

Note: the second dimension of the array x22 must be at least $\max \left(1,\mathbf{m}-\mathbf{p}\right)$ if $\mathbf{trans}=\text{'T'}$, and at least $\mathbf{m}-\mathbf{q}$ otherwise.

On entry: the lower right partition of the unitary matrix $X$ CSD is desired.

On exit: contains details of the unitary matrix used in a simultaneous bidiagonalization process.

17: $\mathbf{ldx22}$ – Integer Input

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

Constraints:

• if $\mathbf{trans}=\text{'T'}$, $\mathbf{ldx22}\ge \max \left(1,\mathbf{m}-\mathbf{q}\right)$;
• otherwise $\mathbf{ldx22}\ge \max \left(1,\mathbf{m}-\mathbf{p}\right)$.

18: $\mathbf{theta}\left(\min \left(\mathbf{p},\mathbf{m}-\mathbf{p},\mathbf{q},\mathbf{m}-\mathbf{q}\right)\right)$ – Real (Kind=nag_wp) array Output

On exit: the values ${\theta }_i$ for $i=1,2,\dots ,r$ where $r=\min \left(p,m-p,q,m-q\right)$. The diagonal submatrices $C$ and $S$ of ${\Sigma }_p$ are constructed from these values as

• $C=\mathrm{diag}\left(\cos \left(\mathbf{theta}\left(1\right)\right),\dots ,\cos \left(\mathbf{theta}\left(r\right)\right)\right)$ and
• $S=\mathrm{diag}\left(\sin \left(\mathbf{theta}\left(1\right)\right),\dots ,\sin \left(\mathbf{theta}\left(r\right)\right)\right)$.

19: $\mathbf{u1}\left(\mathbf{ldu1},*\right)$ – Complex (Kind=nag_wp) array Output

Note: the second dimension of the array u1 must be at least $\max \left(1,\mathbf{p}\right)$ if $\mathbf{jobu1}=\text{'Y'}$, and at least $1$ otherwise.

On exit: if $\mathbf{jobu1}=\text{'Y'}$, u1 contains the $p$ by $p$ unitary matrix $U_1$.

20: $\mathbf{ldu1}$ – Integer Input

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

Constraint: if $\mathbf{jobu1}=\text{'Y'}$, $\mathbf{ldu1}\ge \max \left(1,\mathbf{p}\right)$.

21: $\mathbf{u2}\left(\mathbf{ldu2},*\right)$ – Complex (Kind=nag_wp) array Output

Note: the second dimension of the array u2 must be at least $\max \left(1,\mathbf{m}-\mathbf{p}\right)$ if $\mathbf{jobu2}=\text{'Y'}$, and at least $1$ otherwise.

On exit: if $\mathbf{jobu2}=\text{'Y'}$, u2 contains the $m-p$ by $m-p$ unitary matrix $U_2$.

22: $\mathbf{ldu2}$ – Integer Input

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

Constraint: if $\mathbf{jobu2}=\text{'Y'}$, $\mathbf{ldu2}\ge \max \left(1,\mathbf{m}-\mathbf{p}\right)$.

23: $\mathbf{v1t}\left(\mathbf{ldv1t},*\right)$ – Complex (Kind=nag_wp) array Output

Note: the second dimension of the array v1t must be at least $\max \left(1,\mathbf{q}\right)$ if $\mathbf{jobv1t}=\text{'Y'}$, and at least $1$ otherwise.

On exit: if $\mathbf{jobv1t}=\text{'Y'}$, v1t contains the $q$ by $q$ unitary matrix ${V_1}^{\mathrm{H}}$.

24: $\mathbf{ldv1t}$ – Integer Input

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

Constraint: if $\mathbf{jobv1t}=\text{'Y'}$, $\mathbf{ldv1t}\ge \max \left(1,\mathbf{q}\right)$.

25: $\mathbf{v2t}\left(\mathbf{ldv2t},*\right)$ – Complex (Kind=nag_wp) array Output

Note: the second dimension of the array v2t must be at least $\max \left(1,\mathbf{m}-\mathbf{q}\right)$ if $\mathbf{jobv2t}=\text{'Y'}$, and at least $1$ otherwise.

On exit: if $\mathbf{jobv2t}=\text{'Y'}$, v2t contains the $m-q$ by $m-q$ unitary matrix ${V_2}^{\mathrm{H}}$.

26: $\mathbf{ldv2t}$ – Integer Input

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

Constraint: if $\mathbf{jobv2t}=\text{'Y'}$, $\mathbf{ldv2t}\ge \max \left(1,\mathbf{m}-\mathbf{q}\right)$.

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

On exit: if $\mathbf{info}=\mathbf{0}$, $\mathbf{work}\left(1\right)$ returns the optimal lwork.

If $\mathbf{info}>\mathbf{0}$ on exit, $\mathbf{work}\left(2:\mathit{r}\right)$ contains the values $\mathrm{PHI}\left(1\right),\dots \mathrm{PHI}\left(\mathit{r}-1\right)$ that, together with ${\mathrm{xref}}^{\arg }\left(1\right),\dots {\mathrm{xref}}^{\arg }\left(\mathit{r}\right)$, define the matrix in intermediate bidiagonal-block form remaining after nonconvergence. info specifies the number of nonzero PHI's.

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

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

If $\mathbf{lwork}=-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.

The minimum workspace required is $$\begin{gathered} \max \left(1,\mathbf{p}\right)+\max \left(1,\mathbf{m}-\mathbf{p}\right)+\max \left(1,\mathbf{q}\right)+ \\ \max \left(1,\mathbf{m}-\mathbf{q}\right)+\max \left(1,\mathbf{p},\mathbf{m}-\mathbf{p},\mathbf{q},\mathbf{m}-\mathbf{q}\right)+1 \end{gathered}$$; the optimal amount of workspace depends on internal block sizes and the relative problem dimensions.

Constraint:
$\mathbf{lwork}=-1$ or $$\begin{gathered} \mathbf{lwork}\ge \max \left(1,\mathbf{p}\right)+\max \left(1,\mathbf{m}-\mathbf{p}\right)+\max \left(1,\mathbf{q}\right)+ \\ \max \left(1,\mathbf{m}-\mathbf{q}\right)+\max \left(1,\mathbf{p},\mathbf{m}-\mathbf{p},\mathbf{q},\mathbf{m}-\mathbf{q}\right)+1 \end{gathered}$$.

29: $\mathbf{rwork}\left(\max \left(1,\mathbf{lrwork}\right)\right)$ – Real (Kind=nag_wp) array Workspace

30: $\mathbf{lrwork}$ – Integer Input

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

If $\mathbf{lrwork}=-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 lrwork is issued. Otherwise the required workspace is $5\times \max \left(1,\mathbf{q}-1\right)+4\times \max \left(1,\mathbf{q}\right)+\max \left(1,8\times \mathbf{q}\right)+1$ which equates to $11$ for $\mathbf{q}=0$, $18$ for $\mathbf{q}=1$ and $17\times \mathbf{q}-4$ when $\mathbf{q}>1$.

Constraint:
$\mathbf{lrwork}=-1$ or $\mathbf{lrwork}\ge 5\times \max \left(1,\mathbf{q}-1\right)+4\times \max \left(1,\mathbf{q}\right)+\max \left(1,8\times \mathbf{q}\right)+1$.

31: $\mathbf{iwork}\left(\mathbf{m}-\min \left(\mathbf{p},\mathbf{m}-\mathbf{p},\mathbf{q},\mathbf{m}-\mathbf{q}\right)\right)$ – Integer array Workspace

32: $\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$

The Jacobi-type procedure failed to converge during an internal reduction to bidiagonal-block form. The process requires convergence to $\min \left(\mathbf{p},\mathbf{m}-\mathbf{p},\mathbf{q},\mathbf{m}-\mathbf{q}\right)$ values, the value of info gives the number of converged values.

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results