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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS1982

The economics of time shared computing: Congestion, user costs and capacity

Time shared systems permit the fixed costs of computing resources to be spread over large numbers of users. However, bottleneck results in the theory of closed queueing networks can be used to show that this economy of scale will be offset by the increased congestion that results as more users are added to the system. If one considers the total costs, including the congestion cost, there is an optimal number of users for a system which equals the saturation value usually used to define system capacity.

Agnew, C. E.↗

NASA NTRS2017

Order-Reduced Solution of the Nonlinear High-Fidelity Generalized Method of Cells Micromechanics Relations

The High-Fidelity Generalized Method of Cells (HFGMC) is one technique for accurately simulating nonlinear composite material behavior. The HFGMC uses a higher-order approximation for the subcell displacement field that allows for a more accurate determination of the subcell stressstrain fields at the cost of some computational efficiency. In order to reduce computational costs associated with the solution of the ensuing system of simultaneous equations, the HFGMC global system of equations for doubly-periodic repeating unit cells with nonlinear constituents was reduced in size through the use of a Petrov-Galerkin-based Proper Orthogonal Decomposition order-reduction scheme. A number of cases were presented that address the computational feasibility of using order-reduction techniques to solve solid mechanics problems involving complex microstructures.

order-reduction↗

NASA NTRS1993

A parallelizable load balancing algorithm

We present a parallelizable load balancing algorithm for grid-based problems that employs a give and take concept among neighboring subdomains. The algorithm is found to converge very quickly to almost perfect load balance while minimizing the surface-to-volume ratio of the domains. The algorithm can be used for problems whose volume cost grows nonlinearly with the number of elements, because it measures continuously the computational cost to be incurred for each subdomain. This is an advantage over most algorithms currently in use (e.g., recursive subdivision), which assume a linear relationship between the computational cost and the number of elements.

Loehner, Rainald↗

NASA NTRS1979

Developments in the computation of turbulent boundary layers

Computational techniques applicable to turbulent boundary layers are classified into solutions of Reynolds-averaged equations, in which all the effects of the turbulence are modelled, and solutions of three-dimensional, time dependent Navier-Stokes equations, in which the large eddies are calculated and only the turbulence at scales smaller than the computational mesh spacings has to be modelled. Current computation costs place engineering computations in the first of these categories; large eddy simulations are appropriate currently for special studies of the dynamical processes of turbulence in idealized flow fields. It is shown that the two methods are interrelated and that each can gain from advances in the other. The degree of success of a pair of increasingly complex Reynolds stress models to broaden their range of applicability is examined through comparisons with experimental data for a variety of flow conditions. An example of a large-eddy simulation is presented, compared with experimental results, and used to evaluate the models for pressure rate-of-strain correlations and dissipation in the Reynolds-averaged equations.

Rubesin, M. W.↗

NASA NTRS1981

Development and implementation of a low cost micro computer system for LANDSAT analysis and geographic data base applications

Since the implementation of the GRID and IMGRID computer programs for multivariate spatial analysis in the early 1970's, geographic data analysis subsequently moved from large computers to minicomputers and now to microcomputers with radical reduction in the costs associated with planning analyses. Programs designed to process LANDSAT data to be used as one element in a geographic data base were used once NIMGRID (new IMGRID), a raster oriented geographic information system, was implemented on the microcomputer. Programs for training field selection, supervised and unsupervised classification, and image enhancement were added. Enhancements to the color graphics capabilities of the microsystem allow display of three channels of LANDSAT data in color infrared format. The basic microcomputer hardware needed to perform NIMGRID and most LANDSAT analyses is listed as well as the software available for LANDSAT processing.

Faust, N.↗

NASA NTRS1983

Accuracy of approximations to the Navier-Stokes equations

The systems of truncated differential equations that have been proposed to reduce the complexity and large computational costs of solutions to the full Navier-Stokes equations are considered. These systems are computationally efficient and capture all the physically relevant behavior. The systems follow a certain hierarchy: (1) the classical boundary-layer equations with specified edge properties (usually the streamwise pressure distribution); (2) the coupled boundary-layer/inviscid equations; (3) the so-called thin-layer equations that discard streamwise diffusion; and (4) the Navier-Stokes equations. Consideration is given to each of these approximations applied to an incompressible, laminar-separating flow at low and moderate Reynolds numbers. It is pointed out that for any flow or region of flow for which viscous-inviscid interaction effects are small, classical boundary-layer equations will provide a satisfactory description of the viscous flow at a fraction of the computational cost of any higher approximations.

Murphy, J. D.↗

NASA NTRSDate not supplied

Implicit Preconditioning for Explicit Multigrid Solvers on Cut-Cell Cartesian Meshes

This work assesses the effectiveness of linearized implicit Euler preconditioning for multigrid solvers using an unpreconditioned, Jacobian-free Newton Krylov method to converge the linear system of equations. Multigrid convergence rates improve to approximately 0.75 across the cases tested including a Mach 2 supersonic wedge, transonic NACA 0012 airfoil, and ONERA M6 wing. While larger Krylov subspaces increase the convergence rate, they also increase the computational cost, such that 4-8 Krylov vectors often offers the fastest turnaround. Further reductions in computational cost are achieved with a sequential hybrid preconditioner that begins with the explicit multigrid solver before transitioning to the preconditioned algorithm later on. In addition, a novel implementation of dual time stepping is extended to include both common BDF methods as well as high-order implicit Runge-Kutta schemes. This particular formulation, which uses A −1 preconditioning, is amenable to matrix-free solvers, and the L-stable methods are especially suited for meshes with arbitrarily small cut-cells. Asymptotic order of convergence is demonstrated for BDF1, BDF2, SDIRK2, and 3rd-order Radau IIA time integration with unsteady 2D vortex simulations.

ARMD↗

NASA NTRS2013

Influence of Computational Drop Representation in LES of a Droplet-Laden Mixing Layer

Multiphase turbulent flows are encountered in many practical applications including turbine engines or natural phenomena involving particle dispersion. Numerical computations of multiphase turbulent flows are important because they provide a cheaper alternative to performing experiments during an engine design process or because they can provide predictions of pollutant dispersion, etc. Two-phase flows contain millions and sometimes billions of particles. For flows with volumetrically dilute particle loading, the most accurate method of numerically simulating the flow is based on direct numerical simulation (DNS) of the governing equations in which all scales of the flow including the small scales that are responsible for the overwhelming amount of dissipation are resolved. DNS, however, requires high computational cost and cannot be used in engineering design applications where iterations among several design conditions are necessary. Because of high computational cost, numerical simulations of such flows cannot track all these drops. The objective of this work is to quantify the influence of the number of computational drops and grid spacing on the accuracy of predicted flow statistics, and to possibly identify the minimum number, or, if not possible, the optimal number of computational drops that provide minimal error in flow prediction. For this purpose, several Large Eddy Simulation (LES) of a mixing layer with evaporating drops have been performed by using coarse, medium, and fine grid spacings and computational drops, rather than physical drops. To define computational drops, an integer NR is introduced that represents the ratio of the number of existing physical drops to the desired number of computational drops; for example, if NR=8, this means that a computational drop represents 8 physical drops in the flow field. The desired number of computational drops is determined by the available computational resources; the larger NR is, the less computationally intensive is the simulation. A set of first order and second order flow statistics, and of drop statistics are extracted from LES predictions and are compared to results obtained by filtering a DNS database. First order statistics such as Favre averaged stream-wise velocity, Favre averaged vapor mass fraction, and the drop stream-wise velocity, are predicted accurately independent of the number of computational drops and grid spacing. Second order flow statistics depend both on the number of computational drops and on grid spacing. The scalar variance and turbulent vapor flux are predicted accurately by the fine mesh LES only when NR is less than 32, and by the coarse mesh LES reasonably accurately for all NR values. This is attributed to the fact that when the grid spacing is coarsened, the number of drops in a computational cell must not be significantly lower than that in the DNS.

Bellan, Josette↗

NASA NTRS2016

A-Priori Tuning of Modified Magnussen Combustion Model

In the application of CFD to turbulent reacting flows, one of the main limitations to predictive accuracy is the chemistry model. Using a full or skeletal kinetics model may provide good predictive ability, however, at considerable computational cost. Adding the ability to account for the interaction between turbulence and chemistry improves the overall fidelity of a simulation but adds to this cost. An alternative is the use of simple models, such as the Magnussen model, which has negligible computational overhead, but lacks general predictive ability except for cases that can be tuned to the flow being solved. In this paper, a technique will be described that allows the tuning of the Magnussen model for an arbitrary fuel and flow geometry without the need to have experimental data for that particular case. The tuning is based on comparing the results of the Magnussen model and full finite-rate chemistry when applied to perfectly and partially stirred reactor simulations. In addition, a modification to the Magnussen model is proposed that allows the upper kinetic limit for the reaction rate to be set, giving better physical agreement with full kinetic mechanisms. This procedure allows a simple reacting model to be used in a predictive manner, and affords significant savings in computational costs for simulations.

Norris, A. T.↗

NASA NTRS2018

Tuning Process for the Modified Magnussen Combustion Model

In the application of CFD to turbulent reacting flows, one of the main limitations to predictive accuracy is the chemistry model. Using a full or skeletal kinetics model may provide good predictive ability, however, at considerable computational cost. Adding the ability to account for the interaction between turbulence and chemistry improves the overall fidelity of a simulation but adds to this cost. An alternative is the use of simple models, such as the Magnussen model, which has negligible computational overhead, but lacks general predictive ability except for cases that can be tuned to the flow being solved. In this paper, a technique will be described that allows the tuning of the Magnussen model for an arbitrary fuel and flow geometry without the need to have experimental data for a particular case. The tuning is based on comparing the results of the Magnussen model and full finite-rate chemistry when applied to perfectly and partially stirred reactor sim- ulations. In addition, a modification to the Magnussen model is proposed that allows the upper kinetic limit for the reaction rate to be set, giving better physical agreement with full kinetic mechanisms. In order to improve the agreement with flame temperatures, the thermal properties of the product species is adjusted to better match the mixture proper- ties of the full mechanism. The combustion model is then applied to the simulation of a representative scramjet flowpath, and the results compared to experimental data and other kinetic models. This procedure allows a simple reacting model to be used in a predictive manner, and affords significant savings in computational costs for CFD simulations.

Norris, A. T.↗

NASA NTRS1987

Approximations to eigenvalues of modified general matrices

The reanalysis of non-self-adjoint dynamic models is computationally very expensive in design optimization applications. This paper describes several approximations that can be applied to eigenvalues of non-hermitian matrices to reduce that computational cost. Approximations based on eigenvalue derivatives, generalized Rayleigh quotient and the trace theorem are presented and their accuracy and computational cost are estimated. The accuracy and cost estimates are verified by applying the approximations to random matrices and matrices arising in flutter analysis of compressor blades. Recommendations are made for selection of the best approximation when the derivatives are available and when they are not. In particular, it is concluded that the quadratic approximation for eigenvalues should never be used as higher order approximations are always more accurate as well as more efficient.

Murthy, Durbha V.↗

NASA NTRSDate not supplied

End-To-End Uncertainty Quantification with Analytical Derivatives for Design Under Uncertainty

Uncertainty quantification (UQ) is a rapidly growing and evolving discipline, especially within the aerospace community. Performing analysis with UQ can provide decision makers with a wealth of information about a candidate design. However, the value of UQ is fully realized when the information gained during UQ analysis is leveraged in a feedback loop of a design optimization process, often referred to as design under uncertainty. Although design under uncertainty can be a powerful risk mitigation technique, there are a number of roadblocks that prevent its implementation. Two primary factors are computational costs and added complexity of the analysis. High fidelity simulations on the order tens of uncertain variables quickly become computationally infeasible. Also, implementing UQ into an existing multidisciplinary design and optimization (MDO) process often requires extensive knowledge of the UQ methods and careful treatment of the problem formulation. The objective of this work is to address these two primary roadblocks and enable practitioners to efficiently perform design under uncertainty with limited knowledge of the UQ discipline. Methods outlined in this paper demonstrate MDO incorporating UQ into the design process, leveraging an analytic derivative tool chain through the entire optimization. The proposed approach leverages machine learning techniques to generate a differentiable confidence interval output from polynomial chaos models. This technique, coupled with the incorporation of analytical derivatives through the Polynomial Chaos Expansion (PCE) process, eliminates the need to estimate derivatives which are usually obtained from finite difference, complex step, or similar methods. Developing a differentiable confidence interval allows mixed uncertainty problems (both epistemic and aleatory) to be modeled. Without such modeling, these problems cannot accurately predict objective functions containing statistical quantities such as mean and variance. The addition of analytic derivatives to a polynomial chaos-based UQ method decreases the computational costs of performing design under uncertainty by orders of magnitude in comparison with methods such as complex step. The method and codes developed are modular in nature and are a drop-in solution for design under uncertainty within existing MDO problems. A low-fidelity analytical multidisciplinary optimization under uncertainty for a wing design in OpenMDAO is detailed in this paper. This demonstration case will include both objective functions and constraints which are influenced by uncertain parameters.

Ben D Phillips↗

NASA NTRSDate not supplied

End-To-End Uncertainty Quantification with Analytical Derivatives for Design Under Uncertainty

Ben Phillips↗

NASA NTRSDate not supplied

The Effect of Fiber-Angle Fidelity on the Linear Response of Tow-steered Composite Plates

Composite laminate tailoring is traditionally performed by uniformly changing the in-plane ply orientation to obtain the desired mechanical performance. The emergence of tow-steered plies, where the fibers follow a prescribed curvilinear path, have increased the tailorability of composite laminates. However, characterizing the behavior of tow-steered laminates using finite element analysis is challenging because additional, and often numerous, orientation definitions may be required. The additional orientation definitions detrimentally increase the computational cost and hinder the use of advanced analysis techniques, such as Monte Carlo or uncertainty quantification, in the design process. To reduce computational cost without adversely affecting mechanics-based performance, the results of a parametric study that was used to investigate the effects of fiber-angle fidelity, element size, and tow-steered radius-of-curvature on various loading scenarios for tow-steered composite plates are presented. The three loading scenarios that were analyzed using finite element analysis included an axial tension load, an applied constant through-thickness-direction pressure load, and an axial compression load. Results for mechanics-based metrics of interest are presented and discussed for each loading scenario. Little sensitivity (less than one percent difference) to the effect of fiber-angle fidelity is observed in the mechanics-based metrics until the coarse-end of the considered range. Sensitivity to element size generally dominates the observed results for the mechanics-based metrics. Notable reductions in the preprocessing time are observed for increasingly coarse element size and fiber-rounding parameters. The preprocessing times decreased up to three orders of magnitude from a few thousand seconds to a few seconds without loss of accuracy in the mechanics-based metrics. Such increased computational performance is of particular interest to the structural design and analysis communities that may be conducting large counts of finite-element analyses, such as in other parametric studies, Monte-Carlo analyses, uncertainty quantification, or tow-steered optimization.

tow-steered composites↗

NASA NTRS1989

Integrated aerodynamic-structural design of a transport wing

The integrated aerodynamic-structural design of a subsonic transport wing for minimum weight subject to required range is formulated and solved. The problem requires large computational resources, and two methods are used to alleviate the computational burden. First, a modular sensitivity method that permits the usage of black-box disciplinary software packages, is used to reduce the cost of sensitivity derivatives. In particular, it is shown that derivatives of the aeroelastic response and divergence speed can be calculated without the costly computation of derivatives of aerodynamic influence coefficient and structural stiffness matrices. A sequential approximate optimization is used to further reduce computational cost. The optimization procedure is shown to require a relatively small number of analysis and sensitivity calculations.

Grossman, B.↗

NASA NTRS1990

Catalytic ignition model in a monolithic reactor with in-depth reaction

Two transient models have been developed to study the catalytic ignition in a monolithic catalytic reactor. The special feature in these models is the inclusion of thermal and species structures in the porous catalytic layer. There are many time scales involved in the catalytic ignition problem, and these two models are developed with different time scales. In the full transient model, the equations are non-dimensionalized by the shortest time scale (mass diffusion across the catalytic layer). It is therefore accurate but is computationally costly. In the energy-integral model, only the slowest process (solid heat-up) is taken as nonsteady. It is approximate but computationally efficient. In the computations performed, the catalyst is platinum and the reactants are rich mixtures of hydrogen and oxygen. One-step global chemical reaction rates are used for both gas-phase homogeneous reaction and catalytic heterogeneous reaction. The computed results reveal the transient ignition processes in detail, including the structure variation with time in the reactive catalytic layer. An ignition map using reactor length and catalyst loading is constructed. The comparison of computed results between the two transient models verifies the applicability of the energy-integral model when the time is greater than the second largest time scale of the system. It also suggests that a proper combined use of the two models can catch all the transient phenomena while minimizing the computational cost.

Tien, Ta-Ching↗

NASA NTRS2011

Reynolds-Averaged Navier-Stokes Solutions to Flat Plate Film Cooling Scenarios

The predictions of several Reynolds-Averaged Navier-Stokes solutions for a baseline film cooling geometry are analyzed and compared with experimental data. The Fluent finite volume code was used to perform the computations with the realizable k-epsilon turbulence model. The film hole was angled at 35 to the crossflow with a Reynolds number of 17,400. Multiple length-to-diameter ratios (1.75 and 3.5) as well as momentum flux ratios (0.125 and 0.5) were simulated with various domains, boundary conditions, and grid refinements. The coolant to mainstream density ratio was maintained at 2.0 for all scenarios. Computational domain and boundary condition variations show the ability to reduce the computational cost as compared to previous studies. A number of grid refinement and coarsening variations are compared for further insights into the reduction of computational cost. Liberal refinement in the near hole region is valuable, especially for higher momentum jets that tend to lift-off and create a recirculating flow. A lack of proper refinement in the near hole region can severely diminish the accuracy of the solution, even in the far region. The effects of momentum ratio and hole length-to-diameter ratio are also discussed.

Johnson, Perry L.↗

NASA NTRSDate not supplied

Impact of Analytic Derivatives on Optimization of N-Impulse Orbit Transfer

Several formulations are possible for the optimization of N-impulse two-body orbit transfers. One formulation that assumes the firstN−1impulses are design variables and implements Lambert’s algorithm in the final leg is here considered. This paper presents a derivation for the analytic expressions of the gradients needed to optimize this formulation. The impact of using these analytic expressions on the optimization computational cost is also presented. A linear system of equations is developed that approximates the Lambert’s problem solution in a way that is suitable for computing the analytic gradients. The derivations of the analytic gradients, as well as numerical case studies for 2-impulse and 3-impulse orbit transfers, are presented. The numerical case studies highlights a significant reduction in the computational cost, measured in terms of the number of function calls.

Ahmed Ellithy↗