MESH_BANDWIDTH
Geometric Bandwidth of a Mesh


MESH_BANDWIDTH is an executable C++ program, using double precision arithmetic, which computes the geometric bandwidth of a mesh.

The user specifies an element file, containing the indices of the nodes that make up each element. Examples of such a file include the order 3 and order 6 triangulation files, but any order of element may be used.

Not only may any element type be used, but the geometric region may be of any spatial dimension.

The program reads the element information and computes the geometric bandwidth M as

M = ML + 1 + MU
where ML is the lower bandwidth, namely, the maximum value over all nodes I of the difference (I-J), taken over all nodes J that share an element with node I. The upper bandwidth is the maximum value of (J-I) under the same conditions.

The geometric bandwidth M is the linear algebraic bandwidth of the adjacency matrix of the mesh, where I and J are considered to be adjacent if there is some element that includes both nodes.

The geometric bandwidth is of interest since it is the bandwidth of the finite element matrix associated with the mesh, when a scalar quantity is being approximated and there is a single unknown for every node, and the unknowns have the same numbering as the nodes.

Related Data and Programs:

MESH_BANDWIDTH is also available in a FORTRAN90 version and a MATLAB version.

TABLE_DELAUNAY is a C++ program which triangulates a set of nodes whose coordinates are stored in a file.

TET_MESH_RCM is a FORTRAN90 program which applies the reverse Cuthill-McKee reordering to a tetrahedral mesh of nodes in 3D.

TRIANGLE is a C program which computes a triangulation of a geometric region.

TRIANGULATION_BOUNDARY_NODES is a C++ program that reads data defining a triangulation, determines which nodes lie on the boundary, and writes their coordinates to a file.

TRIANGULATION_DISPLAY_OPEN_GL is a C++ program which reads files defining a triangulation and displays an image using Open GL.

TRIANGULATION_L2Q is a C++ program which reads data defining a 3-node triangulation and generates midside nodes and writes out the corresponding 6-node triangulation.

TRIANGULATION_ORDER3 is a directory which contains a description and examples of order 3 triangulations.

TRIANGULATION_ORDER6 is a directory which contains a description and examples of order 6 triangulations.

TRIANGULATION_ORIENT is a FORTRAN90 program which reads data defining a triangulation, makes sure that every triangle has positive orientation, and if not, writes a corrected triangle file.

TRIANGULATION_PLOT is a C++ program which reads data defining a triangulation and creates a PostScript image of the nodes and triangles.

TRIANGULATION_Q2L is a C++ program which reads data defining a 6-node triangulation, and subdivides each triangle into 4 3-node triangles, writing the resulting triangulation to a file.

TRIANGULATION_QUALITY is a C++ program which reads data defining a triangulation and computes a number of quality measures.

TRIANGULATION_REFINE is a FORTRAN90 program which can be used to refine a triangulation.

Usage:

mesh_bandwidth element_file
reads the mesh whose node indices are in element_file, and computes the geometric bandwidth.

Reference:

  1. Alan George, Joseph Liu,
    Computer Solution of Large Sparse Positive Definite Matrices,
    Prentice Hall, 1981,
    QA 188.G46
  2. Norman Gibbs, William Poole, Paul Stockmeyer,
    An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix,
    SIAM Journal on Numerical Analysis,
    Volume 13, pages 236-250, 1976.
  3. Norman Gibbs,
    Algorithm 509: A Hybrid Profile Reduction Algorithm,
    ACM Transactions on Mathematical Software,
    Volume 2, Issue 4, pages 378-387, 1976.
  4. Joseph ORourke,
    Computational Geometry,
    Cambridge University Press,
    Second Edition, 1998.

Source Code:

Examples and Tests:

Some sample mesh files include:

List of Routines:

You can go up one level to the C++ source codes.


Last revised on 02 January 2007.