Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximation methods”

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 1,495 records · Page 83
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Comparison of circular orbit and Fourier power series ephemeris representations for backup use by the upper atmosphere research satellite onboard computer

The Upper Atmosphere Research Satellite (UARS) is a three-axis stabilized Earth-pointing spacecraft in a low-Earth orbit. The UARS onboard computer (OBC) uses a Fourier Power Series (FPS) ephemeris representation that includes 42 position and 42 velocity coefficients per axis, with position residuals at 10-minute intervals. New coefficients and 32 hours of residuals are uploaded daily. This study evaluated two backup methods that permit the OBC to compute an approximate spacecraft ephemeris in the event that new ephemeris data cannot be uplinked for several days: (1) extending the use of the FPS coefficients previously uplinked, and (2) switching to a simple circular orbit approximation designed and tested (but not implemented) for LANDSAT-D. The FPS method provides greater accuracy during the backup period and does not require additional ground operational procedures for generating and uplinking an additional ephemeris table. The tradeoff is that the high accuracy of the FPS will be degraded slightly by adopting the longer fit period necessary to obtain backup accuracy for an extended period of time. The results for UARS show that extended use of the FPS is superior to the circular orbit approximation for short-term ephemeris backup.

Kast, J. R.↗
NASA NTRS1972

Examination of the collision force method for analyzing the responses of simple containment/deflection structures to impact by one engine rotor blade fragment

An approximate collision analysis, termed the collision-force method, was developed for studying impact-interaction of an engine rotor blade fragment with an initially circular containment ring. This collision analysis utilizes basic mass, material property, geometry, and pre-impact velocity information for the fragment, together with any one of three postulated patterns of blade deformation behavior: (1) the elastic straight blade model, (2) the elastic-plastic straight shortening blade model, and (3) the elastic-plastic curling blade model. The collision-induced forces are used to predict the resulting motions of both the blade fragment and the containment ring. Containment ring transient responses are predicted by a finite element computer code which accommodates the large deformation, elastic-plastic planar deformation behavior of simple structures such as beams and/or rings. The effects of varying the values of certain parameters in each blade-behavior model were studied. Comparisons of predictions with experimental data indicate that of the three postulated blade-behavior models, the elastic-plastic curling blade model appears to be the most plausible and satisfactory for predicting the impact-induced motions of a ductile engine rotor blade and a containment ring against which the blade impacts.

Zirin, R. M.↗
NASA NTRS2011

Fast Simulations of Gas Sloshing and Cold Front Formation

We present a simplified and fast method for simulating minor mergers between galaxy clusters. Instead of following the evolution of the dark matter halos directly by the N-body method, we employ a rigid potential approximation for both clusters. The simulations are run in the rest frame of the more massive cluster and account for the resulting inertial accelerations in an optimised way. We test the reliability of this method for studies of minor merger induced gas sloshing by performing a one-to-one comparison between our simulations and hydro+N-body ones. We find that the rigid potential approximation reproduces the sloshing-related features well except for two artefacts: the temperature just outside the cold fronts is slightly over-predicted, and the outward motion of the cold fronts is delayed by typically 200 Myr. We discuss reasons for both artefacts.

Roediger, E.↗
NASA NTRS2012

Fast Simulations of Gas Sloshing and Cold Front Formation

We present a simplified and fast method for simulating minor mergers between galaxy clusters. Instead of following the evolution of the dark matter halos directly by the N-body method, we employ a rigid potential approximation for both clusters. The simulations are run in the rest frame of the more massive cluster and account for the resulting inertial accelerations in an optimised way. We test the reliability of this method for studies of minor merger induced gas sloshing by performing a one-to-one comparison between our simulations and hydro+N-body ones. We find that the rigid potential approximation reproduces the sloshing-related features well except for two artifacts: the temperature just outside the cold fronts is slightly over-predicted, and the outward motion of the cold fronts is delayed by typically 200 Myr. We discuss reasons for both artifacts.

Roediger, E.↗
NASA NTRS1974

Triangulation of multistation camera data to locate a curved line in space

A method is described for finding the location of a curved line in space from local azimuth as a function of elevation data obtained at several observation sites. A least-squares criterion is used to insure the best fit to the data. The method is applicable to the triangulation of an object having no identifiable structural features, provided its width is very small compared with its length so as to approximate a line in space. The method was implemented with a digital computer program and was successfully applied to data obtained from photographs of a barium ion cloud which traced out the earth's magnetic field line at very high altitudes.

Fricke, C. L.↗
NASA NTRS1947

The Streamline Pattern in the Vicinity of an Oblique Airfoil

A method for determining the streamwise flow pattern of a nonviscous incompressible fluid about an oblique airfoil from the corresponding flow pattern about the airfoil in normal position is presented and illustrated in two examples. The method can be extended to account approximately for compressibility effects by applying the Prandtl-Glauert correction factor to the flow pattern that is normal to the leading edge of the airfoil. The method is expected to be useful in determining the shape of a fuselage or nacelle having a minimum of interference with the flow over a swept-back wing.

Watkins, Charles E↗
NASA NTRS1940

The frequencies of cantilever wings in beam and torsional vibrations

Methods are described for calculating the period and frequency of vibration of cantilever wings and similar structures in which the weight and moment of inertia vary along the span. Both the beam and torsional frequencies may be calculated by these methods. The procedure is illustrated by examples. It is shown that a surprisingly close approximation to the beam frequency may be obtained by a very brief calculation in which the curvature of the wing in vibration is assumed to be constant. A somewhat longer computation permits taking account of the true curvature of the beam by a series of successive approximations which are shown to be strongly convergent. Analogous methods are applied to calculations of the torsional frequency. For the first approximation it is assumed that the angle of twist varies linearly alone the semispan. True variation of the twist is computed by successive approximations which are strongly convergent, as in the case of beam vibrations.

Burgess, C P↗
NASA NTRS1989

Numerical algorithms for steady and unsteady incompressible Navier-Stokes equations

The numerical analysis of the incompressible Navier-Stokes equations are becoming important tools in the understanding of some fluid flow problems which are encountered in research as well as in industry. With the advent of the supercomputers, more realistic problems can be studied with a wider choice of numerical algorithms. An alternative formulation is presented for viscous incompressible flows. The incompressible Navier-Stokes equations are cast in a velocity/vorticity formulation. This formulation consists of solving the Poisson equations for the velocity components and the vorticity transport equation. Two numerical algorithms for the steady two-dimensional laminar flows are presented. The first method is based on the actual partial differential equations. This uses a finite-difference approximation of the governing equations on a staggered grid. The second method uses a finite element discretization with the vorticity transport equation approximated using a Galerkin approximation and the Poisson equations are obtained using a least squares method. The equations are solved efficiently using Newton's method and a banded direct matrix solver (LINPACK). The method is extended to steady three-dimensional laminar flows and applied to a cubic driven cavity using finite difference schemes and a staggered grid arrangement on a Cartesian mesh. The equations are solved iteratively using a plane zebra relaxation scheme. Currently, a two-dimensional, unsteady algorithm is being developed using a generalized coordinate system. The equations are discretized using a finite-volume approach. This work will then be extended to three-dimensional flows.

Hafez, Mohammed↗
NASA NTRS2005

Texturing Blood-Glucose-Monitoring Optics Using Oxygen Beams

A method has been invented for utilizing directed, hyperthermal oxygen atoms and ions for texturing tips of polymeric optical fibers or other polymeric optical components for use in optical measurement of concentration of glucose in blood. The required texture of the sensory surface of such a component amounts to a landscape of microscopic hills having high aspect ratios (hills taller than they are wide), with an average distance between hills of no more than about 5 m. This limit on the average distance between hills is chosen so that blood cells (which are wider) cannot enter the valleys between the hills, where they could obstruct optical sensing of glucose in the blood plasma. On the other hand, the plasma is required to enter the valleys, and a high aspect ratio is intended to maximize the hillside and valley surface area in contact with the plasma, thereby making it possible to obtain a given level of optical glucose- measurement sensitivity with a relatively small volume of blood. The present method of texturing by use of directed, hyperthermal (particle energy >1 eV) oxygen atoms and ions stands in contrast to a prior method of texturing by use of thermal monatomic oxygen characterized by a temperature of the order of 0.5 eV. The prior method yields low-aspect- ratio (approximately hemispherical) craters that are tens of microns wide . too wide to exclude blood cells. The figure schematically depicts parts of a typical apparatus for texturing according to the present method. One or more polymeric optical components to be textured (e.g., multiple optical fibers bundled together for simultaneous processing) are mounted in a vacuum chamber facing a suitable ion- or atom-accelerating device capable of generating a beam of oxygen atoms and/or ions having kinetic energies >1 eV. Typically, such a device includes a heated cathode, in which case it is desirable to interpose a water-cooled thermal-radiation shield to prevent melting of the polymeric component(s) to be textured. In operation, the chamber is evacuated to a pressure .10.5 torr (less than or equal to approximately 1.3 mPa), then the beam is turned on. The resulting texture is characterized by approximately conical hills having aspect ratios greater than 1. In experiments, it was demonstrated that separations between adjacent hills can be made .1 m and that the separations and heights of the hills can be varied by varying the fluence of monatomic oxygen and/or oxygen ions.

Banks, Bruce↗
NASA NTRS1983

Spline Classification Methods

The use of spline functions in the development of classification algorithms is discussed. A method is formulated for producing spline approximations to univariate density functions when each density function is described by a histogram of measurements. The resulting approximations are then incorporated into a Bayesian classification procedure for which the probability of misclassification can be readily computed. Some preliminary numerical results are presented to illustrate the method.

Guseman, L. F., Jr.↗
NASA NTRS1988

Multigrid method for stability problems

The problem of calculating the stability of steady state solutions of differential equations is treated. Leading eigenvalues (i.e., having maximal real part) of large matrices that arise from discretization are to be calculated. An efficient multigrid method for solving these problems is presented. The method begins by obtaining an initial approximation for the dominant subspace on a coarse level using a damped Jacobi relaxation. This proceeds until enough accuracy for the dominant subspace has been obtained. The resulting grid functions are then used as an initial approximation for appropriate eigenvalue problems. These problems are being solved first on coarse levels, followed by refinement until a desired accuracy for the eigenvalues has been achieved. The method employs local relaxation on all levels together with a global change on the coarsest level only, which is designed to separate the different eigenfunctions as well as to update their corresponding eigenvalues. Coarsening is done using the FAS formulation in a non-standard way in which the right hand side of the coarse grid equations involves unknown parameters to be solved for on the coarse grid. This in particular leads to a new multigrid method for calculating the eigenvalues of symmetric problems. Numerical experiments with a model problem demonstrate the effectiveness of the method proposed. Using an FMG algorithm a solution to the level of discretization errors is obtained in just a few work units (less than 10), where a work unit is the work involved in one Jacobi relization on the finest level.

Taasan, Shlomo↗
NASA NTRS2005

Concrete Model Checking with Abstract Matching and Refinement

We propose an abstraction-based model checking method which relies on refinement of an under-approximation of the feasible behaviors of the system under analysis. The method preserves errors to safety properties, since all analyzed behaviors are feasible by definition. The method does not require an abstract transition relation to he generated, but instead executes the concrete transitions while storing abstract versions of the concrete states, as specified by a set of abstraction predicates. For each explored transition. the method checks, with the help of a theorem prover, whether there is any loss of precision introduced by abstraction. The results of these checks are used to decide termination or to refine the abstraction, by generating new abstraction predicates. If the (possibly infinite) concrete system under analysis has a finite bisimulation quotient, then the method is guaranteed to eventually explore an equivalent finite bisimilar structure. We illustrate the application of the approach for checking concurrent programs. We also show how a lightweight variant can be used for efficient software testing.

Pasareanu Corina S.↗
NASA NTRS2012

A Comparison of Filter-based Approaches for Model-based Prognostics

Model-based prognostics approaches use domain knowledge about a system and its failure modes through the use of physics-based models. Model-based prognosis is generally divided into two sequential problems: a joint state-parameter estimation problem, in which, using the model, the health of a system or component is determined based on the observations; and a prediction problem, in which, using the model, the stateparameter distribution is simulated forward in time to compute end of life and remaining useful life. The first problem is typically solved through the use of a state observer, or filter. The choice of filter depends on the assumptions that may be made about the system, and on the desired algorithm performance. In this paper, we review three separate filters for the solution to the first problem: the Daum filter, an exact nonlinear filter; the unscented Kalman filter, which approximates nonlinearities through the use of a deterministic sampling method known as the unscented transform; and the particle filter, which approximates the state distribution using a finite set of discrete, weighted samples, called particles. Using a centrifugal pump as a case study, we conduct a number of simulation-based experiments investigating the performance of the different algorithms as applied to prognostics.

prognostics↗
NASA NTRS1990

Implicit application of polynomial filters in a k-step Arnoldi method

The Arnoldi process is a well known technique for approximating a few eigenvalues and corresponding eigenvectors of a general square matrix. Numerical difficulties such as loss of orthogonality and assessment of the numerical quality of the approximations as well as a potential for unbounded growth in storage have limited the applicability of the method. These issues are addressed by fixing the number of steps in the Arnoldi process at a prescribed value k and then treating the residual vector as a function of the initial Arnoldi vector. This starting vector is then updated through an iterative scheme that is designed to force convergence of the residual to zero. The iterative scheme is shown to be a truncation of the standard implicitly shifted QR-iteration for dense problems and it avoids the need to explicitly restart the Arnoldi sequence. The main emphasis of this paper is on the derivation and analysis of this scheme. However, there are obvious ways to exploit parallelism through the matrix-vector operations that comprise the majority of the work in the algorithm. Preliminary computational results are given for a few problems on some parallel and vector computers.

Sorensen, D. C.↗
NASA NTRS1993

Two-level Schwartz methods for nonconforming finite elements and discontinuous coefficients

Two-level domain decomposition methods are developed for a simple nonconforming approximation of second order elliptic problems. A bound is established for the condition number of these iterative methods, which grows only logarithmically with the number of degrees of freedom in each subregion. This bound holds for two and three dimensions and is independent of jumps in the value of the coefficients.

Sarkis, Marcus↗
NASA NTRS2001

Turbofan Duct Propagation Model

The CDUCT code utilizes a parabolic approximation to the convected Helmholtz equation in order to efficiently model acoustic propagation in acoustically treated, complex shaped ducts. The parabolic approximation solves one-way wave propagation with a marching method which neglects backwards reflected waves. The derivation of the parabolic approximation is presented. Several code validation cases are given. An acoustic lining design process for an example aft fan duct is discussed. It is noted that the method can efficiently model realistic three-dimension effects, acoustic lining, and flow within the computational capabilities of a typical computer workstation.

Lan, Justin H.↗