SEARCH · Search NASA

Results for “approximation algorithms”

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 541 records · Page 30

All sources NASA NTRS DOE OSTI

NASA NTRS1991

Sinc-Galerkin estimation of diffusivity in parabolic problems

A fully Sinc-Galerkin method for the numerical recovery of spatially varying diffusion coefficients in linear partial differential equations is presented. Because the parameter recovery problems are inherently ill-posed, an output error criterion in conjunction with Tikhonov regularization is used to formulate them as infinite-dimensional minimization problems. The forward problems are discretized with a sinc basis in both the spatial and temporal domains thus yielding an approximate solution which displays an exponential convergence rate and is valid on the infinite time interval. The minimization problems are then solved via a quasi-Newton/trust region algorithm. The L-curve technique for determining an approximate value of the regularization parameter is briefly discussed, and numerical examples are given which show the applicability of the method both for problems with noise-free data as well as for those whose data contains white noise.

Smith, Ralph C.↗

DOE OSTI2026

Exploring the holographic entropy cone via reinforcement learning

We develop a reinforcement learning algorithm to study the holographic entropy cone. Given a target entropy vector, our algorithm searches for a graph realization whose min-cut entropies match the target vector. If the target vector does not admit such a graph realization, it must lie outside the cone, in which case the algorithm finds a graph whose corresponding entropy vector most nearly approximates the target and allows us to probe the location of the facets. For the N = 3 cone, we confirm that our algorithm successfully rediscovers monogamy of mutual information beginning with a target vector outside the holographic entropy cone. We then apply the algorithm to the N = 6 cone, analyzing the 6 mystery extreme rays of the subadditivity cone from [1] that satisfy all known holographic entropy inequalities yet lacked graph realizations. We found realizations for 3 of them, proving they are genuine extreme rays of the holographic entropy cone, while providing evidence that the remaining 3 are not realizable, implying unknown holographic inequalities exist for N = 6.

AdS-CFT correspondence↗

NASA NTRS1996

Guidance of Nonlinear Systems

The paper describes a method for guiding a dynamic system through a given set of points. The paradigm is a fully automatic aircraft subject to air traffic control (ATC). The ATC provides a sequence of way points through which the aircraft trajectory must pass. The way points typically specify time, position, and velocity. The guidance problem is to synthesize a system state trajectory which satisfies both the ATC and aircraft constraints. Complications arise because the controlled process is multi-dimensional, multi-axis, nonlinear, highly coupled, and the state space is not flat. In addition, there is a multitude of possible operating modes, which may number in the hundreds. Each such mode defines a distinct state space model of the process by specifying the state space coordination, the partition of the controls into active controls and configuration controls, and the output map. Furthermore, mode transitions must be smooth. The guidance algorithm is based on the inversion of the pure feedback approximations, which is followed by iterative corrections for the effects of zero dynamics. The paper describes the structure and modules of the algorithm, and the performance is illustrated by several example aircraft maneuvers.

Meyer, George↗

NASA NTRS1997

Guidance of Nonlinear Systems

The paper describes a method for guiding a dynamic system through a given set of points. The paradigm is a fully automatic aircraft subject to air traffic control (ATC). The ATC provides a sequence of way points through which the aircraft trajectory must pass. The way points typically specify time, position, and velocity. The guidance problem is to synthesize a system state trajectory which satisfies both the ATC and aircraft constraints. Complications arise because the controlled process is multi-dimensional, multi-axis, nonlinear, highly coupled, and the state space is not flat. In addition, there is a multitude of possible operating modes, which may number in the hundreds. Each such mode defines a distinct state space model of the process by specifying the state space coordinatization, the partition of the controls into active controls and configuration controls, and the output map. Furthermore, mode transitions must be smooth. The guidance algorithm is based on the inversion of the pure feedback approximations, which is followed by iterative corrections for the effects of zero dynamics. The paper describes the structure and modules of the algorithm, and the performance is illustrated by several example aircraft maneuvers.

Meyer, George↗

NASA NTRS1977

Composite methods for hyperbolic equations

A composite approximation procedure combining the properties of the Lax-Wendroff and leapfrog algorithms is proposed for solving hyperbolic equations. For a one-dimensional equation, a three-step approximation consisting of a two-step Richtmeyer method followed by a leapfrog step is considered. This is a two-level scheme, so all difficulties, including storage requirements, associated with the three-level leapfrog are eliminated. For two-dimensional problems a generalization of the preceding method is used consisting of a rotated Richtmeyer method followed by a modified leapfrog step. It is found that the composite schemes are effective in reducing oscillations and nonlinear instabilities that affect the leapfrog method. The dissipation in the composite schemes is much less than in the Richtmeyer algorithm, and hence can be used for long term integrations.

Turkel, E.↗

DOE OSTI2024

Faster Tensor Network Decoding for Topological Quantum Codes

We present a fast and Bayes-optimal-approximating tensor network decoder for planar quantum LDPC codes based on the tensor renormalization group algorithm, originally proposed by Levin, and Nave. By precomputing the renormalization group flow for the null syndrome, we need only recompute tensor contractions in the causal cone of the measured syndrome at the time of decoding. This allows us to achieve an overall runtime complexity of ($pnχ^6$) where p is the depolarizing noise rate, and χ is the cutoff value used to control singular value decomposition approximations used in the algorithm. We apply our decoder to the surface code in the code capacity noise model and compare its performance to the original matrix product state (MPS) tensor network decoder introduced by Bravyi, Suchara, and Vargo. The MPS decoder has a p-independent runtime complexity of $\mathcal{O}(nχ^3)$ resulting in significantly slower decoding times compared to our algorithm in the low-p regime.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1981

Rapid inversion of limb radiance data using an emissivity growth approximation

The time-consuming nature of limb relaxation-type inversion algorithms is due primarily to the numerous integrations over an absorption band to obtain forward radiance values with which to compare measured values. A new method has been devised for the quick and accurate (0.5% error) calculation of single gas broadband (approximately 100 per cm) limb radiance. The method uses a precalculated data base consisting of homogeneous path emissivity vs mass path data for a wide range of temperature and pressure. A 50-km altitude range, 1-km resolution, constituent inversion employing this method requires under 1 sec of computational time when run on modern computer hardware. The method does not rely upon a priori statistical knowledge.

Gordley, L. L.↗

NASA NTRS1983

Three-dimensional Euler solutions for long-duct nacelles

A three-dimensional Euler-equation computational technique has been developed to solve for the transonic flow past flow-through nacelles. The technique employs an approximately-factored alternating-direction implicit numerical algorithm and a radiation treatment of the outflow boundary. Studies are presented which show that the radiation treatment gives better numerical convergence than the condition of specifying the pressure at the outflow boundary. Calculations made with the technique are presented for a long-duct turbofan engine nacelle at a Mach number of 0.80 and angles of attack of 0 deg and 4 deg. Good agreement is shown between the computational results and wind-tunnel data. Problem areas are identified and recommendations are made for further numerical studies.

Compton, W. B., III↗

NASA NTRS1985

Multigrid method for nearly singular and slightly indefinite problems

This paper deals with nearly singular, possibly indefinite problems for which the usual multigrid solvers converge very slowly or even diverge. The main difficulty is related to some badly approximated smooth functions which correspond to eigenfunctions with nearly zero eigenvalues. A correction to the usual coarse-grid equations is derived, both in the correction scheme and in the full approximation scheme. The performance of the new algorithm using this correction is essentially as that of usual multigrid for definite problems.

Brandt, A.↗

NASA NTRS1986

Uniformly high order accurate essentially non-oscillatory schemes 3

In this paper (a third in a series) the construction and the analysis of essentially non-oscillatory shock capturing methods for the approximation of hyperbolic conservation laws are presented. Also presented is a hierarchy of high order accurate schemes which generalizes Godunov's scheme and its second order accurate MUSCL extension to arbitrary order of accuracy. The design involves an essentially non-oscillatory piecewise polynomial reconstruction of the solution from its cell averages, time evolution through an approximate solution of the resulting initial value problem, and averaging of this approximate solution over each cell. The reconstruction algorithm is derived from a new interpolation technique that when applied to piecewise smooth data gives high-order accuracy whenever the function is smooth but avoids a Gibbs phenomenon at discontinuities. Unlike standard finite difference methods this procedure uses an adaptive stencil of grid points and consequently the resulting schemes are highly nonlinear.

Harten, A.↗

NASA NTRS1986

Multigrid method for nearly singular and slightly indefinite problems

Brandt, A.↗

NASA NTRS1988

A feedback linearization approach to spacecraft control using momentum exchange devices

Recent developments in the area of nonlinear control theory have shown how coordiante changes in the state and input spaces can be used with nonlinear feedback to transform certain nonlinear ordinary differential equations into equivalent linear equations. These feedback linearization techniques are applied to resolve two problems arising in the control of spacecraft equipped with control moment gyroscopes (CMGs). The first application involves the computation of rate commands for the gimbals that rotate the individual gyroscopes to produce commanded torques on the spacecraft. The second application is to the long-term management of stored momentum in the system of control moment gyroscopes using environmental torques acting on the vehicle. An approach to distributing control effort among a group of redundant actuators is described that uses feedback linearization techniques to parameterize sets of controls which influence a specified subsystem in a desired way. The approach is adapted for use in spacecraft control with double-gimballed gyroscopes to produce an algorithm that avoids problematic gimbal configurations by approximating sets of gimbal rates that drive CMG rotors into desirable configurations. The momentum management problem is stated as a trajectory optimization problem with a nonlinear dynamical constraint. Feedback linearization and collocation are used to transform this problem into an unconstrainted nonlinear program. The approach to trajectory optimization is fast and robust. A number of examples are presented showing applications to the proposed NASA space station.

Dzielski, John Edward↗

NASA NTRS1990

Viscous shock profiles and primitive formulations

Weak solutions of hyperbolic systems in primitive (non-conservation) form for which a consistent conservation form exists are considered. It is shown that primitive formulations, shock relations are not uniquely defined by the states to either side of the shock but also depend on the viscous path connecting the two. Scheme-dependent high order correction terms are derived that enforce consistent viscous shock profiles. The resulting primitive algorithm is conservative to the order of approximation. One dimensional Euler calculations of flows containing strong shocks clearly show that conservation errors in primitive flow calculations are of comparable quality.

Karni, S.↗

NASA NTRS1992

Scheme For Finite-Difference Computations Of Waves

Compact algorithms generating and solving finite-difference approximations of partial differential equations for propagation of waves obtained by new method. Based on concept of discrete dispersion relation. Used in wave propagation to relate frequency to wavelength and is key measure of wave fidelity.

Davis, Sanford↗

NASA NTRS1991

Multi-Dimensional ENO Schemes for General Geometries

A class of ENO schemes is presented for the numerical solution of multidimensional hyperbolic systems of conservation laws in structured and unstructured grids. This is a class of shock-capturing schemes which are designed to compute cell-averages to high order accuracy. The ENO scheme is composed of a piecewise-polynomial reconstruction of the solution form its given cell-averages, approximate evolution of the resulting initial value problem, and averaging of this approximate solution over each cell. The reconstruction algorithm is based on an adaptive selection of stencil for each cell so as to avoid spurious oscillations near discontinuities while achieving high order of accuracy away from them.

Harten, Ami↗

NASA NTRS1992

A comparison of neural network and fuzzy clustering techniques in segmenting magnetic resonance images of the brain

Magnetic resonance (MR) brain section images are segmented and then synthetically colored to give visual representations of the original data with three approaches: the literal and approximate fuzzy c-means unsupervised clustering algorithms and a supervised computational neural network, a dynamic multilayered perception trained with the cascade correlation learning algorithm. Initial clinical results are presented on both normal volunteers and selected patients with brain tumors surrounded by edema. Supervised and unsupervised segmentation techniques provide broadly similar results. Unsupervised fuzzy algorithms were visually observed to show better segmentation when compared with raw image data for volunteer studies. However, for a more complex segmentation problem with tumor/edema or cerebrospinal fluid boundary, where the tissues have similar MR relaxation behavior, inconsistency in rating among experts was observed.

Hall, Lawrence O.↗

NASA NTRS1995

A magnetic hysteresis model

The Passive Aerodynamically Stabilized Magnetically Damped Satellite (PAMS) will be deployed from the Space Shuttle and used as a target for a Shuttle-mounted laser. It will be a cylindrical satellite with several corner cube reflectors on the ends. The center of mass of the cylinder will be near one end, and aerodynamic torques will tend to align the axis of the cylinder with the spacecraft velocity vector. Magnetic hysteresis rods will be used to provide passive despin and oscillation-damping torques on the cylinder. The behavior of the hysteresis rods depends critically on the 'B/H' curves for the combination of materials and rod length-to-diameter ratio ('l-over-d'). These curves are qualitatively described in most Physics textbooks in terms of major and minor 'hysteresis loops'. Mathematical modeling of the functional relationship between B and H is very difficult. In this paper, the physics involved is not addressed, but an algorithm is developed which provides a close approximation to empirically determined data with a few simple equations suitable for use in computer simulations.

Flatley, Thomas W.↗

NASA NTRS1996

Soft-output decoding algorithms in iterative decoding of turbo codes

In this article, we present two versions of a simplified maximum a posteriori decoding algorithm. The algorithms work in a sliding window form, like the Viterbi algorithm, and can thus be used to decode continuously transmitted sequences obtained by parallel concatenated codes, without requiring code trellis termination. A heuristic explanation is also given of how to embed the maximum a posteriori algorithms into the iterative decoding of parallel concatenated codes (turbo codes). The performances of the two algorithms are compared on the basis of a powerful rate 1/3 parallel concatenated code. Basic circuits to implement the simplified a posteriori decoding algorithm using lookup tables, and two further approximations (linear and threshold), with a very small penalty, to eliminate the need for lookup tables are proposed.

Benedetto, S.↗