NAG FL Interface
f06flf (darang)

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

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

On entry: $n$, the number of elements in $x$.

2: $\mathbf{x}\left(*\right)$ – Real (Kind=nag_wp) array Input

Note: the dimension of the array x must be at least $\max \left(1,1+\left(\mathbf{n}-1\right)\times \mathbf{incx}\right)$.

On entry: the $n$-element vector $x$. $x_{\mathit{i}}$ must be stored in $\mathbf{x}\left(1+\left(\mathit{i}-1\right)\times \mathbf{incx}\right)$, for $\mathit{i}=1,2,\dots ,\mathbf{n}$.

Intermediate elements of x are not referenced.

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

On entry: the increment in the subscripts of x between successive elements of $x$.

Constraint: $\mathbf{incx}>0$.

4: $\mathbf{xmax}$ – Real (Kind=nag_wp) Output

On exit: the value $x_{\max }={\displaystyle \underset{i}{\max }}\left|x_i\right|$.

5: $\mathbf{xmin}$ – Real (Kind=nag_wp) Output

On exit: the value $x_{\min }={\displaystyle \underset{i}{\min }}\left|x_i\right|$.

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example