Efficient volume computation for three-dimensional hexahedral cells

doi:https://doi.org/10.1016/0021-9991(88)90091-5

Title: Efficient volume computation for three-dimensional hexahedral cells

Full Record
Other Related Research

Abstract

Currently, algorithms for computing the volume of hexahedral cells with ''ruled'' surfaces require a minimum of 122 FLOPs (floating point operations) per cell. A new algorithm is described which reduces the operation count to 57 FLOPs per cell. copyright 1988 Academic Press, Inc.

Authors:: Dukowicz, J K

Publication Date:: 1988-02-01

Research Org.:: Theoretical Division, Group T-3 Los Alamos National Laboratory, Los Alamos, New Mexico 87545

OSTI Identifier:: 5434039

Resource Type:: Journal Article

Journal Name:: J. Comput. Phys.; (United States)

Additional Journal Information:: Journal Volume: 74:2

Country of Publication:: United States

Language:: English

Subject:: 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; COMPUTER CODES; ALGORITHMS; HYDRODYNAMICS; MAPPING; THREE-DIMENSIONAL CALCULATIONS; TOPOLOGY; FLUID MECHANICS; MATHEMATICAL LOGIC; MATHEMATICS; MECHANICS; 990220* - Computers, Computerized Models, & Computer Programs- (1987-1989)

Citation Formats


                    Dukowicz, J K. Efficient volume computation for three-dimensional hexahedral cells.  United States: N. p., 1988. 
        Web.  doi:10.1016/0021-9991(88)90091-5.

Copy to clipboard


                    Dukowicz, J K. Efficient volume computation for three-dimensional hexahedral cells.  United States.  https://doi.org/10.1016/0021-9991(88)90091-5

Copy to clipboard


                    Dukowicz, J K. Mon .  
        "Efficient volume computation for three-dimensional hexahedral cells".  United States.  https://doi.org/10.1016/0021-9991(88)90091-5.

Copy to clipboard


                    
@article{osti_5434039,

  title        = {Efficient volume computation for three-dimensional hexahedral cells},

  author       = {Dukowicz, J K},

  abstractNote = {Currently, algorithms for computing the volume of hexahedral cells with ''ruled'' surfaces require a minimum of 122 FLOPs (floating point operations) per cell. A new algorithm is described which reduces the operation count to 57 FLOPs per cell. copyright 1988 Academic Press, Inc.},

  doi          = {10.1016/0021-9991(88)90091-5},

  url          = {https://www.osti.gov/biblio/5434039},
  journal      = {J. Comput. Phys.; (United States)},
number       = ,

  volume       = 74:2,

  place        = {United States},

  year         = {1988},

  month        = {2}

}

Copy to clipboard

Journal Article:

https://doi.org/10.1016/0021-9991(88)90091-5

Other availability

Find in Google Scholar

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Efficient computation of volume of hexahedral cells

Technical Report Grandy, J

This report describes an efficient method to compute the volume of hexahedral cells used in three-dimensional hydrodynamics simulation. Two common methods for creating the hexahedron using triangular boundaries are considered.
https://doi.org/10.2172/632793

Full Text Available
Numerical solution of three-dimensional magnetic differential equations

Journal Article Reiman, A H ; Greenside, H S - J. Comput. Phys.; (United States)

A computer code is described that solves differential equations of the form B x delf = h for a single-valued solution f, given a toroidal three-dimensional divergence-free field B and a single-valued function h. The code uses a new algorithm that Fourier decomposes a given function in a set of flux coordinates in which the field lines are straight. The algorithm automatically adjusts the required integration lengths to compensate for proximity to low order rational surfaces. Applying this algorithm to the Cartesian coordinates defines a transformation to magnetic coordinates, in which the magnetic differential equation can be accurately solved. Ourmore »« less
https://doi.org/10.1016/0021-9991(88)90121-0
A general concurrent algorithm for plasma particle-in-cell simulation codes. [JPL Mark III Hypercube parallel computer]

Journal Article Liewer, P C ; Decyk, V K - Journal of Computational Physics; (USA)

We have developed a new algorithm for implementing plasma particle-in-cell (PIC) simulation codes on concurrent processors with distributed memory. This algorithm, named the general concurrent PIC algorithm (GCPIC), has been used to implement an electrostatic PIC code on the 33-node JPL Mark III Hypercube parallel computer. To decompose at PIC code using the GCPIC algorithm, the physical domain of the particle simulation is divided into sub-domains, equal in number to the number of processors, such that all sub-domains have roughly equal numbers of particles. For problems with non-uniform particle densities, these sub-domains will be of unequal physical size. Each processormore »« less
https://doi.org/10.1016/0021-9991(89)90153-8
Efficiency and acceptance rates in the application of the Metropolis algorithm to lattice gauge theories

Journal Article Baig, M ; Cuervo, A - Ann. Phys. (N.Y.); (United States)

We study the efficiency of trial distributions in the Metropolis algorithm test for SU(2) Wilson action. The acceptance rate of trial matrices in the Metropolis test and the correlations of results are measured for distributions peak around the identity. Away from the strong coupling region, we observe a frame where the acceptance rate decreases exponentially with the distance of the trial matrices from the identity, as well as a correlation minimum just at the beginning of this frame. Suggestions for optimizing application of the Metropolis algorithm are also presented. copyright 1988 Academic Press, Inc.
https://doi.org/10.1016/0003-4916(88)90284-9
Properties of the eleven-dimensional supermembrane theory

Journal Article Bergshoeff, E ; Sezgin, E ; Townsend, P K - Ann. Phys. (N.Y.); (United States)

We study in detail the structure of the Lorentz covariant, spacetime supersymmetric 11-dimensional supermembrane theory. We show that for a flate spacetime background, the spacetime supersymmetry becomes an N = 8 world volume (rigid) supersymmetry in a ''physical'' gauge; we also present the field equations and transformation rules in a ''lightcone'' gauge. We semiclassically quantize the closed torodial supermembrane on a spactime (Minkowski)/sub 4/ x (flat 7-torus), and review some mathematical results that are relevant for path integral quantization. copyright 1988 Academic Press, Inc.
https://doi.org/10.1016/0003-4916(88)90050-4

Similar Records