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 469 records · Page 26

Computing region moments from boundary representations

The class of all possible formulas for computing arbitrary moments of a region from the region's boundary is derived. The selection of a particular formula depends on the choice of an independent parameter. Several choices of this parameter are explored for region boundaries approximated by polygons. The parameter choice that minimizes computation time for boundaries represented by chain code is derived. Algorithms are presented for computing arbitrary moments for a region from a polygonal approximation of its boundary and for computing low order moments from chain encoded boundaries.

Wilf, J. M.↗

Parametric Study of a YAV-8B Harrier in Ground Effect Using Time-Dependent Navier-Stokes Computations

Flow simulations using the time-dependent Navier-Stokes equations remain a challenge for several reasons. Principal among them are the difficulty to accurately model complex flows, and the time needed to perform the computations. A parametric study of such complex problems is not considered practical due to the large cost associated with computing many time-dependent solutions. The computation time for each solution must be reduced in order to make a parametric study possible. With successful reduction of computation time, the issue of accuracy, and appropriateness of turbulence models will become more tractable.

Shishir, Pandya↗

Accelerated Depth Computation for Surface Boxplots with Deep Learning

Functional depth is a well-known technique used to derive descriptive statistics (e.g., median, quartiles, and outliers) for 1D data. Surface boxplots extend this concept to ensembles of images, helping scientists and users identify representative and outlier images. However, the computational time for surface boxplots increases cubically with the number of ensemble members, making it impractical for integration into visualization tools. In this paper, we propose a deep-learning solution for efficient depth prediction and computation of surface boxplots for time-varying ensemble data. Our deep learning framework accurately predicts member depths in a surface boxplot, achieving average speedups of 6X on a CPU and 15X on a GPU for the 2D Red Sea dataset with 50 ensemble members compared to the traditional depth computation algorithm. Our approach achieves at least a 99% level of rank preservation, with order flipping occurring only at pairs with extremely similar depth values that pose no statistical differences. This local flipping does not significantly impact the overall depth order of the ensemble members.

Han, Mengjiao↗

Trajectory optimization for an asymmetric launch vehicle

A numerical optimization technique is used to fully automate the trajectory design process for an symmetric configuration of the proposed Advanced Launch System (ALS). The objective of the ALS trajectory design process is the maximization of the vehicle mass when it reaches the desired orbit. The trajectories used were based on a simple shape that could be described by a small set of parameters. The use of a simple trajectory model can significantly reduce the computation time required for trajectory optimization. A predictive simulation was developed to determine the on-orbit mass given an initial vehicle state, wind information, and a set of trajectory parameters. This simulation utilizes an idealized control system to speed computation by increasing the integration time step. The conjugate gradient method is used for the numerical optimization of on-orbit mass. The method requires only the evaluation of the on-orbit mass function using the predictive simulation, and the gradient of the on-orbit mass function with respect to the trajectory parameters. The gradient is approximated with finite differencing. Prelaunch trajectory designs were carried out using the optimization procedure. The predictive simulation is used in flight to redesign the trajectory to account for trajectory deviations produced by off-nominal conditions, e.g., stronger than expected head winds.

Sullivan, Jeanne Marie↗

Computer Simulation Of A Small Turboshaft Engine

Component-type mathematical model of small turboshaft engine developed for use in real-time computer simulations of dynamics of helicopter flight. Yields shaft speeds, torques, fuel-consumption rates, and other operating parameters with sufficient accuracy for use in real-time simulation of maneuvers involving large transients in power and/or severe accelerations.

Ballin, Mark G.↗

The Quench Protection of Direct Wind Magnets

The direct wind magnets have several unique features. The conductor layout is characterized by thin single conductors wound over long lengths and separated from the other turns with thick layer of insulation. Moreover, there are several layers of winding. The strong non-uniformity in the magnetic field distribution results in different current and thermal margins for quenching in different regions. The quench protection modeling involves multi-physics coupling between electrical, thermal and magnetic transient. The material properties vary over time and location. This coupled with the complexity in the geometry adds to long computation times. The objective of this study is to understand the quench propagation in an EIC high inductance direct wind magnet which enables one to design appropriate quench protection strategies to protect the magnet. An advanced modeling program has been developed to simulate direct wind magnet quench. In conclusion, we validate theoretical simulations with experimental data.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Data-Driven Nonparametric Approach for Probabilistic Load-Margin Assessment Considering Wind Power Penetration

A modern power system is characterized by an increasing penetration of wind power, which results in large uncertainties in its states. These uncertainties must be quantified properly; otherwise, the system security may be threatened. Facing this challenge, here we propose a cost-effective, data-driven approach to assessing a power system's load margin probabilistically. Using actual wind data, a kernel density estimator is applied to infer the nonparametric wind speed distributions, which are further merged into the framework of a vine copula. The latter enables us to simulate complex multivariate and highly dependent model inputs with a variety of bivariate copulae that precisely represent the tail dependence in the correlated samples. Furthermore, to reduce the prohibitive computational time of traditional Monte-Carlo simulations that process a large amount of samples, we propose to use a nonparametric, Gaussian-process-emulator-based reduced-order model to replace the original complicated continuation power-flow model through a Bayesian-learning framework. To accelerate the convergence rate of this Bayesian algorithm, a truncated polynomial chaos surrogate, which serves as a highly efficient, parametric Bayesian prior, is developed. This emulator allows us to execute the time-consuming continuation power-flow solver at the sampled values with a negligible computational cost. Results of simulations that are performed on several test systems reveal the impressive performance of the proposed method in the probabilistic load-margin assessment.

17 WIND ENERGY↗

An Iterative Response-Surface-Based Approach for Chance-Constrained AC Optimal Power Flow Considering Dependent Uncertainty

A modern power system is characterized by a stochastic variation of the loads and an increasing penetration of renewable energy generation, which results in large uncertainties in its states. These uncertainties bring formidable challenges to the power system planning and operation process. To address these challenges, we propose a cost-effective, iterative response-surface-based approach for the chance-constrained AC optimal power-flow problem that aims to ensure the secure operation of the power systems considering dependent uncertainties. Starting from a stochastic-sampling-based framework, we first utilize the copula theory to simulate the dependence among multivariate uncertain inputs. Then, to reduce the prohibitive computational time required in the traditional Monte-Carlo method, we propose, instead of using the original complicated power-system model, to rely on a polynomial-chaos-based response surface. This response surface allows us to efficiently evaluate the time-consuming power-system model at arbitrary distributed sampled values with a negligible computational cost. This further enables us to efficiently conduct an online stochastic testing for the system states that not only screens out the statistical active constraints, but also assists in a better design of the tightened bounds without using any Gaussian or symmetric assumption. Finally, an iterative procedure is executed to fine-tune the optimal solution that better satisfies a predefined probability. The simulations conducted in multiple test systems demonstrate the excellent performance of the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A parallel Jacobson-Oksman optimization algorithm

A gradient-dependent optimization technique which exploits the vector-streaming or parallel-computing capabilities of some modern computers is presented. The algorithm, derived by assuming that the function to be minimized is homogeneous, is a modification of the Jacobson-Oksman serial minimization method. In addition to describing the algorithm, conditions insuring the convergence of the iterates of the algorithm and the results of numerical experiments on a group of sample test functions are presented. The results of these experiments indicate that this algorithm will solve optimization problems in less computing time than conventional serial methods on machines having vector-streaming or parallel-computing capabilities.

Straeter, T. A.↗

Prediction of unsteady aerodynamic loads in cascades using the linearized Euler equations on deforming grids

A linearized Euler solver for calculating unsteady flows in turbomachinery blade rows due to both incident gusts and blade motion is presented. Using the linearized Euler technique, one decomposes the flow into a mean (or steady) flow plus an unsteady, harmonically varying, small disturbance flow. Linear variable coefficient equations describe the small disturbance behavior of the flow, and are solved using a pseudo-time marching Lax-Wendroff scheme. For the blade motion problem, a harmonically deforming computational rid that conforms to the motion of vibrating blades eliminates large error producing mean flow gradient terms that would otherwise appear in the unsteady flow tangency boundary condition. The paper also presents a new, numerically exact, nonreflecting far-field boundary condition based on an eigenanalysis of the discretized equations. Computed flow solutions demonstrate the computational accuracy and efficiency of the present method. The solution of the linearized Euler equations requires one to two orders of magnitude less computer time than solution of the nonlinear Euler equations using traditional time-accurate time-marching techniques. In addition, the deformable grid significantly improves the accuracy of the solution.

Hall, Kenneth C.↗

Study of Interesting Solidification Phenomena on the Ground and in Space (MEPHISTO)

Real-time Seebeck voltage variations in a Sn-Bi melt during directional solidification in the MEPHISTO spaceflight experiment flown on the USMP-3 mission, can be correlated with well characterized thruster firings and an Orbiter Main System (OMS) burn. The Seebeck voltage measurement is related to the response of the instantaneous average melt composition at the melt-crystal interface. This allowed us to make a direct comparison of numerical simulations with the experimentally obtained Seebeck signals. Based on the results of preflight and real-time computations, several well-defined thruster firing events were programmed to occur at specific times during the experiment. In particular, we simulated the effects of the thruster firings on melt and crystal composition in a directionally solidifying Sn-Bi alloy. The relative accelerations produced by the firings were simulated by impulsive accelerations of the same magnitude, duration and orientation as the requested firings. A comparison of the simulation results with the Seebeck signal indicates that there is a good agreement between the two. This unique opportunity allows us, for the first time, to quantitatively characterize actual g-jitter effects on an actual crystal growth experiment and to properly calibrate our models of g-jitter effects on crystal growth.

Favier, J.-J.↗

Study of Interesting Solidification Phenomena on the Ground and in Space (MEPHISTO)

Real-time Seebeck voltage variations in a Sn-Bi melt during directional solidification in the MEPHISTO spaceflight experiment flown on the USMP-3 mission, have been correlated with well-characterized thruster firings and an Orbiter Main System (OMS) burn. The Seebeck voltage measurement is related to the response of the instantaneous average melt composition at the melt-crystal interface. This allowed us to make a direct comparison of numerical simulations with the experimentally obtained Seebeck signals. Based on the results of preflight and real-time computations, several well-defined thruster firing events were programmed to occur at specific times during the experiment. In particular, we simulated the effects of the thruster firings on melt and crystal composition in a directionally solidifying Sn-Bi alloy. The relative accelerations produced by the firings were simulated by impulsive accelerations of the same magnitude, duration and orientation as the requested firings. A comparison of the simulation results with the Seebeck signal indicates that there is a good agreement between the two. This unique opportunity allows us to make the first quantitative characterization of actual g-jitter effects on an actual crystal growth experiment and to calibrate our models of g-jitter effects on crystal growth.

Alexander, J. Iwan D.↗

A Domain-Decomposed Multi-Level Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

The work presents a new method for on-the-fly domain decomposition technique for mapping grids and solution algorithms to parallel machines, and is applicable to both shared-memory and message-passing architectures. It will be demonstrated on the Cray T3E, HP Exemplar, and SGI Origin 2000. Computing time has been secured on all these platforms. The decomposition technique is an outgrowth of techniques used in computational physics for simulations of N-body problems and the event horizons of black holes, and has not been previously used by the CFD community. Since the technique offers on-the-fly partitioning, it offers a substantial increase in flexibility for computing in heterogeneous environments, where the number of available processors may not be known at the time of job submission. In addition, since it is dynamic it permits the job to be repartitioned without global communication in cases where additional processors become available after the simulation has begun, or in cases where dynamic mesh adaptation changes the mesh size during the course of a simulation. The platform for this partitioning strategy is a completely new Cartesian Euler solver tarcreted at parallel machines which may be used in conjunction with Ames' "Cart3D" arbitrary geometry simulation package.

Aftosmis, M. J.↗

Predictive modeling of NSTX discharges with the updated multi-mode anomalous transport module

Abstract The objective of this study is twofold: firstly, to demonstrate the consistency between the anomalous transport results produced by updated Multi-Mode Model (MMM) version 9.0.4 and those obtained through gyrokinetic simulations; and secondly, to showcase MMM’s ability to predict electron and ion temperature profiles in low aspect ratio, high beta NSTX discharges. MMM encompasses a range of transport mechanisms driven by electron and ion temperature gradients, trapped electrons, kinetic ballooning, peeling, microtearing, and drift resistive inertial ballooning modes. These modes within MMM are being verified through corresponding gyrokinetic results. The modes that potentially contribute to ion thermal transport are stable in MMM, aligning with both experimental data and findings from linear CGYRO simulations. The isotope effects on these modes are also studied and higher mass is found to be stabilizing, consistent with the experimental trend. The electron thermal power across the flux surface is computed within MMM and compared to experimental measurements and nonlinear CGYRO simulation results. Specifically, the electron temperature gradient modes (ETGM) within MMM account for 2.0 MW of thermal power, consistent with experimental findings. It is noteworthy that the ETGM model requires approximately 5.0 ms of computation time on a standard desktop, while nonlinear CGYRO simulations necessitate 8.0 h on 8 K cores. MMM proves to be highly computationally efficient, a crucial attribute for various applications, including real-time control, tokamak scenario optimization, and uncertainty quantification of experimental data.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Massively Parallel Bayesian Approach to Planetary Protection Trajectory Analysis and Design

The NASA Planetary Protection Office has levied a requirement that the upper stage of future planetary launches have a less than 10(exp -4) chance of impacting Mars within 50 years after launch. A brute-force approach requires a decade of computer time to demonstrate compliance. By using a Bayesian approach and taking advantage of the demonstrated reliability of the upper stage, the required number of fifty-year propagations can be massively reduced. By spreading the remaining embarrassingly parallel Monte Carlo simulations across multiple computers, compliance can be demonstrated in a reasonable time frame. The method used is described here.

parallel computing↗

Parallel processors and nonlinear structural dynamics algorithms and software

Techniques are discussed for the implementation and improvement of vectorization and concurrency in nonlinear explicit structural finite element codes. In explicit integration methods, the computation of the element internal force vector consumes the bulk of the computer time. The program can be efficiently vectorized by subdividing the elements into blocks and executing all computations in vector mode. The structuring of elements into blocks also provides a convenient way to implement concurrency by creating tasks which can be assigned to available processors for evaluation. The techniques were implemented in a 3-D nonlinear program with one-point quadrature shell elements. Concurrency and vectorization were first implemented in a single time step version of the program. Techniques were developed to minimize processor idle time and to select the optimal vector length. A comparison of run times between the program executed in scalar, serial mode and the fully vectorized code executed concurrently using eight processors shows speed-ups of over 25. Conjugate gradient methods for solving nonlinear algebraic equations are also readily adapted to a parallel environment. A new technique for improving convergence properties of conjugate gradients in nonlinear problems is developed in conjunction with other techniques such as diagonal scaling. A significant reduction in the number of iterations required for convergence is shown for a statically loaded rigid bar suspended by three equally spaced springs.

Belytschko, Ted↗

A New Workflow of X-ray CT Image Processing and Data Analysis of Structural Features in Rock Using Open-Source Software

X-ray computed tomography (CT) images of rock specimens often contain artifacts which must be corrected before scientific analyses are performed. Here, we present a new workflow of automated image processing to utilize poor-quality X-ray CT scan images. The workflow runs on the open-source image analysis software and efficiently separates desired features from low-contrast scanned images. The new workflow is a two-step technique using contrast enhancement and automated feature segmentation to generate noise-free binary images. The results of binary images using the proposed workflow and using a conventional thresholding technique are analyzed to show the quality of the proposed method. The paper also presents a workflow of estimating the structural geometries of features in two and three dimensions. The results of the structural feature analyses and computational time were compared between the open-source (ImageJ) and commercial image analysis software (Bruker Computed Tomography Analyzer). The commercial software was more computationally efficient, but the task-specific macros in open-source software enabled the user-desired automation in image processing and data extraction of desired structural features of comparable quality.

47 OTHER INSTRUMENTATION↗