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

Numerical spatial marching techniques for estimating duct attenuation and source pressure profiles

A numerical method is developed that could predict the pressure distribution of a ducted source from far-field pressure inputs. Using an initial value formulation, the two-dimensional homogeneous Helmholtz wave equation (no steady flow) is solved using explicit marching techniques. The Von Neumann method is used to develop relationships which describe how sound frequency and grid spacing effect numerical stability. At the present time, stability considerations limit the approach to high frequency sound. Sample calculations for both hard and soft wall ducts compare favorably to known boundary value solutions. In addition, assuming that reflections in the duct are small, this initial value approach is successfully used to determine the attenuation of a straight soft wall duct. Compared to conventional finite difference or finite element boundary value approaches, the numerical marching technique is orders of magnitude shorter in computation time and required computer storage and can be easily employed in problems involving high frequency sound.

Baumeister, K. J.↗
DOE OSTI2026

A Flexible Quasi-Static Mooring Design Optimization Method for Floating Structures

This paper presents a flexible and efficient design method for optimizing the mooring systems of floating structures. Mooring system optimization is challenging because of the strong nonlinearity of mooring system behavior and the many technical constraints that must be satisfied. Furthermore, different mooring configurations can have very different design spaces. While some successful examples of mooring design optimization exist in the literature, developing an optimization approach that can work across various mooring design problems is a larger challenge. We present such a method based on a flexible parameterization that allows a wide variety of mooring designs to be described by a list of variables, a quasi-static mooring model that provides efficient evaluation of a mooring design without directly considering mooring system dynamics, and an optimization framework that generates, evaluates, and adjusts the mooring design while considering user-specified constraints such as offset limits, strength safety factors, and seabed contact limits. We demonstrate the design optimization framework on four mooring design problems, each for a different type of mooring system. We compare the use of different design modes to simplify the optimization problem, showing that they can reduce the computation time by up to 75%. We also compare different optimization algorithms and find that the resulting computational speed can vary by up to 51 times. We perform a sensitivity study on one design and find that the local sensitivity of anchoring radius to water depth has a positive correlation of 0.29, but the global sensitivity shows large nonlinearities. Lastly, we perform a coupled dynamic analysis on one of the optimized designs and find that the predicted mean platform motions and mooring line tensions are within 1% of dynamic results and the extreme motions and tensions are within 14%. Lastly, we show that a DEA-Chain-Polyester mooring configuration is cost-optimal for the given design problem of the demonstrations, which aligns with general industry practice.

16 TIDAL AND WAVE POWER↗
NASA NTRS2011

Fault recovery for real-time, multi-tasking computer system

System and methods for providing a recoverable real time multi-tasking computer system are disclosed. In one embodiment, a system comprises a real time computing environment, wherein the real time computing environment is adapted to execute one or more applications and wherein each application is time and space partitioned. The system further comprises a fault detection system adapted to detect one or more faults affecting the real time computing environment and a fault recovery system, wherein upon the detection of a fault the fault recovery system is adapted to restore a backup set of state variables.

Hess, Richard↗
DOE OSTI2020

Thermodynamic and Kinetic Roles of H2 in Structure Evolution of Urchin-like Co: A density functional theory study

Small gas molecules working as good capping agents play important roles in controlling the morphologies and surface structures of the metal nanocrystals. In present work, the thermodynamic and kinetic roles of H2 molecule played on the morphology of Co nanocrystal were systematically studied based on density functional theory (DFT). The Gibbs surface free energies (?) of Co(100), Co(110) and Co(111) under different hydrogen surface coverages were investigated by ab initio thermodynamics, based on which i) the phase diagrams of stable H coverage on each plane were obtained; ii) the morphology evolutions of the Co nanocrystals with various surface hydrogen coverages were further predicted by Wulff construction. It was revealed that addition of H2 could change the facet stability generating diverse morphological Co nucleus. The kinetic role of H2 was further explored by DFT during adatom Co surface diffusions under different H coverages (?H), which suggested that except for Co(100) at ?H of 0.56 ML, the surface H would hinder Co surface diffusions. The projected density of state (PDOS) gave a deeper insight that the electronic structures of the Co adatom could be alerted by addition of the surface H, which thereby affected its surface diffusion ability. X. Wang, N. Liu, Q. Zhang, X. Liang, and B. Chen were financially supported by the National Natural Science Foundation of China (No. 21476012, 21571012, and 91534201). D. Mei was supported by the US Department of Energy (DOE), Office of Science, Office of Basic Energy Sciences, Division of Chemical Sciences, Geosciences & Biosciences. Pacific Northwest National Laboratory (PNNL) is a multiprogram national laboratory operated for DOE by Battelle. Computing time was granted by the facility user proposal grand challenge of computational catalysis of the William R. Wiley Environmental Molecular Sciences Laboratory (EMSL). EMSL is a national scientific user facility located at Pacific Northwest National Laboratory (PNNL) and sponsored by DOE’s Office of Biological and Environmental Research.

Nanocrystal Co, Surface free energy, Surface diffu↗
DOE OSTI2021

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Efficient near-field ptychography reconstruction using the Hessian operator

X-ray ptychography is a powerful and robust coherent imaging method providing access to the complex object and probe (illumination). Ptychography reconstruction is typically performed using first-order methods due to their computational efficiency. Higher-order methods, while potentially more accurate, are often prohibitively expensive in terms of computation. In this study, we present a mathematical framework for reconstruction using second-order information derived from an efficient computation of the bilinear Hessian and Hessian operator. The formulation is provided for Gaussian-based models, enabling the simultaneous reconstruction of the object, probe, and object positions. Synthetic data tests, along with experimental near-field ptychography data processing, demonstrate a ten-fold reduction in computation time compared to first-order methods. The derived formulas for computing the Hessians, along with the strategies for incorporating them into optimization schemes, are well-structured and easily adaptable to various ptychography problem formulations.

Carlsson, Marcus [Lund Univ. (Sweden)] (ORCID:0000↗
NASA NTRS1978

Perturbations in two- and three-dimensional transonic flows

The difficulty of treating the perturbation of transonic flow, during which shock waves change position, can be overcome by using a distorted coordinate system in which the locations of all shock waves do not change; the distortion is found as part of the solution. This device leads to a relation that allows a range of flows, with differing shock locations, to be related algebraically to two known 'calibration' flows. Results for flows around finite wings, including those with multiple, intersecting shock waves, are presented. A typical computing time for such examples is 0.3 sec on a CDC 7600 computer.

Nixon, D.↗
NASA NTRS1985

Recent advances in computational transonic aerodynamics

The near-term prospects are discussed for calculation of viscous transonic flow fields about realistic configurations at full-scale Reynolds numbers. Three basic algorithms are considered: The central-difference, three-factor ADI method; the central-difference, explicit, multistep Runge-Kutta method with multigrid acceleration; and the relaxation method for the upwind-differenced, flux-split equations. Each method has distinct advantages and disadvantages regarding stability, convergence rate, and vectorizability. It appears that computation times can be 15 to 60 hours on the latest super computers unless 3D algorithms are improved to perform as well as current 2D algorithms.

South, J. C., Jr.↗
NASA NTRS1986

A lateral guidance algorithm to reduce the post-aerobraking burn requirements for a lift-modulated orbital transfer vehicle

A lateral guidance algorithm which controls the location of the line of intersection between the actual and desired orbital planes (the hinge line) is developed for the aerobraking phase of a lift-modulated orbital transfer vehicle. The on-board targeting algorithm associated with this lateral guidance algorithm is simple and concise which is very desirable since computation time and space are limited on an on-board flight computer. A variational equation which describes the movement of the hinge line is derived. Simple relationships between the plane error, the desired hinge line position, the position out-of-plane error, and the velocity out-of-plane error are found. A computer simulation is developed to test the lateral guidance algorithm for a variety of operating conditions. The algorithm does reduce the total burn magnitude needed to achieve the desired orbit by allowing the plane correction and perigee-raising burn to be combined in a single maneuver. The algorithm performs well under vacuum perigee dispersions, pot-hole density disturbance, and thick atmospheres. The results for many different operating conditions are presented.

Herman, G. C.↗
NASA NTRS1989

Supersonic far-field boundary conditions for transonic small-disturbance theory

Characteristic far-field boundary conditions for supersonic freestream flow have been developed and implemented within a transonic small-disturbance code. The boundary conditions have been implemented within the CAP-TSD code which has been developed recently for aeroelastic analysis of complete aircraft configurations. These boundary conditions improve the accuracy of the solutions for supersonic freestream applications. They also allow the extent of the grid to be much smaller, thus providing savings in the computational time required to obtain solutions. Comparisons are shown between surface pressures computed using large and small grid extents for the NACA 0012 airfoil and the F-5 wing at various Mach numbers and angles of attack. Both steady and unsteady results are presented and comparisons are made with Euler results and with experimental data to assess the accuracy of the new far-field boundary conditions. Comparisons of these results show that the supersonic boundary conditions allow a much smaller grid to be used without losing accuracy.

Gibbons, Michael D.↗
NASA NTRS1985

Advanced reliability methods for structural evaluation

Fast probability integration (FPI) methods, which can yield approximate solutions to such general structural reliability problems as the computation of the probabilities of complicated functions of random variables, are known to require one-tenth the computer time of Monte Carlo methods for a probability level of 0.001; lower probabilities yield even more dramatic differences. A strategy is presented in which a computer routine is run k times with selected perturbed values of the variables to obtain k solutions for a response variable Y. An approximating polynomial is fit to the k 'data' sets, and FPI methods are employed for this explicit form.

Wirsching, P. H.↗
NASA NTRS1972

Computational work and time on finite machines.

Measures of the computational work and computational delay required by machines to compute functions are given. Exchange inequalities are developed for random access, tape, and drum machines to show that product inequalities between storage and time, number of drum tracks and time, number of bits in an address and time, etc., must be satisfied to compute finite functions on bounded machines.

Savage, J. E.↗
NASA NTRS2012

Time-Domain Terahertz Computed Axial Tomography NDE System

NASA has identified the need for advanced non-destructive evaluation (NDE) methods to characterize aging and durability in aircraft materials to improve the safety of the nation's airline fleet. 3D THz tomography can play a major role in detection and characterization of flaws and degradation in aircraft materials, including Kevlar-based composites and Kevlar and Zylon fabric covers for soft-shell fan containment where aging and durability issues are critical. A prototype computed tomography (CT) time-domain (TD) THz imaging system has been used to generate 3D images of several test objects including a TUFI tile (a thermal protection system tile used on the Space Shuttle and possibly the Orion or similar capsules). This TUFI tile had simulated impact damage that was located and the depth of damage determined. The CT motion control gan try was designed and constructed, and then integrated with a T-Ray 4000 control unit and motion controller to create a complete CT TD-THz imaging system prototype. A data collection software script was developed that takes multiple z-axis slices in sequence and saves the data for batch processing. The data collection software was integrated with the ability to batch process the slice data with the CT TD-THz image reconstruction software. The time required to take a single CT slice was decreased from six minutes to approximately one minute by replacing the 320 ps, 100-Hz waveform acquisition system with an 80 ps, 1,000-Hz waveform acquisition system. The TD-THZ computed tomography system was built from pre-existing commercial off-the-shelf subsystems. A CT motion control gantry was constructed from COTS components that can handle larger samples. The motion control gantry allows inspection of sample sizes of up to approximately one cubic foot (.0.03 cubic meters). The system reduced to practice a CT-TDTHz system incorporating a COTS 80- ps/l-kHz waveform scanner. The incorporation of this scanner in the system allows acquisition of 3D slice data with better signal-to-noise using a COTS scanner rather than the gchirped h scanner. The system also reduced to practice a prototype for commercial CT systems for insulating materials where safety concerns cannot accommodate x-ray. A software script was written to automate the COTS software to collect and process TD-THz CT data.

Zimdars, David↗
DOE OSTI2024

Two-Step Hyperparameter Optimization Method: Accelerating Hyperparameter Search by Using a Fraction of a Training Dataset

Abstract Hyperparameter optimization (HPO) is an important step in machine learning (ML) model development, but common practices are archaic—primarily relying on manual or grid searches. This is partly because adopting advanced HPO algorithms introduces added complexity to the workflow, leading to longer computation times. This poses a notable challenge to ML applications, as suboptimal hyperparameter selections curtail the potential of ML model performance, ultimately obstructing the full exploitation of ML techniques. In this article, we present a two-step HPO method as a strategic solution to curbing computational demands and wait times, gleaned from practical experiences in applied ML parameterization work. The initial phase involves a preliminary evaluation of hyperparameters on a small subset of the training dataset, followed by a reevaluation of the top-performing candidate models postretraining with the entire training dataset. This two-step HPO method is universally applicable across HPO search algorithms, and we argue it has attractive efficiency gains. As a case study, we present our recent application of the two-step HPO method to the development of neural network emulators for aerosol activation. Although our primary use case is a data-rich limit with many millions of samples, we also find that using up to 0.0025% of the data—a few thousand samples—in the initial step is sufficient to find optimal hyperparameter configurations from much more extensive sampling, achieving up to 135× speedup. The benefits of this method materialize through an assessment of hyperparameters and model performance, revealing the minimal model complexity required to achieve the best performance. The assortment of top-performing models harvested from the HPO process allows us to choose a high-performing model with a low inference cost for efficient use in global climate models (GCMs).

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Simulation of intense microwave pulse propagation in air breakdown environment

An experiment is conducted to examine the tail erosion phenomenon which occurs to an intense microwave pulse propagating in air breakdown environment. In the experiment, a 1 MW microwave pulse (1.1 microsec) is transmitted through a large plexiglas chamber filled with dry air at about 1-2 torr pressure. Two different degrees of tail erosion caused by two different mechanisms are identified. This experimental effort leads to the understanding of the fundamental behavior of tail erosion and provides a data base for validating the theoretical model. A theoretical model based on two coupled partial differential equations is established to describe the propagation on an intense microwave pulse in air breakdown environment. One is derived from the Poynting theorem, and the other one is the rate equation of electron density. A semi-empirical formula of the ionization frequency is adopted for this model. A transformation of these two equations to local time frame of reference is introduced so that they can be solved numerically with considerably reduced computation time. This model is tested by using it to perform the computer simulation of the experiment. The numerical results are shown to agree well with the experimental results.

Kuo, S. P.↗
DOE OSTI2023

Sparsity for Gradient-Based Optimization of Wind Farm Layouts

Optimizing wind farm layouts is an important step in designing an efficient wind farm. Optimizing wind farm layouts is also a difficult task due to computation times increasing with the number of turbines present in the farm. The most computationally expensive part of gradient-based optimization is calculating the gradient. In order to reduce the expense of gradient calculation, we performed a study on the use of sparsity in wind farm layout optimization. This paper presents the findings of the sparsity study and provides a method to use sparsity in wind farm layout optimization. We tested this sparsity method by optimizing multiple farms with sparse methods and compared the results to optimizations of the same farms using traditional methods. By using the sparse method to optimize multiple farms, we found that the objective results were comparable between sparse and traditional methods and that sparse methods were 4 times faster than traditional methods on average. We expect more speedups with improved methodology and larger wind farms. By using sparse methods, it is possible to solve the wind farm layout optimization problem more efficiently, thus allowing for a more thorough study of the wind farm layout design space without excessive computational costs. Further work is required to refine the method and prepare for testing on real-world wind farm layout applications.

gradient↗
NASA NTRS1994

Real-time robot deliberation by compilation and monitoring of anytime algorithms

Anytime algorithms are algorithms whose quality of results improves gradually as computation time increases. Certainty, accuracy, and specificity are metrics useful in anytime algorighm construction. It is widely accepted that a successful robotic system must trade off between decision quality and the computational resources used to produce it. Anytime algorithms were designed to offer such a trade off. A model of compilation and monitoring mechanisms needed to build robots that can efficiently control their deliberation time is presented. This approach simplifies the design and implementation of complex intelligent robots, mechanizes the composition and monitoring processes, and provides independent real time robotic systems that automatically adjust resource allocation to yield optimum performance.

Zilberstein, Shlomo↗