Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational costs”

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 37 records · Page 2

A Data-Driven Reduced Order Model of an Isolated Rotor

There are numerous conceptual design stage rotorcraft analysis tasks which demand a high-fidelity and low cost method for rotor load distribution predictions. Considering Urban Air Mobility (UAM) vehicles aim to operate in close proximity to buildings and with unique rotor configurations, there is a significant challenge in quickly and accurately modeling rotors operating in complex, turbulent flow fields. One potential path for deriving a high-fidelity, low cost rotor model is with data-driven surrogate modeling. In this study, an initial investigation is taken to apply a proper orthogonal decomposition (POD) based reduced order model (ROM) for the purpose of pressure distribution prediction. In this study, a POD ROM was derived to produce distributed pressure predictions on rotor blades subjected to topology change due to variation in twist and taper ratio. Rotor twist was varied between 0◦, 10◦, 20◦, and 30◦ while taper ratio was varied between 1.0, 0.9, 0.8, and 0.7. All rotors consisted of a single blade. The POD ROM was validated for three demonstration cases; a high thrust rotor in hover, a low thrust rotor in hover, and a rotor in forward flight with a flight speed of M = 0.1. Results showed highly accurate distributed load predictions could be achieved at minimal computational cost. Computational cost for hovering blade surface pressure modeling was reduced from 12 hours on 440 cores to 10−5 seconds on a single core. For blade in forward flight cost was reduced from 20 hours on 440 cores to 0.6 seconds on a single core. For cases of high thrust and low thrust rotors, POD ROM was used to undergo a design optimization of the rotor such that figure of merit was maximized. Total optimization time for each case was 1 minute.

Data-Driven↗

Failure Bounding And Sensitivity Analysis Applied To Monte Carlo Entry, Descent, And Landing Simulations

In the study of entry, descent, and landing, Monte Carlo sampling methods are often employed to study the uncertainty in the designed trajectory. The large number of uncertain inputs and outputs, coupled with complicated non-linear models, can make interpretation of the results difficult. Three methods that provide statistical insights are applied to an entry, descent, and landing simulation. The advantages and disadvantages of each method are discussed in terms of the insights gained versus the computational cost. The first method investigated was failure domain bounding which aims to reduce the computational cost of assessing the failure probability. Next a variance-based sensitivity analysis was studied for the ability to identify which input variable uncertainty has the greatest impact on the uncertainty of an output. Finally, probabilistic sensitivity analysis is used to calculate certain sensitivities at a reduced computational cost. These methods produce valuable information that identifies critical mission parameters and needs for new technology, but generally at a significant computational cost.

Gaebler, John A.↗

Reduction of computer usage costs in predicting unsteady aerodynamic loadings caused by control surface motions: Computer program description

A digital computer program was developed to calculate unsteady loadings caused by motions of lifting surfaces with leading edge and trailing edge controls based on the subsonic kernel function approach. The pressure singularities at hinge line and side edges were extracted analytically as a preliminary step to solving the integral equation of collocation. The program calculates generalized aerodynamic forces for user supplied deflection modes. Optional intermediate output includes pressure at an array of points, and sectional generalized forces. From one to six controls on the half span can be accomodated.

Petrarca, J. R.↗

Three-Dimensional Aeroelastic and Aerothermoelastic Behavior in Hypersonic Flow

The aeroelastic and aerothermoelastic behavior of three-dimensional configurations in hypersonic flow regime are studied. The aeroelastic behavior of a low aspect ratio wing, representative of a fin or control surface on a generic hypersonic vehicle, is examined using third order piston theory, Euler and Navier-Stokes aerodynamics. The sensitivity of the aeroelastic behavior generated using Euler and Navier-Stokes aerodynamics to parameters governing temporal accuracy is also examined. Also, a refined aerothermoelastic model, which incorporates the heat transfer between the fluid and structure using CFD generated aerodynamic heating, is used to examine the aerothermoelastic behavior of the low aspect ratio wing in the hypersonic regime. Finally, the hypersonic aeroelastic behavior of a generic hypersonic vehicle with a lifting-body type fuselage and canted fins is studied using piston theory and Euler aerodynamics for the range of 2.5 less than or equal to M less than or equal to 28, at altitudes ranging from 10,000 feet to 80,000 feet. This analysis includes a study on optimal mesh selection for use with Euler aerodynamics. In addition to the aeroelastic and aerothermoelastic results presented, three time domain flutter identification techniques are compared, namely the moving block approach, the least squares curve fitting method, and a system identification technique using an Auto-Regressive model of the aeroelastic system. In general, the three methods agree well. The system identification technique, however, provided quick damping and frequency estimations with minimal response record length, and therefore o ers significant reductions in computational cost. In the present case, the computational cost was reduced by 75%. The aeroelastic and aerothermoelastic results presented illustrate the applicability of the CFL3D code for the hypersonic flight regime.

McNamara, Jack J.↗

A Reynolds-Averaged Navier-Stokes Perspective for the High Lift Common Research Model Using the LAVA Framework

An in-depth assessment of the High Lift-Common Research Model (HL-CRM) aerodynamic performance is made using a Reynolds-Averaged Navier-Stokes (RANS) methodology. Results presented here were produced in support of the 4th AIAA High Lift Prediction Workshop(HLPW-4), with additional simulation results and analysis used to support findings from the workshop. Mesh resolution, RANS closure models, and tunnel effects were among the sources of simulation sensitivity addressed, all in the pursuit of evaluating best-practice simulation methods for complex high-lift configurations. In general, free-air simulations using RANS yield accurate predictions of integrated loads in the pre-stall regime for the HL-CRM, while strong sensitivity to simulation method is observed near CLmax. Additionally, a study assessing changes in aerodynamic performance due to flap deflection angle indicated strong sensitivity to turbulence model closure and mesh resolution, particularly at the highest deflection setting. Several available corrections for the Spalart-Allmaras (SA) turbulence model were tested and generally introduced more error relative to the experiment in comparison to the baseline SA closure model. The Standard Menter Baseline Two-Equation (k-ωBSL) turbulence model was also explored, which arguably yielded results highly consistent with experiment, but at a substantially higher computational cost. Therefore, as a compromise between computational cost and accuracy, the baseline SA closure model was selected for additional HL-CRM studies that assess alternative solution methods. These strategies include “warm start” approaches, which initialize the simulation from a previously converged solution at a nearby angle of attack, unsteady calculations, and simulations that model the experimental wind tunnel. Results from these studies would reinforce the shortcomings of RANS in predicting aircraft performance at high-lift conditions, namely at high-αand highly loaded flap conditions, while also answering questions about appropriate modeling techniques to minimize the errors associated with RANS where possible

TTT↗

Thermodynamic cost of computation, algorithmic complexity and the information metric

Algorithmic complexity is discussed as a computational counterpart to the second law of thermodynamics. It is shown that algorithmic complexity, which is a measure of randomness, sets limits on the thermodynamic cost of computations and casts a new light on the limitations of Maxwell's demon. Algorithmic complexity can also be used to define distance between binary strings.

Zurek, W. H.↗

Progress Toward Affordable High Fidelity Combustion Simulations Using Filtered Density Functions for Hypersonic Flows in Complex Geometries

Significant progress has been made in the development of subgrid scale (SGS) closures based on a filtered density function (FDF) for large eddy simulations (LES) of turbulent reacting flows. The FDF is the counterpart of the probability density function (PDF) method, which has proven effective in Reynolds averaged simulations (RAS). However, while systematic progress is being made advancing the FDF models for relatively simple flows and lab-scale flames, the application of these methods in complex geometries and high speed, wall-bounded flows with shocks remains a challenge. The key difficulties are the significant computational cost associated with solving the FDF transport equation and numerically stiff finite rate chemistry. For LES/FDF methods to make a more significant impact in practical applications a pragmatic approach must be taken that significantly reduces the computational cost while maintaining high modeling fidelity. An example of one such ongoing effort is at the NASA Langley Research Center, where the first generation FDF models, namely the scalar filtered mass density function (SFMDF) are being implemented into VULCAN, a production-quality RAS and LES solver widely used for design of high speed propulsion flowpaths. This effort leverages internal and external collaborations to reduce the overall computational cost of high fidelity simulations in VULCAN by: implementing high order methods that allow reduction in the total number of computational cells without loss in accuracy; implementing first generation of high fidelity scalar PDF/FDF models applicable to high-speed compressible flows; coupling RAS/PDF and LES/FDF into a hybrid framework to efficiently and accurately model the effects of combustion in the vicinity of the walls; developing efficient Lagrangian particle tracking algorithms to support robust solutions of the FDF equations for high speed flows; and utilizing finite rate chemistry parametrization, such as flamelet models, to reduce the number of transported reactive species and remove numerical stiffness. This paper briefly introduces the SFMDF model (highlighting key benefits and challenges), and discusses particle tracking for flows with shocks, the hybrid coupled RAS/PDF and LES/FDF model, flamelet generated manifolds (FGM) model, and the Irregularly Portioned Lagrangian Monte Carlo Finite Difference (IPLMCFD) methodology for scalable simulation of high-speed reacting compressible flows.

Drozda, Tomasz G.↗

Nonrecursive formulations of multibody dynamics and concurrent multiprocessing

Since the late 1980's, research in recursive formulations of multibody dynamics has flourished. Historically, much of this research can be traced to applications of low dimensionality in mechanism and vehicle dynamics. Indeed, there is little doubt that recursive order N methods are the method of choice for this class of systems. This approach has the advantage that a minimal number of coordinates are utilized, parallelism can be induced for certain system topologies, and the method is of order N computational cost for systems of N rigid bodies. Despite the fact that many authors have dismissed redundant coordinate formulations as being of order N(exp 3), and hence less attractive than recursive formulations, we present recent research that demonstrates that at least three distinct classes of redundant, nonrecursive multibody formulations consistently achieve order N computational cost for systems of rigid and/or flexible bodies. These formulations are as follows: (1) the preconditioned range space formulation; (2) penalty methods; and (3) augmented Lagrangian methods for nonlinear multibody dynamics. The first method can be traced to its foundation in equality constrained quadratic optimization, while the last two methods have been studied extensively in the context of coercive variational boundary value problems in computational mechanics. Until recently, however, they have not been investigated in the context of multibody simulation, and present theoretical questions unique to nonlinear dynamics. All of these nonrecursive methods have additional advantages with respect to recursive order N methods: (1) the formalisms retain the highly desirable order N computational cost; (2) the techniques are amenable to concurrent simulation strategies; (3) the approaches do not depend upon system topology to induce concurrency; and (4) the methods can be derived to balance the computational load automatically on concurrent multiprocessors. In addition to the presentation of the fundamental formulations, this paper presents new theoretical results regarding the rate of convergence of order N constraint stabilization schemes associated with the newly introduced class of methods.

Kurdila, Andrew J.↗

Low cost spacecraft computers: Oxymoron or future trend?

Over the last few decades, application of current terrestrial computer technology in embedded spacecraft control systems has been expensive and wrought with many technical challenges. These challenges have centered on overcoming the extreme environmental constraints (protons, neutrons, gamma radiation, cosmic rays, temperature, vibration, etc.) that often preclude direct use of commercial off-the-shelf computer technology. Reliability, fault tolerance and power have also greatly constrained the selection of spacecraft control system computers. More recently, new constraints are being felt, cost and mass in particular, that have again narrowed the degrees of freedom spacecraft designers once enjoyed. This paper discusses these challenges, how they were previously overcome, how future trends in commercial computer technology will simplify (or hinder) selection of computer technology for spacecraft control applications, and what spacecraft electronic system designers can do now to circumvent them.

Manning, Robert M.↗

Efficient optimization of integrated aerodynamic-structural design

The introduction of composite materials is having a profound effect on the design process. Because these materials permit the designer to tailor material properties to improve structural, aerodynamic and acoustic performance, they require a more integrated multidisciplinary design process. Because of the complexity of the design process numerical optimization methods are required. The present paper is focused on a major difficulty associated with the multidisciplinary design optimization process - its enormous computational cost. We consider two approaches for reducing this computational burden: (1) development of efficient methods for cross-sensitivity calculation using perturbation methods; and (2) the use of approximate numerical optimization procedures. Our efforts are concentrated upon combined aerodynamic-structural optimization. Results are presented for the integrated design of a sailplane wing. The impact of our computational procedures on the computational costs of integrated costs of integrated designs are discussed.

Haftka, R. T.↗

Versatile, low-cost, computer-controlled, sample positioning system for vacuum applications

A versatile, low-cost, easy to implement, microprocessor-based motorized positioning system (MPS) suitable for accurate sample manipulation in a Second Ion Mass Spectrometry (SIMS) system, and for other ultra-high vacuum (UHV) applications was designed and built at NASA LeRC. The system can be operated manually or under computer control. In the latter case, local, as well as remote operation is possible via the IEEE-488 bus. The position of the sample can be controlled in three linear orthogonal and one angular coordinates.

Vargas-Aburto, Carlos↗

Parallel conjugate gradient algorithms for manipulator dynamic simulation

Parallel conjugate gradient algorithms for the computation of multibody dynamics are developed for the specialized case of a robot manipulator. For an n-dimensional positive-definite linear system, the Classical Conjugate Gradient (CCG) algorithms are guaranteed to converge in n iterations, each with a computation cost of O(n); this leads to a total computational cost of O(n sq) on a serial processor. A conjugate gradient algorithms is presented that provide greater efficiency using a preconditioner, which reduces the number of iterations required, and by exploiting parallelism, which reduces the cost of each iteration. Two Preconditioned Conjugate Gradient (PCG) algorithms are proposed which respectively use a diagonal and a tridiagonal matrix, composed of the diagonal and tridiagonal elements of the mass matrix, as preconditioners. Parallel algorithms are developed to compute the preconditioners and their inversions in O(log sub 2 n) steps using n processors. A parallel algorithm is also presented which, on the same architecture, achieves the computational time of O(log sub 2 n) for each iteration. Simulation results for a seven degree-of-freedom manipulator are presented. Variants of the proposed algorithms are also developed which can be efficiently implemented on the Robot Mathematics Processor (RMP).

Fijany, Amir↗

Optimization of Aerospace Structure Subject to Damage Tolerance Criteria

The objective of this cooperative agreement was to seek computationally efficient ways to optimize aerospace structures subject to damage tolerance criteria. Optimization was to involve sizing as well as topology optimization. The work was done in collaboration with Steve Scotti, Chauncey Wu and Joanne Walsh at the NASA Langley Research Center. Computation of constraint sensitivity is normally the most time-consuming step of an optimization procedure. The cooperative work first focused on this issue and implemented the adjoint method of sensitivity computation in an optimization code (runstream) written in Engineering Analysis Language (EAL). The method was implemented both for bar and plate elements including buckling sensitivity for the latter. Lumping of constraints was investigated as a means to reduce the computational cost. Adjoint sensitivity computation was developed and implemented for lumped stress and buckling constraints. Cost of the direct method and the adjoint method was compared for various structures with and without lumping. The results were reported in two papers. It is desirable to optimize topology of an aerospace structure subject to a large number of damage scenarios so that a damage tolerant structure is obtained. Including damage scenarios in the design procedure is critical in order to avoid large mass penalties at later stages. A common method for topology optimization is that of compliance minimization which has not been used for damage tolerant design. In the present work, topology optimization is treated as a conventional problem aiming to minimize the weight subject to stress constraints. Multiple damage configurations (scenarios) are considered. Each configuration has its own structural stiffness matrix and, normally, requires factoring of the matrix and solution of the system of equations. Damage that is expected to be tolerated is local and represents a small change in the stiffness matrix compared to the baseline (undamaged) structure. The exact solution to a slightly modified set of equations can be obtained from the baseline solution economically without actually solving the modified system. Sherrnan-Morrison-Woodbury (SMW) formulas are matrix update formulas that allow this. SMW formulas were therefore used here to compute adjoint displacements for sensitivity computation and structural displacements in damaged configurations.

Akgun, Mehmet A.↗

Adjoint Techniques for Topology Optimization of Structures Under Damage Conditions

The objective of this cooperative agreement was to seek computationally efficient ways to optimize aerospace structures subject to damage tolerance criteria. Optimization was to involve sizing as well as topology optimization. The work was done in collaboration with Steve Scotti, Chauncey Wu and Joanne Walsh at the NASA Langley Research Center. Computation of constraint sensitivity is normally the most time-consuming step of an optimization procedure. The cooperative work first focused on this issue and implemented the adjoint method of sensitivity computation (Haftka and Gurdal, 1992) in an optimization code (runstream) written in Engineering Analysis Language (EAL). The method was implemented both for bar and plate elements including buckling sensitivity for the latter. Lumping of constraints was investigated as a means to reduce the computational cost. Adjoint sensitivity computation was developed and implemented for lumped stress and buckling constraints. Cost of the direct method and the adjoint method was compared for various structures with and without lumping. The results were reported in two papers (Akgun et al., 1998a and 1999). It is desirable to optimize topology of an aerospace structure subject to a large number of damage scenarios so that a damage tolerant structure is obtained. Including damage scenarios in the design procedure is critical in order to avoid large mass penalties at later stages (Haftka et al., 1983). A common method for topology optimization is that of compliance minimization (Bendsoe, 1995) which has not been used for damage tolerant design. In the present work, topology optimization is treated as a conventional problem aiming to minimize the weight subject to stress constraints. Multiple damage configurations (scenarios) are considered. Each configuration has its own structural stiffness matrix and, normally, requires factoring of the matrix and solution of the system of equations. Damage that is expected to be tolerated is local and represents a small change in the stiffness matrix compared to the baseline (undamaged) structure. The exact solution to a slightly modified set of equations can be obtained from the baseline solution economically without actually solving the modified system.. Shennan-Morrison-Woodbury (SMW) formulas are matrix update formulas that allow this (Akgun et al., 1998b). SMW formulas were therefore used here to compute adjoint displacements for sensitivity computation and structural displacements in damaged configurations.

Akgun, Mehmet A.↗

Low-cost Quantification of Fluid Flow Parameter Sensitivity using Reduced-order Modeling

Uncertainty quantification of computational fluid dynamics (CFD) simulations is a complicated procedure which still relies in many cases on engineering judgment and factors of safety. This is in part because the computational cost of measuring the simulation's sensitivity to all meaningful parameters (e.g., body surface roughness) and hyperparameters (e.g., subiteration convergence criterion) is intractable for even a single simulation. Reduced-order modeling dramatically lowers this computational cost of simulating fluid flows, but usually only where similar data is already available. In this work, fluid reduced-order models are utilized to quantify a flow's sensitivity to certain physical parameters for the purposes of improved uncertainty quantification. Characteristic observability and sensitivity are both explored. The resulting sensitivity quantifications enable more informed CFD frameworks and more rigorous uncertainty bounds on the resulting data.

uncertainty quantification↗

Low-cost Quantification of Fluid Flow Parameter Sensitivity using Reduced-order Modeling

Uncertainty quantification of computational fluid dynamics (CFD) simulations is a complicated procedure which still relies in many cases on engineering judgment and factors of safety. This is in part because the computational cost of measuring the simulation's sensitivity to all meaningful parameters (e.g., body surface roughness) and hyperparameters (e.g., subiteration convergence criterion) is intractable for even a single simulation. Reduced-order modeling dramatically lowers this computational cost of simulating fluid flows, but usually only where similar data is already available. In this work, fluid reduced-order models are utilized to quantify a flow's sensitivity to certain physical parameters for the purposes of improved uncertainty quantification. Characteristic observability and sensitivity are both explored. The resulting sensitivity quantifications enable more informed CFD frameworks and more rigorous uncertainty bounds on the resulting data.

uncertainty quantification↗

A Comprehensive and Cost-Effective Computer Infrastructure for K-12 Schools

Since 1993, NASA Langley Research Center has been developing and implementing a low-cost Internet connection model, including system architecture, training, and support, to provide Internet access for an entire network of computers. This infrastructure allows local area networks which exceed 50 machines per school to independently access the complete functionality of the Internet by connecting to a central site, using state-of-the-art commercial modem technology, through a single standard telephone line. By locating high-cost resources at this central site and sharing these resources and their costs among the school districts throughout a region, a practical, efficient, and affordable infrastructure for providing scale-able Internet connectivity has been developed. As the demand for faster Internet access grows, the model has a simple expansion path that eliminates the need to replace major system components and re-train personnel. Observations of optical Internet usage within an environment, particularly school classrooms, have shown that after an initial period of 'surfing,' the Internet traffic becomes repetitive. By automatically storing requested Internet information on a high-capacity networked disk drive at the local site (network based disk caching), then updating this information only when it changes, well over 80 percent of the Internet traffic that leaves a location can be eliminated by retrieving the information from the local disk cache.

Warren, G. P.↗