Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
NASA NTRS1978

Aerodynamic preliminary analysis system. Part 1: Theory

A comprehensive aerodynamic analysis program based on linearized potential theory is described. The solution treats thickness and attitude problems at subsonic and supersonic speeds. Three dimensional configurations with or without jet flaps having multiple non-planar surfaces of arbitrary planform and open or closed slender bodies of non-circular contour may be analyzed. Longitudinal and lateral-directional static and rotary derivative solutions may be generated. The analysis was implemented on a time sharing system in conjunction with an input tablet digitizer and an interactive graphics input/output display and editing terminal to maximize its responsiveness to the preliminary analysis problem. Nominal case computation time of 45 CPU seconds on the CDC 175 for a 200 panel simulation indicates the program provides an efficient analysis for systematically performing various aerodynamic configuration tradeoff and evaluation studies.

Bonner, E.↗
DOE OSTI2022

Delaunay walk for fast nearest neighbor: accelerating correspondence matching for ICP

Point set registration algorithms such as Iterative Closest Point (ICP) are commonly utilized in time-constrained environments like robotics. Finding the nearest neighbor of a point in a reference 3D point set is a common operation in ICP and frequently consumes at least 90% of the computation time. We introduce a novel approach to performing the distance-based nearest neighbor step based on Delaunay triangulation. This greedy algorithm finds the nearest neighbor of a query point by traversing the edges of the Delaunay triangulation created from a reference 3D point set. Our work integrates the Delaunay traversal into the correspondences search of ICP and exploits the iterative aspect of ICP by caching previous correspondences to expedite each iteration. An algorithmic analysis and comparison is conducted showing an order of magnitude speedup for both serial and vector processor implementation.

3d point cloud processing↗
DOE OSTI2020

A fast particle-based approach for calibrating a 3-D model of the Antarctic ice sheet

We consider the scientifically challenging and policy-relevant task of understanding the past and projecting the future dynamics of the Antarctic ice sheet. The Antarctic ice sheet has shown a highly nonlinear threshold response to past climate forcings. Triggering such a threshold response through anthropogenic greenhouse gas emissions would drive drastic and potentially fast sea level rise with important implications for coastal flood risks. Previous studies have combined information from ice sheet models and observations to calibrate model parameters. These studies have broken important new ground but have either adopted simple ice sheet models or have limited the number of parameters to allow for the use of more complex models. These limitations are largely due to the computational challenges posed by calibration as models become more computationally intensive or when the number of parameters increases. Here, we propose a method to alleviate this problem: a fast sequential Monte Carlo method that takes advantage of the massive parallelization afforded by modern high-performance computing systems. We use simulated examples to demonstrate how our sample-based approach provides accurate approximations to the posterior distributions of the calibrated parameters. The drastic reduction in computational times enables us to provide new insights into important scientific questions, for example, the impact of Pliocene era data and prior parameter information on sea level projections. These studies would be computationally prohibitive with other computational approaches for calibration such as Markov chain Monte Carlo or emulation-based methods. We also find considerable differences in the distributions of sea level projections when we account for a larger number of uncertain parameters. For example, based on the same ice sheet model and data set, the 99th percentile of the Antarctic ice sheet contribution to sea level rise in 2300 increases from 6.5 m to 13.1 m when we increase the number of calibrated parameters from three to 11. With previous calibration methods, it would be challenging to go beyond five parameters. Here, this work provides an important next step toward improving the uncertainty quantification of complex, computationally intensive and decision-relevant models.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1989

The application of 3D marching scheme for the prediction of supersonic free jets

A modified version of the upwind flux-difference scheme of Roe for supersonic flow solution is described. This efficient iterative Space Marching Scheme (SMS) is used to solve the three-dimensional, Reynolds-averaged Navier-Stokes equations, for underexpanded and overexpanded supersonic free jet with a single time sweep. Comparisons with experimental data and the Parabolized Navier-Stokes (PNS) solutions are presented. These results show that the present scheme gives good agreement with experimental data in less computer time and the convergence history of the SMS is much faster than the PNS solution.

Abdol-Hamid, Khaled S.↗
NASA NTRS1992

Spatial and temporal adaptive procedures for the unsteady aerodynamic analysis of airfoils using unstructured meshes

An algorithm which combines spatial and temporal adaption for the time integration of the two dimensional Euler equations on unstructured meshes of triangles is presented. Spatial adaption involves mesh enrichment to add elements in high gradient regions of the flow and mesh coarsening to remove elements where they are no longer needed. Temporal adaption is a time accurate, local time stepping procedure which integrates the flow equations in each cell according to the local numerical stability constraint. The flow solver utilizes a four stage Runge-Kutta time integration scheme with an upwind flux-split spatial discretization. Results obtained using spatial and temporal adaption indicate that highly accurate solutions can be obtained with a significant savings of computing time over global time stepping.

Hooker, John R.↗
NASA NTRS1992

Spatial and temporal adaptive procedures for the unsteady aerodynamic analysis of airfoils using unstructured meshes

An algorithm which combines spatial and temporal adaption for the time integration of the two-dimensional Euler equations on unstructured meshes of triangles is presented. Spatial adaption involves mesh enrichment to add elements in high gradient regions of the flow and mesh coarsening to remove elements where they are no longer needed. Temporal adaption is a time accurate, local time stepping procedure which integrates the flow equations in each cell according to the local numerical stability constraint. The flow solver utilizes a four-stage Runge-Kutta time integration scheme with an upwind flux-split spatial discretization. Results obtained using spatial and temporal adaption indicate that highly accurate solutions can be obtained with a significant savings of computing time over global time stepping.

Hooker, John R.↗
NASA NTRS1993

Structured adaptive grid generation using algebraic methods

The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration of points to the grid redistribution scheme. The evaluation of the weighting mesh is accomplished by utilizing the weight function representing the solution variation and the equidistribution law. The selection of the weight function plays a key role in grid adaptation. A new weight function utilizing a properly weighted boolean sum of various flowfield characteristics is defined. The redistribution scheme is developed utilizing Non-Uniform Rational B-Splines (NURBS) representation. The application of NURBS representation results in a well distributed smooth grid by maintaining the fidelity of the geometry associated with boundary curves. Several algebraic methods are applied to smooth and/or nearly orthogonalize the grid lines. An elliptic solver is utilized to smooth the grid lines if there are grid crossings. Various computational examples of practical interest are presented to demonstrate the success of these methods.

Yang, Jiann-Cherng↗
DOE OSTI2025

Emulator-based Bayesian calibration of a subglacial drainage model

Subglacial drainage models, often motivated by the relationship between hydrology and ice flow, sensitively depend on numerous unconstrained parameters. We explore using borehole water-pressure time series to calibrate the uncertain parameters of a popular subglacial drainage model, taking a Bayesian perspective to quantify the uncertainty in parameter estimates and in the calibrated model predictions. To reduce the computation time associated with Markov Chain Monte Carlo sampling, we construct a fast Gaussian process emulator to stand in for the subglacial drainage model. We first carry out a calibration experiment using synthetic observations consisting of model simulations with hidden parameter values as a demonstration of the method. Using real borehole water pressures measured in western Greenland, we find meaningful constraints on four of the eight model parameters and a factor-of-three reduction in uncertainty of the calibrated model predictions. These experiments illustrate Gaussian process-based Bayesian inference as a useful tool for calibration and uncertainty quantification of complex glaciological models using field data. However, significant differences between the calibrated model and the borehole data suggest that structural limitations of the model, rather than poorly constrained parameters or computational cost, remain the most important constraint on subglacial drainage modelling.

58 GEOSCIENCES↗
NASA NTRS1991

A finite dynamic element for laminated composite plates and shells

Development of finite dynamic elements can result in a significant reduction of computing time and cost for calculation of natural frequencies and mode shapes, which is an essential part of flutter prediction. Analysis with and without the dynamic terms is an alternative to constructing a new finite element mesh, to determine whether the mesh is sufficiently refined. Finite dynamic elements show spectacular improvement in convergence of higher modes with mesh refinement, but the improvement for lower modes is not so great. Cost reduction ratios greater than 20 have been observed for some modes. An average cost reduction ratio of 12 was achieved for the first six modes of a swept, tapered sandwich composite plate, at the 3 percent error level. Another set of calculations was made to determine the mesh density and cost parameters for which none of the first 12 frequencies was in error by more than 3 percent. It was found that the computing cost parameter for the dynamic element was about three times lower than the basic triangular element and 5.9 times lower than an eight-node isoparametric element.

Martin, C. W.↗
DOE OSTI2023

Data-driven, structure-preserving approximations to entropy-based moment closures for kinetic equations

In this study, we present a data-driven approach for approximating entropy-based closures of moment systems from kinetic equations. The proposed closure learns the entropy function by fitting the map between the moments and the entropy of the moment system, and thus does not depend on the spacetime discretization of the moment system or specific problem configurations such as initial and boundary conditions. With convex and C 2 approximations, this data-driven closure inherits several structural properties from entropy-based closures, such as entropy dissipation, hyperbolicity, and H-Theorem. We construct convex approximations to the Maxwell–Boltzmann entropy using convex splines and neural networks, test them on the plane source benchmark problem for linear transport in slab geometry, and compare the results to the standard, entropy-based systems which solve a convex optimization problem to find the closure. Numerical results indicate that these data-driven closures provide accurate solutions in much less computation time than that required by the optimization routine.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Wind farm blockage effects: comparison of different engineering models

The work presents four engineering methods to estimate the induction zone in front of a wind turbine and account for the wind farm blockage effect. The methods comprise the vortex cylinder model, vortex dipole model, self-similar model, and wake projection model. The majority of the models presented account for yaw misalignments and ground effect. Actuator disk simulations are used to verify the individual models. The performance of each model is evaluated both in terms of precision and computational time. The induction models are coupled to wake models within the FLOw Redirection and Induction in Steady State framework to provide the full velocity field within a wind farm. Sample wind farm computations are presented, and the impact of including induction effects into wind farm performance predictions is reported. The different codes are publicly available online.

17 WIND ENERGY↗
NASA NTRS1980

Analytic investigation of efficiency and performance limits in klystron amplifiers using multidimensional computer programs; multi-stage depressed collectors; and thermionic cathode life studies

Due to complexity of the program which used a hydrodynamic, axially and radially deformable disk-ring model and the resulting long computing time only the output gap was investigated. Results from independent studies were used to initiate the starting conditions for the electrons and the RF voltage using our program. Although this method of computation is less exact than processing the entire klystron interaction in 3-Dimensions it is shown that, for a confined flow focused throughout the penultimate cavity, radial velocities remain very small and the beam is highly laminar. It is concluded that possible errors resulting from treating only the output cavity in 3-D would remain small.

Kosmahl, H. G.↗
NASA NTRS1987

Simple numerical method for predicting steady compressible flows

The present numerical method for the solution of the isenthalpic form of the governing equations for compressible viscous and inviscid flows has its basis in the concept of flux vector splitting in its implicit form, and has been tested in the cases of several difficult viscous and inviscid configurations. An acceleration of time-marching to steady state is accomplished by implementing a multigrid procedure which effectively increases the convergence rate. The steady state results obtained are largely of good quality, and required only short computational times.

Von Lavante, E.↗
DOE OSTI2022

A unified thermionic and thermionic-field emission (TE–TFE) model for ideal Schottky reverse-bias leakage current

We present a unified thermionic emission (TE) and thermionic-field emission (TFE) model for the ideal reverse-bias leakage current in Schottky junctions. The unified TE–TFE analytical model advances upon previous analytical TFE models by Murphy–Good and Padovani–Stratton, which are the two most widely adopted models by the community, in two major aspects: (i) the applicability of the TFE expression therein is extended to near-zero surface electric fields by an error-function correction, allowing for the calculation of the total current by a nontrivial sum of TE (over-the-barrier current) and TFE (below-the-barrier current) contributions; therefore, an accurate description of the TE-to-TFE transition region is captured analytically for the first time; (ii) image-force lowering is considered with much-simpler correction terms. Comparisons with the reference numerical model show that the unified TE–TFE model has excellent accuracy, as well as a 10 000× reduction in computation time. The unified model is further tested against experimental data from Schottky barrier diodes based on Si, 4H-SiC, GaN, and β-Ga 2 O 3 , revealing accurate extractions of barrier heights and correct descriptions of the ideal reverse leakage characteristics. With the extended applicable range, improved accuracy, and computational efficiency, the unified TE–TFE model is highly valuable for the design and analysis of devices based on Schottky junctions, as well as for potential integration in technology computer-aided design (TCAD) tools.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Serpent transient analyses of GIACINT geometrical change experiments

This paper simulates seven transient experiments with geometrical movements performed at the GIACINT facility of Belarus. These experiments include three slow control rods insertion in more than 25 s, one fast control rod insertion in less than 1 s, and three water moderator draining transients. In the fast control rod insertion experiment, the control rods are first pushed by a mechanical spring and then let fall by gravity in the assembly. In this experiment, the control rods speed varies because of the initial spring force, the gravitational acceleration, and the water buoyancy force. In all other transient experiments, the geometry change occurs with a constant speed. The Serpent computer program was utilized to simulate these transient experiments with geometrical changes by performing two separate computations. One time-independent computation is performed in criticality mode and the other time-dependent computation is performed in dynamic-source mode. The first computation writes the neutron population and delayed neutron precursors for starting the transient simulation. The second computation divides the transient time into several time bins, reads the two files from the first computation, and updates them at the end of each time bin. The Serpent simulation results obtained for this set of experiments are in good agreement with the time dependent experimental measurements. In addition, Serpent and MCNP simulations results show an excellent agreement for the water moderator transient

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2023

The DESC stellarator code suite. Part 1. Quick and accurate equilibria computations

Three-dimensional equilibrium codes are vital for stellarator design and operation, and high-accuracy equilibria are also necessary for stability studies. This paper details comparisons of two three-dimensional equilibrium codes: VMEC, which uses a steepest-descent algorithm to reach a minimum-energy plasma state, and DESC, which minimizes the magnetohydrodynamic (MHD) force error in real space directly. Accuracy as measured by satisfaction of MHD force balance is presented for each code, along with the computation time. It is shown that DESC is able to achieve more accurate solutions, especially near axis. The importance of higher-accuracy equilibria is shown in DESC's better agreement of stability metrics with asymptotic formulae. DESC's global Fourier–Zernike basis also yields solutions with analytic derivatives explicitly everywhere in the plasma volume, provides improved accuracy in the radial direction versus conventional finite differences and allows for exponential convergence. Further, DESC can compute a solution with the same accuracy as VMEC in order-of-magnitude less time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

twoaxistracking – a python package for simulating self-shading of two-axis tracking solar collectors

Self-shading in fields of two-axis tracking collectors typically ranges from 1% to 6% of the annual incident irradiation. It is thus essential to account for shading in order to obtain accurate yield estimates and financing for such solar projects. The present study presents the free and open-source Python package twoaxistracking for simulating self-shading in fields of two-axis tracking collectors. The package is freely available at: https://github.com/pvlib/twoaxistracking. The main steps of the method and mathematical formulation are described. Additionally, a demonstration of how to use the package is presented. The shading calculation method excels over previous methods found in the literature in that it can: handle arbitrary aperture geometries and distinguish between the total and active areas; account for sloped ground and collectors with different heights within the same field; reduce computation time by skipping calculations at high solar elevation angles.

14 SOLAR ENERGY↗
DOE OSTI2024

Fast and Flexible Inference Framework for Continuum Reverberation Mapping Using Simulation-based Inference with Deep Learning

Continuum reverberation mapping (CRM) of active galactic nuclei (AGN) monitors multiwavelength variability signatures to constrain accretion disk structure and supermassive black hole (SMBH) properties. The upcoming Vera Rubin Observatory’s Legacy Survey of Space and Time will survey tens of millions of AGN over the next decade, with thousands of AGN monitored with almost daily cadence in the deep drilling fields. However, existing CRM methodologies often require long computation time and are not designed to handle such large amounts of data. In this paper, we present a fast and flexible inference framework for CRM using simulation-based inference (SBI) with deep learning to estimate SMBH properties from AGN light curves. We use a long short-term memory summary network to reduce the high dimensionality of the light curve data and then use a neural density estimator to estimate the posterior of SMBH parameters. Using simulated light curves, we find SBI can produce more accurate SMBH parameter estimation with 10 3 –10 5 times speed up in inference efficiency compared to traditional methods. The SBI framework is particularly suitable for wide-field CRM surveys as the light curves will have identical observing patterns, which can be incorporated into the SBI simulation. We explore the performance of our SBI model on light curves with irregular-sampled, realistic observing cadence and alternative variability characteristics to demonstrate the flexibility and limitation of the SBI framework.

79 ASTRONOMY AND ASTROPHYSICS↗