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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Exponential Runge-Kutta Parareal for non-diffusive equations

Parareal is a well-known parallel-in-time algorithm that combines a coarse and fine propagator within a parallel iteration. It allows for large-scale parallelism that leads to significantly reduced computational time compared to serial time-stepping methods. However, like many parallel-in-time methods it can fail to converge when applied to non-diffusive equations such as hyperbolic systems or dispersive nonlinear wave equations. Here, this paper explores the use of exponential integrators within the Parareal iteration. Exponential integrators are particularly interesting candidates for Parareal because of their ability to resolve fast-moving waves, even at the large stepsizes used by coarse propagators. This work begins with an introduction to exponential Parareal integrators followed by several motivating numerical experiments involving the nonlinear Schrödinger equation. These experiments are then analyzed using linear analysis that approximates the stability and convergence properties of the exponential Parareal iteration on nonlinear problems. The paper concludes with two additional numerical experiments involving the dispersive Kadomtsev-Petviashvili equation and the hyperbolic Vlasov-Poisson equation. These experiments demonstrate that exponential Parareal methods offer improved time-to-solution compared to serial exponential integrators when solving certain non-diffusive equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

$\mathrm{CROPSR}$: an automated platform for complex genome-wide $\mathrm{CRISPR}$ g$\mathrm{RNA}$ design and validation

CRISPR/Cas9 technology has become an important tool to generate targeted, highly specific genome mutations. The technology has great potential for crop improvement, as crop genomes are tailored to optimize specific traits over generations of breeding. Many crops have highly complex and polyploid genomes, particularly those used for bioenergy or bioproducts. The majority of tools currently available for designing and evaluating gRNAs for CRISPR experiments were developed based on mammalian genomes that do not share the characteristics or design criteria for crop genomes. We have developed an open source tool for genome-wide design and evaluation of gRNA sequences for CRISPR experiments, CROPSR. The genome-wide approach provides a significant decrease in the time required to design a CRISPR experiment, including validation through PCR, at the expense of an overhead compute time required once per genome, at the first run. To better cater to the needs of crop geneticists, restrictions imposed by other packages on design and evaluation of gRNA sequences were lifted. A new machine learning model was developed to provide scores while avoiding situations in which the currently available tools sometimes failed to provide guides for repetitive, A/T-rich genomic regions. We show that our gRNA scoring model provides a significant increase in prediction accuracy over existing tools, even in non-crop genomes. CROPSR provides the scientific community with new methods and a new workflow for performing CRISPR/Cas9 knockout experiments. CROPSR reduces the challenges of working in crops, and helps speed gRNA sequence design, evaluation and validation. We hope that the new software will accelerate discovery and reduce the number of failed experiments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Detecting hidden transient events in noisy nonlinear time-series

The information impulse function (IIF), running Variance, and local Hölder Exponent are three conceptually different time-series evaluation techniques. These techniques examine time-series for local changes in information content, statistical variation, and point-wise smoothness, respectively. Using simulated data emulating a randomly excited nonlinear dynamical system, this study interrogates the utility of each method to correctly differentiate a transient event from the background while simultaneously locating it in time. Computational experiments are designed and conducted to evaluate the efficacy of each technique by varying pulse size, time location, and noise level in time-series. Our findings reveal that, in most cases, the first instance of a transient event is more easily observed with the information-based approach of IIF than with the Variance and local Hölder Exponent methods. While our study highlights the unique strengths of each technique, the results suggest that very robust and reliable event detection for nonlinear systems producing noisy time-series data can be obtained by incorporating the IIF into the analysis.

42 ENGINEERING↗
NASA NTRS1983

BANDIT in NASTRAN

BANDIT has been implemented into the NASTRAN April '83 release. It is now a permanent feature in NASTRAN and will be included in all future releases for all four computing machines (IBM, CDC, UNIVAC, and VAX). Originally BANDIT operated as a preprocessor of NASTRAN. It read the NASTRAN input cards and produced a set of resequencing (SEOGP) cards that would greatly reduce the computational time required by the matrix decomposition module of NASTRAN for a large structure. In the past, many computer centers had installed BANDIT in their systems together with the NASTRAN program. The user would run the BANDIT program and NASTRAN as if they were one program (or two separated programs depending on how the two programs were actually tied together in the computer systems). In some cases, the user was required to pass the input cards and the output SEQGP cards between the two programs, and n others, the data was manipulated through the use of cataloged disc files. Although there is nothing wrong with this BANDIT-NASTRAN arrangement, there are, however, several shortcomings which are mentioned in this paper. The BANDIT in the NASTRAN April '83 release has removed all the deficiencies, and it comes in one version applicable to the four computing machines.

Chan, G. C.↗
NASA NTRS1988

Grid embedding technique using Cartesian grids for Euler solutions

Grid-embedding techniques are presently applied to the solutions of the Euler equations on Cartesian grids for the NACA 0012 airfoil and the multielement SKF1.1 airfoil at transonic speeds. Based on comparisons with solutions on fine grids, it is shown that the present scheme, when used in conjunction with the Runge-Kutta time-stepping scheme as well as Cartesian grids, yields reduced memory requirements and a substantial reduction in computational time, without loss of accuracy.

Micheltree, R. A.↗
NASA NTRS1991

Monitoring Engine Vibrations And Spectrum Of Exhaust

Real-time computation of intensities of peaks in visible-light emission spectrum of exhaust combined with real-time spectrum analysis of vibrations into developmental monitoring technique providing up-to-the-second information on conditions of critical bearings in engine. Conceived to monitor conditions of bearings in turbopump suppling oxygen to Space Shuttle main engine, based on observations that both vibrations in bearings and intensities of visible light emitted at specific wavelengths by exhaust plume of engine indicate wear and incipient failure of bearings. Applicable to monitoring "health" of other machinery via spectra of vibrations and electromagnetic emissions from exhausts. Concept related to one described in "Monitoring Bearing Vibrations For Signs Of Damage", (MFS-29734).

Martinez, Carol L.↗
DOE OSTI2020

Experimental Validation of Approximate Dynamic Programming Based Optimization and Convergence on Microgrid Applications

Stochastic optimization can better address uncertainties in power system problems. However, when state space and action space become large, many existing approaches become computationally expensive and even infeasible. Approximate dynamic programming (ADP) attracts researchers’ attention as a powerful tool for solving power system optimization problems with reduced computational cost. In this paper, in light of the existing literature, we investigate how the ADP approach with post-decision value function approximation converges to the nearly optimal solution with improved computational speed and experimentally validate the performance of the approach for a microgrid energy optimization problem. The approximation error versus the number of iteration is studied for convergence analysis of the post-decision ADP. A flowchart is provided to illustrate the proposed ADP algorithm for a microgrid energy optimization problem. The performance of ADP and dynamic programming (DP) is compared in terms of optimization error and computational time. It has found that the post-decision ADP approach can achieve competitive optimality with improved computational speed compared to the traditional DP.

Das, Avijit↗
DOE OSTI2022

Detecting CAN Masquerade Attacks with Signal Clustering Similarity

Vehicular Controller Area Networks (CANs) are susceptible to cyber attacks of different levels of sophistication. Fabrication attacks are the easiest to administer—an adversary simply sends (extra) frames on a CAN—but also the easiest to detect because they disrupt frame frequency. To overcome time-based detection methods, adversaries must administer masquerade attacks by sending frames in lieu of (and therefore at the expected time of) benign frames but with malicious payloads. Research efforts have proven that CAN attacks, and masquerade attacks in particular, can affect vehicle functionality. Examples include causing unintended acceleration, deactivation of vehicle’s brakes, as well as steering the vehicle. We hypothesize that masquerade attacks modify the nuanced correlations of CAN signal time series and how they cluster together. Therefore, changes in cluster assignments should indicate anomalous behavior. We confirm this hypothesis by leveraging our previously developed capability for reverse engineering CAN signals (i.e., CAN-D [Controller Area Network Decoder]) and focus on advancing the state of the art for detecting masquerade attacks by analyzing time series extracted from raw CAN frames. Specifically, we demonstrate that masquerade attacks can be detected by computing time series clustering similarity using hierarchical clustering on the vehicle’s CAN signals (time series) and comparing the clustering similarity across CAN captures with and without attacks. We test our approach in a previously collected CAN dataset with masquerade attacks (i.e., the ROAD dataset) and develop a forensic tool as a proof of concept to demonstrate the potential of the proposed approach for detecting CAN masquerade attacks.

Moriano Salazar, Pablo↗
NASA NTRS2000

Parallel Unsteady Turbopump Flow Simulations for Reusable Launch Vehicles

An efficient solution procedure for time-accurate solutions of Incompressible Navier-Stokes equation is obtained. Artificial compressibility method requires a fast convergence scheme. Pressure projection method is efficient when small time-step is required. The number of sub-iteration is reduced significantly when Poisson solver employed with the continuity equation. Both computing time and memory usage are reduced (at least 3 times). Other work includes Multi Level Parallelism (MLP) of INS3D, overset connectivity for the validation case, experimental measurements, and computational model for boost pump.

Kiris, Cetin↗
DOE OSTI2024

Learning model combining convolutional deep neural network with a self-attention mechanism for AC optimal power flow

Alternating current optimal power flow (OPF) analysis is critical for efficient and reliable operation of power systems. For large systems or repetitive computations, the traditional methods such as the direct and gradient methods, or non-traditional methods, such as the genetic algorithm and simulating annealing, are time-consuming and unsuitable for real-time computing. The work in this paper proposes a novel framework to obtain the optimal solution of power flow in real-time using a combination of convolutional neural networks and a self-attention mechanism. All parameters of the power networks are rearranged in an image-like shape of a multi-channel image where each channel is a two-dimensional matrix. The proposed approach is adaptive with every input size of power systems as well as frequent variations of network topologies without intervention to the framework core. The encompassment of all power system contexts in which all parameters of internal elements, generation costs, and topology information are included, contributes to the higher accuracy of inference compared to other current machine-learning-based OPF-solving methods. Besides, the proposed framework established on ubiquitous platforms is effortlessly integrated into current infrastructures of power systems, and the great efficiency along with the computation speed may serve as a critical point for practical implications, such as enabling faster decision-making during real-time operations, predicting system contingencies, and remedial actions based on an offline pre-trained model. Furthermore, this supervised learning process is applied to the dataset of four case studies of meshed power systems: the IEEE 5-bus system (IEEE-5), the IEEE 30-bus system (IEEE-30), the IEEE 39-bus system (IEEE-39), and the IEEE 57-bus system (IEEE-57) to prove the efficacy of the proposed method.

42 ENGINEERING↗
NASA NTRS2018

NASA GMAO S2S Prediction System Hindcast and Near-Real Time Operations Strategy

In this presentation we present an overview of the GMAO Sub-Seasonal and Seasonal Prediction System with a focus on the computing time and resources and actual time it takes to complete a full set of hindcasts. The goal is to come up with some solutions to allow us to run more ensemble members for the next version of the system which will be higher resolution and take many more resources.

Kovach, Robin↗
DOE OSTI2025

CUDO: closed-form universal dwell-time optimization for computer-controlled optical surfacing

Precision optical figuring demands fast and accurate dwell time optimization to reach nanometer- and sub-nanometer-level accuracy in next-generation optical systems. We introduce CUDO (closed-form universal dwell-time optimization), the first, to the best of our knowledge, unified closed-form analytical framework that supports both function-form and matrix-form dwell time models in computer-controlled optical surfacing (CCOS). In contrast to traditional methods, which rely on iterative optimization and hyperparameter tuning, our framework derives direct analytical solutions with no adjustable parameters. This approach unifies the solution principles of existing methods within a single mathematical model, delivering three key advantages: (1) accuracy on par with, or superior to, iterative solvers, (2) substantial reduction in computation time, and (3) numerical robustness. Comparative studies with prior art confirm that closed-form solutions achieve equivalent residual error while removing runtime bottlenecks. By simplifying the implementation and enabling real-time, scalable deployment, CUDO establishes a practical foundation for future deterministic fabrication of large-aperture and high-performance optics.

36 MATERIALS SCIENCE↗
NASA NTRS1979

Acoustic duct liner optimization using finite elements

Determination of a mathematical model which may be used for obtaining optimum acoustic liners in aeroengine ducts was the goal of this study. Starting with a baseline finite element model which consumed too much computer time to permit optimum liner evaluation for realistic ducts and source frequencies, a survey was conducted of candidate methods for reducing computational effort. A highly effective boundary exclusive decomposition method was developed which enables L-U decomposition of a major partition of the global matrix to be performed once only. Timing experiments using the technique in duct liner optimization show a reduction of between one and two orders of magnitude in the central processor unit (CPU) time of the baseline model.

Abrahamson, A. L.↗
NASA NTRS1972

Shock pair observation

On day 84, 1969, the HEOS 1 satellite observed a shock pair connected with a plasma bulk velocity increase from 400 to approximately 750 km/sec. Both shocks were fast shocks. The forward shock had a Mach number of 1.7, the reverse shock had M(fast) = 1.4. The time interval between the two shocks was 7 hrs, 10 min. The time delay between HEOS 1 and Explorer 35 reverse shock observation (20 + or - 6 min) agrees with the computed time delay (11 + or - 4 min).

Chao, J. K.↗
NASA NTRS1977

Three-dimensional vector modeling and restoration of flat finite wave tank radiometric measurements

In this paper, a three-dimensional Fourier transform inversion method describing the interaction between water surface emitted radiation from a flat finite wave tank and antenna radiation characteristics is reported. The transform technique represents the scanning of the antenna mathematically as a correlation. Computation time is reduced by using the efficient and economical fast Fourier transform algorithm. To verify the inversion method, computations have been made and compared with known data and other available results. The technique has been used to restore data of the finite wave tank system and other available antenna temperature measurements made at the Cape Cod Canal. The restored brightness temperatures serve as better representations of the emitted radiation than the measured antenna temperatures.

Truman, W. M.↗
NASA NTRS1980

Iterative solutions for one-dimensional diffusion with time varying surface composition and composition-dependent diffusion coefficient

Solutions are given for one-dimensional diffusion problems with a time varying surface composition and also a composition dependent diffusion coefficient. The most general solution does not require special mathematical functions to fit the variation in surface composition or D(C). In another solution, a series expansion may be used to fit the time dependent surface concentration. These solutions make use of iterative calculations that converge rapidly and are highly stable. Computer times are much shorter than that required for finite difference calculations and can efficiently make use of interactive graphics terminals. Existing gas carburization data were used to provide an illustration of an iterative approach with a time varying carbon composition at the free surface.

Chow, M.↗
NASA NTRS1985

Ocean acoustic tomography - Travel time biases

The travel times of acoustic rays traced through a climatological sound-speed profile are compared with travel times computed through the same profile containing an eddy field. The accuracy of linearizing the relations between the travel time difference and the sound-speed deviation at long ranges is assessed using calculations made for two different eddy fields measured in the eastern Atlantic. Significant nonlinearities are found in some cases, and the relationships of the values of these nonlinearities to the range between source and receiver, to the anomaly size associated with the eddies, and to the positions of the eddies are studied. An analytical model of the nonlinearities is discussed.

Spiesberger, J. L.↗
NASA NTRS1990

A computational efficient modelling of laminar separation bubbles

In predicting the aerodynamic characteristics of airfoils operating at low Reynolds numbers, it is often important to account for the effects of laminar (transitional) separation bubbles. Previous approaches to the modelling of this viscous phenomenon range from fast but sometimes unreliable empirical correlations for the length of the bubble and the associated increase in momentum thickness, to more accurate but significantly slower displacement-thickness iteration methods employing inverse boundary-layer formulations in the separated regions. Since the penalty in computational time associated with the more general methods is unacceptable for airfoil design applications, use of an accurate yet computationally efficient model is highly desirable. To this end, a semi-empirical bubble model was developed and incorporated into the Eppler and Somers airfoil design and analysis program. The generality and the efficiency was achieved by successfully approximating the local viscous/inviscid interaction, the transition location, and the turbulent reattachment process within the framework of an integral boundary-layer method. Comparisons of the predicted aerodynamic characteristics with experimental measurements for several airfoils show excellent and consistent agreement for Reynolds numbers from 2,000,000 down to 100,000.

Dini, Paolo↗