Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational efficiency”

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 1,315 records · Page 73

Accelerating the spin-up of the coupled carbon and nitrogen cycle model in CLM4

The commonly adopted biogeochemistry spin-up process in an Earth system model (ESM) is to run the model for hundreds to thousands of years subject to periodic atmospheric forcing to reach dynamic steady state of the carbon–nitrogen (CN) models. A variety of approaches have been proposed to reduce the computation time of the spin-up process. Significant improvement in computational efficiency has been made recently. However, a long simulation time is still required to reach the common convergence criteria of the coupled carbon–nitrogen model. A gradient projection method was proposed and used to further reduce the computation time after examining the trend of the dominant carbon pools. The Community Land Model version 4 (CLM4) with a carbon and nitrogen component was used in this study. From point-scale simulations, we found that the method can reduce the computation time by 20–69% compared to one of the fastest approaches in the literature. We also found that the cyclic stability of total carbon for some cases differs from that of the periodic atmospheric forcing, and some cases even showed instability. Close examination showed that one case has a carbon periodicity much longer than that of the atmospheric forcing due to the annual fire disturbance that is longer than half a year. The rest was caused by the instability of water table calculation in the hydrology model of CLM4. The instability issue is resolved after we replaced the hydrology scheme in CLM4 with a flow model for variably saturated porous media.

54 ENVIRONMENTAL SCIENCES↗

Current capabilities for simulating the extreme distortion of thin structures subjected to severe impacts

The explicit transient dynamics technology in use today for simulating the impact and subsequent transient dynamic response of a structure has its origins in the 'hydrocodes' dating back to the late 1940's. The growth in capability in explicit transient dynamics technology parallels the growth in speed and size of digital computers. Computer software for simulating the explicit transient dynamic response of a structure is characterized by algorithms that use a large number of small steps. In explicit transient dynamics software there is a significant emphasis on speed and simplicity. The finite element technology used to generate the spatial discretization of a structure is based on a compromise between completeness of the representation for the physical processes modelled and speed in execution. That is, since it is expected in every calculation that the deformation will be finite and the material will be strained beyond the elastic range, the geometry and the associated gradient operators must be reconstructed, as well as complex stress-strain models evaluated at every time step. As a result, finite elements derived for explicit transient dynamics software use the simplest and barest constructions possible for computational efficiency while retaining an essential representation of the physical behavior. The best example of this technology is the four-node bending quadrilateral derived by Belytschko, Lin and Tsay. Today, the speed, memory capacity and availability of computer hardware allows a number of the previously used algorithms to be 'improved.' That is, it is possible with today's computing hardware to modify many of the standard algorithms to improve their representation of the physical process at the expense of added complexity and computational effort. The purpose is to review a number of these algorithms and identify the improvements possible. In many instances, both the older, faster version of the algorithm and the improved and somewhat slower version of the algorithm are found implemented together in software. Specifically, the following seven algorithmic items are examined: the invariant time derivatives of stress used in material models expressed in rate form; incremental objectivity and strain used in the numerical integration of the material models; the use of one-point element integration versus mean quadrature; shell elements used to represent the behavior of thin structural components; beam elements based on stress-resultant plasticity versus cross-section integration; the fidelity of elastic-plastic material models in their representation of ductile metals; and the use of Courant subcycling to reduce computational effort.

Key, Samuel W.↗

Particle Swarm Optimization

The purpose of this paper is to show how the search algorithm known as particle swarm optimization performs. Here, particle swarm optimization is applied to structural design problems, but the method has a much wider range of possible applications. The paper's new contributions are improvements to the particle swarm optimization algorithm and conclusions and recommendations as to the utility of the algorithm, Results of numerical experiments for both continuous and discrete applications are presented in the paper. The results indicate that the particle swarm optimization algorithm does locate the constrained minimum design in continuous applications with very good precision, albeit at a much higher computational cost than that of a typical gradient based optimizer. However, the true potential of particle swarm optimization is primarily in applications with discrete and/or discontinuous functions and variables. Additionally, particle swarm optimization has the potential of efficient computation with very large numbers of concurrently operating processors.

Venter, Gerhard↗

Validation of a High-Order Prefactored Compact Code on Nonlinear Flows with Complex Geometries

A finite-difference time domain solution of the airfoil gust problem is obtained using a high-accuracy nonlinear computational aeroacoustics code. For computational efficiency, the equations are cast in chain-rule curvilinear form, and a structured multiblock solver is used in parallel. In order to fully investigate the performance of this solver, a test matrix of eight problems are computed (two airfoil geometries, two gust frequencies, and two gust configurations). These results are compared to solutions obtained by the GUST3D frequency-domain solver both on the airfoil surface and in the far field. Grid density and domain size studies are included.

Hixon, R.↗

Application of the Convolution Formalism to the Ocean Tide Potential: Results from the Gravity and Recovery and Climate Experiment (GRACE)

A computationally efficient approach to reducing omission errors in ocean tide potential models is derived and evaluated using data from the Gravity Recovery and Climate Experiment (GRACE) mission. Ocean tide height models are usually explicitly available at a few frequencies, and a smooth unit response is assumed to infer the response across the tidal spectrum. The convolution formalism of Munk and Cartwright (1966) models this response function with a Fourier series. This allows the total ocean tide height, and therefore the total ocean tide potential, to be modeled as a weighted sum of past, present, and future values of the tide-generating potential. Previous applications of the convolution formalism have usually been limited to tide height models, but we extend it to ocean tide potential models. We use luni-solar ephemerides to derive the required tide-generating potential so that the complete spectrum of the ocean tide potential is efficiently represented. In contrast, the traditionally adopted harmonic model of the ocean tide potential requires the explicit sum of the contributions from individual tidal frequencies. It is therefore subject to omission errors from neglected frequencies and is computationally more intensive. Intersatellite range rate data from the GRACE mission are used to compare convolution and harmonic models of the ocean tide potential. The monthly range rate residual variance is smaller by 4-5%, and the daily residual variance is smaller by as much as 15% when using the convolution model than when using a harmonic model that is defined by twice the number of parameters.

models↗

Methane Sensitivity to Perturbations in Tropospheric Oxidizing Capacity

Methane is an important greenhouse gas and has a 25 times greater global warming potential than CO2 on a century timescale. Yet there are considerable uncertainties in the magnitude and variability of its sources and sinks. The response of the coupled non-linear methane-carbon monoxide-hydroxyl radical (OH) system is important in determining the tropospheric oxidizing capacity. Using the NASA Goddard Earth Observing System, Version 5 (GEOS-5) chemistry climate model, we study the response of methane to perturbations of OH and wetland emissions. We use a computationally-efficient option of the GEOS-5 CCM that includes an OH parameterization that accurately represents OH predicted by a full chemical mechanism. The OH parameterization allows for studying non-linear CH4-CO-OH feedbacks in computationally fast sensitivity experiments. We compare our results with surface observations (GMD) and discuss the range of uncertainty in OH and wetland emissions required to bring modeling results in better agreement with surface observations. Our results can be used to improve projections of methane emissions and methane growth.

Yegorova, Elena↗

Unsteady RANS and Scale Resolving Simulations of Open Rotor Noise

Computational simulations using structured curvilinear overset grids with the Launch Ascent and Vehicle Aerodynamics (LAVA) framework are presented for predicting the aerodynamic and aeroacoustic behavior of a contra-rotating open rotor (CROR) propulsion system using a newly developed and computationally efficient sliding mesh technique. A comprehensive evaluation of two turbulence closure treatments is carried out as part of the scope of this work: Unsteady Reynolds-Averaged Navier-Stokes Simulation (URANS), and Hybrid RANS/LES (HRLES). The computed results are then validated against existing experimental measurements at both the nominal take-off and cruise flight conditions. To propagate the noise generated by the near-field CROR system, aeroacoustic analysis based on a frequency-domain permeable surface Ffowcs Williams-Hawkings (FW-H) approach is applied.

ARMD↗

Unsteady RANS and Scale Resolving Simulations of Open Rotor Noise

Computational simulations using structured curvilinear overset grids with the Launch Ascent and Vehicle Aerodynamics (LAVA) framework are presented for predicting the aerodynamic and aeroacoustic behavior of a contra-rotating open rotor (CROR) propulsion system using a newly developed and computationally efficient sliding mesh technique. A comprehensive evaluation of two turbulence closure treatments is carried out as part of the scope of this work: Unsteady Reynolds-Averaged Navier-Stokes Simulation (URANS), and Hybrid RANS/LES (HRLES). The computed results are then validated against existing experimental measurements at both the nominal take-off and cruise flight conditions. To propagate the noise generated by the near-field CROR system, aeroacoustic analysis based on a frequency-domain permeable surface Ffowcs Williams-Hawkings (FW-H) approach is applied.

ARMD↗

Recent improvements in efficiency, accuracy, and convergence for implicit approximate factorization algorithms

In 1977 and 1978, general purpose centrally space differenced implicit finite difference codes in two and three dimensions have been introduced. These codes, now called ARC2D and ARC3D, can run either in inviscid or viscous mode for steady or unsteady flow. Since the introduction of the ARC2D and ARC3D codes, overall computational efficiency could be improved by making use of a number of algorithmic changes. These changes are related to the use of a spatially varying time step, the use of a sequence of mesh refinements to establish approximate solutions, implementation of various ways to reduce inversion work, improved numerical dissipation terms, and more implicit treatment of terms. The present investigation has the objective to describe the considered improvements and to quantify advantages and disadvantages. It is found that using established and simple procedures, a computer code can be maintained which is competitive with specialized codes.

Pulliam, T. H.↗

Survey and analysis of multiresolution methods for turbulence data

This paper compares the effectiveness of various multi-resolution geometric representation methods, such as B-spline, Daubechies, Coiflet and Dual-tree wavelets, curvelets and surfacelets, to capture the structure of fully developed turbulence using a truncated set of coefficients. The turbulence dataset is obtained from a Direct Numerical Simulation of buoyancy driven turbulence on a 512 3 mesh size, with an Atwood number, A = 0.05, and turbulent Reynolds number, Re t = 1800, and the methods are tested against quantities pertaining to both velocities and active scalar (density) fields and their derivatives, spectra, and the properties of constant density surfaces. The comparisons between the algorithms are given in terms of performance, accuracy, and compression properties. The results should provide useful information for multi-resolution analysis of turbulence, coherent feature extraction, compression for large datasets handling, as well as simulations algorithms based on multi-resolution methods. In conclusion, the final section provides recommendations for best decomposition algorithms based on several metrics related to computational efficiency and preservation of turbulence properties using a reduced set of coefficients.

97 MATHEMATICS AND COMPUTING↗

A multi-dimensional, energy- and charge-conserving, nonlinearly implicit, electromagnetic Vlasov–Darwin particle-in-cell algorithm

For decades, the Vlasov–Darwin model has been recognized to be attractive for particle-in-cell (PIC) kinetic plasma simulations in non-radiative electromagnetic regimes, to avoid radiative noise issues and gain computational efficiency. However, the Darwin model results in an elliptic set of field equations that renders conventional explicit time integration unconditionally unstable. We explore a fully implicit PIC algorithm for the Vlasov–Darwin model in multiple dimensions, which overcomes many difficulties of traditional semi-implicit Darwin PIC algorithms. The finite-difference scheme for Darwin field equations and particle equations of motion is space–time-centered, employing particle sub-cycling and orbit-averaging. This algorithm conserves total energy, local charge, canonical-momentum in the ignorable direction, and preserves the Coulomb gauge exactly. An asymptotically well-posed fluid preconditioner allows efficient use of large cell sizes, which are determined by accuracy considerations, not stability, and can be orders of magnitude larger than required in a standard explicit electromagnetic PIC simulation. Finally, we demonstrate the accuracy and efficiency properties of the algorithm with various numerical experiments in 2D–3V.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Coupled Fluid-Solid Interaction Under Shock Wave Loading: Part II - Dynamic Interfaces

This article is the second of two that consider the treatment of fluid-solid interaction problems where the solid experiences wave loading and large bulk Lagrangian displacements. In part-I, we presented the formulation for the edge-based unstructured-grid Euler solver in the context of a discontinuous- Galerkin framework with the extensions used to treat internal fluid-solid interfaces. A super-sampled L 2 projection was used to construct level-set data from the Lagrangian interface, and a narrow-band approach was used to identify and construct appropriate ghost data and boundary conditions at the fluid-solid interface. A series of benchmark problems were used to verify the treatment of the fluid-solid interface conditions with a static interface position. In this paper, we consider the treatment of dynamic interfaces and the associated large bulk Lagrangian displacements of the solid.We present the coupled dynamic fluid-solid system, and develop an explicit, monolithic treatment of the fully-coupled system. The conditions associated with moving interfaces and their implementation are discussed. A comparison of moving vs. fixed reference frames is used to verify the dynamic interface treatment. Lastly, a series of two and and three-dimensional projectile and shock-body interaction calculations are presented. Ultimately, the use of the Lagrangian interface position and a super-sampled projection for fast level-set construction, the narrow-band extraction of ghost data, and monolithic explicit solution algorithm has proved to be a computationally efficient means for treating shock induced fluid-solid interaction problems.

42 ENGINEERING↗

A Green’s function fast multipole method for computation of micromechanical fields in heterogeneous materials

Computation of micromechanical fields in heterogeneous materials is usually performed using either the finite element method or the Green’s function method based on FFTs. The finite element method allows for accurate discretization and for non-periodic boundary conditions but is computationally expensive. On the other hand, the FFT-based method is computationally efficient but requires discretization on a regular grid of hexahedral voxels. In this paper, a Green’s function method allowing for accurate discretization using tetrahedral elements and for non-periodic boundary conditions is proposed. The convolution is computed using the fast multipole method, which provides good accuracy even for low-order expansion due to the fast decay of interactions between elements. The proposed Green’s function fast multipole method is verified by comparison with analytical and FFT-based solutions. Furthermore, the computational time is analyzed and compared to the FFT-based method for non-periodic convolution. Finally, effective properties of an elastic polycrystalline microstructure containing thin intergranular cracks are computed and analyzed.

36 MATERIALS SCIENCE↗

Greedy emulators for nuclear two-body scattering

Applications of reduced basis method emulators are increasing in low-energy nuclear physics because they enable fast and accurate sampling of high-fidelity calculations, enabling robust uncertainty quantification. Here, in this paper, we develop, implement, and test two model-driven emulators based on the (Petrov-)Galerkin projection using the prototypical test case of two-body scattering with the Minnesota potential and a more realistic local chiral potential. The high-fidelity scattering equations are solved with the matrix Numerov method, a reformulation of the popular Numerov recurrence relation for solving special second-order differential equations as a linear system of coupled equations. A novel error estimator based on reduced-space residuals is applied to an active learning approach (a greedy algorithm) to choosing training samples (“snapshots”) for the emulator and contrasted with a proper orthogonal decomposition (POD) approach. Both approaches allow for computationally efficient offline-online decompositions, but the greedy approach requires many fewer snapshot calculations. These developments set the groundwork for emulating scattering observables based on chiral nucleon-nucleon and three-nucleon interactions and optical models, where computational speed-ups are necessary for Bayesian uncertainty quantification. Our emulators and error estimators are widely applicable to linear systems.

Bayesian methods↗

A Novel Multigrid Method for Sn Discretizations of the Mono-Energetic Boltzmann Transport Equation in the Optically Thick and Thin Regimes with Anisotropic Scattering, Part I

This paper presents a new multigrid method applied to the most common Sn discretizations (Petrov-Galerkin, diamond-differenced, corner-balanced, and discontinuous Galerkin) of the mono-energetic Boltzmann transport equation in the optically thick and thin regimes, and with strong anisotropic scattering. Unlike methods that use scalar DSA diffusion preconditioners for the source iteration, this multigrid method is applied directly to an integral equation for the scalar flux. Thus, unlike the former methods that apply a multigrid strategy to the scalar DSA diffusion operator, this method applies a multigrid strategy to the integral source iteration operator, which is an operator for 5 independent variables in spatial 3-d (3 in space and 2 in angle) and 4 independent variables in spatial 2-d (2 in space and 2 in angle). The core smoother of this multigrid method involves applications of the integral operator. Since the kernel of this integral operator involves the transport sweeps, applying this integral operator requires a transport sweep (an inversion of an upper triagular matrix) for each of the angles used. As the equation is in 5-space or 4-space, the multigrid approach in this paper coarsens in both angle and space, effecting efficient applications of the coarse integral operators. Although each V-cycle of this method is more expensive than a V-cycle for the DSA preconditioner, since the DSA equation does not have angular dependence, the overall computational efficiency is about the same for problems where DSA preconditioning {\it is} effective. This new method also appears to be more robust over all parameter regimes than DSA approaches. Moreover, this new method is applicable to a variety of Sn spatial discretizations, to problems involving a combination of optically thick and thin regimes, and more importantly, to problems with anisotropic scattering cross-sections, all of which DSA approaches perform poorly or not applicable at all. This multigrid approach is most effective in neutron scattering applications, where the total cross-section coefficient $\sigma_t$ and spatial meshsize $h$ satisfies $\sigma_t h\approx 1.$ For this case, coarsening can be done aggressively. For problems with $\sigma_t h\approx 10,$ this multigrid scheme requires a moderately coarsened multiple-coarsening scheme. An even slow coarsening, an angle semi-coarsening, is required for problems with $\sigma_t h$ ranges between 100 and 1000, which occur in high-energy photon applications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Transient Response of Shells of Revolution by Direct Integration and Modal Superposition Methods

The results of an analytical effort to obtain and evaluate transient response data for a cylindrical and a conical shell by use of two different approaches: direct integration and modal superposition are described. The inclusion of nonlinear terms is more important than the inclusion of secondary linear effects (transverse shear deformation and rotary inertia) although there are thin-shell structures where these secondary effects are important. The advantages of the direct integration approach are that geometric nonlinear and secondary effects are easy to include and high-frequency response may be calculated. In comparison to the modal superposition technique the computer storage requirements are smaller. The advantages of the modal superposition approach are that the solution is independent of the previous time history and that once the modal data are obtained, the response for repeated cases may be efficiently computed. Also, any admissible set of initial conditions can be applied.

Stephens, W. B.↗

The explicit computation of integration algorithms and first integrals for ordinary differential equations with polynomials coefficients using trees

This note is concerned with the explicit symbolic computation of expressions involving differential operators and their actions on functions. The derivation of specialized numerical algorithms, the explicit symbolic computation of integrals of motion, and the explicit computation of normal forms for nonlinear systems all require such computations. More precisely, if R = k(x(sub 1),...,x(sub N)), where k = R or C, F denotes a differential operator with coefficients from R, and g member of R, we describe data structures and algorithms for efficiently computing g. The basic idea is to impose a multiplicative structure on the vector space with basis the set of finite rooted trees and whose nodes are labeled with the coefficients of the differential operators. Cancellations of two trees with r + 1 nodes translates into cancellation of O(N(exp r)) expressions involving the coefficient functions and their derivatives.

Crouch, P. E.↗

Regional Climate Simulation with a Variable Resolution Stretched Grid GCM: The Regional Down-Scaling Effects

The results obtained with the variable resolution stretched grid (SG) GEOS GCM (Goddard Earth Observing System General Circulation Models) are discussed, with the emphasis on the regional down-scaling effects and their dependence on the stretched grid design and parameters. A variable resolution SG-GCM and SG-DAS using a global stretched grid with fine resolution over an area of interest, is a viable new approach to REGIONAL and subregional CLIMATE studies and applications. The stretched grid approach is an ideal tool for representing regional to global scale interactions. It is an alternative to the widely used nested grid approach introduced a decade ago as a pioneering step in regional climate modeling. The GEOS SG-GCM is used for simulations of the anomalous U.S. climate events of 1988 drought and 1993 flood, with enhanced regional resolution. The height low level jet, precipitation and other diagnostic patterns are successfully simulated and show the efficient down-scaling over the area of interest the U.S. An imitation of the nested grid approach is performed using the developed SG-DAS (Data Assimilation System) that incorporates the SG-GCM. The SG-DAS is run with withholding data over the area of interest. The design immitates the nested grid framework with boundary conditions provided from analyses. No boundary condition buffer is needed for the case due to the global domain of integration used for the SG-GCM and SG-DAS. The experiments based on the newly developed versions of the GEOS SG-GCM and SG-DAS, with finer 0.5 degree (and higher) regional resolution, are briefly discussed. The major aspects of parallelization of the SG-GCM code are outlined. The KEY OBJECTIVES of the study are: 1) obtaining an efficient DOWN-SCALING over the area of interest with fine and very fine resolution; 2) providing CONSISTENT interactions between regional and global scales including the consistent representation of regional ENERGY and WATER BALANCES; 3) providing a high computational efficiency for future SG-GCM and SG-DAS versions using PARALLEL codes.

Fox-Rabinovitz, Michael S.↗