NAG Library Routine Document

d06ccf  (dim2_renumber)

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

1:     $\mathbf{nv}$ – IntegerInput

On entry: the total number of vertices in the input mesh.

Constraint: $\mathbf{nv}\ge 3$.

2:     $\mathbf{nelt}$ – IntegerInput

On entry: the number of triangles in the input mesh.

Constraint: $\mathbf{nelt}\le 2\times \mathbf{nv}-1$.

3:     $\mathbf{nedge}$ – IntegerInput

On entry: the number of boundary edges in the input mesh.

Constraint: $\mathbf{nedge}\ge 1$.

4:     $\mathbf{nnzmax}$ – IntegerInput

On entry: the maximum number of nonzero entries in the matrix based on the input mesh. It is the dimension of the arrays irow and icol as declared in the subroutine from which d06ccf is called.

Constraint: $4\times \mathbf{nelt}+\mathbf{nv}\le \mathbf{nnzmax}\le {\mathbf{nv}}^2$.

5:     $\mathbf{nnz}$ – IntegerOutput

On exit: the number of nonzero entries in the matrix based on the input mesh.

6:     $\mathbf{coor}\left(2,\mathbf{nv}\right)$ – Real (Kind=nag_wp) arrayInput/Output

On entry: $\mathbf{coor}\left(1,\mathit{i}\right)$ contains the $x$ coordinate of the $\mathit{i}$th input mesh vertex, for $\mathit{i}=1,2,\dots ,\mathbf{nv}$; while $\mathbf{coor}\left(2,\mathit{i}\right)$ contains the corresponding $y$ coordinate.

On exit: $\mathbf{coor}\left(1,\mathit{i}\right)$ will contain the $x$ coordinate of the $\mathit{i}$th renumbered mesh vertex, for $\mathit{i}=1,2,\dots ,\mathbf{nv}$; while $\mathbf{coor}\left(2,\mathit{i}\right)$ will contain the corresponding $y$ coordinate.

7:     $\mathbf{edge}\left(3,\mathbf{nedge}\right)$ – Integer arrayInput/Output

On entry: the specification of the boundary or interface edges. $\mathbf{edge}\left(1,j\right)$ and $\mathbf{edge}\left(2,j\right)$ contain the vertex numbers of the two end points of the $j$th boundary edge. $\mathbf{edge}\left(3,j\right)$ is a user-supplied tag for the $j$th boundary or interface edge: $\mathbf{edge}\left(3,j\right)=0$ for an interior edge and has a nonzero tag otherwise.

Constraint: $1\le \mathbf{edge}\left(\mathit{i},\mathit{j}\right)\le \mathbf{nv}$ and $\mathbf{edge}\left(1,\mathit{j}\right)\ne \mathbf{edge}\left(2,\mathit{j}\right)$, for $\mathit{i}=1,2$ and $\mathit{j}=1,2,\dots ,\mathbf{nedge}$.

On exit: the renumbered specification of the boundary or interface edges.

8:     $\mathbf{conn}\left(3,\mathbf{nelt}\right)$ – Integer arrayInput/Output

On entry: the connectivity of the mesh between triangles and vertices. For each triangle $\mathit{j}$, $\mathbf{conn}\left(\mathit{i},\mathit{j}\right)$ gives the indices of its three vertices (in anticlockwise order), for $\mathit{i}=1,2,3$ and $\mathit{j}=1,2,\dots ,\mathbf{nelt}$.

Constraint: $1\le \mathbf{conn}\left(\mathit{i},\mathit{j}\right)\le \mathbf{nv}$ and $\mathbf{conn}\left(1,\mathit{j}\right)\ne \mathbf{conn}\left(2,\mathit{j}\right)$ and $\mathbf{conn}\left(1,\mathit{j}\right)\ne \mathbf{conn}\left(3,\mathit{j}\right)$ and $\mathbf{conn}\left(2,\mathit{j}\right)\ne \mathbf{conn}\left(3,\mathit{j}\right)$, for $\mathit{i}=1,2,3$ and $\mathit{j}=1,2,\dots ,\mathbf{nelt}$.

On exit: the renumbered connectivity of the mesh between triangles and vertices.

9:     $\mathbf{irow}\left(\mathbf{nnzmax}\right)$ – Integer arrayOutput

10:   $\mathbf{icol}\left(\mathbf{nnzmax}\right)$ – Integer arrayOutput

On exit: the first nnz elements contain the row and column indices of the nonzero elements supplied in the finite element matrix $A$.

11:   $\mathbf{itrace}$ – IntegerInput

On entry: the level of trace information required from d06ccf.

$\mathbf{itrace}\le 0$

No output is generated.

$\mathbf{itrace}=1$

Information about the effect of the renumbering on the finite element matrix are output. This information includes the half bandwidth and the sparsity structure of this matrix before and after renumbering.

$\mathbf{itrace}>1$

The output is similar to that produced when $\mathbf{itrace}=1$ but the sparsities (for each row of the matrix, indices of nonzero entries) of the matrix before and after renumbering are also output.

12:   $\mathbf{iwork}\left(\mathbf{liwork}\right)$ – Integer arrayWorkspace

13:   $\mathbf{liwork}$ – IntegerInput

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

Constraint: $\mathbf{liwork}\ge \max \left(\mathbf{nnzmax},20\times \mathbf{nv}\right)$.

14:   $\mathbf{rwork}\left(\mathbf{lrwork}\right)$ – Real (Kind=nag_wp) arrayWorkspace

15:   $\mathbf{lrwork}$ – IntegerInput

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

Constraint: $\mathbf{lrwork}\ge \mathbf{nv}$.

16:   $\mathbf{ifail}$ – IntegerInput/Output

On entry: ifail must be set to $0$, $-1\text{ 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\text{ 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 $-\mathbf{1}\text{ or }\mathbf{1}$ is used it is essential to test the value of ifail on exit.

On exit: $\mathbf{ifail}=\mathbf{0}$ unless the routine detects an error or a warning has been flagged (see Section 6).

6

Error Indicators and Warnings

$\mathbf{ifail}=1$

On entry,	$\mathbf{nv}<3$,
or	$\mathbf{nelt}>2\times \mathbf{nv}-1$,
or	$\mathbf{nedge}<1$,
or	$\mathbf{nnzmax}<4\times \mathbf{nelt}+\mathbf{nv}$ or $\mathbf{nnzmax}>{\mathbf{nv}}^2$
or	$\mathbf{conn}\left(i,j\right)<1$ or $\mathbf{conn}\left(i,j\right)>\mathbf{nv}$ for some $i=1,2,3$ and $j=1,2,\dots ,\mathbf{nelt}$,
or	$\mathbf{conn}\left(1,j\right)=\mathbf{conn}\left(2,j\right)$ or $\mathbf{conn}\left(1,j\right)=\mathbf{conn}\left(3,j\right)$ or $\mathbf{conn}\left(2,j\right)=\mathbf{conn}\left(3,j\right)$ for some $j=1,2,\dots ,\mathbf{nelt}$,
or	$\mathbf{edge}\left(i,j\right)<1$ or $\mathbf{edge}\left(i,j\right)>\mathbf{nv}$ for some $i=1,2$ and $j=1,2,\dots ,\mathbf{nedge}$,
or	$\mathbf{edge}\left(1,j\right)=\mathbf{edge}\left(2,j\right)$ for some $j=1,2,\dots ,\mathbf{nedge}$,
or	$\mathbf{liwork}<\max \left(\mathbf{nnzmax},20\times \mathbf{nv}\right)$,
or	$\mathbf{lrwork}<\mathbf{nv}$.

$\mathbf{ifail}=2$

A serious error has occurred during the computation of the compact sparsity of the finite element matrix or in an internal call to the renumbering routine. Check the input mesh, especially the connectivity between triangles and vertices (the argument conn). If the problem persists, contact NAG.

$\mathbf{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.

$\mathbf{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.

$\mathbf{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

8

Parallelism and Performance

9

Further Comments

10

Example

10.1

Program Text

Program Text (d06ccfe.f90)

10.2

Program Data

10.3

Program Results

Program Results (d06ccfe.r)