NAG FL Interface
f08kvf (zgejsv)

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

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

On entry: specifies the form of pivoting for the $QR$ factorization stage; whether an estimate of the condition number of the scaled matrix is required; and the form of rank reduction that is performed.

$\mathbf{joba}=\text{'C'}$

The initial $QR$ factorization of the input matrix is performed with column pivoting; no estimate of condition number is computed; and, the rank is reduced by only the underflowed part of the triangular factor $R$. This option works well (high relative accuracy) if $A$ can be written in the form $A=BD$, with well-conditioned $B$ and arbitrary diagonal matrix $D$. The accuracy cannot be spoiled by column scaling. The accuracy of the computed output depends on the condition of $B$, and the procedure attempts to achieve the best theoretical accuracy.

$\mathbf{joba}=\text{'E'}$

Computation as with $\mathbf{joba}=\text{'C'}$ with an additional estimate of the condition number of $B$. It provides a realistic error bound.

$\mathbf{joba}=\text{'F'}$

The initial $QR$ factorization of the input matrix is performed with full row and column pivoting; no estimate of condition number is computed; and, the rank is reduced by only the underflowed part of the triangular factor $R$. If $A=D_1\times C\times D_2$ with ill-conditioned diagonal scalings $D_1$, $D_2$, and well-conditioned matrix $C$, this option gives higher accuracy than the $\mathbf{joba}=\text{'C'}$ option. If the structure of the input matrix is not known, and relative accuracy is desirable, then this option is advisable.

$\mathbf{joba}=\text{'G'}$

Computation as with $\mathbf{joba}=\text{'F'}$ with an additional estimate of the condition number of $B$, where $A=DB$ (i.e., $B=C\times D_2$). If $A$ has heavily weighted rows, then using this condition number gives too pessimistic an error bound.

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

Computation as with $\mathbf{joba}=\text{'C'}$ except in the treatment of rank reduction. In this case, small singular values are to be considered as noise and, if found, the matrix is treated as numerically rank deficient. The computed SVD, $A=U\Sigma V^{\mathrm{H}}$, is such that the relative residual norm (when comparing against $A$) is of the order $\mathit{O}\left(m\right)\times \epsilon$, where $\epsilon$ is machine precision. This gives the procedure licence to discard (set to zero) all singular values below $\mathbf{n}\times \epsilon \times ‖A‖$.

$\mathbf{joba}=\text{'R'}$

Similar to $\mathbf{joba}=\text{'A'}$. The rank revealing property of the initial $QR$ factorization is used to reveal (using the upper triangular factor) a gap, ${\sigma }_{r+1}<\epsilon {\sigma }_r$, in which case the numerical rank is declared to be $r$. The SVD is computed with absolute error bounds, but more accurately than with $\mathbf{joba}=\text{'A'}$.

Constraint: $\mathbf{joba}=\text{'C'}$, $\text{'E'}$, $\text{'F'}$, $\text{'G'}$, $\text{'A'}$ or $\text{'R'}$.

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

On entry: specifies options for computing the left singular vectors $U$.

$\mathbf{jobu}=\text{'U'}$

The first $n$ left singular vectors (columns of $U$) are computed and returned in the array u.

$\mathbf{jobu}=\text{'F'}$

All $m$ left singular vectors are computed and returned in the array u.

$\mathbf{jobu}=\text{'W'}$

No left singular vectors are computed, but the array u (with $\mathbf{ldu}\ge \mathbf{m}$ and second dimension at least n) is available as workspace for computing right singular values. See the description of u.

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

No left singular vectors are computed. $\mathbf{u}$ is not referenced when $\mathbf{jobv}=\text{'W'}$ or $\text{'N'}$.

Constraint: $\mathbf{jobu}=\text{'U'}$, $\text{'F'}$, $\text{'W'}$ or $\text{'N'}$.

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

On entry: specifies options for computing the right singular vectors $V$.

$\mathbf{jobv}=\text{'V'}$

The $n$ right singular vectors (columns of $V$) are computed and returned in the array v; Jacobi rotations are not explicitly accumulated.

$\mathbf{jobv}=\text{'J'}$

The $n$ right singular vectors (columns of $V$) are computed and returned in the array v, but they are computed as the product of Jacobi rotations. This option is allowed only if $\mathbf{jobu}=\text{'U'}$ or $\text{'F'}$, i.e., in computing the full SVD.

This is equivalent to multiplying the input matrix, on the right, by the matrix $V$.

$\mathbf{jobv}=\text{'W'}$

No right singular values are computed, but the array v (with $\mathbf{ldv}\ge \mathbf{n}$ and second dimension at least n) is available as workspace for computing left singular values. See the description of v.

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

No right singular vectors are computed. $\mathbf{v}$ is not referenced when $\mathbf{jobu}=\text{'W'}$ or $\text{'N'}$ or $\mathbf{jobt}=\text{'N'}$ or $\mathbf{m}\ne \mathbf{n}$.

Constraints:

• $\mathbf{jobv}=\text{'V'}$, $\text{'J'}$, $\text{'W'}$ or $\text{'N'}$;
• if $\mathbf{jobu}=\text{'W'}$ or $\text{'N'}$, $\mathbf{jobv}\ne \text{'J'}$.

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

On entry: specifies the conditions under which columns of $A$ are to be set to zero. This effectively specifies a lower limit on the range of singular values; any singular values below this limit are (through column zeroing) set to zero. If $A\ne 0$ is scaled so that the largest column (in the Euclidean norm) of $cA$ is equal to the square root of the overflow threshold, then jobr allows the routine to kill columns of $A$ whose norm in $cA$ is less than $\sqrt{\mathit{sfmin}}$ (for $\mathbf{jobr}=\text{'R'}$), or less than $\mathit{sfmin}/\epsilon$ (otherwise). $\mathit{sfmin}$ is the safe range parameter, as returned by routine x02amf.

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

Only set to zero those columns of $A$ for which the norm of corresponding column of $cA<\mathit{sfmin}/\epsilon$, that is, those columns that are effectively zero (to machine precision) anyway. If the condition number of $A$ is greater than the overflow threshold $\lambda$, where $\lambda$ is the value returned by x02alf, you are recommended to use routine f08kwf.

$\mathbf{jobr}=\text{'R'}$

Set to zero those columns of $A$ for which the norm of the corresponding column of $cA<\sqrt{\mathit{sfmin}}$. This approximately represents a restricted range for $\sigma \left(cA\right)$ of $\left[\sqrt{\mathit{sfmin}},\sqrt{\lambda }\right]$.

For computing the singular values in the full range from the safe minimum up to the overflow threshold use f08kwf.

Suggested value: $\mathbf{jobr}=\text{'R'}$.

Constraint: $\mathbf{jobr}=\text{'N'}$ or $\text{'R'}$.

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

On entry: specifies, in the case $n=m$, whether the routine is permitted to use the conjugate transpose of $A$ for improved efficiency. If the matrix is square, then the procedure may use $A^{\mathrm{H}}$ if it seems to be better with respect to convergence. If the matrix is not square, jobt is ignored. The decision is based on two values of entropy over the adjoint orbit of $A^{\mathrm{H}}A$. See the descriptions of $\mathbf{rwork}\left(6\right)$ and $\mathbf{rwork}\left(7\right)$.

$\mathbf{jobt}=\text{'T'}$

If $n=m$, perform an entropy test and, if the test indicates possibly faster convergence of the Jacobi process when using $A^{\mathrm{H}}$, then form the conjugate transpose $A^{\mathrm{H}}$. If $A$ is replaced with $A^{\mathrm{H}}$, then the row pivoting is included automatically.

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

No entropy test and no transposition is performed.

The option $\mathbf{jobt}=\text{'T'}$ can be used to compute only the singular values, or the full SVD ($U$, $\Sigma$ and $V$). In the case where only one set of singular vectors ($U$ or $V$) is required, the caller must still provide both u and v, as one of the matrices is used as workspace if the matrix $A$ is transposed. See the descriptions of u and v.

Constraint: $\mathbf{jobt}=\text{'T'}$ or $\text{'N'}$.

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

On entry: specifies whether the routine should be allowed to introduce structured perturbations to drown denormalized numbers. For details see Drmač and Veselić (2008a) and Drmač and Veselić (2008b). For the sake of simplicity, these perturbations are included only when the full SVD or only the singular values are requested.

$\mathbf{jobp}=\text{'P'}$

Introduce perturbation if $A$ is found to be very badly scaled (introducing denormalized numbers).

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

Do not perturb.

Constraint: $\mathbf{jobp}=\text{'P'}$ or $\text{'N'}$.

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

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

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

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

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

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

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

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

On entry: the $m$ by $n$ matrix $A$.

On exit: the contents of a are overwritten.

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

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

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

11: $\mathbf{sva}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Output

On exit: the, possibly scaled, singular values of $A$.

The singular values of $A$ are ${\sigma }_{\mathit{i}}=\alpha \times \mathbf{sva}\left(\mathit{i}\right)$, for $\mathit{i}=1,2,\dots ,n$, where $\alpha =\mathbf{rwork}\left(1\right)/\mathbf{rwork}\left(2\right)$. Normally $\alpha =1$ and no scaling is required to obtain the singular values. However, if the largest singular value of $A$ overflows or if small singular values have been saved from underflow by scaling the input matrix $A$, then $\alpha \ne 1$.

If $\mathbf{jobr}=\text{'R'}$, then some of the singular values may be returned as exact zeros because they are below the numerical rank threshold or are denormalized numbers.

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

Note: the second dimension of the array u must be at least $\max \left(1,\mathbf{m}\right)$ if $\mathbf{jobu}=\text{'F'}$, $\max \left(1,\mathbf{n}\right)$ if $\mathbf{jobu}=\text{'U'}$ or $\text{'W'}$, and at least $1$ otherwise.

On exit: if $\mathbf{jobu}=\text{'U'}$, u contains the $m$ by $n$ matrix of left singular vectors.

If $\mathbf{jobu}=\text{'F'}$, u contains the $m$ by $m$ matrix of left singular vectors, including an orthonormal basis of the orthogonal complement of Range($A$).

u is not referenced when $\mathbf{jobu}=\text{'W'}$ or $\text{'N'}$ and one of the following is satisfied:

• $\mathbf{jobv}=\text{'W'}$ or $\text{'N'}$, or
• $\mathbf{n}=1$, or
• $A$ is the zero matrix.

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

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

Constraints:

• if $\mathbf{jobu}=\text{'U'}$, $\text{'F'}$ or $\text{'W'}$, $\mathbf{ldu}\ge \max \left(1,\mathbf{m}\right)$;
• otherwise $\mathbf{ldu}\ge 1$.

14: $\mathbf{v}\left(\mathbf{ldv},*\right)$ – Complex (Kind=nag_wp) array Output

Note: the second dimension of the array v must be at least $\max \left(1,\mathbf{n}\right)$ if $\mathbf{jobv}=\text{'V'}$, $\text{'J'}$ or $\text{'W'}$, and at least $1$ otherwise.

On exit: if $\mathbf{jobv}=\text{'V'}$ or $\text{'J'}$, v contains the $n$ by $n$ matrix of right singular vectors.

v is not referenced when $\mathbf{jobv}=\text{'W'}$ or $\text{'N'}$ and one of the following is satisfied:

• $\mathbf{jobu}=\text{'U'}$ or $\text{'F'}$ and $\mathbf{jobt}=\text{'T'}$, or
• $\mathbf{n}=1$, or
• $A$ is the zero matrix.

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

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

Constraints:

• if $\mathbf{jobv}=\text{'V'}$, $\text{'J'}$ or $\text{'W'}$, $\mathbf{ldv}\ge \max \left(1,\mathbf{n}\right)$;
• otherwise $\mathbf{ldv}\ge 1$.

16: $\mathbf{cwork}\left(\mathbf{lwork}\right)$ – Complex (Kind=nag_wp) array Workspace

On exit: if $\mathbf{info}=\mathbf{0}$, $\mathbf{cwork}\left(1\right)$ contains the required minimal size of lwork.

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

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

If $\mathbf{jobu}=\text{'N'}$ or $\text{'W'}$

if $\mathbf{jobv}=\text{'N'}$ or $\text{'W'}$

if $\mathbf{joba}\ne \text{'E'}$ or $\text{'G'}$

the minimal requirement is $\mathbf{lwork}\ge 2\mathbf{n}+1$;

for optimal performance the requirement is $\mathbf{lwork}\ge \mathbf{n}+\left(\mathbf{n}+1\right)\times \mathit{nb}$, where $\mathit{nb}$ is the block size used by f08asf and f08btf. Assuming a value of $\mathit{nb}=256$ is wise, but choosing a smaller value (e.g., $\mathit{nb}=128$) should still lead to acceptable performance.

if $\mathbf{joba}=\text{'E'}$ or $\text{'G'}$

the minimal requirement is $\mathbf{lwork}\ge \mathbf{n}\left(\mathbf{n}+3\right)$;

for optimal performance the requirement is $\mathbf{lwork}\ge \max \left(\mathbf{n}+\left(\mathbf{n}+1\right)\times \mathit{nb},\mathbf{n}\left(\mathbf{n}+3\right)\right)$.

if $\mathbf{jobv}=\text{'V'}$ or $\text{'J'}$

the minimal requirement is $\mathbf{lwork}\ge 3\mathbf{n}$;

for optimal performance the requirement is $\mathbf{lwork}\ge \max \left(\mathit{nb},\mathbf{n}\right)+\mathbf{n}\left(\mathit{nb}+1\right)$.

If $\mathbf{jobu}=\text{'U'}$ or $\text{'F'}$ and $\mathbf{n}\ne 1$

if $\mathbf{jobv}=\text{'N'}$ or $\text{'W'}$

the minimal requirement is $\mathbf{lwork}\ge 3\mathbf{n}$;

for optimal performance the requirement is $\mathbf{lwork}\ge \max \left(\mathit{nb},\mathbf{n}\right)+\mathbf{n}\left(\mathit{nb}+1\right)$.

if $\mathbf{jobv}=\text{'V'}$

the minimal requirement is $\mathbf{lwork}\ge \mathbf{n}\left(2\mathbf{n}+5\right)$;

for optimal performance the minimal requirement is sufficient.

if $\mathbf{jobv}=\text{'J'}$

the minimal requirement is $\mathbf{lwork}\ge \mathbf{n}\left(\mathbf{n}+4\right)$;

for optimal performance the minimal requirement is sufficient.

If $\mathbf{jobu}=\text{'U'}$ or $\text{'F'}$ and $\mathbf{n}=1$

the minimal workspace requirement is $\mathbf{lwork}\ge \mathbf{m}+1$;

for optimal performance, $\mathbf{lwork}\ge \mathbf{m}\times \mathit{nb}+1$.

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

On exit: contains information about the completed job.

$\mathbf{rwork}\left(1\right)$

$\alpha =\mathbf{rwork}\left(1\right)/\mathbf{rwork}\left(2\right)$ is the scaling factor such that ${\sigma }_{\mathit{i}}=\alpha \times \mathbf{sva}\left(\mathit{i}\right)$, for $\mathit{i}=1,2,\dots ,n$, are the computed singular values of $A$. See the description of $\mathbf{sva}$.

$\mathbf{rwork}\left(2\right)$

See the description of $\mathbf{rwork}\left(1\right)$.

$\mathbf{rwork}\left(3\right)$

$\mathit{sconda}$, an estimate for the condition number of column equilibrated $A$ (if $\mathbf{joba}=\text{'E'}$ or $\text{'G'}$). $\mathit{sconda}$ is an estimate of $\sqrt{\left({‖{\left(R^{\mathrm{H}}R\right)}^{-1}‖}_1\right)}$. It is computed using f07fgf. It satisfies $n^{-\frac{1}{4}}\times \mathit{sconda}\le {‖R^{-1}‖}_2\le n^{\frac{1}{4}}\times \mathit{sconda}$ where $R$ is the triangular factor from the $QR$ factorization of $A$. However, if $R$ is truncated and the numerical rank is determined to be strictly smaller than $n$, $\mathit{sconda}$ is returned as $-1$, thus indicating that the smallest singular values might be lost.

If the full SVD is needed, and you are familiar with the details of the method, the following two condition numbers are useful for the analysis of the algorithm.

$\mathbf{rwork}\left(4\right)$

An estimate of the scaled condition number of the triangular factor in the first $QR$ factorization.

$\mathbf{rwork}\left(5\right)$

An estimate of the scaled condition number of the triangular factor in the second $QR$ factorization.

The following two parameters are computed if $\mathbf{jobt}=\text{'T'}$.

$\mathbf{rwork}\left(6\right)$

The entropy of $A^{\mathrm{H}}A$: this is the Shannon entropy of $\mathrm{diag}{A}^{\mathrm{H}}A/\mathrm{trace}{A}^{\mathrm{H}}A$ taken as a point in the probability simplex.

$\mathbf{rwork}\left(7\right)$

The entropy of $A{A}^{\mathrm{H}}$.

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

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

Constraint: $\mathbf{lrwork}\ge \max \left(7,\mathbf{n}+2\times \mathbf{m}\right)$.

20: $\mathbf{iwork}\left(\mathbf{m}+3\times \mathbf{n}\right)$ – Integer array Workspace

On exit: contains information about the completed job.

$\mathbf{iwork}\left(1\right)$

The numerical rank of $A$ determined after the initial $QR$ factorization with pivoting. See the descriptions of joba and jobr.

$\mathbf{iwork}\left(2\right)$

The number of computed nonzero singular values.

$\mathbf{iwork}\left(3\right)$

If nonzero, a warning message. If $\mathbf{iwork}\left(3\right)=1$, then some of the column norms of $A$ were denormalized (tiny) numbers. The requested high accuracy is not warranted by the data.

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

f08kvf did not converge in the allowed number of iterations ($30$). The computed values might be inaccurate.

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results