Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mesh optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 883 records · Page 49

Operator induced multigrid algorithms using semirefinement

A variant of multigrid, based on zebra relaxation, and a new family of restriction/prolongation operators is described. Using zebra relaxation in combination with an operator-induced prolongation leads to fast convergence, since the coarse grid can correct all error components. The resulting algorithms are not only fast, but are also robust, in the sense that the convergence rate is insensitive to the mesh aspect ratio. This is true even though line relaxation is performed in only one direction. Multigrid becomes a direct method if an operator-induced prolongation is used, together with the induced coarse grid operators. Unfortunately, this approach leads to stencils which double in size on each coarser grid. The use of an implicit three point restriction can be used to factor these large stencils, in order to retain the usual five or nine point stencils, while still achieving fast convergence. This algorithm achieves a V-cycle convergence rate of 0.03 on Poisson's equation, using 1.5 zebra sweeps per level, while the convergence rate improves to 0.003 if optimal nine point stencils are used. Numerical results for two- and three-dimensional model problems are presented, together with a two level analysis explaining these results.

Decker, Naomi Henderson↗

Coupling Subsurface and Above-Surface Models for Optimizing the Design of Borefields and District Heating and Cooling Systems

Accurate dynamic energy simulation is important for the design and sizing of district heating and cooling systems with geothermal heat exchange for seasonal energy storage. Current modeling approaches in building and district energy simulation tools typically consider heat conduction through the ground between boreholes without flowing groundwater. While detailed simulation tools for subsurface heat and mass transfer exist, these fall short in simulating above-surface energy systems. To support the design and operation of such systems, the study developed a coupled model including a software package for building and district energy simulation, and software for detailed heat and mass transfer in the subsurface. For the first, it uses the open-source Modelica Buildings Library, which includes dynamic simulation models for building and district energy and control systems. For the heat and mass transfer in the soil, it uses the TOUGH simulator. The TOUGH family of codes can model heat and multi-phase, multi-component mass transport for a variety of fluid systems, as well as chemical reactions, in fractured porous media. The study validated the coupled modeling approach by comparing the simulation results with one from the g-function based ground response model. It then looked into effects when the water table and the regional groundwater flow are considered in the ground, from the perspective of heat exchange between borehole and ground, and the electrical consumption of the district heating and cooling systems. To access the simulation models, please find the links in the submission: -- For coupled approach validation: see model Buildings.Fluid.Geothermal.Borefields.Examples.BorefieldsWithTough and Buildings.Examples.DistrictReservoirNetworks.Examples.Reservoir3Variable_TOUGH from the "Modelica Building Library" resource, branch issue1495_tough_interface, commit a2667c0. -- For the study of the effect of water table: see model Buildings.Examples.DistrictReservoirNetworks.Examples.Reservoir3Variable_TOUGH from he "Modelica Building Library" resource, branch issue1495_tough_interface_moreIO, commit 760de49. -- For the study of the effect of regional groundwater flow: see Buildings.Examples.DistrictReservoirNetworks.Examples.Reservoir3Variable_TOUGH from he "Modelica Building Library" resource, branch issue1495_tough_interface_moreIO_3D, commit c2a2d2a. The coupling interface script "GrounResponse.py" can be found from the above links in the folder Buildings/Resources/Python-Sources. Also, the needed files for TOUGH simulation are in the folder Buildings/Resources/Python-Sources/ToughFiles that can be accessed through the above links. A brief description of these files is given below; detailed specifications for the first three files may be found in the TOUGH3 Users Guide (Jung et al., 2018) https://tough.lbl.gov/documentation/tough-manuals/. (1) INCON - initial conditions for each grid block (2) INFILE - main input file with material properties and control parameters (3) MESH - description of the computational grid (4) readsave - Modelica/TOUGH interface program: read the final output of TOUGH simulation after TOUGH time step and prepare for transfer to Modelica for next Modelica time step (5) readsave.inp - input parameters for program readsave (6) writeincon - Modelica/TOUGH interface program: write the output of Modelica after Modelica time step and prepare for transfer to TOUGH as initial conditions for the next TOUGH step (7) writeincon.inp - input parameters for program writeincon

15 GEOTHERMAL ENERGY↗

Validation of RELAP-7 for Forced Convective and Natural Circulation Reactor Flows

New reactor designs such as small modular reactors and newly proposed passive safety systems rely on natural circulation two-phase flow cooling of the reactor core under accident conditions. Without a pump to drive the flow, the circulation rate is a strong function of void fraction. Under these conditions where the flow rate, pressure drop, and heat transfer are all closely coupled through the mixture density, the accurate prediction of void fraction is pivotal. Furthermore, while these passive systems boast a more reliable cooling option, the sensitivity of the system to two-phase flow instabilities is more likely than in forced convective cooling and can result in dangerous density wave or flow excursion conditions. Improvement of one-dimensional system codes and further development of three-dimensional code capability are all important efforts in addressing these issues. The proposed work is a critical step towards providing confidence through validation of the capability of thermal-hydraulic tools to meet the emerging challenges in reactor simulation. Historically, system analysis codes develop a stiffness over time due to fine-tuning of adjustable code parameters that result in a reluctance or inability to adopt improved models. Therefore, a rigorous effort should be invested in preparation for RELAP-7 to identify required modeling improvements of constitutive relations and validation of the code applicability to the wide range of possible reactor flow conditions. Part of this validation involves the uncertainty quantification which is a critical step in the Code Scaling, Applicability, and Uncertainty (CSAU) methodology and Best-Estimate Plus Uncertainty (BEPU) licensing method. BEPU allows recovery of safety margins and potentially optimizing plant performance, resulting in economic benefit for the reactor operators. Beginning with the collection of past experimental data covering prototypic LWR conditions, this document reviews three critical datasets available for the validation of system codes. The experimental methods, procedures, facilities, instrumentation, and supplementary information are consolidated to aid the validation efforts of this work and future projects. These three datasets (824 conditions) are chosen due to their wide acceptance and demonstrated application for code validation. Two experimental datasets from the Nuclear Power Engineering Corporation (NUPEC) span prototypic conditions of Boiling Water Reactors (BWR) and Pressurized Water Reactors (PWR). These datasets are labeled as the BFBT (BWR Full-size Fine-mesh Bundle Test) and the PSBT (PWR Subchannel and Bundle Test) datasets respectively. The third dataset is taken in an internally heated annulus that is scaled based on a BWR subassembly and includes two-phase flows important to post-blowdown analysis. Together, the datasets consider the full range of pressure and mass flux expected in LWR forced convective flows from steady-state to long term cooling conditions. Recognizing the deficiency of available data under low-pressure, low-flow, a new natural circulation dataset consisting of 107 conditions is obtained. With system pressures ranging between 145 and 950 kPa, natural circulation is driven by a heat flux up to 275 kW/m2 in a 3 m long heated region of the annulus test section which is followed by a 2 m long unheated region before entering a condenser. Stable natural circulation flow rates in this facility were measured to be between 182 and 590 kg/m2-s. Pressure and temperature are measured at ten locations in the facility. In addition, measurements of void fraction, interfacial area concentration, and gas velocity are obtained at five axial locations in the annulus test section. The RELAP5-3D code demonstrates good accuracy for void fraction predictions in BFBT and PSBT benchmarks, but shows relatively large discrepancy in the annulus experiments at lower pressures. In two-phase natural circulation, large oscillations are observed in many system parameters during the simulation of 19 experiment cases which were conducted at low pressures, and the model shows good predictive performance with the remaining 88 experiment cases. However, some discrepancies in void fraction and temperature predictions are found which may require improved constitutive modeling under these low-pressure, low-flow condition. The quantified uncertainty in void fraction predictions in three forced convection benchmarks due to uncertainties in boundary conditions and geometries are relatively small, except for a few cases in the annulus experiment. The output uncertainty of the natural circulation model is quantified by considering the measurement error in boundary conditions, and it is shown that the output uncertainty ranges are relatively small for the range of conditions considered. Through this work, a clear pathway is provided for validation of RELAP7 once the code is available.

42 ENGINEERING↗

Partitioned Coupling for Structural Acoustics

Here, we expand the second-order fluid–structure coupling scheme of Farhat et al. (1998, “Load and Motion Transfer Algorithms for 19 Fluid/Structure Interaction Problems With Non-Matching Discrete Interfaces: Momentum and Energy Conservation, Optimal Discretization and Application to Aeroelasticity,” Comput. Methods Appl. Mech. Eng., 157(1–2), pp. 95–114; 2006, “Provably Second-Order Time-Accurate Loosely-Coupled Solution Algorithms for Transient Nonlinear Computational Aeroelasticity,” Comput. Methods Appl. Mech. Eng., 195(17), pp. 1973–2001) to structural acoustics. The staggered structural acoustics solution method is demonstrated to be second-order accurate in time, and numerical results are compared to a monolithically coupled system. The partitioned coupling method is implemented in the Sierra Mechanics software suite, allowing for the loose coupling of time domain acoustics in SIERRA/SD to structural dynamics ( SIERRA/SD ) or solid mechanics ( SIERRA/SD ). The coupling is demonstrated to work for nonconforming meshes. Results are verified for a one-dimensional piston, and the staggered and monolithic results are compared to an exact solution. Huang, H. (1969, “Transient Interaction of Plane Acoustic Waves With a Spherical Elastic Shell,” J. Acoust. Soc. Am., 45(3), pp. 661–670) sphere scattering problem with a spherically spreading acoustic load demonstrates parallel capability on a complex problem. Our numerical results compare well for a bronze plate submerged in water and sinusoidally excited (Fahnline and Shepherd, 2017, “Transient Finite Element/Equivalent Sources Using Direct Coupling and Treating the Acoustic Coupling Matrix as Sparse,” J. Acoust. Soc. Am., 142(2), pp. 1011–1024).

42 ENGINEERING↗

AMReX and pyAMReX: Looking beyond the exascale computing project

AMReX is a software framework for the development of block-structured mesh applications with adaptive mesh refinement (AMR). AMReX was initially developed and supported by the AMReX Co-Design Center as part of the U.S. DOE Exascale Computing Project (ECP), and is continuing to grow post-ECP. In addition to adding new functionality and performance improvements to the core AMReX framework, we have also developed a Python binding, pyAMReX, that provides a bridge between AMReX-based application codes and the data science ecosystem. pyAMReX provides zero-copy application GPU data access for AI/ML, in situ analysis and application coupling, and enables rapid, massively parallel prototyping. In this paper we review the overall functionality of AMReX and pyAMReX, focusing on new developments, new functionality, and optimizations of key operations. We also summarize capabilities of ECP projects that used AMReX and provide an overview of new, non-ECP applications.

Myers, Andrew↗

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composite data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, J. R.↗

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composits data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, John R.↗

Reoptimization of the Ohio State University radio telescope for the NASA SETI program

The Ohio State University radiotelescope is the second largest radio telescope in the United States, equivalent in collecting area (2200 sq m) to a 175-foot diameter dish. For the past 17 years it has been dedicated fulltime to SETI, and it is now being considered by NASA for selection as the NASA dedicated SETI observatory. The telescope was originally designed, optimized, and used as an all-sky survey instrument to create detailed maps and catalogs of the radio astronomical sky. For the SETI Program, some re-optimizations are required. Right ascension tracking for one to two hours (depending on the declination) was achieved by exploiting the exceptionally large f/d ratio of the telescope. The feed horns were mounted on a large moveable, rubber-tired cart which is capable of a total motion of 100 feet. The cart can carry many horns, making possible simultaneous observations at many sky directions and frequency ranges. Rapid declination movement and its automation will be accomplished through simplification of the existing braking system, and replacement of older mechanical sensors by modern electronic inclinometers and proximity detectors. Circular polarization capability will be achieved through an increase in the number of horizontal wires in the reflector mesh, or addition of a finer mesh on top of the existing one. The telescope has great inherent resistance to radio frequency interference, due to its ground-mounted feed horns and shielding by the large reflectors of half the horizon. The resistance was recently increased further by installation of rolled-edges and diffraction-trapping gratings on the feed horns. If further shielding should be required, inexpensive side shields could be added to the telescope, making it a totally closed structure on all four sides.

Dixon, R. S.↗

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composite data structure by allocating one processor (at least conceptually) per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of the operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum-cost way to evaluate an expression, for several different data parallel architectures. This algorithm applies to any architecture in which the metric describing the cost of moving an array is robust. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes. Remarks are made on several variations of the problem, some of which are solved and some of which remain open.

Gilbert, John R.↗

Characteristics of the RF Negative Ion Source Using a Mesh Grid Bias Method

Using a mesh grid bias method for plasma parameter control, volume production of hydrogen negative ions H{sup -} is studied in pure hydrogen rf plasmas. Relationship between the extracted H{sup -} ion currents and plasma parameters is discussed. Both high and low electron temperature T{sub e} plasmas are produced in the separated regions when the grid is negatively biased. In addition, with changing grid potential V{sub g}, values of n{sub e} increase while T{sub e} decrease in their values. The negative ion production depends strongly on the grid potential and related plasma conditions. It is also confirmed that grid bias method is more effective than the so-called magnetic filter method to optimize plasma parameters for H{sup -} production. Production of deuterium negative ions D{sup -} is also studied briefly.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A High-Quality Workflow for Multi-Resolution Scientific Data Reduction and Visualization

Multi-resolution methods such as Adaptive Mesh Refinement (AMR) can enhance storage efficiency for HPC applications generating vast volumes of data. However, their applicability is limited and cannot be universally deployed across all applications. Furthermore, integrating lossy compression with multi-resolution techniques to further boost storage efficiency encounters significant barriers. To this end, we introduce an innovative workflow that facilitates high-quality multi-resolution data compression for both uniform and AMR simulations. Initially, to extend the usability of multi-resolution techniques, our workflow employs a compression-oriented Region of Interest (ROI) extraction method, transforming uniform data into a multi-resolution format. Subsequently, to bridge the gap between multi-resolution techniques and lossy compressors, we optimize three distinct compressors, ensuring their optimal performance on multi-resolution data. These optimizations can improve the compression ratio of SOTA approaches by up to 3.3× under the same data quality loss. Lastly, we incorporate an advanced uncertainty visualization method into our workflow to understand the potential impacts of lossy compression. Experimental evaluation demonstrates that our workflow achieves significant compression quality improvements.

Wang, Daoce↗

A multiscale mass scaling approach for explicit time integration using proper orthogonal decomposition

One of the main computational issues with explicit dynamics simulations is the significant reduction of the critical time step as the spatial resolution of the finite element mesh increases. In this work, a selective mass scaling approach is presented that can significantly reduce the computational cost in explicit dynamic simulations, while maintaining accuracy. The proposed method is based on a multiscale decomposition approach that separates the dynamics of the system into low (coarse scales) and high frequencies (fine scales). Here, the critical time step is increased by selectively applying mass scaling on the fine scale component only. In problems where the response is dominated by the coarse (low frequency) scales, significant increases in the stable time step can be realized. In this work, we use the proper orthogonal decomposition (POD) method to build the coarse scale space. The main idea behind POD is to obtain an optimal low-dimensional orthogonal basis for representing an ensemble of high-dimensional data. In our proposed method, the POD space is generated with snapshots of the solution obtained from early times of the full-scale simulation. The example problems addressed in this work show significant improvements in computational time, without heavily compromising the accuracy of the results.

97 MATHEMATICS AND COMPUTING↗

Kriging-Based Inverse Uncertainty Quantification of BISON Fission Gas Release Model

Nuclear reactor fuel performance analysis studies the thermo-mechanical behavior of fuel rods and verify their compliance with safety criteria under both normal operation and accidental conditions. One of the major concerns in fuel performance analysis is the behavior of the fission gases xenon and krypton in uranium dioxide fuel, which significantly affect the thermo-mechanical performance of the nuclear fuel rods employed in current LWRs. Previously, the modeling of fission gas release (FGR) in nuclear fuel performance codes have been relying on empirical models which are not applicable beyond their range of calibration. Recently a more efficient and flexible physics-based FGR and swelling model that can describe a wider range of reactor operation conditions have been implemented in fuel performance code BISON. In this work, we performed Bayesian calibration to inversely quantify the uncertainties associated with the 5 tuning parameters in BISON FGR model, based on the time-dependent FGR measurement data from Riso-AN3 benchmark. It takes around 1 hour and 40 minutes for BISON to simulate the Riso-AN3 benchmark with a moderate mesh size using 32 processors. As hundreds of thousands of BISON simulations are needed during Markov Chain Monte Carlo (MCMC) sampling, running BISON directly is not a viable solution. Therefore we propose to use Kriging-based metamodels to replace BISON during MCMC sampling. Surrogate model is an approximation of the input/output relation of a computer code/model. It is also called metamodel, response surface, emulator. Surrogate models usually take much less computational time than the original model (like BISON) while maintaining the input/output relation of the original model to a desirable accuracy. Constructing the metamodels normally requires small number of executions of the original model. Once validated, metamodels can be used to perform uncertainty and sensitivity analysis, Bayesian calibration, optimization, etc.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Equivalent Relaxations of Optimal Power Flow

Several convex relaxations of the optimal power flow (OPF) problem have recently been developed using both bus injection models and branch flow models. In this paper, we prove relations among three convex relaxations: a semidefinite relaxation that computes a full matrix, a chordal relaxation based on a chordal extension of the network graph, and a second-order cone relaxation that computes the smallest partial matrix. We prove a bijection between the feasible sets of the OPF in the bus injection model and the branch flow model, establishing the equivalence of these two models and their second-order cone relaxations. Our results imply that, for radial networks, all these relaxations are equivalent and one should always solve the second-order cone relaxation. For mesh networks, the semidefinite relaxation and the chordal relaxation are equally tight and both are strictly tighter than the second-order cone relaxation. Therefore, for mesh networks, one should either solve the chordal relaxation or the SOCP relaxation, trading off tightness and the required computational effort. Simulations are used to illustrate these results.

Bose, S↗

User-oriented Improvements in the MOOSE Framework in Support of Multiphysics Simulation

The Multiphysics Object-Oriented Simulation Environment (MOOSE) framework is a foundational capability used by the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program to create over 15 different simulation tools for advanced nuclear reactors. Due to this ubiquity, improvements to the framework in support of modeling and simulation goals are critical to the program. These improvements can take many forms, including optimization, improved user experience, streamlined application programming interfaces (APIs), parallelism, and new capabilities. The work transcribed in this report was conducted in direct support of the simulation tools and has already been deployed or will be deployed in the coming months. The capabilities were implemented in the same order as they are covered in this report: chainable execution objects or executors, support for transfers between same-level applications in a coupling scheme, support for boundary/subdomain restricted transfers, support for transfers between applications with different coordinate or unit systems, support for MOOSE applications in the NEAMS Workbench, deployment of the MOOSE application of the Idaho National Laboratory (INL) high-performance computing (HPC) OnDemand platform, the addition of a triangular meshing library in libMesh, and increased support of face variables.

97 MATHEMATICS AND COMPUTING↗

Flexible Microsensor Array for the Monitoring and Control of Plant Growth System

Testing for plant experiments in space has begun to explore active nutrient delivery concepts in which water and nutrients are replenished on a continuous basis for long-term growth. The goal of this study is to develop a novel microsensor array to provide information on the dissolved oxygen environment in the plant root zone for the optimum control of hydroponics and solid substrate plant cultivation systems in the space environment. Miniaturized polarographic dissolved oxygen sensors have been designed and fabricated on a flexible Kapton (trademark) (polyimide) substrate. Two capabilities of the new microsensor array were explored. First, measurements of dissolved oxygen in the plant root zone in hydroponics and solid substrate culture systems were made. The microsensor array was fabricated on a flexible substrate, and then cut out into a mesh type to make a suspended array that could be placed either in a hydroponics system or in a solid substrate cultivation system to measure the oxygen environments. Second, the in situ self-diagnostic and self-calibration capability (two-point for oxygen) was adopted by dynamically controlling the microenvironment in close proximity to the microsensors. With a built-in generating electrode that surrounds the microsensor, two kinds of microenvironments (oxygen-saturated and oxygen-depleted phases) could be established by water electrolysis depending on the polarity of the generating electrode. The unique features of the new microsensor array (small size, multiple sensors, flexibility and self-diagnosis) can have exceptional benefits for the study and optimization of plant cultivation systems in both terrestrial and microgravity environments. The in situ self-diagnostic and self-calibration features of the microsensor array will also enable continuous verification of the operability during entire plant growth cycles. This concept of automated control of a novel chemical monitoring system will minimize crew time required for maintenance, as well as reduce volume, mass, and power consumption by eliminating bulky diagnosis systems including calibrant (fluid and gas) reservoir and flow system hardware.

Kim, Chang-Soo↗

Adaptive Numerical Algorithms in Space Weather Modeling

Space weather describes the various processes in the Sun-Earth system that present danger to human health and technology. The goal of space weather forecasting is to provide an opportunity to mitigate these negative effects. Physics-based space weather modeling is characterized by disparate temporal and spatial scales as well as by different physics in different domains. A multi-physics system can be modeled by a software framework comprising of several components. Each component corresponds to a physics domain, and each component is represented by one or more numerical models. The publicly available Space Weather Modeling Framework (SWMF) can execute and couple together several components distributed over a parallel machine in a flexible and efficient manner. The framework also allows resolving disparate spatial and temporal scales with independent spatial and temporal discretizations in the various models. Several of the computationally most expensive domains of the framework are modeled by the Block-Adaptive Tree Solar wind Roe Upwind Scheme (BATS-R-US) code that can solve various forms of the magnetohydrodynamics (MHD) equations, including Hall, semi-relativistic, multi-species and multi-fluid MHD, anisotropic pressure, radiative transport and heat conduction. Modeling disparate scales within BATS-R-US is achieved by a block-adaptive mesh both in Cartesian and generalized coordinates. Most recently we have created a new core for BATS-R-US: the Block-Adaptive Tree Library (BATL) that provides a general toolkit for creating, load balancing and message passing in a 1, 2 or 3 dimensional block-adaptive grid. We describe the algorithms of BATL and demonstrate its efficiency and scaling properties for various problems. BATS-R-US uses several time-integration schemes to address multiple time-scales: explicit time stepping with fixed or local time steps, partially steady-state evolution, point-implicit, semi-implicit, explicit/implicit, and fully implicit numerical schemes. Depending on the application, we find that different time stepping methods are optimal. Several of the time integration schemes exploit the block-based granularity of the grid structure. The framework and the adaptive algorithms enable physics based space weather modeling and even forecasting.

Toth, Gabor↗

Incremental triangulation by way of edge swapping and local optimization

This document is intended to serve as an installation, usage, and basic theory guide for the two dimensional triangulation software 'HARLEY' written for the Silicon Graphics IRIS workstation. This code consists of an incremental triangulation algorithm based on point insertion and local edge swapping. Using this basic strategy, several types of triangulations can be produced depending on user selected options. For example, local edge swapping criteria can be chosen which minimizes the maximum interior angle (a MinMax triangulation) or which maximizes the minimum interior angle (a MaxMin or Delaunay triangulation). It should be noted that the MinMax triangulation is generally only locally optical (not globally optimal) in this measure. The MaxMin triangulation, however, is both locally and globally optical. In addition, Steiner triangulations can be constructed by inserting new sites at triangle circumcenters followed by edge swapping based on the MaxMin criteria. Incremental insertion of sites also provides flexibility in choosing cell refinement criteria. A dynamic heap structure has been implemented in the code so that once a refinement measure is specified (i.e., maximum aspect ratio or some measure of a solution gradient for the solution adaptive grid generation) the cell with the largest value of this measure is continually removed from the top of the heap and refined. The heap refinement strategy allows the user to specify either the number of cells desired or refine the mesh until all cell refinement measures satisfy a user specified tolerance level. Since the dynamic heap structure is constantly updated, the algorithm always refines the particular cell in the mesh with the largest refinement criteria value. The code allows the user to: triangulate a cloud of prespecified points (sites), triangulate a set of prespecified interior points constrained by prespecified boundary curve(s), Steiner triangulate the interior/exterior of prespecified boundary curve(s), refine existing triangulations based on solution error measures, and partition meshes based on the Cuthill-McKee, spectral, and coordinate bisection strategies.

Wiltberger, N. Lyn↗