Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic recourse”

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.

7 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

A general explicit or semi-explicit algorithm for compressible and incompressible flows

A unified finite element algorithm is developed which is applicable to a wide range of problems of fluid mechanics without recourse to artificial, empirically determined factors. In its explicit form, the algorithm is similar to the Taylor-Galerkin scheme and is easily adopted to standard codes. The scheme proposed here possesses sufficient natural balancing diffusion and thus reduces and sometimes eliminates the need for special 'shock capturing' diffusion. The efficiency of the algorithm is demonstrated using several examples ranging from incompressible through transonic regions to supersonic flows.

Zienkiewicz, O. C.↗
NASA NTRS1998

Pattern Search Methods for Linearly Constrained Minimization

We extend pattern search methods to linearly constrained minimization. We develop a general class of feasible point pattern search algorithms and prove global convergence to a Karush-Kuhn-Tucker point. As in the case of unconstrained minimization, pattern search methods for linearly constrained problems accomplish this without explicit recourse to the gradient or the directional derivative. Key to the analysis of the algorithms is the way in which the local search patterns conform to the geometry of the boundary of the feasible region.

Lewis, Robert Michael↗
NASA NTRS1985

Implicit/explicit analysis of interactive phenomena in: supersonic, chemically-reacting, mixing and boundary layer problems

An efficient implicit/explicit procedure for solving the parabolized Navier-Stokes (PNS) equations to analyze supersonic, viscous, chemically-reacting flows is presented. The approach combines a fully-implicit algorithm for solving the parabolic mixing/boundary layer equations with an explicit algorithm for determining the hyperbolic pressure field. The unified model, SPLITP, contains provisions for treating bounding/embedded subsonic regions using a pressure-splitting procedure which suppresses elliptic (upstream influence) effects without recourse to sublayer approximations. Several two-equation turbulence models with compressibility and curvature-correction terms are incorporated into SPLITP. Applications to a variety of flow problems are presented which include: ducted supersonic mixing and combustion flowfields, free jets and plumes, and, curved boundary layers and wall jets.

Dash, S. M.↗
NASA NTRS2013

Eliminating Obliquity Error from the Estimation of Ionospheric Delay in a Satellite-Based Augmentation System

Current satellite-based augmentation systems estimate ionospheric delay using algorithms that assume the electron density of the ionosphere is non-negligible only in a thin shell located near the peak of the actual profile. In its initial operating capability, for example, the Wide Area Augmentation System incorporated the thin shell model into an estimation algorithm that calculates vertical delay using a planar fit. Under disturbed conditions or at low latitude where ionospheric structure is complex, however, the thin shell approximation can serve as a significant source of estimation error. A recent upgrade of the system replaced the planar fit algorithm with an algorithm based upon kriging. The upgrade owes its success, in part, to the ability of kriging to mitigate the error due to this approximation. Previously, alternative delay estimation algorithms have been proposed that eliminate the need for invoking the thin shell model altogether. Prior analyses have compared the accuracy achieved by these methods to the accuracy achieved by the planar fit algorithm. This paper extends these analyses to include a comparison with the accuracy achieved by kriging. It concludes by examining how a satellite-based augmentation system might be implemented without recourse to the thin shell approximation.

delay estimation↗
NASA NTRS2024

Expansion of Check-Cases for 6DOF Simulation

This is the Appendix containing a description of the solution for Case 1 in the assessment, “Expansion of Check-Cases for 6DOF Simulation”. For cases of spherical gravity, it is possible to provide a two-body solution without recourse to numerical integration and thus it is accurate to machine precision. Python code for a Keplerian Propagator (propagate.py) which produced a reference trajectory for Case 1 is provided in this appendix. There is also code for generating test cases which was used as an independent verification of the propagator. This is a high-level description of the algorithm employed. The documentation of each function includes implementation details, including equations for each task.

Modeling↗
NASA NTRS1998

Support Vector Machines for Hyperspectral Remote Sensing Classification

The Support Vector Machine provides a new way to design classification algorithms which learn from examples (supervised learning) and generalize when applied to new data. We demonstrate its success on a difficult classification problem from hyperspectral remote sensing, where we obtain performances of 96%, and 87% correct for a 4 class problem, and a 16 class problem respectively. These results are somewhat better than other recent results on the same data. A key feature of this classifier is its ability to use high-dimensional data without the usual recourse to a feature selection step to reduce the dimensionality of the data. For this application, this is important, as hyperspectral data consists of several hundred contiguous spectral channels for each exemplar. We provide an introduction to this new approach, and demonstrate its application to classification of an agriculture scene.

Gualtieri, J. Anthony↗
NASA NTRS1989

Zonal multigrid solution of compressible flow problems on unstructured and adaptive meshes

The simultaneous use of adaptive meshing techniques with a multigrid strategy for solving the 2-D Euler equations in the context of unstructured meshes is studied. To obtain optimal efficiency, methods capable of computing locally improved solutions without recourse to global recalculations are pursued. A method for locally refining an existing unstructured mesh, without regenerating a new global mesh is employed, and the domain is automatically partitioned into refined and unrefined regions. Two multigrid strategies are developed. In the first, time-stepping is performed on a global fine mesh covering the entire domain, and convergence acceleration is achieved through the use of zonal coarse grid accelerator meshes, which lie under the adaptively refined regions of the global fine mesh. Both schemes are shown to produce similar convergence rates to each other, and also with respect to a previously developed global multigrid algorithm, which performs time-stepping throughout the entire domain, on each mesh level. However, the present schemes exhibit higher computational efficiency due to the smaller number of operations on each level.

Mavriplis, Dimitri J.↗