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 793 records · Page 44

The simultaneous integration of many trajectories using nilpotent normal forms

Taylor's formula shows how to approximate a certain class of functions by polynomials. The approximations are arbitrarily good in some neighborhood whenever the function is analytic and they are easy to compute. The main goal is to give an efficient algorithm to approximate a neighborhood of the configuration space of a dynamical system by a nilpotent, explicitly integrable dynamical system. The major areas covered include: an approximating map; the generalized Baker-Campbell-Hausdorff formula; the Picard-Taylor method; the main theorem; simultaneous integration of trajectories; and examples.

Grayson, Matthew A.↗

Computer simulation of the effect of dDAVP with saline loading on fluid balance after 24-hour head-down tilt

Fluid loading (FL) before Shuttle reentry is a countermeasure currently in use by NASA to improve the orthostatic tolerance of astronauts during reentry and postflight. The fluid load consists of water and salt tablets equivalent to 32 oz (946 ml) of isotonic saline. However, the effectiveness of this countermeasure has been observed to decrease with the duration of spaceflight. The countermeasure's effectiveness may be improved by enhancing fluid retention using analogs of vasopressin such as lypressin (LVP) and desmopressin (dDAVP). In a computer simulation study reported previously, we attempted to assess the improvement in fluid retention obtained by the use of LVP administered before FL. The present study is concerned with the use of dDAVP. In a recent 24-hour, 6 degree head-down tilt (HDT) study involving seven men, dDAVP was found to improve orthostatic tolerance as assessed by both lower body negative pressure (LBNP) and stand tests. The treatment restored Luft's cumulative stress index (cumulative product of magnitude and duration of LBNP) to nearly pre-bedrest level. The heart rate was lower and stroke volume was marginally higher at the same LBNP levels with administration of dDAVP compared to placebo. Lower heart rates were also observed with dDAVP during stand test, despite the lower level of cardiovascular stress. These improvements were seen with only a small but significant increase in plasma volume of approximately 3 percent. This paper presents a computer simulation analysis of some of the results of this HDT study.

NASA Discipline Cardiopulmonary↗

Adaptive mesh refinement and turbulence modeling

Adaptive mesh refinement is shown to be essential in turbulence modeling. Adaptive Mesh Refinement (AMR) is a more computationally efficient means to obtain a discrete approximation to a continuous boundary value problem of a specified accuracy than classic isotropic grid refinement. Previous application of this methodology in the assessment of turbulence models suggested that the field variable solution on the interior of the domain was more sensitive to grid refinement than would be suggested by the sensitivity to grid refinement of surface quantities. Revisiting challenging high speed flow field revealed that issues believed to be fundamental turbulence model issues appear to be related to an under-resolved boundary layer edge – a flow detail previously considered unimportant.

Hypersonics↗

Numerical simulation of viscous vortex rings

Vortex interactions and their role in turbulent flow are examined. The objectives are twofold. First, to use the existing axisymmetric code to study the annihilation process of colliding vortex rings and determine the relevance of this problem to similar 3-D phenomena. The second objective is to extend the code to three dimensions. The code under development is unique in that it can compute flows in a truly infinite domain (i.e., without periodic boundary conditions or approximations from truncating the domain). Because of this, the far field sound can be computed, and therefore, contribute to improved models of turbulence generated noise for this class of flows. Issues which can be addressed by the code include: effects of viscosity on mode selection in azimuthal breakdown of vortex rings (i.e., the Widnall instability); reconnection, the associated production of small scales, and the time scale of the process.

Stanaway, Sharon Kay↗

Minimum-fuel, power-limited transfers between coplanar elliptical orbits

Two techniques of computing coplanar, minimum-fuel, power-limited transfers are presented, based on approximate solutions obtained by the averaging method. For the first technique, the average solution provides estimates of the initial adjoint variables, and the second provides approximations of the optimal controls in feedback form. The accuracy of the techniques for computing coplanar, minimum-fuel, power-limited transfers is evaluated for a number of initial and final orbits.

Mease, Kenneth D.↗

Lumped-Parameter Representation of Wind Tunnel

Mathematical model of proposed wind-tunnel facility represents wind-tunnel circuit and associated equipment in terms of lumped-parameter components. Requires less computational effort and computing time than full three-dimensional aerodynamic computer analysis of system with many volume elements. Approximates distributed nature of wind tunnel well enough to simulate steady-state and transient behavior for analysis of proposed control subsystems and for training of operators. Lumped-parameter circuit model represents wind tunnel and associated equipment. Implemented on analog or digital computers to simulate wind-tunnel performance without risk to operators or equipment.

Krosel, Susan M.↗

A diagonal algorithm for the method of pseudocompressibility

The method of pseudocompressibility has been shown to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The accuracy and computing efficiency of these algorithms are compared.

Rogers, S. E.↗

Optimal Placement Of Multiple Antennas

Computer program based on pair of algorithms selects approximately optimal locations of antennas and approximately optimal number of elements in each antenna of multiple-antenna communication system. Obscuration in field of view at given antenna location taken into account in choice of number of antenna elements mounted there. Directional coverages of combinations of up to four antenna elements computed in search for combination to cover clear portion of field of view. Developed to aid design of antenna system of conceptual space station. Applied to system aboard ship or aircraft, on building in city, or in any location where transmission and reception blocked in some directions from each potential antenna-mounting point.

Shelton, Kyle W.↗

A Diagonal Algorithm for the Method of Pseudocompressibility

The method of pseudocompressibility has been found to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The computing efficiency of these algorithms are compared. Identical solutions are obtained from both algorithms which compare well with experimental results.

Rogers, Stuart E.↗

Computational analysis of ramjet engine inlet interaction

A computational analysis of a ramjet engine at Mach 3.5 has been conducted and compared to results obtained experimentally. This study focuses on the behavior of the inlet both with and without combustor backpressure. Increased backpressure results in separation of the body side boundary layer and a resultant static pressure rise in the inlet throat region. The computational results compare well with the experimental data for static pressure distribution through the engine, inlet throat flow profiles, and mass capture. The computational analysis slightly underpredicts the thickness of the engine body surface boundary layer and the extent of the interaction caused by backpressure; however, the interaction is observed at approximately the same level of backpressure both experimentally and computationally. This study demonstrates the ability of two different Navier-Stokes codes, namely RPLUS and PARC, to calculate the flow features of this ramjet engine and to provide more detailed information on the process of inlet interaction and unstart.

Duncan, Beverly↗

Analyses of Cometary Silicate Crystals: DDA Spectral Modeling of Forsterite

Comets are the Solar System's deep freezers of gases, ices, and particulates that were present in the outer protoplanetary disk. Where comet nuclei accreted was so cold that CO ice (approximately 50K) and other supervolatile ices like ethane (C2H2) were preserved. However, comets also accreted high temperature minerals: silicate crystals that either condensed (greater than or equal to 1400 K) or that were annealed from amorphous (glassy) silicates (greater than 850-1000 K). By their rarity in the interstellar medium, cometary crystalline silicates are thought to be grains that formed in the inner disk and were then radially transported out to the cold and ice-rich regimes near Neptune. The questions that comets can potentially address are: How fast, how far, and over what duration were crystals that formed in the inner disk transported out to the comet-forming region(s)? In comets, the mass fractions of silicates that are crystalline, f_cryst, translate to benchmarks for protoplanetary disk radial transport models. The infamous comet Hale-Bopp has crystalline fractions of over 55%. The values for cometary crystalline mass fractions, however, are derived assuming that the mineralogy assessed for the submicron to micron-sized portion of the size distribution represents the compositional makeup of all larger grains in the coma. Models for fitting cometary SEDs make this assumption because models can only fit the observed features with submicron to micron-sized discrete crystals. On the other hand, larger (0.1-100 micrometer radii) porous grains composed of amorphous silicates and amorphous carbon can be easily computed with mixed medium theory wherein vacuum mixed into a spherical particle mimics a porous aggregate. If crystalline silicates are mixed in, the models completely fail to match the observations. Moreover, models for a size distribution of discrete crystalline forsterite grains commonly employs the CDE computational method for ellipsoidal platelets (c:a:b=8.14x8.14xl in shape with geometrical factors of x:y:z=1:1:10, Fabian et al. 2001; Harker et al. 2007). Alternatively, models for forsterite employ statistical methods like the Distribution of Hollow Spheres (Min et al. 2008; Oliveira et al. 2011) or Gaussian Random Spheres (GRS) or RGF (Gielen et al. 200S). Pancakes, hollow spheres, or GRS shapes similar to wheat sheaf crystal habit (e.g., Volten et al. 2001; Veihelmann et al. 2006), however, do not have the sharp edges, flat faces, and vertices seen in images of cometary crystals in interplanetary dust particles (IDPs) or in Stardust samples. Cometary forsterite crystals often have equant or tabular crystal habit (J. Bradley). To simulate cometary crystals, we have computed absorption efficiencies of forsterite using the Discrete Dipole Approximation (DDA) DDSCAT code on NAS supercomputers. We compute thermal models that employ a size distribution of discrete irregularly shaped forsterite crystals (nonspherical shapes with faces and vertices) to explore how crystal shape affects the shape and wavelength positions of the forsterite spectral features and to explore whether cometary crystal shapes support either condensation or annealing scenarios (Lindsay et al. 2012a, b). We find forsterite crystal shapes that best-fit comet Hale-Bopp are tetrahedron, bricks or brick platelets, essentially equant or tabular (Lindsay et al. 2012a,b), commensurate with high temperature condensation experiments (Kobatake et al. 2008). We also have computed porous aggregates with crystal monomers and find that the crystal resonances are amplified. i.e., the crystalline fraction is lower in the aggregate than is derived by fitting a linear mix of spectral features from discrete subcomponents, and the crystal resonances 'appear' to be from larger crystals (Wooden et al. 2012). These results may indicate that the crystalline mass fraction in comets with comae dominated by aggregates may be lower than deduced by popular methods that only emoy ensembles of discrete crystals.

Wooden, Diane↗

A fast, exact code for scattered thermal radiation compared with a two-stream approximation

A two-stream accuracy study for internally (thermal) driven problems is presented by comparison with a recently developed 'exact' adding/doubling method. The resulting errors in external (or boundary) radiative intensity and flux are usually larger than those for the externally driven problems and vary substantially with the radiative parameters. Error predictions for a specific problem are difficult. An unexpected result is that the exact method is computationally as fast as the two-stream approximation for nonisothermal media.

Cogley, A. C.↗

Mass and radius of cosmic balloons

Cosmic balloons are spherical domain walls with relativistic particles trapped inside. We derive the exact mass and radius relations for a static cosmic balloon using Gauss-Codazzi equations. The cosmic balloon mass as a function of its radius, M(R), is found to have a functional form similar to that of fermion soliton stars, with a fixed point at 2GM(R)/R approximately or equal to 0.486 which corresponds to the limit of infinite central density. We derive a simple analytical approximation for the mass density of a spherically symmetric relativistic gas star. When applied to the computation of the mass and radius of a cosmic balloon, the analytical approximation yields fairly good agreement with the exact numerical solutions.

Wang, Yun↗

Multiple zeros of polynomials

For polynomials of higher degree, iterative numerical methods must be used. Four iterative methods are presented for approximating the zeros of a polynomial using a digital computer. Newton's method and Muller's method are two well known iterative methods which are presented. They extract the zeros of a polynomial by generating a sequence of approximations converging to each zero. However, both of these methods are very unstable when used on a polynomial which has multiple zeros. That is, either they fail to converge to some or all of the zeros, or they converge to very bad approximations of the polynomial's zeros. This material introduces two new methods, the greatest common divisor (G.C.D.) method and the repeated greatest common divisor (repeated G.C.D.) method, which are superior methods for numerically approximating the zeros of a polynomial having multiple zeros. These methods were programmed in FORTRAN 4 and comparisons in time and accuracy are given.

Wood, C. A.↗

Euler/Navier-Stokes calculations of transonic flow past fixed- and rotary-wing aircraft configurations

Computational fluid dynamics has an increasingly important role in the design and analysis of aircraft as computer hardware becomes faster and algorithms become more efficient. Progress is being made in two directions: more complex and realistic configurations are being treated and algorithms based on higher approximations to the complete Navier-Stokes equations are being developed. The literature indicates that linear panel methods can model detailed, realistic aircraft geometries in flow regimes where this approximation is valid. As algorithms including higher approximations to the Navier-Stokes equations are developed, computer resource requirements increase rapidly. Generation of suitable grids become more difficult and the number of grid points required to resolve flow features of interest increases. Recently, the development of large vector computers has enabled researchers to attempt more complex geometries with Euler and Navier-Stokes algorithms. The results of calculations for transonic flow about a typical transport and fighter wing-body configuration using thin layer Navier-Stokes equations are described along with flow about helicopter rotor blades using both Euler/Navier-Stokes equations.

Deese, J. E.↗

A computer model of the electrostatic positioning system

Positioning systems based upon electrstatic forces are being developed for the containerless processing of materials that cannot use acoustic or electromagnetic positioning techniques. Currently, electrode configurations for these electrostatic systems are designed on the basis of approximate analytical calculations and past experience. A three dimensional computer model is being developed that will predict the electrostatic fields and forces for a given electrode configuration and will allow for a more rapid evaluation of proposed designs. Early results of this model are presented.

Gutt, G. M.↗

Error Analysis for Discontinuous Galerkin Method for Parabolic Problems

In the proposal, the following three objectives are stated: (1) A p-version of the discontinuous Galerkin method for a one dimensional parabolic problem will be established. It should be recalled that the h-version in space was used for the discontinuous Galerkin method. An a priori error estimate as well as a posteriori estimate of this p-finite element discontinuous Galerkin method will be given. (2) The parameter alpha that describes the behavior double vertical line u(sub t)(t) double vertical line 2 was computed exactly. This was made feasible because of the explicitly specified initial condition. For practical heat transfer problems, the initial condition may have to be approximated. Also, if the parabolic problem is proposed on a multi-dimensional region, the parameter alpha, for most cases, would be difficult to compute exactly even in the case that the initial condition is known exactly. The second objective of this proposed research is to establish a method to estimate this parameter. This will be done by computing two discontinuous Galerkin approximate solutions at two different time steps starting from the initial time and use them to derive alpha. (3) The third objective is to consider the heat transfer problem over a two dimensional thin plate. The technique developed by Vogelius and Babuska will be used to establish a discontinuous Galerkin method in which the p-element will be used for through thickness approximation. This h-p finite element approach, that results in a dimensional reduction method, was used for elliptic problems, but the application appears new for the parabolic problem. The dimension reduction method will be discussed together with the time discretization method.

Kaneko, Hideaki↗