Author:

Publisher:

Published: 2001

Total Pages: 18

ISBN-13:

A formalism is derived for the Arbitrarily High Order Transport (AHOT) method of the Characteristic type (AHOT-C) in three-dimensional geometry for unstructured grids (UG). The resulting equations are implemented in a computer code, AHOT-C-UG, in the C language. The transport solution on the unstructured grid is stored as two inter-linked lists of cell and face flux moments. This arrangement allows the transport sweep to select the order of evaluation dynamically so that the typical recursive ordering of the discrete ordinate's mesh sweep is maintained without the need to store a precomputed order for each ordinate. The dynamic cell sweep order thus reduces the memory demand without excessively increasing execution time. Comparison of AHOT-C-UG's solutions to fine mesh TORT solutions illustrate high accuracy of the new method. In particular, large half a million cell numerical tests illustrate a convergence rate for the error as O(h), where h is a measure of the longest edge in the tetrahedral grid. Execution time on a 700 MHz Intel Pentium III running Linux 2.4.0 is less than 0.2 ms per cell-angle sweep operation. Also the total memory requirement is of the order of 240 bytes per tetrahedral cell, where 64-bit arithmetic precision is employed throughout.