NAG Library Routine Document

-norm of a real rectangular matrix without accessing the matrix explicitly. It uses reverse communication for evaluating matrix products. The routine may be used for estimating condition numbers of square matrices.

2

Specification

Fortran Interface

Subroutine f04ydf (

irevcm, m, n, x, ldx, y, ldy, estnrm, t, seed, work, iwork, ifail)

Integer, Intent (In)	::	m, n, ldx, ldy, t, seed
Integer, Intent (Inout)	::	irevcm, iwork(2n+5t+20), ifail
Real (Kind=nag_wp), Intent (Inout)	::	x(ldx,), y(ldy,), estnrm, work(m*t)

C Header Interface

#include <nagmk26.h>

void	f04ydf_ (Integer irevcm, const Integer m, const Integer n, double x[], const Integer ldx, double y[], const Integer ldy, double estnrm, const Integer t, const Integer seed, double work[], Integer iwork[], Integer *ifail)

3

Description

f04ydf computes an estimate (a lower bound) for the

1

-norm

{‖A‖}_{1} = \max_{1 \leq j \leq n} \sum_{i = 1}^{m} |a_{i j}|

(1)

of an

m

n

real matrix

A = (a_{i j})

. The routine regards the matrix

A

as being defined by a user-supplied ‘Black Box’ which, given an

n \times t

matrix

X

(with

t ≪ n

) or an

m \times t

matrix

Y

, can return

A X

A^{T} Y

. A reverse communication interface is used; thus control is returned to the calling program whenever a matrix product is required.

Note: this routine is not recommended for use when the elements of

A

are known explicitly; it is then more efficient to compute the

1

-norm directly from formula (1) above.

The main use of the routine is for estimating

{‖B^{- 1}‖}_{1}

for a square matrix,

B

, and hence the condition number

κ_{1} (B) = {‖B‖}_{1} {‖B^{- 1}‖}_{1}

, without forming

B^{- 1}

explicitly (

A = B^{- 1}

above).

If, for example, an

L U

factorization of

B

is available, the matrix products

B^{- 1} X

and

B^{- T} Y

required by f04ydf may be computed by back- and forward-substitutions, without computing

B^{- 1}

The routine can also be used to estimate

1

-norms of matrix products such as

A^{- 1} B

and

A B C

, without forming the products explicitly. Further applications are described by Higham (1988).

Since

{‖A‖}_{\infty} = {‖A^{T}‖}_{1}

, f04ydf can be used to estimate the

\infty

-norm of

A

by working with

A^{T}

instead of

A

The algorithm used is described in Higham and Tisseur (2000).

4

References

Higham N J (1988) FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation ACM Trans. Math. Software 14 381–396

Higham N J and Tisseur F (2000) A block algorithm for matrix

1

-norm estimation, with an application to

1

-norm pseudospectra SIAM J. Matrix. Anal. Appl. 21 1185–1201

5

Arguments

Note: this routine uses reverse communication. Its use involves an initial entry, intermediate exits and re-entries, and a final exit, as indicated by the argument irevcm. Between intermediate exits and re-entries, all arguments other than x and y must remain unchanged.

1: $irevcm$ – IntegerInput/Output

On initial entry: must be set to

0

On intermediate exit:

irevcm = 1

2

, and x contains the

n \times t

matrix

X

and y contains the

m \times t

matrix

Y

. The calling program must

(a)	if $irevcm = 1$ , evaluate $A X$ and store the result in y or if $irevcm = 2$ , evaluate $A^{T} Y$ and store the result in x,
(b)	call f04ydf once again, with all the other arguments unchanged.

On intermediate re-entry: irevcm must be unchanged.

On final exit:

irevcm = 0

Note: any values you return to f04ydf as part of the reverse communication procedure should not include floating-point NaN (Not a Number) or infinity values, since these are not handled by f04ydf. If your code does inadvertently return any NaNs or infinities, f04ydf is likely to produce unexpected results.

2: $m$ – IntegerInput

On entry: the number of rows of the matrix

A

Constraint:

m \geq 0

3: $n$ – IntegerInput

On entry:

n

, the number of columns of the matrix

A

Constraint:

n \geq 0

4: $x (ldx *)$ – Real (Kind=nag_wp) arrayInput/Output

Note: the second dimension of the array x must be at least

t

On initial entry: need not be set.

On intermediate exit: if

irevcm = 1

, contains the current matrix

X

On intermediate re-entry: if

irevcm = 2

, must contain

A^{T} Y

On final exit: the array is undefined.

5: $ldx$ – IntegerInput

On initial entry: the leading dimension of the array x as declared in the (sub)program from which f04ydf is called.

Constraint:

ldx \geq n

6: $y (ldy *)$ – Real (Kind=nag_wp) arrayInput/Output

Note: the second dimension of the array y must be at least

t

On initial entry: need not be set.

On intermediate exit: if

irevcm = 2

, contains the current matrix

Y

On intermediate re-entry: if

irevcm = 1

, must contain

A X

On final exit: the array is undefined.

7: $ldy$ – IntegerInput

On initial entry: the leading dimension of the array y as declared in the (sub)program from which f04ydf is called.

Constraint:

ldy \geq m

8: $estnrm$ – Real (Kind=nag_wp)Input/Output

On initial entry: need not be set.

On intermediate re-entry: must not be changed.

On final exit: an estimate (a lower bound) for

{‖A‖}_{1}

9: $t$ – IntegerInput

On entry: the number of columns

t

of the matrices

X

and

Y

. This is an argument that can be used to control the accuracy and reliability of the estimate and corresponds roughly to the number of columns of

A

that are visited during each iteration of the algorithm.

t \geq 2

then a partly random starting matrix is used in the algorithm.

Suggested value:

t = 2

Constraint:

1 \leq t \leq m

10: $seed$ – IntegerInput

On entry: the seed used for random number generation.

t = 1

, seed is not used.

Constraint: if

t > 1

seed \geq 1

11: $work (m \times t)$ – Real (Kind=nag_wp) arrayCommunication Array

12: $iwork (2 \times n + 5 \times t + 20)$ – Integer arrayCommunication Array

On initial entry: need not be set.

On intermediate re-entry: must not be changed.

13: $ifail$ – IntegerInput/Output

On initial entry: ifail must be set to

0

- 1 or 1

. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.

For environments where it might be inappropriate to halt program execution when an error is detected, the value

- 1 or 1

is recommended. If the output of error messages is undesirable, then the value

1

is recommended. Otherwise, because for this routine the values of the output arguments may be useful even if

ifail \neq 0

on exit, the recommended value is

- 1

. When the value $- 1 or 1$ is used it is essential to test the value of ifail on exit.

On final exit:

ifail = 0

unless the routine detects an error or a warning has been flagged (see Section 6).

6

Error Indicators and Warnings

If on entry

ifail = 0

- 1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

$ifail = 1$: Internal error; please contact NAG.

$ifail = - 1$: On entry, $irevcm = 〈value〉$ .
Constraint: $irevcm = 0$ , $1$ or $2$ .

On initial entry, $irevcm = 〈value〉$ .
Constraint: $irevcm = 0$ .

$ifail = - 2$: On entry, $m = 〈value〉$ .
Constraint: $m \geq 0$ .

$ifail = - 3$: On entry, $n = 〈value〉$ .
Constraint: $n \geq 0$ .

$ifail = - 5$: On entry, $ldx = 〈value〉$ and $n = 〈value〉$ .
Constraint: $ldx \geq n$ .

$ifail = - 7$: On entry, $ldy = 〈value〉$ and $m = 〈value〉$ .
Constraint: $ldy \geq m$ .

$ifail = - 9$: On entry, $m = 〈value〉$ and $t = 〈value〉$ .
Constraint: $1 \leq t \leq m$ .

$ifail = - 10$: On entry, $t = 〈value〉$ and $seed = 〈value〉$ .
Constraint: if $t > 1$ , $seed \geq 1$ .

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

7

Accuracy

In extensive tests on random matrices of size up to

m = n = 450

the estimate estnrm has been found always to be within a factor two of

{‖A‖}_{1}

; often the estimate has many correct figures. However, matrices exist for which the estimate is smaller than

{‖A‖}_{1}

by an arbitrary factor; such matrices are very unlikely to arise in practice. See Higham and Tisseur (2000) for further details.

8

Parallelism and Performance

f04ydf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9

Further Comments

9.1

Timing

For most problems the time taken during calls to f04ydf will be negligible compared with the time spent evaluating matrix products between calls to f04ydf.

The number of matrix products required depends on the matrix

A

. At most six products of the form

Y = A X

and five products of the form

X = A^{T} Y

will be required. The number of iterations is independent of the choice of

t

9.2

Overflow

It is your responsibility to guard against potential overflows during evaluation of the matrix products. In particular, when estimating

{‖B^{- 1}‖}_{1}

using a triangular factorization of

B

, f04ydf should not be called if one of the factors is exactly singular – otherwise division by zero may occur in the substitutions.

9.3

Choice of $t$

The argument

t

controls the accuracy and reliability of the estimate. For

t = 1

, the algorithm behaves similarly to the LAPACK estimator xLACON. Increasing

t

typically improves the estimate, without increasing the number of iterations required.

For

t \geq 2

, random matrices are used in the algorithm, so for repeatable results the same value of seed should be used each time.

A value of

t = 2

is recommended for new users.

9.4

Use in Conjunction with NAG Library Routines

To estimate the

1

-norm of the inverse of a matrix

A

, the following skeleton code can normally be used:

      ...  code to factorize A ...  
      If (A is not singular) Then 
         irevcm = 0 
10       Call f04ydf (irevcm,m,n,x,ldx,y,ldy,estnrm,t,seed,work,   &
                      iwork,ifail) 
         If (irevcm.ne.0) Then 
            If (irevcm.eq.1) Then 
               ...  code to compute y=inv(A)x ...  
            Else 
               ...  code to compute x=inv(transpose(A))y ...  
            End If 
            Go To 10 
         End If 
      End If

To compute

A^{- 1} X

A^{- T} Y

, solve the equation

A Y = X

A^{T} X = Y

, storing the result in y or x respectively. The code will vary, depending on the type of the matrix

A

, and the NAG routine used to factorize

A

The factorization will normally have been performed by a suitable routine from Chapters F01, F03 or F07. Note also that many of the ‘Black Box’ routines in Chapter F04 for solving systems of equations also return a factorization of the matrix. The example program in Section 10 illustrates how f04ydf can be used in conjunction with NAG Library routines for

L U

factorization of a real matrix f07adf (dgetrf).

It is straightforward to use f04ydf for the following other types of matrix, using the named routines for factorization and solution:

nonsymmetric tridiagonal (f01lef and f04lef);
nonsymmetric almost block-diagonal (f01lhf and f04lhf);
nonsymmetric band (f07bdf (dgbtrf) and f07bef (dgbtrs));
symmetric positive definite (f07fdf (dpotrf) and f07fef (dpotrs));
symmetric positive definite band (f07hdf (dpbtrf) and f07hef (dpbtrs));
symmetric positive definite tridiagonal (f07jaf (dptsv), f07jdf (dpttrf) and f07jef (dpttrs));
symmetric positive definite variable bandwidth (f01mcf and f04mcf);
symmetric positive definite sparse (f11jaf and f11jbf);
symmetric indefinite (f07pdf (dsptrf) and f07pef (dsptrs));
nonsymmetric sparse (f11mef and f11mff; note that f11mgf can also be used here).

For upper or lower triangular matrices, no factorization routine is needed:

Y = A^{- 1} X

and

X = A^{- T} Y

may be computed by calls to f06pjf (dtrsv) (or f06pkf (dtbsv) if the matrix is banded, or f06plf (dtpsv) if the matrix is stored in packed form).

10

Example

For this routine two examples are provided. There is a single example program for f04ydf, with a main program and the code to solve the two example problems is given in Example 1 (EX1) and Example 2 (EX2).

Example 1 (EX1)

This example estimates the condition number

{‖A‖}_{1} {‖A^{- 1}‖}_{1}

of the matrix

A

given by

A = (\begin{matrix} 0.7 & - 0.2 & 1.0 & 0.0 & 2.0 & 0.1 \\ 0.3 & 0.7 & 0.0 & 1.0 & 0.9 & 0.2 \\ 0.0 & 0.0 & 0.2 & 0.7 & 0.0 & - 1.1 \\ 0.0 & 3.4 & - 0.7 & 0.2 & 0.1 & 0.1 \\ 0.0 & - 4.0 & 0.0 & 1.0 & 9.0 & 0.0 \\ 0.4 & 1.2 & 4.3 & 0.0 & 6.2 & 5.9 \end{matrix}) .

Example 2 (EX2)

This example estimates the condition number of the sparse matrix

A

(stored in symmetric coordinate storage format) given by

A = (\begin{matrix} 0.0 & 0.0 & 0.0 & 1.0 & 0.0 \\ 3.0 & 1.0 & 0.0 & 0.0 & 0.0 \\ 0.0 & 2.0 & 0.0 & 2.0 & 0.0 \\ 2.0 & 0.0 & 4.0 & 0.0 & 5.0 \\ 0.0 & 1.0 & 2.0 & 0.0 & 0.0 \end{matrix}) .

NAG Library Routine Document

f04ydf (real_gen_norm_rcomm)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

9.1 Timing

9.2 Overflow

9.3 Choice of t

9.4 Use in Conjunction with NAG Library Routines

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

6

Error Indicators and Warnings

7

Accuracy

8

Parallelism and Performance

9

Further Comments

9.1

Timing

9.2

Overflow

9.3

Choice of $t$

9.4

Use in Conjunction with NAG Library Routines

10

Example

10.1

Program Text

10.2

Program Data

10.3

Program Results