Search NASA⌕ Search

SEARCH · Search NASA

Results for “arbitrary meshes”

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 415 records · Page 23

DRAGON Grid: A Three-Dimensional Hybrid Grid Generation Code Developed

Because grid generation can consume 70 percent of the total analysis time for a typical three-dimensional viscous flow simulation for a practical engineering device, payoffs from research and development could reduce costs and increase throughputs considerably. In this study, researchers at the NASA Glenn Research Center at Lewis Field developed a new hybrid grid approach with the advantages of flexibility, high-quality grids suitable for an accurate resolution of viscous regions, and a low memory requirement. These advantages will, in turn, reduce analysis time and increase accuracy. They result from an innovative combination of structured and unstructured grids to represent the geometry and the computation domain. The present approach makes use of the respective strengths of both the structured and unstructured grid methods, while minimizing their weaknesses. First, the Chimera grid generates high-quality, mostly orthogonal meshes around individual components. This process is flexible and can be done easily. Normally, these individual grids are required overlap each other so that the solution on one grid can communicate with another. However, when this communication is carried out via a nonconservative interpolation procedure, a spurious solution can result. Current research is aimed at entirely eliminating this undesired interpolation by directly replacing arbitrary grid overlapping with a nonstructured grid called a DRAGON grid, which uses the same set of conservation laws over the entire region, thus ensuring conservation everywhere. The DRAGON grid is shown for a typical film-cooled turbine vane with 33 holes and 3 plenum compartments. There are structured grids around each geometrical entity and unstructured grids connecting them. In fiscal year 1999, Glenn researchers developed and tested the three-dimensional DRAGON grid-generation tools. A flow solver suitable for the DRAGON grid has been developed, and a series of validation tests are underway.

Liou, Meng-Sing↗

Boundary-fitted curvilinear coordinate systems for solution of partial differential equations on fields containing any number of arbitrary two-dimensional bodies

A method is presented for automatic numerical generation of a general curvilinear coordinate system with coordinate lines coincident with all boundaries of a general multi-connected two-dimensional region containing any number of arbitrarily shaped bodies. No restrictions are placed on the shape of the boundaries, which may even be time-dependent, and the approach is not restricted in principle to two dimensions. With this procedure the numerical solution of a partial differential system may be done on a fixed rectangular field with a square mesh with no interpolation required regardless of the shape of the physical boundaries, regardless of the spacing of the curvilinear coordinate lines in the physical field, and regardless of the movement of the coordinate system in the physical plane. A number of examples of coordinate systems and application thereof to the solution of partial differential equations are given. The FORTRAN computer program and instructions for use are included.

Thompson, J. F.↗

Unsteady density-current equations for highly curved terrain

New nonlinear partial differential equations containing terrain curvature and its rate of change are derived that describe the flow of an atmospheric density current. Unlike the classical hydraulic-type equations for density currents, the new equations are valid for two-dimensional, gradually varied flow over highly curved terrain, hence suitable for computing unsteady (or steady) flows over arbitrary mountain/valley profiles. The model assumes the atmosphere above the density current exerts a known arbitrary variable pressure upon the unknown interface. Later this is specialized to the varying hydrostatic pressure of the atmosphere above. The new equations yield the variable velocity distribution, the interface position, and the pressure distribution that contains a centrifugal component, often significantly larger than its hydrostatic component. These partial differential equations are hyperbolic, and the characteristic equations and characteristic directions are derived. Using these to form a characteristic mesh, a hypothetical unsteady curved-flow problem is calculated, not based upon observed data, merely as an example to illustrate the simplicity of their application to unsteady flows over mountains.

Sivakumaran, N. S.↗

Multiscale formulation of frictional contact mechanics at the pore scale

Direct numerical simulation (DNS) yields the highest fidelity predictions of mechanical deformation at the pore scale, but is prohibitively expensive for analyzing large or many samples. Discrete element methods (DEM) are an efficient alternative, but are limited to granular media and incapable of estimating or controlling prediction errors. We present a pore-level multiscale method (PLMM) that approximates DNS efficiently and with controllable accuracy. We focus on the linear elastic response of a consolidated geologic porous medium with arbitrary microstructure, heterogeneous mineralogy, containing cracks or defects. PLMM decomposes the solid phase into non-overlapping subdomains, on which local basis functions are constructed. The bases are then coupled with a global interface problem that accounts for slip or stick contact conditions between the subdomains. PLMM produces an initial, but accurate, approximation to DNS that can be iteratively improved. It is amenable to parallelism and allows for different mesh, models, and physics in each subdomain. An algebraic interpretation of PLMM as a preconditioner is also presented to allow non-intrusive implementation into existing solvers. Lastly, this work extends previous developments of PLMM in fluid dynamics to solid mechanics and enables future extensions towards modeling coupled flow and mechanics problems.

42 ENGINEERING↗

Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation

We propose a new algorithm for computing the Riemann mapping of the unit disk to a polygon, also known as the Schwarz-Christoffel transformation. The new algorithm, CRDT, is based on cross-ratios of the prevertices, and also on cross-ratios of quadrilaterals in a Delaunay triangulation of the polygon. The CRDT algorithm produces an accurate representation of the Riemann mapping even in the presence of arbitrary long, thin regions in the polygon, unlike any previous conformal mapping algorithm. We believe that CRDT can never fail to converge to the correct Riemann mapping, but the correctness and convergence proof depend on conjectures that we have so far not been able to prove. We demonstrate convergence with computational experiments. The Riemann mapping has applications to problems in two-dimensional potential theory and to finite-difference mesh generation. We use CRDT to produce a mapping and solve a boundary value problem on long, thin regions for which no other algorithm can solve these problems.

Driscoll, Tobin A.↗

Exact charge and energy conservation in implicit PIC with mapped computational meshes

This paper discusses a novel fully implicit formulation for a one-dimensional electrostatic particle-in-cell (PIC) plasma simulation approach. Unlike earlier implicit electrostatic PIC approaches (which are based on a linearized Vlasov Poisson formulation), ours is based on a nonlinearly converged Vlasov Amp re (VA) model. By iterating particles and fields to a tight nonlinear convergence tolerance, the approach features superior stability and accuracy properties, avoiding most of the accuracy pitfalls in earlier implicit PIC implementations. In particular, the formulation is stable against temporal (Courant Friedrichs Lewy) and spatial (aliasing) instabilities. It is charge- and energy-conserving to numerical round-off for arbitrary implicit time steps (unlike the earlier energy-conserving explicit PIC formulation, which only conserves energy in the limit of arbitrarily small time steps). While momentum is not exactly conserved, errors are kept small by an adaptive particle sub-stepping orbit integrator, which is instrumental to prevent particle tunneling (a deleterious effect for long-term accuracy). The VA model is orbit-averaged along particle orbits to enforce an energy conservation theorem with particle sub-stepping. As a result, very large time steps, constrained only by the dynamical time scale of interest, are possible without accuracy loss. Algorithmically, the approach features a Jacobian-free Newton Krylov solver. A main development in this study is the nonlinear elimination of the new-time particle variables (positions and velocities). Such nonlinear elimination, which we term particle enslavement, results in a nonlinear formulation with memory requirements comparable to those of a fluid computation, and affords us substantial freedom in regards to the particle orbit integrator. Numerical examples are presented that demonstrate the advertised properties of the scheme. In particular, long-time ion acoustic wave simulations show that numerical accuracy does not degrade even with very large implicit time steps, and that significant CPU gains are possible.

Chen, Guangye↗

PHISICS: New Features and Advancements

The PHISICS (Parallel and Highly Innovative Simulation for INL Code System) software is under an intensive development at INL. In the last months new features have been added and improvements of the previously existing one performed. The modular approach has created a friendly development environment that allows a quick expansion of the capabilities. In the last months a little amount of work has been dedicated to the improvement of the spherical harmonics based nodal transport solver while the implementation of a solver based on the self adjoint formulation of the discrete ordinate is in the test phase on structured mesh. PHISICS now include a depletion solver with the option to use two different algorithms for the solution of the Bateman equation: the Taylor development of the exponential matrix and the Chebyshev Rational Approximation Method. The coupling with RELAP5 is also available at least in the steady state search mode. The coupling between RELAP5 and PHISICS can also take advantage of the new cross section interpolation module so that the coupling could be performed using an arbitrary number of energy groups.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A three-node C deg element for analysis of laminated composite sandwich shells

A three-node flat shell element with C deg rotation fields has been developed for analysis of arbitrary composite shells. The element may consist of any number of orthotropic layers, each layer having different material properties and angular orientation. The formulation includes coupling between bending and extension, which is essential for analysis of unsymmetric laminates. Shearing deflections are included, since laminated and sandwich construction frequently results in shear stiffness much smaller than bending stiffness. Formulation of the element is straightforward, and calculation of its stiffness matrix is simple and fast. Convergence of solutions with mesh refinement is uniform for both thin and thick shells and is insensitive to element shape, although not as rapid as some other elements that lack one or more capabilities of the newly developed element. An experimental verification of the shall element is reported in the appendix.

Martin, C. Wayne↗

Medial axis and local thickness computation using the Fast Sweeping Method

This report describes an efficient and robust voxel-based methodology for computing the medial axis, local thickness, and distance-to-skeleton of arbitrary three-dimensional geometries. It is assumed that the object can be represented by an exact or approximate signed distance function on a discrete grid. The gradient of such function is used to formulate a hyperbolic partial differential equation (PDE) that models the collapse of the position vector in space. By exploiting the causality property of the PDE, the Fast Sweeping Method is able to obtain the solution in a finite number of sweeps independent of the mesh resolution. The intersection of characteristic lines leads to the formation of shocks and a discrete bisector function is used to identify the medial axis. The same PDE approach is used to compute the local thickness inside the object and obtain the distance-to-skeleton field. Multiple examples are given in two and three dimensions along with a resolution study. The methodology has optimal complexity and yields subsecond computational times for geometries with over a million zones on a single core. The methodology is also capable of parallelization across shared and distributed memory architectures.

97 MATHEMATICS AND COMPUTING↗

Radiative Heat Transfer Calculation on 16384 GPUs Using a Reverse Monte Carlo Ray Tracing Approach with Adaptive Mesh Refinement

Modeling thermal radiation is computationally challenging in parallel due to its all-to-all physical and resulting computational connectivity, and is also the dominant mode of heat transfer in practical applications such as next-generation clean coal boilers, being modeled by the Uintah framework. However, a direct all-to-all treatment of radiation is prohibitively expensive on large computers systems whether homogeneous or heterogeneous. DOE Titan and the planned DOE Summit and Sierra machines are examples of current and emerging GPU-based heterogeneous systems where the increased processing capability of GPUs over CPUs exacerbates this problem. These systems require that computational frameworks like Uintah leverage an arbitrary number of on-node GPUs, while simultaneously utilizing thousands of GPUs within a single simulation. We show that radiative heat transfer problems can be made to scale within Uintah on heterogeneous systems through a combination of reverse Monte Carlo ray tracing (RMCRT) techniques combined with AMR, to reduce the amount of global communication. In particular, significant Uintah infrastructure changes, including a novel lock and contention-free, thread-scalable data structure for managing MPI communication requests and improved memory allocation strategies were necessary to achieve excellent strong scaling results to 16384 GPUs on Titan.

Computer Science↗

Accurate multigrid solution of the Euler equations on unstructured and adaptive meshes

A method for accurately solving inviscid compressible flow in the subcritical and supercritical regimes about complex configurations is presented. The method is based on the use of unstructured triangular meshes in two dimensions, and special emphasis is placed on the accuracy and efficiency of the solutions. High accuracy is achieved by careful scaling of the artificial dissipation terms, and by reformulating the inner and outer boundary conditions for both the convective and dissipative operators. An adaptive grid refinement strategy is presented which enhances the solution accuracy for complex flows. When coupled with an unstructured multigrid algorithm, this method is shown to produce an efficient solver for flows about arbitrary configurations.

Mavriplis, Dimitri J.↗

A Higher-Order Space-Time Finite-Element Method for Moving-Body and Fluid-Structure Interaction Problems

We present a high-order finite-element method for moving body and fluid/structure interaction problems. Our solution strategy is based on a space-time discontinuous Galerkin (DG) spectral-element discretization which extends to arbitrary order of accuracy. The space-time DG discretization is a natural choice for moving body and fluid-structure interaction problems as moving surfaces are incorporated simply by considering curved space-time elements whose space-time faces align with the moving body. We present a discontinuous-Galerkin in time discretization for six-degree of motion modeling of rigid bodies, and a continuous-Galerkin discretization for equations of linear elasticity to generate curved space-time meshes. Numerical results for several simple 2D test cases are presented in order to verify the implementation of the different models. Finally we present a preliminary dynamic simulation of a parachute.

High-Order↗

Efficiently enclosing the compact binary parameter space by singular-value decomposition

Gravitational-wave searches for the merger of compact binaries use matched filtering as the method of detecting signals and estimating parameters. Such searches construct a fine mesh of filters covering a signal parameter space at high density. Previously it has been shown that singular-value decomposition can reduce the effective number of filters required to search the data. Here we study how the basis provided by the singular-value decomposition changes dimension as a function of template-bank density. We will demonstrate that it is sufficient to use the basis provided by the singular-value decomposition of a low-density bank to accurately reconstruct arbitrary points within the boundaries of the template bank. Since this technique is purely numerical, it may have applications to interpolating the space of numerical relativity waveforms.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

TRIPOLI-4{sup R} version 9 Shielding for the Shielding Community: Overview, Relevant Benchmarking for Shielding and Licensing Policy - Paper 49

This is a review paper of the Shielding only version of TRIPOLI-4. TRIPOLI-4 and TRIPOLI-4 S: TRIPOLI{sup R} represents a family of radiation transport codes using the Monte Carlo method (1,2). It has been continuously developed at CEA since the mid 60's. TRIPOLI-4{sup R}, being the fourth generation, has been developed starting from the mid 90's in C++. It tracks neutrons from 20 MeV down to 10{sup -5} eV, photons, electrons and positrons from 100 MeV to 1 keV, in 3D arbitrary geometries either in TRIPOLI{sup R} proprietary format or ROOT(4) format. It reads its continuous energy nuclear data from any evaluation in ENDF format, including but not limited to JEFF-3.1.1 and ENDF/BVII.0. It has various simulation modes, fixed-source (with or without fission), criticality, or both of them chained. A variety of tallies are available: averaged flux in a volume (track length and collision estimators), surface flux and current, point flux, reaction rates, deposited energy, dpa, pka, gamma spectroscopy, mesh tallies, tallies for criticality (k{sub eff}, beta eff, kinetic parameters). It provides the user with embedded response functions from IRDF and EAF as well. Several variance reduction techniques (3), including automated ones, make it particularly suitable to deep penetration problems (implicit capture, Russian roulette, exponential biasing with automatic estimation of the importance map). It may run in parallel, on single multi-core machines as well as heterogeneous networks of stations or massively parallel machines. It comes with productivity tools designed to speed-up the elaboration and verification of the input deck as well as the output analysis: 2D interactive display of geometry; 2D display of mesh tallies and collision sites; 3D input deck modeler; compatibility with ROOT tools to post-process TRIPOLI{sup R} outputs. Its V and V test base is made of more than 1000 internationally accepted benchmarks from ICSBEP and SINBAD (REPLICA, ASPIS, NESDIP) and covers all its application domains, including several shielding cases which will be detailed in the talk. TRIPOLI-4{sup R} is the reference Monte Carlo code for CEA, EDF, and also for AREVA for a number of applications. A 'Shielding-only' version has been designed to specifically answer the needs of the shielding community. It is distributed through the NEA Databank with a license for R and D, covering the fusion applications, whose terms are detailed in the paper.

61 RADIATION PROTECTION AND DOSIMETRY↗

Finite difference operators on unstructured triangular meshes

A new form of the Laplace operator is derived which is shown to be second-order accurate when calculated at mesh triangle nodes if the cells corresponding to the nodes have a high degree of symmetry. It is demonstrated that the Laplace operator directly derived from Stokes' integral theorem is only zeroth-order accurate on these same cells. The construction of gradient and Laplace operators on unstructured triangular grids are discussed from the variational point of view. Two discrete representations of the Laplacian are compared to each other, and conclusions are drawn regarding their accuracy on a pointwise basis. Finally, geometric relations valid on arbitrary polygons are given for completeness in an appendix.

Erlebacher, G.↗

The Data Transfer Kit: A geometric rendezvous-based tool for multiphysics data transfer

The Data Transfer Kit (DTK) is a software library designed to provide parallel data transfer services for arbitrary physics components based on the concept of geometric rendezvous. The rendezvous algorithm provides a means to geometrically correlate two geometric domains that may be arbitrarily decomposed in a parallel simulation. By repartitioning both domains such that they have the same geometric domain on each parallel process, efficient and load balanced search operations and data transfer can be performed at a desirable algorithmic time complexity with low communication overhead relative to other types of mapping algorithms. With the increased development efforts in multiphysics simulation and other multiple mesh and geometry problems, generating parallel topology maps for transferring fields and other data between geometric domains is a common operation. The algorithms used to generate parallel topology maps based on the concept of geometric rendezvous as implemented in DTK are described with an example using a conjugate heat transfer calculation and thermal coupling with a neutronics code. In addition, we provide the results of initial scaling studies performed on the Jaguar Cray XK6 system at Oak Ridge National Laboratory for a worse-case-scenario problem in terms of algorithmic complexity that shows good scaling on 0(1 x 104) cores for topology map generation and excellent scaling on 0(1 x 105) cores for the data transfer operation with meshes of O(1 x 109) elements. (authors)

97 MATHEMATICS AND COMPUTING↗

Large-eddy and unsteady RANS simulations of a shock-accelerated heavy gas cylinder

Two-dimensional numerical simulations of the Richtmyer–Meshkov unstable “shock-jet” problem are conducted using both large-eddy simulation (LES) and unsteady Reynolds-averaged Navier–Stokes (URANS) approaches in an arbitrary Lagrangian–Eulerian hydrodynamics code. Turbulence statistics are extracted from LES by running an ensemble of simulations with multimode perturbations to the initial conditions. Detailed grid convergence studies are conducted, and LES results are found to agree well with both experiment and high-order simulations conducted by Shankar et al. (Phys Fluids 23, 024102, 2011). URANS results using a k–L approach are found to be highly sensitive to initialization of the turbulence lengthscale L and to the time at which L becomes resolved on the computational mesh. As a result, it is observed that a gradient diffusion closure for turbulent species flux is a poor approximation at early times, and a new closure based on the mass-flux velocity is proposed for low-Reynolds-number mixing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TOMCAT - A code for numerical generation of boundary-fitted curvilinear coordinate systems on fields containing any number of arbitrary two-dimensional bodies

A method for automatic generation of boundary-fitted curvilinear coordinate systems, where the transformed coordinates are solutions of an elliptic differential system in the physical plane, and where the coordinate lines are coincident with all boundaries of a general multiply-connected, two-dimensional region containing any number of arbitrarily shaped bodies, and is described along with a suitable computer code for implementing the method. Any partial differential system can be solved on the boundary-fitted coordinate system by appropriate transformations. The transformed equations are approximated by finite differences and solved numerically in the transformed plane. All computations, whether for generating coordinate system or then solving the transformed equations, can be done on a rectangular field with square mesh with no interpolation required on the boundaries. The physical boundaries may even be time-dependent.

Thompson, J. F.↗