Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximate computing”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Three-dimensional transonic nacelle/inlet flowfield computations using an efficient approximate factorization algorithm

A highly efficient computer analysis has been developed for predicting transonic nacelle/inlet flowfields. This algorithm can compute the three-dimensional transonic flowfield about axisymmetric or asymmetric nacelle/inlet configurations at zero or nonzero incidence. The flowfield is determined by solving the full-potential equation in conservative form on a body-fitted curvilinear computational mesh. The difference equations are solved using the AF2 approximate factorization scheme. The effects of boundary layer viscous entrainment are approximated in the inviscid algorithm by applying a surface transpiration velocity which is determined from the calculated boundary layer growth. Computed results and correlations with existing methods and experiment are presented to illustrate application of the analysis.

Vadyak, J.↗
NASA NTRS1976

Equations and approximations involved in computing vertical wind velocities from superpressure balloon data

Superpressure, or constant-level, balloons have long been used to obtain horizontal wind velocities in the atmosphere. This paper presents equations which can be used to evaluate omega, the vertical wind component in pressure coordinates, from on-board pressure and temperature sensors. These equations take into account the short-term displacements of a balloon from its equilibrium density level, and thus they do not assume that the balloon precisely maintains constant density. The longer-term and larger-amplitude diurnal oscillations in balloon level, and also an approximation used in deriving the vertical velocity equations, are both discussed in some detail. These equations can be used to obtain quantitative estimates of omega if reasonable estimates of the ambient lapse rate could be obtained.

Banta, R. M.↗
NASA NTRS1976

Use of steepest descent and various approximations for efficient computation of minimum noise aircraft landing trajectories

The following areas related to landing trajectory optimization research were discussed: (1) programming and modifying the steepest descent optimization procedure, (2) successfully iterating toward the optimum for a four-mile trajectory, (3) beginning optimization runs for a twenty-mile trajectory, and (4) adapt wind tunnel data for computer usage. Other related areas were discussed in detail in the two previous annual reports.

Cook, G.↗
NASA NTRS1976

On the computational cost of approximating and recognizing noise-perturbed straight lines and quadratic arcs in the plane

Recognition of underlying straight lines and quadratic arcs in line drawings, and approximation of very noisy data by such line/curve segments, is addressed as a subproblem of the more general problem of optimum recognition of complicated line/curve drawings. Some specific algorithms are presented with extensions and interpretations for more complicated applications, and a data generation model is developed for the problem. Data are generated as a perturbation of a single underlying straight line or an elliptic or hyperbolic arc. Recursive estimation techniques, minimization of central processing unit time, decision making with controlled error probabilities, and modeling and recognition of pictures consisting of noisy curves are dealt with. Applications envisaged include: picture data compression, contour line representation in maps, intelligent data searches, and ballistic missile decoy tracking.

Cooper, D. B.↗
NASA NTRS1994

Structural optimization with approximate sensitivities

Computational efficiency in structural optimization can be enhanced if the intensive computations associated with the calculation of the sensitivities, that is, gradients of the behavior constraints, are reduced. Approximation to gradients of the behavior constraints that can be generated with small amount of numerical calculations is proposed. Structural optimization with these approximate sensitivities produced correct optimum solution. Approximate gradients performed well for different nonlinear programming methods, such as the sequence of unconstrained minimization technique, method of feasible directions, sequence of quadratic programming, and sequence of linear programming. Structural optimization with approximate gradients can reduce by one third the CPU time that would otherwise be required to solve the problem with explicit closed-form gradients. The proposed gradient approximation shows potential to reduce intensive computation that has been associated with traditional structural optimization.

Patnaik, S. N.↗
DOE OSTI2021

Practical algorithms for multivariate rational approximation

We present two approaches for computing rational approximations to multivariate functions, motivated by their effectiveness as surrogate models for high-energy physics (HEP) applications. Our first approach builds on the Stieltjes process to efficiently and robustly compute the coefficients of the rational approximation. Our second approach is based on an optimization formulation that allows us to include structural constraints on the rational approximation (in particular, constraints demanding the absence of singularities), resulting in a semi-infinite optimization problem that we solve using an outer approximation approach. We present results for synthetic and real-life HEP data, and we compare the approximation quality of our approaches with that of traditional polynomial approximations.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1980

Nonreflecting far-field boundary conditions for unsteady transonic flow computation

The approximate nonreflecting far-field boundary condition, as proposed by Engquist and Majda, is implemented in the computer code LTRAN2. This code solves the implicit finite-difference representation of the small disturbance equations for unsteady transonic flows about airfoils. The nonreflecting boundary condition and the description of the algorithm for implementing these conditions in LTRAN2 are discussed. Various cases are computed and compared with results from the older, more conventional procedures. One concludes that the nonreflecting far-field boundary approximation allows the far-field boundary to be located closer to the airfoil; this permits a decrease in the computer time required to obtain the solution through the use of fewer mesh points.

Kwak, D.↗
NASA NTRS1981

Nonreflecting Far-Field Boundary Conditions for Unsteady Transonic Flow Computation

The approximate nonreflecting far-field boundary condition, as proposed by Engquisi and Majda, is implemented In the computer code LTRAN2. This code solves the Implicit finite-difference representation of the small-disturbance equations for unsteady transonic flows about airfoils. The nonreflecting boundary condition and the description of the algorithm for Implementing these conditions In LTRAN2 tire discussed. Various cases re computed and compared with results from the older, more conventional procedures. One concludes that the nonreflecting far-field boundary approximation allows the far-field boundary to be located closer to the airfoil; this permits a decrease in the computer lime required to obtain the solution through the use of fewer mesh points.

Kwak, D.↗
DOE OSTI2022

Optical conductivity of the two-dimensional Hubbard model: Vertex corrections, emergent Galilean invariance, and the accuracy of the single-site dynamical mean field approximation

We compute the frequency-dependent conductivity of the two-dimensional square lattice Hubbard model at zero temperature as a function of density to second order in the interaction strength, and compare the results to the predictions of single-site dynamical mean field theory computed at the same order. We find that despite the neglect of vertex corrections, the single-site dynamical mean field approximation produces semiquantitatively accurate results for most carrier concentrations, but fails qualitatively for the nearly empty or nearly filled band cases where the model exhibits an emergent Galilean invariance. The DMFT approximation also becomes qualitatively inaccurate very near half filling if nesting is important.

2-dimensional systems↗
NASA NTRS1981

Approximate and exact numerical computation of supersonic flow over an airfoil

The computation of inviscid supersonic flow over a two-dimensional airfoil is considered. There are two main nonlinear approaches which lead to approximate solutions. Small-amplitude theory gives valid solutions provided the airfoil thickness is not too great and the Mach number is not too high. The second type of approximation, shock expansion theory, employs the fact that even for flows with strong shocks the effect of the down-running characteristics remains small. This leads to an analytic solution at the airfoil. It is pointed out that the approximate solution is accurate enough for many cases of interest. The numerical method furnishes a rapid correction to the solution in those cases where it is not. The characteristic-streamline coordinate system is useful both for the computation of the approximate solution and the corrections, and is also convenient for displaying and interpreting the results.

Lewis, T. S.↗
DOE OSTI2025

Stage-local partitioned two-step runge-kutta methods for large systems of ordinary differential equations

We introduce stage-local partitioned two-step Runge-Kutta methods are an extension of standard two-step Runge-Kutta methods, which are an alternative to the standard additive two-step Runge-Kutta methods currently existing in the literature. Furthermore, these new schemes are designed with an eye towards truly N-partitioned systems and leverage local stage approximations to make several computationally interesting approximations viable. Specifically, the focus on local stage approximations makes possible the construction of truly asynchronous schemes, in the parallel sense, possible. In addition, we show that an implicit-explicit approach to these schemes can lead to methods that require the inversion of only local nonlinear systems.

Applied Dynamical Systems↗