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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

A Real-Time Optimization with Warm-Start of Multiperiod AC Optimal Power Flows

We present a real-time optimization strategy based on warm-start for solving a moving horizon of multi period AC optimal power flow (ACOPF) problems. In each horizon, ACOPFs are temporally interlinked via generator ramp constraints, and we assume that each horizon needs to be solved every few seconds or minutes. We introduce two approximate tracking schemes that closely follow a solution path consisting of strongly regular points. We present theoretical results bounding the tracking error by the square of the parameter changes between time periods. Experimental results for networks of sizes up to 9K buses show a fast computation time while maintaining a good solution quality, thus making our approach well suited for real-time circumstances.

moving horizon↗
NASA NTRS1972

Optimizing a liquid propellant rocket engine with an automated combustor design code (AUTOCOM)

A procedure for automatically designing a liquid propellant rocket engine combustion chamber in an optimal fashion is outlined. The procedure is contained in a digital computer code, AUTOCOM. The code is applied to an existing engine, and design modifications are generated which provide a substantial potential payload improvement over the existing design. Computer time requirements for this payload improvement were small, approximately four minutes in the CDC 6600 computer.

Hague, D. S.↗
NASA NTRS1978

Description and performance of the Langley visual landing display system

A television/model board system is described which provides a means of generating a six-degree-of-freedom visual out-the-window scene for the pilot of a simulated aircraft. The hardware and its performance of capability for meeting the visual requirements for a wide range of simulation studies are detailed. Also included is a description of the computer software required for the system. An example of software implementation in a real-time computer program is provided.

Rollins, J. D.↗
NASA NTRS1982

Conference on Complex Turbulent Flows: Comparison of Computation and Experiment, Stanford University, Stanford, CA, September 14-18, 1981, Proceedings. Volume 2 - Taxonomies, reporters' summaries, evaluation, and conclusions

Computational techniques for simulating turbulent flows were explored, together with the results of experimental investigations. Particular attention was devoted to the possibility of defining a universal closure model, applicable for all turbulence situations; however, conclusions were drawn that zonal models, describing localized structures, were the most promising techniques to date. The taxonomy of turbulent flows was summarized, as were algebraic, differential, integral, and partial differential methods for numerical depiction of turbulent flows. Numerous comparisons of theoretically predicted and experimentally obtained data for wall pressure distributions, velocity profiles, turbulent kinetic energy profiles, Reynolds shear stress profiles, and flows around transonic airfoils were presented. Simplifying techniques for reducing the necessary computational time for modeling complex flowfields were surveyed, together with the industrial requirements and applications of computational fluid dynamics techniques.

Kline, S. J.↗
NASA NTRS1992

Analysis of cascades using a two dimensional Euler aeroelastic solver

A two-dimensional unsteady aerodynamic Euler solver based on a flux differencing scheme is being developed to analyze oscillating cascades. The cascades can have subsonic, transonic, or supersonic flow with either subsonic or supersonic axial velocity. The aerodynamic solver is coupled with a typical section structural model for each blade of the cascade. Flutter analysis methods both in time and frequency domains are then implemented into the resulting aeroelastic solver. Methods that reduce computational time for calculating the unsteady aerodynamic coefficients, namely the influence coefficient method and the pulse response method, are also implemented and validated. The present solver showed good correlation with published results for all the flow regimes. It is shown that grid coarsening improved the accuracy of the predictions. A representative flutter calculation showed that both the frequency domain and time domain methods are implemented correctly into the aeroelastic solver.

Reddy, T. S. R.↗
NASA NTRS1990

Bending and stretching finite element analysis of anisotropic viscoelastic composite plates

Finite element algorithms have been developed to analyze linear anisotropic viscoelastic plates, with or without holes, subjected to mechanical (bending, tension), temperature, and hygrothermal loadings. The analysis is based on Laplace transforms rather than direct time integrations in order to improve the accuracy of the results and save on extensive computational time and storage. The time dependent displacement fields in the transverse direction for the cross ply and angle ply laminates are calculated and the stacking sequence effects of the laminates are discussed in detail. Creep responses for the plates with or without a circular hole are also studied. The numerical results compare favorably with analytical solutions, i.e. within 1.8 percent for bending and 10(exp -3) 3 percent for tension. The tension results of the present method are compared with those using the direct time integration scheme.

Hilton, Harry H.↗
NASA NTRS1999

Space Station GPS Multipath Analysis and Validation

To investigate the multipath effects on the International Space Station (ISS) Global Positioning System (GPS) measurement accuracy, experimental and computational investigations were performed to estimate the carrier phase errors due to multipath. A new modeling approach is used to reduce the required computing time by separating the dynamic structure elements from the static structure elements in the multipath computations. This study confirmed that the multipath is a major error source to the ISS GPS performance and can possibly degrade the attitude determination solution. It is demonstrated that the GPS antenna carrier phase errors due to multipath can be analyzed using the electromagnetic modeling technique such as the Uniform Geometrical Theory of Diffraction (UTD).

Hwu, Shian U.↗
DOE OSTI2026

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Computationally efficient Bayesian estimation of graphical networks for omics data

Graphical networks are useful, widely-used modeling approaches to represent complex biological processes with biological measurements generated by platforms such as mass spectrometry. Bayesian analyses of graphical networks for omics data have several advantages over their frequentist counterparts, such as the inclusion of prior knowledge in the estimation of models. However, Bayesian approaches to date have only been feasible for data with a couple hundred biomolecules due to prohibitive computational time, but omics data often contains tens of thousands of biomolecules. Here, we present and illustrate a more computationally efficient approach named BPlane (Bayesian PseudoLikelihood-based Algorithm for Network Estimation) to extend Bayesian modeling capabilities for larger-sized datasets, such as most untargeted proteomics data. Via simulation, we demonstrate that BPlane produces substantial computational savings over a current state-of-the-art Bayesian algorithm while maintaining competitive edge detection accuracy. On a SARS-CoV2 proteomics data with 7000 proteins, the competing algorithm takes three times as long to complete the first iteration as BPlane takes to converge after over 100 iterations.

EM algorithm↗
DOE OSTI2024

Quantum simulations of hadron dynamics in the Schwinger model using 112 qubits

Hadron wave packets are prepared and time evolved in the Schwinger model using 112 qubits of IBM’s 133-qubit Heron quantum computer ibm_torino. The initialization of the hadron wave packet is performed in two steps. First, the vacuum is prepared across the whole lattice using the recently developed SC-ADAPT-VQE algorithm and workflow. SC-ADAPT-VQE is then extended to the preparation of localized states, and used to establish a hadron wave packet on top of the vacuum. This is done by adaptively constructing low-depth circuits that maximize the overlap with an adiabatically prepared hadron wave packet. Due to the localized nature of the wavepacket, these circuits can be determined on a sequence of small lattices using classical computers, and then robustly scaled to prepare wave packets on large lattices for simulations using quantum computers. Time evolution is implemented with a second-order Trotterization. To reduce both the required qubit connectivity and circuit depth, an approximate quasilocal interaction is introduced. This approximation is made possible by the emergence of confinement at long distances, and converges exponentially with increasing distance of the interactions. Using multiple error-mitigation strategies, up to 14 Trotter steps of time evolution are performed, employing 13,858 two-qubit gates (with a CNOT depth of 370). The propagation of hadrons is clearly identified, with results that compare favorably with Matrix Product State simulations. Finally, prospects for a near-term quantum advantage in simulations of hadron scattering are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Per-Phase and 3-Phase Optimal Coordination of Directional Overcurrent Relays Using Genetic Algorithm

Penetration of the power grid by renewable energy sources, distributed storage, and distributed generators is becoming increasingly common. Increased utilization of these distributed energy resources (DERs) has given rise to additional protection coordination concerns, particularly where they are utilized in an unbalanced manner or where loading among phases is unbalanced. Digital relays such as the SEL-751 (produced by Schweitzer Engineering Laboratories, Pullman, WA, USA) series have the capability of being set on a per-phase basis. This capability is underutilized in common practice. Additionally, in optimization algorithms for determining relay settings, the time-overcurrent characteristics (TOCs) of relays are generally not treated as variables and are assigned before running the optimization algorithm. In this paper, TOC options themselves are treated as discrete variables to be considered in the optimization algorithm. A mixed integer nonlinear programming problem (MINLP) is set up where the goal is to minimize relay operating times. A genetic algorithm (GA) approach is implemented in MATLAB where two cases are considered. In the first case, the TOC and Time dial setting (TDS) of each relay is set on a three-phase basis. In the second case, per-phase settings are considered. Relay TDSs and TOCs are both considered as simultaneous discrete control variables. Despite the stochastic nature of using per-phase settings for unbalanced systems is found to generally allow for shorter operating times. However, for relatively balanced systems, it is best to use three-phase settings if computation time is of importance.

Matthews, Ronald C.↗
NASA NTRS1985

Nonreflecting boundary conditions for the complete unsteady transonic small-disturbance equation

Nonreflecting far-field boundary conditions that are consistent with the complete transonic small-disturbance (TSD) equations are derived. They are implemented in a new code for solving the complete TSD equation and are tested for a harmonically oscillating NACA 64A010 airfoil in transonic flow and for a flat-plate airfoil with a pulse in the angle of attack. Using the new boundary conditions on a relatively small grid, solutions for the airfoil that are obtained that agree with large-grid calculations, resulting in a 44 percent savings in computer time. Frequency responses for the flat plate show that most of the disturbances incident on the computational boundaries are absorbed by the boundary conditions.

Whitlow, W., Jr.↗
NASA NTRS1991

A theoretical model for intense microwave pulse propagation in an air breakdown environment

A theoretical model based on two coupled partial differential equations is established to describe the propagation of 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 semiempirical 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.

Kuo, S. P.↗
NASA NTRS1982

User's manual for THPLOT, A FORTRAN 77 Computer program for time history plotting

A general purpose FORTRAN 77 computer program (THPLOT) for plotting time histories using Calcomp pen plotters is described. The program is designed to read a time history data file and to generate time history plots for selected time intervals and/or selected data channels. The capabilities of the program are described. The card input required to define the plotting operation is described and examples of card input and the resulting plotted output are given. The examples are followed by a description of the printed output, including both normal output and error messages. Lastly, implementation of the program is described. A complete listing of the program with reference maps produced by the CDC FTN 5.0 compiler is included.

Murray, J. E.↗
NASA NTRSDate not supplied

Efficient Preconditioning of a High-Order Solver for Multiple Physics

This work addresses preconditioning approaches for an implicit high-order solver frame-work applied to multiple physics. The solver is based on a space-time spectral element method and matrix-free Newton-Krylov solver developed at NASA over the recent years. Within this context, most preconditioning methods are impractical, as the computational time and memory requirements scale poorly with increasing polynomial orders. To improve computational efficiency, we first describe a novel entity-based Block Jacobi preconditioner for the continuous-Galerkin solution of the linear-elasticity and linear-shell equations. Second, we introduce a multigrid algorithm to further reduce time-to-solution on stiff cases arising from continuous-and discontinuous-Galerkin discretizations. Results obtained on relevant single-physics reference solutions, demonstrate the feasibility of the methods, paving the way for high-order solutions of fully coupled multi-physics problems.

STMD↗
NASA NTRS1981

Rapid inversion of limb radiance data using an emissivity growth approximation

The time-consuming nature of limb relaxation-type inversion algorithms is due primarily to the numerous integrations over an absorption band to obtain forward radiance values with which to compare measured values. A new method has been devised for the quick and accurate (0.5% error) calculation of single gas broadband (approximately 100 per cm) limb radiance. The method uses a precalculated data base consisting of homogeneous path emissivity vs mass path data for a wide range of temperature and pressure. A 50-km altitude range, 1-km resolution, constituent inversion employing this method requires under 1 sec of computational time when run on modern computer hardware. The method does not rely upon a priori statistical knowledge.

Gordley, L. L.↗