Results for “computation time” — Page 11

NASA NTRS1991

Computational modelling of dump combustors flowfield

A computational model aimed at predicting the flowfield of dump combustors is presented. The turbulent combustion model is based on the conserved scalar approach and on a convenient specification of its probability density function, which reduces the computation of the mean density to a closed form. Turbulence is modeled by means of the k-epsilon model. The averaged conservation equations are solved by a technique based on a staggered grid and on the SIMPLE solver. The computational model is applied to a simple dump combustor to assess the computer time requirements and accuracy. The turbulent combustion model is shown to reduce the computer time by an order of magnitude when compared to evaluating the mean density by numerical quadrature.

Lentini, D.↗

NASA NTRS1989

The role of thermal and lubricant boundary layers in the transient thermal analysis of spur gears

An improved convection heat-transfer model has been developed for the prediction of the transient tooth surface temperature of spur gears. The dissipative quality of the lubricating fluid is shown to be limited to the capacity extent of the thermal boundary layer. This phenomenon can be of significance in the determination of the thermal limit of gears accelerating to the point where gear scoring occurs. Steady-state temperature prediction is improved considerably through the use of a variable integration time step that substantially reduces computer time. Computer-generated plots of temperature contours enable the user to animate the propagation of the thermal wave as the gears come into and out of contact, thus contributing to better understanding of this complex problem. This model has a much better capability at predicting gear-tooth temperatures than previous models.

El-Bayoumy, L. E.↗

NASA NTRS1989

The role of thermal and lubricant boundary layers in the transient thermal analysis of spur gears

An improved convection heat-transfer model has been developed for the prediction of the transient tooth surface temperature of spur gears. The dissipative quality of the lubricating fluid is shown to be limited to the capacity extent of the thermal boundary layer. This phenomenon can be of significance in the determination of the thermal limit of gears accelerating to the point where gear scoring occurs. Steady-state temperature prediction is improved considerably through the use of a variable integration time step that substantially reduces computer time. Computer-generated plots of temperature contours enable the user to animate the propagation of the thermal wave as the gears come into and out of contact, thus contributing to better understanding of this complex problem. This model has a much better capability at predicting gear-tooth temperatures than previous models.

El-Bayoumy, L. E.↗

DOE OSTI2022

Towards a more general understanding of the algorithmic utility of recurrent connections

Lateral and recurrent connections are ubiquitous in biological neural circuits. Yet while the strong computational abilities of feedforward networks have been extensively studied, our understanding of the role and advantages of recurrent computations that might explain their prevalence remains an important open challenge. Foundational studies by Minsky and Roelfsema argued that computations that require propagation of global information for local computation to take place would particularly benefit from the sequential, parallel nature of processing in recurrent networks. Such “tag propagation” algorithms perform repeated, local propagation of information and were originally introduced in the context of detecting connectedness, a task that is challenging for feedforward networks. Here, we advance the understanding of the utility of lateral and recurrent computation by first performing a large-scale empirical study of neural architectures for the computation of connectedness to explore feedforward solutions more fully and establish robustly the importance of recurrent architectures. In addition, we highlight a tradeoff between computation time and performance and construct hybrid feedforward/recurrent models that perform well even in the presence of varying computational time limitations. We then generalize tag propagation architectures to propagating multiple interacting tags and demonstrate that these are efficient computational substrates for more general computations of connectedness by introducing and solving an abstracted biologically inspired decision-making task. Our work thus clarifies and expands the set of computational tasks that can be solved efficiently by recurrent computation, yielding hypotheses for structure in population activity that may be present in such tasks.

59 BASIC BIOLOGICAL SCIENCES↗

NASA NTRSDate not supplied

Time-Accurate Computational Fluid Dynamics Analysis of a Supersonic Turbine to Assess Structural Mode Excitation

Gas turbines can experience significant unsteady loading during operation which can cause damage such as blade cracking or bearing wear. While computational fluid dynamics (CFD) modeling of full three-dimensional gas turbine flow to verify meanline design performance is standard practice within the industry, the use of time-accurate CFD makes it possible to assess the unsteady loading which can be especially problematic at operating conditions where unsteady fluid loading aligns with structural modes. The Fluid Dynamics branch (ER42) at NASA Marshall Space Flight Center has developed a time-accurate CFD analysis methodology using the unstructured, density-based, Loci-CHEM solver which is capable of simulating the relative motion required for turbomachinery applications through sliding interface meshes. The highly-parallel unstructured solver allows for full three-dimensional, time-accurate simulation of turbines including upstream and downstream components such as manifolds, nozzles, and stators, any of which could excite a turbine structural mode. Recently, Loci-CHEM was used to analyze the FASTRAC supersonic turbine to assess the loading on the rotor. Overall performance and time-averaged loading on the rotor was computed, including the axial force over the entire rotor disk which is required for force balance calculations on the turbopump. The FASTRAC turbine has supersonic nozzles upstream of the rotor that result in significant unsteady loading on the rotor blades at multiples of the nozzle pass frequency. The unsteady blade pressure loading was decomposed into the frequency domain for direct use in structural forced response analysis. Utilizing this type of CFD analysis coupled with structural analysis has proven to be a valuable tool in identifying structural modes that are being excited by unsteady fluid loading.

M.V. Fischels↗

NASA NTRSDate not supplied

Time-Accurate Computational Fluid Dynamics Analysis of a Supersonic Turbine to Assess Structural Mode Excitation

Gas turbines can experience significant unsteady loading during operation which can cause damage such as blade cracking or bearing wear. While computational fluid dynamics (CFD) modeling of full three-dimensional gas turbine flow to verify meanline design performance is standard practice within the industry, the use of time-accurate CFD makes it possible to assess the unsteady loading which can be especially problematic at operating conditions where unsteady fluid loading aligns with structural modes. The Fluid Dynamics branch (ER42) at NASA Marshall Space Flight Center has developed a time-accurate CFD analysis methodology using the unstructured, density-based, Loci-CHEM solver which is capable of simulating the relative motion required for turbomachinery applications through sliding interface meshes. The highly-parallel unstructured solver allows for full three-dimensional, time-accurate simulation of turbines including upstream and downstream components such as manifolds, nozzles, and stators, any of which could excite a turbine structural mode. Recently, Loci-CHEM was used to analyze the FASTRAC supersonic turbine to assess the loading on the rotor. Overall performance and time-averaged loading on the rotor was computed, including the axial force over the entire rotor disk which is required for force balance calculations on the turbopump. The FASTRAC turbine has supersonic nozzles upstream of the rotor that result in significant unsteady loading on the rotor blades at multiples of the nozzle pass frequency. The unsteady blade pressure loading was decomposed into the frequency domain for direct use in structural forced response analysis. Utilizing this type of CFD analysis coupled with structural analysis has proven to be a valuable tool in identifying structural modes that are being excited by unsteady fluid loading.

M V Fischels↗

NASA NTRS1989

Distributed execution of recovery blocks - An approach for uniform treatment of hardware and software faults in real-time applications

The concept of distributed execution of recovery blocks is examined as an approach for uniform treatment of hardware and software faults. A useful characteristic of the approach is the relatively small time cost it requires. The approach is thus suitable for incorporation into real-time computer systems. A specific formulation of the approach that is aimed at minimizing the recovery time is presented, called the distributed recovery block (DRB) scheme. The DRB scheme is capable of effecting forward recovery while handling both hardware and software faults in a uniform manner. An approach to incorporating the capability for multiprocessing scheme is also discussed. Two experiments aimed at testing the execution efficiency of the scheme in real-time applications have been conducted on two different multimicrocomputer networks. The results clearly indicate the feasibility of achieving tolerance of hardware and software faults in a broad range of real-time computer systems by use of the schemes for distributed execution of recovery blocks.

Kim, K. H.↗

NASA NTRS1989

Fast, adaptive summation of point forces in the two-dimensional Poisson equation

A comparatively simple procedure is presented for the direct summation of the velocity field introduced by point vortices which significantly reduces the required number of operations by replacing selected partial sums by asymptotic series. Tables are presented which demonstrate the speed of this algorithm in terms of the mere doubling of computational time in dealing with a doubling of the number of vortices; current methods involve a computational time extension by a factor of 4. This procedure need not be restricted to the solution of the Poisson equation, and may be applied to other problems involving groups of points in which the interaction between elements of different groups can be simplified when the distance between groups is sufficiently great.

Van Dommelen, Leon↗

DOE OSTI2023

The DESC stellarator code suite Part 3: Quasi-symmetry optimization

The DESC stellarator optimization code takes advantage of advanced numerical methods to search the full parameter space much faster than conventional tools. Only a single equilibrium solution is needed at each optimization step thanks to automatic differentiation, which efficiently provides exact derivative information. A Gauss–Newton trust-region optimization method uses second-order derivative information to take large steps in parameter space and converges rapidly. With just-in-time compilation and GPU portability, high-dimensional stellarator optimization runs take orders of magnitude less computation time with DESC compared to other approaches. This paper presents the theory of the DESC fixed-boundary local optimization algorithm along with demonstrations of how to easily implement it in the code. Example quasi-symmetry optimizations are shown and compared to results from conventional tools. Three different forms of quasi-symmetry objectives are available in DESC, and their relative advantages are discussed in detail. In the examples presented, the triple product formulation yields the best optimization results in terms of minimized computation time and particle transport. This paper concludes with an explanation of how the modular code suite can be extended to accommodate other types of optimization problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1976

An efficient numerical method for solving the time-dependent compressible Navier-Stokes equations at high Reynolds number

A fine-mesh method incorporating two new operators, which drastically reduces the computation time, has been developed for solving the time-dependent Navier-Stokes equations at flight Reynolds numbers. The approach time-splits the equations into a hyperbolic part and a parabolic part, solves the hyperbolic part by a new explicit numerical method based on characteristics theory, and solves the parabolic part by a new efficient implicit parabolic method. The method has reduced the computation time by one and two orders of magnitude from that required previously to solve for the interaction of a shock wave with a boundary layer on a flat plate.

Maccormack, R. W.↗

NASA NTRS1992

A comparison of the reduced and approximate systems for the time dependent computation of the polar wind and multiconstituent stellar winds

The paper derives the 'reduced' system of equations commonly used to describe the time evolution of the polar wind and multiconstituent stellar winds from the equations for a multispecies plasma with known temperature profiles by assuming that the electron thermal speed approaches infinity. The reduced system is proved to have unbounded growth near the sonic point of the protons for many of the standard parameter cases. For the same parameter cases, the unmodified system exhibits growth in some of the Fourier modes, but this growth is bounded. An alternate system (the 'approximate' system) in which the electron thermal speed is slowed down is introduced. The approximate system retains the mathematical behavior of the unmodified system and can be shown to accurately describe the smooth solutions of the unmodified system. Other advantages of the approximate system over the reduced system are discussed.

Browning, G. L.↗

NASA NTRS1986

A nonlinear substructuring method for concurrent processing computers

This paper proposes a method, based on substructuring, to solve nonlinear structural analysis problems on multiprocessor computers. Background information is given on the use of substructuring in large-scale finite element programs and computational time distributions for the major components for an example nonlinear finite element analysis are discussed. Implementation of the substructuring method on a typical multiprocessor computer is described and estimates are made of expected reductions in computation times based on nonlinear substructuring results obtained on a single processor computer.

Storaasli, O. O.↗

NASA NTRSDate not supplied

A Comparison of Model Predictive Control Architectures for Application to Electrified Aircraft Propulsion Systems

As electrified aircraft propulsion (EAP) systems continue to mature, more sophisticated hardware and software are being developed to balance operations among electric machines and gas-turbine engines. In hybrid-electric propulsion systems, the increased complexity resulting from integrating turbine-engine shafts with electric machines necessitates control methodologies to account for various physical domains. Ideal controllers for hybrid-electric engines manage systems, subsystems, and their interactions in a coordinated fashion, able to account for safety and performance goals while being computationally efficient. In a previous work, linear model predictive control (MPC) schemes were implemented in centralized and distributed frameworks on a nonlinear turbofan engine model as a proof of concept. However, these schemes were not evaluated for computational complexity, prompting further study. The research presented here develops hierarchical MPC schemes to reduce the computational burden of the previous MPC schemes. A two-tier framework is implemented, where a slower sampling MPC controls electric machines and determines fan-speed tracking goals for a faster sampling controller, which is either a MPC or a proportional-integral (PI) controller. The proposed designs are compared to the centralized MPC investigated previously, and performance is measured via fan speed tracking error, energy storage state-of-charge, and computation time. Results reveal that the hierarchical MPC scheme employing a lower-level PI controller improves computation time while maintaining comparable tracking and state-of-charge regulation to the centralized scheme.

model predictive control↗

NASA NTRSDate not supplied

A Comparison of Model Predictive Control Architectures for Application to Electrified Aircraft Propulsion Systems

As electrified aircraft propulsion (EAP) systems continue to mature, more sophisticated hardware and software are being developed to balance operations among electric machines and gas-turbine engines. In hybrid-electric propulsion systems, the increased complexity resulting from integrating turbine-engine shafts with electric machines necessitates control methodologies to account for various physical domains. Ideal controllers for hybrid-electric engines manage systems, subsystems, and their interactions in a coordinated fashion, able to account for safety and performance goals while being computationally efficient. In a previous work, linear model predictive control (MPC) schemes were implemented in centralized and distributed frameworks on a nonlinear turbofan engine model as a proof of concept. However, these schemes were not evaluated for computational complexity, prompting further study. The research presented here develops hierarchical MPC schemes to reduce the computational burden of the previous MPC schemes. A two-tier framework is implemented, where a slower sampling MPC controls electric machines and determines fan-speed tracking goals for a faster sampling controller, which is either a MPC or a proportional-integral (PI) controller. The proposed designs are compared to the centralized MPC investigated previously, and performance is measured via fan speed tracking error, energy storage state-of-charge, and computation time. Results reveal that the hierarchical MPC scheme employing a lower-level PI controller improves computation time while maintaining comparable tracking and state-of-charge regulation to the centralized scheme.

model predictive control↗

NASA NTRS1972

Numerical methods for solving the Boltzmann equation (a review)

The methods are reviewed which are utilized in principal attempts to obtain the numerical solution or modeling of the Boltzmann equation over a broad range of Knudsen numbers. The primary methods considered are the Monte Carlo and the discrete velocities methods. The conculsions drawn from the analysis include the following: (1) The Monte Carlo methods are not well suited in the area of small Knudsen numbers. (2) Among the Monte Carlo methods, the Bird method appears to be the most attractive, since it is more directly related to the Boltzmann equation. (3) The deterministic methods, which include the discrete ordinate technique, offer great possibilities but require exceedingly large computer times. (4) The use of approximating equations in combination with the discrete velocities method will possibly improve computation time and reduce the required memory volume.

Limar, Y. F.↗

NASA NTRS1990

The use of the FFT for the efficient solution of the problem of electromagnetic scattering by a body of revolution

The enhancement of the computational efficiency of the body of revolution (BOR) scattering problem is discused with a view to making it practical for solving large-body problems. The problem of EM scattering by a perfectly conducting BOR is considered, although the methods can be extended to multilayered dielectric bodies as well. Typically, the generation of the elements of the moment method matrix consumes a major portion of the computational time. It is shown how this time can be significantly reduced by manipulating the expression for the matrix elements to permit efficient FFT computation. A technique for extracting the singularity of the Green function that appears within the integrands of the matrix diagonal is also presented, further enhancing the usefulness of the FFT. The computation time can thus be improved by at least an order of magnitude for large bodies in comparison to that for previous algorithms.

Gedney, Stephen D.↗

NASA NTRS1988

Arranging computer architectures to create higher-performance controllers

Techniques for integrating microprocessors, array processors, and other intelligent devices in control systems are reviewed, with an emphasis on the (re)arrangement of components to form distributed or parallel processing systems. Consideration is given to the selection of the host microprocessor, increasing the power and/or memory capacity of the host, multitasking software for the host, array processors to reduce computation time, the allocation of real-time and non-real-time events to different computer subsystems, intelligent devices to share the computational burden for real-time events, and intelligent interfaces to increase communication speeds. The case of a helicopter vibration-suppression and stabilization controller is analyzed as an example, and significant improvements in computation and throughput rates are demonstrated.

Jacklin, Stephen A.↗

NASA NTRS1977

Onboard magnetic field modeling for Solar Maximum Mission /SMM/

Analysis and simulation results are presented for magnetic field models for use in attitude acquisition onboard Solar Maximum Mission (SMM). A study was made of the degree of the spherical harmonic expansion of the magnetic field required, considering mission requirements, modeling errors, and magnetometer quantization and biases. It is shown that a fifth-degree field is sufficient to provide two-degree roll angle determination accuracy with a residual magnetic bias of 10 milligauss. Also, a spherical harmonic expansion for the McIlwain L-parameter is included for the first time. This parameter will be telemetered to ground with experimental data. The fifth-degree expansion will provide the L-parameter to within two percent of accepted values. The additional onboard computational burden is the storage of 36 coefficients and an increase of about 15% in computation time. Prototype flight code was developed which is anticipated to require about 2000 bytes of core storage and 30 milliseconds of computation time per orbit point on the NSSC-1 computer.

Headrick, R. D.↗