Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mesh Topology”

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.

197 records · Page 11

Advanced adaptive computational methods for Navier-Stokes simulations in rotorcraft aerodynamics

A phase 2 research and development effort was conducted in area transonic, compressible, inviscid flows with an ultimate goal of numerically modeling complex flows inherent in advanced helicopter blade designs. The algorithms and methodologies therefore are classified as adaptive methods, which are error estimation techniques for approximating the local numerical error, and automatically refine or unrefine the mesh so as to deliver a given level of accuracy. The result is a scheme which attempts to produce the best possible results with the least number of grid points, degrees of freedom, and operations. These types of schemes automatically locate and resolve shocks, shear layers, and other flow details to an accuracy level specified by the user of the code. The phase 1 work involved a feasibility study of h-adaptive methods for steady viscous flows, with emphasis on accurate simulation of vortex initiation, migration, and interaction. Phase 2 effort focused on extending these algorithms and methodologies to a three-dimensional topology.

Stowers, S. T.↗

Handing off the outcome of binary neutron star mergers for accurate and long-term postmerger simulations

In this work, we perform binary neutron star (BNS) merger simulations in full dynamical general relativity with IllinoisGRMHD, on a Cartesian grid with adaptive-mesh refinement. After the remnant black hole has become nearly stationary, the evolution of the surrounding accretion disk on Cartesian grids over long timescales (~1s) is suboptimal, as Cartesian coordinates over-resolve the angular coordinates at large distances, and the accreting plasma flows obliquely across coordinate lines dissipating angular momentum artificially from the disk. To address this, we present the HandOff, a set of computational tools that enables the transfer of general relativistic magnetohydrodynamic (GRMHD) and spacetime data from IllinoisGRMHD to harm3d, a GRMHD code that specializes in modeling black hole accretion disks in static spacetimes over long timescales, making use of general coordinate systems with spherical topology. We demonstrate that the handoff allows for a smooth and reliable transition of GRMHD fields and spacetime data, enabling us to efficiently and reliably evolve BNS dynamics well beyond merger. We also discuss future plans, which involve incorporating advanced equations of state and neutrino physics into BNS simulations using the HandOff approach.

79 ASTRONOMY AND ASTROPHYSICS↗

Aeroheating Predictions for a Hypersonic, Turbulent Near-Wake

The accuracy of heating predictions using various turbulence models is examined for an axisymmetric near-wake at Mach 6. The CFD predictions are compared with experimental data collected under AGARD Working Group 18 on the wake of a 70-degree sphere-cone. The impact of grid resolution and discretization error is estimated, which allows a comparison of stacked-block and conventional structured meshes. The accuracy of steady Reynolds-averaged Navier-Stokes (RANS) models is contrasted with that of a hybrid RANS/Large-Eddy Simulation model. The predictions are made with three different CFD codes (LAURA, FUN3D, and HyperSolve), to demonstrate the code-to-code variation in the results. Steady SST models capture the qualitative nature of the heating in the wake, including the increasing peak heating with increasing Reynolds number. Spalart-Allmaras models, including SA-Catris, under-predicted the peak heating in the wake. Hybrid RANS/LES models improve upon the SA results but have their own modeling difficulties near the shear layer impingement. These results are generally consistent across solvers and grid topologies.

RANS↗

Aeroheating Predictions for a Hypersonic, Turbulent Near-Wake

The accuracy of heating predictions using various turbulence models is examined for an axisymmetric near-wake at Mach 6. The CFD predictions are compared with experimental data collected under AGARD Working Group 18 on the wake of a 70-degree sphere-cone. The impact of grid resolution and discretization error is estimated, which allows a comparison of stacked-block and conventional structured meshes. The accuracy of steady Reynolds-averaged Navier-Stokes (RANS) models is contrasted with that of a hybrid RANS/Large-Eddy Simulation model. The predictions are made with three different CFD codes (LAURA, FUN3D, and HyperSolve), to demonstrate the code-to-code variation in the results. Steady SST models capture the qualitative nature of the heating in the wake, including the increasing peak heating with increasing Reynolds number. Spalart-Allmaras models, including SA-Catris, under-predicted the peak heating in the wake. Hybrid RANS/LES models improve upon the SA results but have their own modeling difficulties near the shear layer impingement. These results are generally consistent across solvers and grid topologies.

RANS↗

CHARMM-GUI Nanomaterial Modeler for Modeling and Simulation of Nanomaterial Systems

Molecular modeling and simulation are invaluable tools for nanoscience that predict mechanical, physicochemical, and thermodynamic properties of nanomaterials and provide molecular-level insight into underlying mechanisms. However, building nanomaterial-containing systems remains challenging due to the lack of reliable and integrated cyberinfrastructures. Here we present Nanomaterial Modeler in CHARMM-GUI, a web-based cyberinfrastructure that provides an automated process to generate various nanomaterial models, associated topologies, and configuration files to perform state-of- the-art molecular dynamics simulations using most simulation packages. The nanomaterial models are based on the interface force field, one of the most reliable force fields (FFs). The transferability of nanomaterial models among the simulation programs was assessed by single-point energy calculations, which yielded 0.01% relative absolute energy differences for various surface models and equilibrium nanoparticle shapes. Three widely used Lennard-Jones (LJ) cutoff methods are employed to evaluate the compatibility of nanomaterial models with respect to conventional biomolecular FFs: simple truncation at r = 12 Å (12 cutoff), force-based switching over 10 to 12 Å (10-12 fsw), and LJ particle mesh Ewald with no cutoff (LJPME). The FF parameters with these LJ cutoff methods are extensively validated by reproducing structural, interfacial, and mechanical properties. As a result, we find that the computed density and surface energies are in good agreement with reported experimental results, although the simulation results increase in the following order: 10-12 fsw <12 cutoff < LJPME. Nanomaterials in which LJ interactions are a major component show relatively higher deviations (up to 4% in density and 8% in surface energy differences) compared with the experiment. Nanomaterial Modeler's capability is also demonstrated by generating complex systems of nanomaterial-biomolecule and nanomaterial-polymer interfaces with a combination of existing CHARMM-GUI modules. We hope that Nanomaterial Modeler can be used to carry out innovative nanomaterial modeling and simulations to acquire insight into the structure, dynamics, and underlying mechanisms of complex nanomaterial-containing systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Field Model: An Object-Oriented Data Model for Fields

We present an extensible, object-oriented data model designed for field data entitled Field Model (FM). FM objects can represent a wide variety of fields, including fields of arbitrary dimension and node type. FM can also handle time-series data. FM achieves generality through carefully selected topological primitives and through an implementation that leverages the potential of templated C++. FM supports fields where the nodes values are paired with any cell type. Thus FM can represent data where the field nodes are paired with the vertices ("vertex-centered" data), fields where the nodes are paired with the D-dimensional cells in R(sup D) (often called "cell-centered" data), as well as fields where nodes are paired with edges or other cell types. FM is designed to effectively handle very large data sets; in particular FM employs a demand-driven evaluation strategy that works especially well with large field data. Finally, the interfaces developed for FM have the potential to effectively abstract field data based on adaptive meshes. We present initial results with a triangular adaptive grid in R(sup 2) and discuss how the same design abstractions would work equally well with other adaptive-grid variations, including meshes in R(sup 3).

Moran, Patrick J.↗

Comprehensive Modeling and Analysis of Rotorcraft Variable Speed Propulsion System With Coupled Engine/Transmission/Rotor Dynamics

This project develops comprehensive modeling and simulation tools for analysis of variable rotor speed helicopter propulsion system dynamics. The Comprehensive Variable-Speed Rotorcraft Propulsion Modeling (CVSRPM) tool developed in this research is used to investigate coupled rotor/engine/fuel control/gearbox/shaft/clutch/flight control system dynamic interactions for several variable rotor speed mission scenarios. In this investigation, a prototypical two-speed Dual-Clutch Transmission (DCT) is proposed and designed to achieve 50 percent rotor speed variation. The comprehensive modeling tool developed in this study is utilized to analyze the two-speed shift response of both a conventional single rotor helicopter and a tiltrotor drive system. In the tiltrotor system, both a Parallel Shift Control (PSC) strategy and a Sequential Shift Control (SSC) strategy for constant and variable forward speed mission profiles are analyzed. Under the PSC strategy, selecting clutch shift-rate results in a design tradeoff between transient engine surge margins and clutch frictional power dissipation. In the case of SSC, clutch power dissipation is drastically reduced in exchange for the necessity to disengage one engine at a time which requires a multi-DCT drive system topology. In addition to comprehensive simulations, several sections are dedicated to detailed analysis of driveline subsystem components under variable speed operation. In particular an aeroelastic simulation of a stiff in-plane rotor using nonlinear quasi-steady blade element theory was conducted to investigate variable speed rotor dynamics. It was found that 2/rev and 4/rev flap and lag vibrations were significant during resonance crossings with 4/rev lagwise loads being directly transferred into drive-system torque disturbances. To capture the clutch engagement dynamics, a nonlinear stick-slip clutch torque model is developed. Also, a transient gas-turbine engine model based on first principles mean-line compressor and turbine approximations is developed. Finally an analysis of high frequency gear dynamics including the effect of tooth mesh stiffness variation under variable speed operation is conducted including experimental validation. Through exploring the interactions between the various subsystems, this investigation provides important insights into the continuing development of variable-speed rotorcraft propulsion systems.

DeSmidt, Hans A.↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

Test experience on an ultrareliable computer communication network

The dispersed sensor processing mesh (DSPM) is an experimental, ultrareliable, fault-tolerant computer communications network that exhibits an organic-like ability to regenerate itself after suffering damage. The regeneration is accomplished by two routines - grow and repair. This paper discusses the DSPM concept for achieving fault tolerance and provides a brief description of the mechanization of both the experiment and the six-node experimental network. The main topic of this paper is the system performance of the growth algorithm contained in the grow routine. The characteristics imbued to DSPM by the growth algorithm are also discussed. Data from an experimental DSPM network and software simulation of larger DSPM-type networks are used to examine the inherent limitation on growth time by the growth algorithm and the relationship of growth time to network size and topology.

Abbott, L. W.↗

Test experience on an ultrareliable computer communication network

The dispersed sensor processing mesh (DSPM) is an experimental, ultra-reliable, fault-tolerant computer communications network that exhibits an organic-like ability to regenerate itself after suffering damage. The regeneration is accomplished by two routines - grow and repair. This paper discusses the DSPM concept for achieving fault tolerance and provides a brief description of the mechanization of both the experiment and the six-node experimental network. The main topic of this paper is the system performance of the growth algorithm contained in the grow routine. The characteristics imbued to DSPM by the growth algorithm are also discussed. Data from an experimental DSPM network and software simulation of larger DSPM-type networks are used to examine the inherent limitation on growth time by the growth algorithm and the relationship of growth time to network size and topology.

Abbott, L. W.↗

The National Grid Project: A system overview

The National Grid Project (NGP) is a comprehensive numerical grid generation software system that is being developed at the National Science Foundation (NSF) Engineering Research Center (ERC) for Computational Field Simulation (CFS) at Mississippi State University (MSU). NGP is supported by a coalition of U.S. industries and federal laboratories. The objective of the NGP is to significantly decrease the amount of time it takes to generate a numerical grid for complex geometries and to increase the quality of these grids to enable computational field simulations for applications in industry. A geometric configuration can be discretized into grids (or meshes) that have two fundamental forms: structured and unstructured. Structured grids are formed by intersecting curvilinear coordinate lines and are composed of quadrilateral (2D) and hexahedral (3D) logically rectangular cells. The connectivity of a structured grid provides for trivial identification of neighboring points by incrementing coordinate indices. Unstructured grids are composed of cells of any shape (commonly triangles, quadrilaterals, tetrahedra and hexahedra), but do not have trivial identification of neighbors by incrementing an index. For unstructured grids, a set of points and an associated connectivity table is generated to define unstructured cell shapes and neighboring points. Hybrid grids are a combination of structured grids and unstructured grids. Chimera (overset) grids are intersecting or overlapping structured grids. The NGP system currently provides a user interface that integrates both 2D and 3D structured and unstructured grid generation, a solid modeling topology data management system, an internal Computer Aided Design (CAD) system based on Non-Uniform Rational B-Splines (NURBS), a journaling language, and a grid/solution visualization system.

Gaither, Adam↗

The Effectiveness of Magnetic Shielding in High-Isp Hall Thrusters

A series of numerical simulations and experiments have been performed to assess the effectiveness of magnetic shielding in a Hall thruster operating in the discharge voltage range of 300-700 V (Isp 2000-2700 s) at 6 kW, and 800 V (Isp 3000) at 9 kW. In this paper we report on the simulation results and their validation with experimental measurements. At 6 kW the magnetic field topology with which we recently demonstrated highly effective magnetic shielding at 300 V was retained for all other discharge voltages; only the magnitude of the field was changed to achieve optimum thruster performance. It is found that magnetic shielding remains highly effective for all discharge voltages studied. Maximum erosion rates that remain fairly constant across the range of 300-700 V are computed, with values not exceeding 10-2 mm/kh. Such rates are ~3 orders of magnitude less than those observed in the unshielded version of the same thruster at 300 V. At 9 kW and 800 V, saturation of the magnetic circuit did not permit us to attain precisely the same magnetic shielding topology as that employed during the 6-kW operation since this thruster was not designed to operate at this condition. Consequently, the maximum erosion rate at the inner wall is found to be ~1 order of magnitude higher (~10-1 mm/kh) than that at the 6-kW level. At the outer wall the ion energy is below the sputtering yield threshold so no measurable erosion is expected. The reasons behind the effectiveness of magnetic shielding at higher discharge voltages are discussed.

magnetic-field-aligned-mesh (MFAM) code↗

Computerized Design and Generation of Low-Noise Gears with Localized Bearing Contact

The results of research projects directed at the reduction of noise caused by misalignment of the following gear drives: double-circular arc helical gears, modified involute helical gears, face-milled spiral bevel gears, and face-milled formate cut hypoid gears are presented. Misalignment in these types of gear drives causes periodic, almost linear discontinuous functions of transmission errors. The period of such functions is the cycle of meshing when one pair of teeth is changed for the next. Due to the discontinuity of such functions of transmission errors high vibration and noise are inevitable. A predesigned parabolic function of transmission errors that is able to absorb linear discontinuous functions of transmission errors and change the resulting function of transmission errors into a continuous one is proposed. The proposed idea was successfully tested using spiral bevel gears and the noise was reduced a substantial amount in comparison with the existing design. The idea of a predesigned parabolic function is applied for the reduction of noise of helical and hypoid gears. The effectiveness of the proposed approach has been investigated by developed TCA (tooth contact analysis) programs. The bearing contact for the mentioned gears is localized. Conditions that avoid edge contact for the gear drives have been determined. Manufacturing of helical gears with new topology by hobs and grinding worms has been investigated.

Litvin, Faydor L.↗

Non-destructive simulation of node defects in additively manufactured lattice structures

Additive Manufacturing (AM), commonly referred to as 3D printing, offers the ability to not only fabricate geometrically complex lattice structures but parts in which lattice topologies in-fill volumes bounded by complex surface geometries. However, current AM processes produce defects on the strut and node elements which make up the lattice structure. This creates an inherent difference between the as-designed and as-fabricated geometries, which negatively affects predictions (via numerical simulation) of the lattice’s mechanical performance. Although experimental and numerical analysis of an AM lattice’s bulk structure, unit cell and struts have been performed, there exists almost no research data on the mechanical response of the individual as-manufactured lattice node elements. Here we propose a methodology that, for the first time, allows non-destructive quantification of the mechanical response of node elements within an as-manufactured lattice structure. A custom-developed tool is used to extract and classify each individual node geometry from micro-computed tomography scans of an AM fabricated lattice. Voxel-based finite element meshes are generated for numerical simulation and the mechanical response distribution is compared to that of the idealised computer-aided design model. The method demonstrates compatibility with Uncertainty Quantification methods that provide opportunities for efficient prediction of a population of nodal responses from sampled data. Overall, the non-destructive and automated nature of the node extraction and response evaluation is promising for its application in qualification and certification of additively manufactured lattice structures.

36 MATERIALS SCIENCE↗

Toward Time Synchronization in Delay Tolerant Network based Solar System Internetworking

The expanding presence in space will place an increased dependency on networked communications– a scalable communications infrastructure; that is, the Solar System Internet (SSI). Upcoming developments towards a SSI include NASA’s upcoming LunaNet, or lunar Internet, which provides multi-hop multi-path communications using Delay Tolerant Networking (DTN). DTN has been an active area of research and development, particularly in routing, security, and optimization. DTNs are marked by mobility, disconnection, and a wide variance of latencies (propagation and processing delays). In this paper, we outline progress towards a theory of time synchronization across such a network. An underlying assumption of DTN is that the network is time synchronized already, rather than synchronization being provided as a service. While this is necessary for schedule-based routing, which is necessarily prevalent in DTNs, it is so deeply ingrained as to be built into the primary unit of data in DTNs– the bundle. Indeed, a bundle’s creation timestamp and its time to live (called the lifetime) are based on time, and there are special recommendations for systems that lack accurate clocks. The assumption of time synchronization makes sense when limiting considerations to smaller-scale and more traditional space communication. However, just as end-to-end connectivity cannot be guaranteed in DTNs, neither can access to a reference or authoritative clock. In this more general case, it might be necessary to synchronize over time-varying meshes, and perhaps even to consider relativistic effects. Moreover, by imposing synchronization restrictions in order to sustain a network, the effectiveness of the network to achieve scalability will be necessarily muted. To work towards a time synchronization theory for DTNs, we build upon past successes in modeling DTNs using time-varying graphs and sheaves. This includes error and limitation estimation, which allows one to define domains over which schedule-based routing is possible, up to some threshold sensitivity. Despite the theoretical nature of these results, the approaches taken are also algorithmic, and hence lend themselves to practical implementations. The paper concludes with comparisons of the various methods along with suggestions for future work.

Delay Tolerant Networking↗

Evaluation of Voronoi Meshes for Large Eddy Simulations of High Lift Aerodynamics

Numerical sensitivity to 3 different Voronoi seeding methods is investigated for Large Eddy Simulations (LES). A second order accurate, non-dissipative finite volume discretization is used to systematically investigate the effects of different polyhedral Voronoi mesh types using a sequence of three canonical problems with increasing complexity. First, inviscid isentropic vortex propagation is studied to demonstrate the substantial reduction of errors for rhombic dodecahedron and truncated octahedral cell types over Cartesian hexagonal cells of identical spacing. Furthermore, the reduction of errors induced at cell-size transitions (grid-coarsening interfaces) due to Lloyd smoothing iterations is quantified. It is shown that by utilizing an appropriate viscous flux discretization, a constant coefficient subgrid scale model is sufficient for non-linear stability at the 2:1 cell-size transitions on polyhedral grids, although some further error reduction does occur when smoothing is utilized. Next, forced homogeneous isotropic turbulence at an asymptotically large Reynolds number is studied to demonstrate the non-dissipative character of the inviscid flux discretization, and the non-linear robustness and accuracy offered by the viscous flux discretization using a subgrid scale model for all three Voronoi grid types. Finally,Wall-Modeled Large Eddy Simulations (WMLES) are performed to study the high-lift aerodynamics on the McDonnell Douglas 30P30N multi-element airfoil at two distinct grid levels and for two distinct Voronoi cell types. The formulation is shown to predict the aerodynamic loading with high accuracy at all angles of attack when sufficient resolution is reached, and the hexagonal prism grid topology, while computationally more expensive, has higher effective resolution compared to the Cartesian grid topology with the same spacing.

TTT↗

Evaluation of Voronoi Meshes for Large Eddy Simulations of High Lift Aerodynamics

Numerical sensitivity to 3 different Voronoi seeding methods is investigated for Large Eddy Simulations (LES). A second order accurate, non-dissipative finite volume discretization is used to systematically investigate the effects of different polyhedral Voronoi mesh types using a sequence of three canonical problems with increasing complexity. First, inviscid isentropic vortex propagation is studied to demonstrate the substantial reduction of errors for rhombic dodecahedron and truncated octahedral cell types over Cartesian hexagonal cells of identical spacing. Furthermore, the reduction of errors induced at cell-size transitions (grid-coarsening interfaces) due to Lloyd smoothing iterations is quantified. It is shown that by utilizing an appropriate viscous flux discretization, a constant coefficient subgrid scale model is sufficient for non-linear stability at the 2:1 cell-size transitions on polyhedral grids, although some further error reduction does occur when smoothing is utilized. Next, forced homogeneous isotropic turbulence at an asymptotically large Reynolds number is studied to demonstrate the non-dissipative character of the inviscid flux discretization, and the non-linear robustness and accuracy offered by the viscous flux discretization using a subgrid scale model for all three Voronoi grid types. Finally, Wall-Modeled Large Eddy Simulations (WMLES) are performed to study the high-lift aerodynamics on the McDonnell Douglas 30P30N multi-element airfoil at two distinct grid levels and for two distinct Voronoi cell types. The formulation is shown to predict the aerodynamic loading with high accuracy at all angles of attack when sufficient resolution is reached, and the hexagonal prism grid topology, while computationally more expensive, has higher effective resolution compared to the Cartesian grid topology with the same spacing.

TTT↗