NAG Library Routine Document

x03aaf calculates the value of a scalar product using basic precision or additional precision and adds it to a basic precision or additional precision initial value.

2

Specification

Fortran Interface

Subroutine x03aaf (

a, isizea, b, isizeb, n, istepa, istepb, c1, c2, d1, d2, sw, ifail)

Integer, Intent (In)	::	isizea, isizeb, n, istepa, istepb
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	a(isizea), b(isizeb), c1, c2
Real (Kind=nag_wp), Intent (Out)	::	d1, d2
Logical, Intent (In)	::	sw

C Header Interface

#include <nagmk26.h>

void	x03aaf_ (const double a[], const Integer isizea, const double b[], const Integer isizeb, const Integer n, const Integer istepa, const Integer istepb, const double c1, const double c2, double d1, double d2, const logical sw, Integer *ifail)

3

Description

x03aaf calculates the scalar product of two real vectors and adds it to an initial value

c

to give a correctly rounded result

d

d = c + \sum_{i = 1}^{n} a_{i} b_{i} .

n < 1

d = c

The vector elements

a_{i}

and

b_{i}

are stored in selected elements of the one-dimensional array arguments a and b, which in the subroutine from which x03aaf is called may be identified with parts of possibly multidimensional arrays according to the standard Fortran rules. For example, the vectors may be parts of a row or column of a matrix. See Section 5 for details, and Section 10 for an example.

Both the initial value

c

and the result

d

are defined by a pair of real variables, so that they may take either basic precision or additional precision values.

(a)	If $sw = .TRUE.$ , the products are accumulated in additional precision, and on exit the result is available either in basic precision, correctly rounded, or in additional precision.
(b)	If $sw = .FALSE.$ , the products are accumulated in basic precision, and the result is returned in basic precision.

This routine is designed primarily for use as an auxiliary routine by other routines in the NAG Library, especially those in the chapters on Linear Algebra.

4

References

None.

5

Arguments

1: $a (isizea)$ – Real (Kind=nag_wp) arrayInput

On entry: the elements of the first vector.

The

i

th vector element is stored in the array element

a ((i - 1) \times istepa + 1)

. In your subroutine from which x03aaf is called, a can be part of a multidimensional array and the actual argument must be the array element containing the first vector element.

2: $isizea$ – IntegerInput

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

The upper bound for isizea is found by multiplying together the dimensions of a as declared in your subroutine from which x03aaf is called, subtracting the starting position and adding

1

Constraint:

isizea \geq (n - 1) \times istepa + 1

3: $b (isizeb)$ – Real (Kind=nag_wp) arrayInput

On entry: the elements of the second vector.

The

i

th vector element is stored in the array element

b ((i - 1) \times istepb + 1)

. In your subroutine from which x03aaf is called, b can be part of a multidimensional array and the actual argument must be the array element containing the first vector element.

4: $isizeb$ – IntegerInput

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

The upper bound for isizeb is found by multiplying together the dimensions of b as declared in your subroutine from which x03aaf is called, subtracting the starting position and adding

1

Constraint:

isizeb \geq (n - 1) \times istepb + 1

5: $n$ – IntegerInput

On entry:

n

, the number of elements in the scalar product.

6: $istepa$ – IntegerInput

On entry: the step length between elements of the first vector in array a.

Constraint:

istepa > 0

7: $istepb$ – IntegerInput

On entry: the step length between elements of the second vector in array b.

Constraint:

istepb > 0

8: $c1$ – Real (Kind=nag_wp)Input

9: $c2$ – Real (Kind=nag_wp)Input

On entry: c1 and c2 must specify the initial value

c

c = c1 + c2

. Normally, if

c

is in additional precision, c1 specifies the most significant part and c2 the least significant part; if

c

is in basic precision, then c1 specifies

c

and c2 must have the value

0.0

. Both c1 and c2 must be defined on entry.

10: $d1$ – Real (Kind=nag_wp)Output

11: $d2$ – Real (Kind=nag_wp)Output

On exit: the result

d

If the calculation is in additional precision (

sw = .TRUE.

$d1 = d$ rounded to basic precision;
$d2 = d - d1$ ,

thus d1 holds the correctly rounded basic precision result and the sum

d1 + d2

gives the result in additional precision. d2 may have the opposite sign to d1.

If the calculation is in basic precision (

sw = .FALSE.

$d1 = d$ ;
$d2 = 0.0$ .

12: $sw$ – LogicalInput

On entry: the precision to be used in the calculation.

$sw = .TRUE.$: additional precision.
$sw = .FALSE.$: basic precision.

13: $ifail$ – IntegerInput/Output

On 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, if you are not familiar with this argument, the recommended value is

0

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

On 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$: On entry, $istepa = 〈value〉$ .
Constraint: $istepa > 0$ .

On entry, $istepb = 〈value〉$ .
Constraint: $istepb > 0$ .

$ifail = 2$: On entry, $isizea = 〈value〉$ , $n = 〈value〉$ and $istepa = 〈value〉$ .
Constraint: $isizea \geq (n - 1) \times istepa + 1$ .

On entry, $isizeb = 〈value〉$ , $n = 〈value〉$ and $istepb = 〈value〉$ .
Constraint: $isizeb \geq (n - 1) \times istepb + 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

If the calculation is an additional precision, the rounded basic precision result d1 is correct to full implementation accuracy, provided that exceptionally severe cancellation does not occur in the summation. If the calculation is in basic precision, such accuracy cannot be guaranteed.

8

Parallelism and Performance

x03aaf is not threaded in any implementation.

9

Further Comments

The time taken by x03aaf is approximately proportional to

n

and also depends on whether basic precision or additional precision is used.

On exit the variables d1 and d2 may be used directly to supply a basic precision or additional precision initial value for a subsequent call of x03aaf.

10

Example

This example calculates the scalar product of the second column of the matrix

A

and the vector

b

, and add it to an initial value

1.0

where

A = (\begin{array}{r} - 2 & - 3 & 7 \\ 2 & - 5 & 3 \\ - 9 & 1 & 0 \end{array}), b = (\begin{array}{r} 8 \\ - 4 \\ - 2 \end{array}) .

NAG Library Routine Document

x03aaf (real_prec)

▸▿ 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

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

10

Example

10.1

Program Text

10.2

Program Data

10.3

Program Results