Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational efficiency”

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 451 records · Page 25

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↗

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↗

Current capabilities for simulating the extreme distortion of thin structures subjected to severe impacts

The explicit transient dynamics technology in use today for simulating the impact and subsequent transient dynamic response of a structure has its origins in the 'hydrocodes' dating back to the late 1940's. The growth in capability in explicit transient dynamics technology parallels the growth in speed and size of digital computers. Computer software for simulating the explicit transient dynamic response of a structure is characterized by algorithms that use a large number of small steps. In explicit transient dynamics software there is a significant emphasis on speed and simplicity. The finite element technology used to generate the spatial discretization of a structure is based on a compromise between completeness of the representation for the physical processes modelled and speed in execution. That is, since it is expected in every calculation that the deformation will be finite and the material will be strained beyond the elastic range, the geometry and the associated gradient operators must be reconstructed, as well as complex stress-strain models evaluated at every time step. As a result, finite elements derived for explicit transient dynamics software use the simplest and barest constructions possible for computational efficiency while retaining an essential representation of the physical behavior. The best example of this technology is the four-node bending quadrilateral derived by Belytschko, Lin and Tsay. Today, the speed, memory capacity and availability of computer hardware allows a number of the previously used algorithms to be 'improved.' That is, it is possible with today's computing hardware to modify many of the standard algorithms to improve their representation of the physical process at the expense of added complexity and computational effort. The purpose is to review a number of these algorithms and identify the improvements possible. In many instances, both the older, faster version of the algorithm and the improved and somewhat slower version of the algorithm are found implemented together in software. Specifically, the following seven algorithmic items are examined: the invariant time derivatives of stress used in material models expressed in rate form; incremental objectivity and strain used in the numerical integration of the material models; the use of one-point element integration versus mean quadrature; shell elements used to represent the behavior of thin structural components; beam elements based on stress-resultant plasticity versus cross-section integration; the fidelity of elastic-plastic material models in their representation of ductile metals; and the use of Courant subcycling to reduce computational effort.

Key, Samuel W.↗

Particle Swarm Optimization

The purpose of this paper is to show how the search algorithm known as particle swarm optimization performs. Here, particle swarm optimization is applied to structural design problems, but the method has a much wider range of possible applications. The paper's new contributions are improvements to the particle swarm optimization algorithm and conclusions and recommendations as to the utility of the algorithm, Results of numerical experiments for both continuous and discrete applications are presented in the paper. The results indicate that the particle swarm optimization algorithm does locate the constrained minimum design in continuous applications with very good precision, albeit at a much higher computational cost than that of a typical gradient based optimizer. However, the true potential of particle swarm optimization is primarily in applications with discrete and/or discontinuous functions and variables. Additionally, particle swarm optimization has the potential of efficient computation with very large numbers of concurrently operating processors.

Venter, Gerhard↗

Validation of a High-Order Prefactored Compact Code on Nonlinear Flows with Complex Geometries

A finite-difference time domain solution of the airfoil gust problem is obtained using a high-accuracy nonlinear computational aeroacoustics code. For computational efficiency, the equations are cast in chain-rule curvilinear form, and a structured multiblock solver is used in parallel. In order to fully investigate the performance of this solver, a test matrix of eight problems are computed (two airfoil geometries, two gust frequencies, and two gust configurations). These results are compared to solutions obtained by the GUST3D frequency-domain solver both on the airfoil surface and in the far field. Grid density and domain size studies are included.

Hixon, R.↗

Application of the Convolution Formalism to the Ocean Tide Potential: Results from the Gravity and Recovery and Climate Experiment (GRACE)

A computationally efficient approach to reducing omission errors in ocean tide potential models is derived and evaluated using data from the Gravity Recovery and Climate Experiment (GRACE) mission. Ocean tide height models are usually explicitly available at a few frequencies, and a smooth unit response is assumed to infer the response across the tidal spectrum. The convolution formalism of Munk and Cartwright (1966) models this response function with a Fourier series. This allows the total ocean tide height, and therefore the total ocean tide potential, to be modeled as a weighted sum of past, present, and future values of the tide-generating potential. Previous applications of the convolution formalism have usually been limited to tide height models, but we extend it to ocean tide potential models. We use luni-solar ephemerides to derive the required tide-generating potential so that the complete spectrum of the ocean tide potential is efficiently represented. In contrast, the traditionally adopted harmonic model of the ocean tide potential requires the explicit sum of the contributions from individual tidal frequencies. It is therefore subject to omission errors from neglected frequencies and is computationally more intensive. Intersatellite range rate data from the GRACE mission are used to compare convolution and harmonic models of the ocean tide potential. The monthly range rate residual variance is smaller by 4-5%, and the daily residual variance is smaller by as much as 15% when using the convolution model than when using a harmonic model that is defined by twice the number of parameters.

models↗

Methane Sensitivity to Perturbations in Tropospheric Oxidizing Capacity

Methane is an important greenhouse gas and has a 25 times greater global warming potential than CO2 on a century timescale. Yet there are considerable uncertainties in the magnitude and variability of its sources and sinks. The response of the coupled non-linear methane-carbon monoxide-hydroxyl radical (OH) system is important in determining the tropospheric oxidizing capacity. Using the NASA Goddard Earth Observing System, Version 5 (GEOS-5) chemistry climate model, we study the response of methane to perturbations of OH and wetland emissions. We use a computationally-efficient option of the GEOS-5 CCM that includes an OH parameterization that accurately represents OH predicted by a full chemical mechanism. The OH parameterization allows for studying non-linear CH4-CO-OH feedbacks in computationally fast sensitivity experiments. We compare our results with surface observations (GMD) and discuss the range of uncertainty in OH and wetland emissions required to bring modeling results in better agreement with surface observations. Our results can be used to improve projections of methane emissions and methane growth.

Yegorova, Elena↗

Unsteady RANS and Scale Resolving Simulations of Open Rotor Noise

Computational simulations using structured curvilinear overset grids with the Launch Ascent and Vehicle Aerodynamics (LAVA) framework are presented for predicting the aerodynamic and aeroacoustic behavior of a contra-rotating open rotor (CROR) propulsion system using a newly developed and computationally efficient sliding mesh technique. A comprehensive evaluation of two turbulence closure treatments is carried out as part of the scope of this work: Unsteady Reynolds-Averaged Navier-Stokes Simulation (URANS), and Hybrid RANS/LES (HRLES). The computed results are then validated against existing experimental measurements at both the nominal take-off and cruise flight conditions. To propagate the noise generated by the near-field CROR system, aeroacoustic analysis based on a frequency-domain permeable surface Ffowcs Williams-Hawkings (FW-H) approach is applied.

ARMD↗

Unsteady RANS and Scale Resolving Simulations of Open Rotor Noise

Computational simulations using structured curvilinear overset grids with the Launch Ascent and Vehicle Aerodynamics (LAVA) framework are presented for predicting the aerodynamic and aeroacoustic behavior of a contra-rotating open rotor (CROR) propulsion system using a newly developed and computationally efficient sliding mesh technique. A comprehensive evaluation of two turbulence closure treatments is carried out as part of the scope of this work: Unsteady Reynolds-Averaged Navier-Stokes Simulation (URANS), and Hybrid RANS/LES (HRLES). The computed results are then validated against existing experimental measurements at both the nominal take-off and cruise flight conditions. To propagate the noise generated by the near-field CROR system, aeroacoustic analysis based on a frequency-domain permeable surface Ffowcs Williams-Hawkings (FW-H) approach is applied.

ARMD↗

Recent improvements in efficiency, accuracy, and convergence for implicit approximate factorization algorithms

In 1977 and 1978, general purpose centrally space differenced implicit finite difference codes in two and three dimensions have been introduced. These codes, now called ARC2D and ARC3D, can run either in inviscid or viscous mode for steady or unsteady flow. Since the introduction of the ARC2D and ARC3D codes, overall computational efficiency could be improved by making use of a number of algorithmic changes. These changes are related to the use of a spatially varying time step, the use of a sequence of mesh refinements to establish approximate solutions, implementation of various ways to reduce inversion work, improved numerical dissipation terms, and more implicit treatment of terms. The present investigation has the objective to describe the considered improvements and to quantify advantages and disadvantages. It is found that using established and simple procedures, a computer code can be maintained which is competitive with specialized codes.

Pulliam, T. H.↗

Transient Response of Shells of Revolution by Direct Integration and Modal Superposition Methods

The results of an analytical effort to obtain and evaluate transient response data for a cylindrical and a conical shell by use of two different approaches: direct integration and modal superposition are described. The inclusion of nonlinear terms is more important than the inclusion of secondary linear effects (transverse shear deformation and rotary inertia) although there are thin-shell structures where these secondary effects are important. The advantages of the direct integration approach are that geometric nonlinear and secondary effects are easy to include and high-frequency response may be calculated. In comparison to the modal superposition technique the computer storage requirements are smaller. The advantages of the modal superposition approach are that the solution is independent of the previous time history and that once the modal data are obtained, the response for repeated cases may be efficiently computed. Also, any admissible set of initial conditions can be applied.

Stephens, W. B.↗

The explicit computation of integration algorithms and first integrals for ordinary differential equations with polynomials coefficients using trees

This note is concerned with the explicit symbolic computation of expressions involving differential operators and their actions on functions. The derivation of specialized numerical algorithms, the explicit symbolic computation of integrals of motion, and the explicit computation of normal forms for nonlinear systems all require such computations. More precisely, if R = k(x(sub 1),...,x(sub N)), where k = R or C, F denotes a differential operator with coefficients from R, and g member of R, we describe data structures and algorithms for efficiently computing g. The basic idea is to impose a multiplicative structure on the vector space with basis the set of finite rooted trees and whose nodes are labeled with the coefficients of the differential operators. Cancellations of two trees with r + 1 nodes translates into cancellation of O(N(exp r)) expressions involving the coefficient functions and their derivatives.

Crouch, P. E.↗

Regional Climate Simulation with a Variable Resolution Stretched Grid GCM: The Regional Down-Scaling Effects

The results obtained with the variable resolution stretched grid (SG) GEOS GCM (Goddard Earth Observing System General Circulation Models) are discussed, with the emphasis on the regional down-scaling effects and their dependence on the stretched grid design and parameters. A variable resolution SG-GCM and SG-DAS using a global stretched grid with fine resolution over an area of interest, is a viable new approach to REGIONAL and subregional CLIMATE studies and applications. The stretched grid approach is an ideal tool for representing regional to global scale interactions. It is an alternative to the widely used nested grid approach introduced a decade ago as a pioneering step in regional climate modeling. The GEOS SG-GCM is used for simulations of the anomalous U.S. climate events of 1988 drought and 1993 flood, with enhanced regional resolution. The height low level jet, precipitation and other diagnostic patterns are successfully simulated and show the efficient down-scaling over the area of interest the U.S. An imitation of the nested grid approach is performed using the developed SG-DAS (Data Assimilation System) that incorporates the SG-GCM. The SG-DAS is run with withholding data over the area of interest. The design immitates the nested grid framework with boundary conditions provided from analyses. No boundary condition buffer is needed for the case due to the global domain of integration used for the SG-GCM and SG-DAS. The experiments based on the newly developed versions of the GEOS SG-GCM and SG-DAS, with finer 0.5 degree (and higher) regional resolution, are briefly discussed. The major aspects of parallelization of the SG-GCM code are outlined. The KEY OBJECTIVES of the study are: 1) obtaining an efficient DOWN-SCALING over the area of interest with fine and very fine resolution; 2) providing CONSISTENT interactions between regional and global scales including the consistent representation of regional ENERGY and WATER BALANCES; 3) providing a high computational efficiency for future SG-GCM and SG-DAS versions using PARALLEL codes.

Fox-Rabinovitz, Michael S.↗

L'Ralph's Advanced Thermal Model Correlation Using Veritrek

Thermal model correlation uses data from thermal balance tests to better estimate uncertain input parameter values. During the correlation process, input parameters are modified in an iterative manner which can become computationally expensive since this requires that the high-fidelity thermal model be run for each iteration. Depending on the number of thermal balance test points there can be many sets of correlation parameters that satisfy correlation criteria; and having enough data to ascertain the best set of correlation parameters to use, further increases the computational expense. Reduced-order models (ROMs) provide computationally efficient surrogates of high-fidelity models and are often built to reduce development cycle times and cost. By leveraging the speed of reduced-order models and the Correlation Analysis feature in the Veritrek software, the typical computational expense of a traditional thermal model correlation process can be significantly reduced and having access to hundreds of thousands of iteration results provides an advanced means of intelligently determining the best set of correlation parameters to use. The L’Ralph thermal team at NASA Goddard Space Flight Center explored the use of the Veritrek software for their thermal model correlation efforts. The ROM that was created allowed for the variation of 15 input parameters to match 70 temperature sensor readouts from 3 thermal balance plateus and required 125 runs of the high-fidelity Thermal Desktop® model to generate a ROM that could predict the detailed model’s results to within 0.2 K (RMS). The ROM was then used to find dozens of plausible correlation parameter values based on L’Ralph instrument test data within a few seconds. By providing several plausible correlation parameter combinations, Veritrek allowed the thermal team to explore different uncertain parameter value combinations and provided insight into how deterministic each input parameter was. This allowed for a more confident decision on the best set of correlation parameters to use, compared to traditional model correlation techniques. In this presentation, the L’Ralph thermal team will be presenting their experience with the Veritrek software and how the software was utilized to provide additional insights during the correlation process.

Daniel Bae↗

L'Ralph's Advanced Thermal Model Correlation Using Veritrek

Thermal model correlation uses data from thermal balance tests to better estimate uncertain input parameter values. During the correlation process, input parameters are modified in an iterative manner which can become computationally expensive since this requires that the high-fidelity thermal model be run for each iteration. Depending on the number of thermal balance test points there can be many sets of correlation parameters that satisfy correlation criteria; and having enough data to ascertain the best set of correlation parameters to use, further increases the computational expense. Reduced-order models (ROMs) provide computationally efficient surrogates of high-fidelity models and are often built to reduce development cycle times and cost. By leveraging the speed of reduced-order models and the Correlation Analysis feature in the Veritrek software, the typical computational expense of a traditional thermal model correlation process can be significantly reduced and having access to hundreds of thousands of iteration results provides an advanced means of intelligently determining the best set of correlation parameters to use. The L’Ralph thermal team at NASA Goddard Space Flight Center explored the use of the Veritrek software for their thermal model correlation efforts. The ROM that was created allowed for the variation of 15 input parameters to match 70 temperature sensor readouts from 3 thermal balance plateus and required 125 runs of the high-fidelity Thermal Desktop® model to generate a ROM that could predict the detailed model’s results to within 0.2 K (RMS). The ROM was then used to find dozens of plausible correlation parameter values based on L’Ralph instrument test data within a few seconds. By providing several plausible correlation parameter combinations, Veritrek allowed the thermal team to explore different uncertain parameter value combinations and provided insight into how deterministic each input parameter was. This allowed for a more confident decision on the best set of correlation parameters to use, compared to traditional model correlation techniques. In this presentation, the L’Ralph thermal team will be presenting their experience with the Veritrek software and how the software was utilized to provide additional insights during the correlation process. "

Daniel Bae↗

Constraint Embedding Technique for Multibody System Dynamics

Multibody dynamics play a critical role in simulation testbeds for space missions. There has been a considerable interest in the development of efficient computational algorithms for solving the dynamics of multibody systems. Mass matrix factorization and inversion techniques and the O(N) class of forward dynamics algorithms developed using a spatial operator algebra stand out as important breakthrough on this front. Techniques such as these provide the efficient algorithms and methods for the application and implementation of such multibody dynamics models. However, these methods are limited only to tree-topology multibody systems. Closed-chain topology systems require different techniques that are not as efficient or as broad as those for tree-topology systems. The closed-chain forward dynamics approach consists of treating the closed-chain topology as a tree-topology system subject to additional closure constraints. The resulting forward dynamics solution consists of: (a) ignoring the closure constraints and using the O(N) algorithm to solve for the free unconstrained accelerations for the system; (b) using the tree-topology solution to compute a correction force to enforce the closure constraints; and (c) correcting the unconstrained accelerations with correction accelerations resulting from the correction forces. This constraint-embedding technique shows how to use direct embedding to eliminate local closure-loops in the system and effectively convert the system back to a tree-topology system. At this point, standard tree-topology techniques can be brought to bear on the problem. The approach uses a spatial operator algebra approach to formulating the equations of motion. The operators are block-partitioned around the local body subgroups to convert them into aggregate bodies. Mass matrix operator factorization and inversion techniques are applied to the reformulated tree-topology system. Thus in essence, the new technique allows conversion of a system with closure-constraints into an equivalent tree-topology system, and thus allows one to take advantage of the host of techniques available to the latter class of systems. This technology is highly suitable for the class of multibody systems where the closure-constraints are local, i.e., where they are confined to small groupings of bodies within the system. Important examples of such local closure-constraints are constraints associated with four-bar linkages, geared motors, differential suspensions, etc. One can eliminate these closure-constraints and convert the system into a tree-topology system by embedding the constraints directly into the system dynamics and effectively replacing the body groupings with virtual aggregate bodies. Once eliminated, one can apply the well-known results and algorithms for tree-topology systems to solve the dynamics of such closed-chain system.

Woo, Simon S.↗

Improved sonic-box computer program for calculating transonic aerodynamic loads on oscillating wings with thickness

A computer program was developed to account approximately for the effects of finite wing thickness in transonic potential flow over an oscillation wing of finite span. The program is based on the original sonic box computer program for planar wing which was extended to account for the effect of wing thickness. Computational efficiency and accuracy were improved and swept trailing edges were accounted for. Account for the nonuniform flow caused by finite thickness was made by application of the local linearization concept with appropriate coordinate transformation. A brief description of each computer routine and the applications of cubic spline and spline surface data fitting techniques used in the program are given, and the method of input was shown in detail. Sample calculations as well as a complete listing of the computer program listing are presented.

Ruo, S. Y.↗

Nonparametric identification of a class of nonlinear close-coupled dynamic systems

A nonparametric identification technique for the identification of close coupled dynamic systems with arbitrary memoryless nonlinearities is presented. The method utilizes noisy recorded data (acceleration, velocity and displacement) to identify the restoring forces in the system. The masses in the system are assumed to be known (or fairly well estimated from the design drawings). The restoring forces are expanded in a series of orthogonal polnomials and the coefficients of these polynomial expansions are obtained by using least square fit method. A particularly simple and computationally efficient method is proposed for dealing with separable restoring forces. The identified results are found to be relatively insensitive to measurement noise. An analysis of the effects of measurement noise on the quality of the estimates is given. The computations are shown to be relatively quick (when compared say to the Wiener identification method) and the core storage required relatively small, making the method suitable for onboard identification of large space structures.

Udwadia, F. E.↗