Search NASA⌕ Search

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.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 685 records · Page 38
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Computational analysis of hypersonic flows past elliptic-cone waveriders

A comprehensive study for the inviscid numerical calculation of the hypersonic flow past a class of elliptic-cone derived waveriders is presented. The theoretical background associated with hypersonic small-disturbance theory (HSDT) is reviewed. Several approximation formulas for the waverider compression surface are established. A CFD algorithm is used to calculate flow fields for the on-design case and a variety of off-design cases. The results are compared with HSDT, experiment, and other available CFD results. For the waverider shape used in previous investigations, the bow shock for the on-design condition stands off from the leading-edge tip of the waverider. It was found that this occurs because the tip was too thick according to the approximating shape formula that was used to describe the compression surface. When this was corrected, the bow shock became closer to attached as it should be. At Mach numbers greater than the design condition, a lambda-shock configuration develops near the tip of the compression surface. At negative angles of attack, other complicated shock patterns occur near the leading-edge tip. These heretofore unknown flow patterns show the power and utility of CFD for investigating novel hypersonic configurations such as waveriders.

Yoon, Bok-Hyun↗
NASA NTRS2011

A Boundary Condition Relaxation Algorithm for Strongly Coupled, Ablating Flows Including Shape Change

Implementations of a model for equilibrium, steady-state ablation boundary conditions are tested for the purpose of providing strong coupling with a hypersonic flow solver. The objective is to remove correction factors or film cooling approximations that are usually applied in coupled implementations of the flow solver and the ablation response. Three test cases are considered - the IRV-2, the Galileo probe, and a notional slender, blunted cone launched at 10 km/s from the Earth's surface. A successive substitution is employed and the order of succession is varied as a function of surface temperature to obtain converged solutions. The implementation is tested on a specified trajectory for the IRV-2 to compute shape change under the approximation of steady-state ablation. Issues associated with stability of the shape change algorithm caused by explicit time step limits are also discussed.

Gnoffo, Peter A.↗
DOE OSTI2024

Semicoherent symmetric quantum processes: Theory and applications

Discovering pragmatic and efficient approaches to construct ε-approximations of quantum operators such as real (imaginary) time-evolution propagators in terms of the basic quantum operations (gates) is challenging. Prior ε-approximations are invaluable, in that they enable the compilation of classical and quantum algorithm modeling of, e.g., dynamical and thermodynamic quantum properties. In parallel, symmetries are powerful tools concisely describing the fundamental laws of nature; the symmetric underpinnings of physical laws have consistently provided profound insights and substantially increased predictive power. In this work, we consider the interplay between the ε-approximate processes and the exact symmetries in a semicoherent context—where measurements occur at each logical clock cycle. Here we draw inspiration from Pascual Jordan's groundbreaking formulation of nonassociative, but commutative, symmetric algebraic form. Our symmetrized formalism is then applied in various domains such as quantum random walks, real-time evolutions, variational algorithm ansatzes, and efficient entanglement verification. Our work paves the way for a deeper understanding and greater appreciation of how symmetries can be used to control quantum dynamics in settings where coherence is a limited resource.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Learning Functions Varying along a Central Subspace

Many functions of interest are in a high-dimensional space but exhibit low-dimensional structures. This paper studies regression of an s-Hölder function in $R^D$ which varies along a central subspace of dimension $d$ while $d \ll D$. A direct approximation of $f$ in $R^D$ with an accuracy $\varepsilon$ requires the number of samples in the order of $\varepsilon^{-(2s+D)/s}$. In this paper, we analyze the generalized contour regression (GCR) algorithm for the estimation of the central subspace and use piecewise polynomials for function approximation. GCR is among the best estimators for the central subspace, but its sample complexity is an open question. In this paper, we partially answer this questions by proving that if a variance quantity is exactly known, GCR leads to a mean squared estimation error of $O(n^{-1})$ for the central subspace. The estimation error of this variance quantity is also given in this paper. The mean squared regression error of $f$ is proved to be in the order of $(n/\log n)^{-\frac{2s}{2s+d}}$, where the exponent depends on the dimension of the central subspace instead of the ambient space . This result demonstrates that GCR is effective in learning the low-dimensional central subspace. We also propose a modified GCR with improved efficiency. Here, the convergence rate is validated through several numerical experiments.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1999

Angular and Seasonal Variation of Spectral Surface Reflectance Ratios: Implications for the Remote Sensing of Aerosol over Land

We obtain valuable information on the angular and seasonal variability of surface reflectance using a hand-held spectrometer from a light aircraft. The data is used to test a procedure that allows us to estimate visible surface reflectance from the longer wavelength 2.1 micrometer channel (mid-IR). Estimating or avoiding surface reflectance in the visible is a vital first step in most algorithms that retrieve aerosol optical thickness over land targets. The data indicate that specular reflection found when viewing targets from the forward direction can severely corrupt the relationships between the visible and 2.1 micrometer reflectance that were derived from nadir data. There is a month by month variation in the ratios between the visible and the mid-IR, weakly correlated to the Normalized Difference Vegetation Index (NDVI). If specular reflection is not avoided, the errors resulting from estimating surface reflectance from the mid-IR exceed the acceptable limit of DELTA-rho approximately 0.01 in roughly 40% of the cases, using the current algorithm. This is reduced to 25% of the cases if specular reflection is avoided. An alternative method that uses path radiance rather than explicitly estimating visible surface reflectance results in similar errors. The two methods have different strengths and weaknesses that require further study.

Remer, L. A.↗
DOE OSTI2024

Stochastic Approximation for Multi-period Simulation Optimization with Streaming Input Data

We consider a continuous-valued simulation optimization (SO) problem, where a simulator is built to optimize an expected performance measure of a real-world system while parameters of the simulator are estimated from streaming data collected periodically from the system. At each period, a new batch of data is combined with the cumulative data and the parameters are re-estimated with higher precision. The system requires the decision variable to be selected in all periods. Therefore, it is sensible for the decision-maker to update the decision variable at each period by solving a more precise SO problem with the updated parameter estimate to reduce the performance loss with respect to the target system. We define this decision-making process as the multi-period SO problem and introduce a multi-period stochastic approximation (SA) framework that generates a sequence of solutions. Two algorithms are proposed: Re-start SA (ReSA) reinitializes the stepsize sequence in each period, whereas Warm-start SA (WaSA) carefully tunes the stepsizes, taking both fewer and shorter gradient-descent steps in later periods as parameter estimates become increasingly more precise. We show that under suitable strong convexity and regularity conditions, ReSA and WaSA achieve the best possible convergence rate in expected sub-optimality either when an unbiased or a simultaneous perturbation gradient estimator is employed, while WaSA accrues significantly lower computational cost as the number of periods increases. In addition, we present the regularized ReSA, which obviates the need to know the strong convexity constant and achieves the same convergence rate at the expense of additional computation.

Computer Science↗
DOE OSTI2024

Resonance compensation at the CERN PS booster aided by Bayesian optimization and BOBYQA

The CERN Proton Synchrotron Booster (PSB) operation involves the crossing of multiple resonance lines in the tune diagram. Loss maps from dynamic tune scans are a helpful way to visualize and quantify the strength of such resonances. Sextupole and octupole correctors can be used in order to partially or fully compensate multiple resonance lines, i.e., third and fourth order lines. The following work explores the application of advanced optimization algorithms such as Bayesian Optimization and Bound Optimization By Quadratic Approximation (BOBYQA) in order to compensate these resonance lines with available correctors.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Beam correction for multi-pass arcs in FFA@CEBAF: status update

This work examines the multi-pass steering of six electron beams in an FFA arc ranging from approximately 10.5 GeV to 22 GeV. Shown here is an algorithm based on singular value decomposition (SVD) to successfully steer all six beams through the arc given precise knowledge of all beam positions at each of one hundred and one diagnostic locations with one hundred individual corrector magnets: that is successive application of SVD to different 100 × 101 response matrices—one for each beam energy. Further, a machine learning scheme is developed which only requires knowledge of the energy-averaged beam position at each location to provide equivalent steering. Extension of this scheme to other beam optics quantities as well as transverse and longitudinal coupling is explored.

Accelerator Physics↗
NASA NTRS1975

A general algorithm using finite element method for aerodynamic configurations at low speeds

A finite element algorithm for numerical simulation of two-dimensional, incompressible, viscous flows was developed. The Navier-Stokes equations are suitably modelled to facilitate direct solution for the essential flow parameters. A leap-frog time differencing and Galerkin minimization of these model equations yields the finite element algorithm. The finite elements are triangular with bicubic shape functions approximating the solution space. The finite element matrices are unsymmetrically banded to facilitate savings in storage. An unsymmetric L-U decomposition is performed on the finite element matrices to obtain the solution for the boundary value problem.

Balasubramanian, R.↗
NASA NTRS1977

The use of the LANDSAT data collection system and imagery in reservoir management and operation

The author has identified the following significant results. An increase in the data collection system's (DCS) ability to function in the flood control mission with no additional manpower was demonstrated during the storms which struck New England during April and May of 1975 and August 1976. It was found that for this watershed, creditable flood hydrographs could be generated from DCS data. It was concluded that an ideal DCS for reservoir regulation would draw features from LANDSAT and GOES. MSS grayscale computer printout and a USGS topographic map were compared, yielding an optimum computer classification map of the wetland areas of the Merrimack River estuary. A classification accuracy of 75% was obtained for the wetlands unit, taking into account the misclassified and the unclassified pixels. The MSS band 7 grayscale printouts of the Franklin Falls reservoir showed good agreement to USGS topographic maps in total area of water depicted at the low water reservoir stage and at the maximum inundation level. Preliminary analysis of the LANDSAT digital data using the GISS computer algorithms showed that the radiance of snow cover/vegetation varied from approximately 20 mW/sq cm sr in nonvegetated areas to less than 4 mW/sq cm sr for densely covered forested area.

Cooper, S.↗
NASA NTRS1979

Numerical methods of solving a system of multi-dimensional nonlinear equations of the diffusion type

The principles of conservation and stability of difference schemes achieved using the iteration control method were examined. For the schemes obtained of the predictor-corrector type, the conversion was proved for the control sequences of approximate solutions to the precise solutions in the Sobolev metrics. Algorithms were developed for reducing the differential problem to integral relationships, whose solution methods are known, were designed. The algorithms for the problem solution are classified depending on the non-linearity of the diffusion coefficients, and practical recommendations for their effective use are given.

Agapov, A. V.↗
NASA NTRS1979

A fast Cauchy-Riemann solver

The inhomogeneous Cauchy-Riemann equations in a rectangle are discretized by a finite difference approximation. Several different boundary conditions are treated explicitly, leading to algorithms which have overall second-order accuracy. All boundary conditions with either u or v prescribed along a side of the rectangle can be treated by similar methods. The algorithms presented here have nearly minimal time and storage requirements and seem suitable for development into a general-purpose direct Cauchy-Riemann solver for arbitrary boundary conditions.

Ghil, M.↗
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 NTRS1983

A grid-embedding transonic flow analysis computer program for wing/nacelle configurations

An efficient grid-interfacing zonal algorithm was developed for computing the three-dimensional transonic flow field about wing/nacelle configurations. the algorithm uses the full-potential formulation and the AF2 approximate factorization scheme. The flow field solution is computed using a component-adaptive grid approach in which separate grids are employed for the individual components in the multi-component configuration, where each component grid is optimized for a particular geometry such as the wing or nacelle. The wing and nacelle component grids are allowed to overlap, and flow field information is transmitted from one grid to another through the overlap region using trivariate interpolation. This report represents a discussion of the computational methods used to generate both the wing and nacelle component grids, the technique used to interface the component grids, and the method used to obtain the inviscid flow solution. Computed results and correlations with experiment are presented. also presented are discussions on the organization of the wing grid generation (GRGEN3) and nacelle grid generation (NGRIDA) computer programs, the grid interface (LK) computer program, and the wing/nacelle flow solution (TWN) computer program. Descriptions of the respective subroutines, definitions of the required input parameters, a discussion on interpretation of the output, and the sample cases illustrating application of the analysis are provided for each of the four computer programs.

Atta, E. H.↗
NASA NTRS1991

Performance optimization of helicopter rotor blades

As part of a center-wide activity at NASA Langley Research Center to develop multidisciplinary design procedures by accounting for discipline interactions, a performance design optimization procedure is developed. The procedure optimizes the aerodynamic performance of rotor blades by selecting the point of taper initiation, root chord, taper ratio, and maximum twist which minimize hover horsepower while not degrading forward flight performance. The procedure uses HOVT (a strip theory momentum analysis) to compute the horse power required for hover and the comprehensive helicopter analysis program CAMRAD to compute the horsepower required for forward flight and maneuver. The optimization algorithm consists of the general purpose optimization program CONMIN and approximate analyses. Sensitivity analyses consisting of derivatives of the objective function and constraints are carried out by forward finite differences. The procedure is applied to a test problem which is an analytical model of a wind tunnel model of a utility rotor blade.

Walsh, Joanne L.↗
NASA NTRS1990

Efficient numerical simulation of electron states in quantum wires

A new algorithm is presented for the numerical simulation of electrons in a quantum wire as described by a two-dimensional eigenvalue problem for Schroedinger's equation coupled with Poisson's equation. Initially, the algorithm employs an underrelaxed fixed point iteration to generate an approximation which is reasonably close to the solution. Subsequently, this approximate solution is employed as an initial guess for a Jacobian-free implementation of an approximate Newton method. In this manner the nonlinearity in the model is dealt with effectively. The effectiveness of this approach is demonstrated in a set of numerical experiments which study the electron states on the cross section of a quantum wire structure based on III-V semiconductors at 4.2 and 77 K.

Kerkhoven, Thomas↗
NASA NTRS1993

Numerical model for dendritic solidification of binary alloys

A finite element model capable of simulating solidification of binary alloys and the formation of freckles is presented. It uses a single system of equations to deal with the all-liquid region, the dendritic region, and the all-solid region. The dendritic region is treated as an anisotropic porous medium. The algorithm uses the bilinear isoparametric element, with a penalty function approximation and a Petrov-Galerkin formulation. Numerical simulations are shown in which an NH4Cl-H2O mixture and a Pb-Sn alloy melt are cooled. The solidification process is followed in time. Instabilities in the process can be clearly observed and the final compositions obtained.

Felicelli, S. D.↗