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 901 records · Page 50

Approximate Solutions Of Equations Of Steady Diffusion

Rigorous analysis yields reliable criteria for "best-fit" functions. Improved "curve-fitting" method yields approximate solutions to differential equations of steady-state diffusion. Method applies to problems in which rates of diffusion depend linearly or nonlinearly on concentrations of diffusants, approximate solutions analytic or numerical, and boundary conditions of Dirichlet type, of Neumann type, or mixture of both types. Applied to equations for diffusion of charge carriers in semiconductors in which mobilities and lifetimes of charge carriers depend on concentrations.

Edmonds, Larry D.↗

Approach for Uncertainty Propagation and Robust Design in CFD Using Sensitivity Derivatives

This paper presents an implementation of the approximate statistical moment method for uncertainty propagation and robust optimization for a quasi 1-D Euler CFD (computational fluid dynamics) code. Given uncertainties in statistically independent, random, normally distributed input variables, a first- and second-order statistical moment matching procedure is performed to approximate the uncertainty in the CFD output. Efficient calculation of both first- and second-order sensitivity derivatives is required. In order to assess the validity of the approximations, the moments are compared with statistical moments generated through Monte Carlo simulations. The uncertainties in the CFD input variables are also incorporated into a robust optimization procedure. For this optimization, statistical moments involving first-order sensitivity derivatives appear in the objective function and system constraints. Second-order sensitivity derivatives are used in a gradient-based search to successfully execute a robust optimization. The approximate methods used throughout the analyses are found to be valid when considering robustness about input parameter mean values.

Putko, Michele M.↗

Inelastic scattering in atom-diatomic molecule collisions. I - Rotational transitions in the sudden approximation

The impact parameter method and the sudden approximation are applied to determine the total probability of inelastic rotational transitions arising from a collision of an atom and a homonuclear diatomic molecule at large impact parameters. An analytical approximation to this probability is found for conditions where the electron exchange or overlap forces dominate the scattering. An approximate upper bound to the range of impact parameters for which rotational scattering can be important is determined. In addition, an estimate of the total inelastic cross section is found at conditions for which a statistical model describes the scattering well. The results of this analysis are applied to Ar-O2 collisions and may be readily applied to other combinations of atoms and molecules.

Stallcop, J. R.↗

Response Surface Model Building and Multidisciplinary Optimization Using D-Optimal Designs

This paper discusses response surface methods for approximation model building and multidisciplinary design optimization. The response surface methods discussed are central composite designs, Bayesian methods and D-optimal designs. An over-determined D-optimal design is applied to a configuration design and optimization study of a wing-body, launch vehicle. Results suggest that over determined D-optimal designs may provide an efficient approach for approximation model building and for multidisciplinary design optimization.

Unal, Resit↗

Heats of Segregation of BCC Binaries from ab Initio and Quantum Approximate Calculations

We compare dilute-limit heats of segregation for selected BCC transition metal binaries computed using ab initio and quantum approximate energy methods. Ab initio calculations are carried out using the CASTEP plane-wave pseudopotential computer code, while quantum approximate results are computed using the Bozzolo-Ferrante-Smith (BFS) method with the most recent LMTO-based parameters. Quantum approximate segregation energies are computed with and without atomistic relaxation, while the ab initio calculations are performed without relaxation. Results are discussed within the context of a segregation model driven by strain and bond-breaking effects. We compare our results with full-potential quantum calculations and with available experimental results.

Good, Brian S.↗

Approximations of distant retrograde orbits for mission design

Distant retrograde orbits (DROs) are stable periodic orbit solutions of the equations of motion in the circular restricted three body problem. Since no closed form expressions for DROs are known, we present methods for approximating a family of planar DROs for an arbitrary, fixed mass ratio. Furthermore we give methods for computing the first and second derivatives of the position and velocity with respect to the variables that parameterize the family. The approximation and derivative methods described allow a mission designer to target specific DROs or a range of DROs with no regard to phasing in contrast to the more limited case of targeting a six-state only.

Distant Retrograde Orbits (DRO)↗

Nucleon clustering at kinetic freezeout of heavy-ion collisions via path-integral Monte Carlo

Clustering of the four-nucleon system at kinetic freezeout conditions is studied using path-integral Monte Carlo techniques. This method seeks to improve upon previous calculations which relied on approximate semiclassical methods or few-body quantum mechanics. Estimates are given for the decay probabilities of the 4N system into various light nuclei decay channels and the strength of spatial correlations is characterized. Additionally, a simple model is presented to describe the impact of this clustering on nucleon multiplicity distributions. Additionally, the effects of a possible modification of the inter-nucleon interaction due to the close critical line (and hypothetical QCD critical point) on the clustering are also studied.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Trigonometric polynomial approximation, K-functionals and generalized moduli of smoothness

Best approximation and approximation by families of linear polynomial operators (FLPO) in the spaces L{sub p}, 0<p⩽+∞, are investigated for periodic functions of an arbitrary number of variables in terms of the generalized modulus of smoothness generated by a periodic generator which, near the origin, is assumed to be close in a certain sense to some homogeneous function of positive order. Direct and inverse theorems (Jackson- and Bernstein-type estimates) are proved; conditions on the generators are obtained under which the approximation error by an FLPO is equivalent to an appropriate modulus of smoothness. These problems are solved by going over from the modulus to an equivalent K-functional. The general results obtained are applied to classical objects in the theory of approximation and smoothness. In particular, they are applied to the methods of approximation generated by Fejér, Riesz and Bochner-Riesz kernels, and also to the moduli of smoothness and K-functionals corresponding to the conventional, Weyl and Riesz derivatives and to the Laplace operator. Bibliography: 24 titles. (paper)

97 MATHEMATICS AND COMPUTING↗

Computation research

Least squares method used in linearizing roots of polynomial and to derive approximations

APPROXIMATION METHOD↗

Transient cooling of solid bodies of classical form by radiation

An approximate analytic method is presented for analysis of the unsteady process of radiative cooling of solid bodies of classical form. The nonlinear heat transfer problem is solved by the cascade linearization technique with use of the iteration method. Comparison of the results obtained even in the first approximation with the available numerical solutions indicates adequate engineering accuracy of the proposed technique.

Novikov, V. S.↗

Implicit flux-split schemes for the Euler equations

Recent progress in the development of implicit algorithms for the Euler equations using the flux-vector splitting method is described. Comparisons of the relative efficiency of relaxation and spatially-split approximately factored methods on a vector processor for two-dimensional flows are made. For transonic flows, the higher convergence rate per iteration of the Gauss-Seidel relaxation algorithms, which are only partially vectorizable, is amply compensated for by the faster computational rate per iteration of the approximately factored algorithm. For supersonic flows, the fully-upwind line-relaxation method is more efficient since the numerical domain of dependence is more closely matched to the physical domain of dependence. A hybrid three-dimensional algorithm using relaxation in one coordinate direction and approximate factorization in the cross-flow plane is developed and applied to a forebody shape at supersonic speeds and a swept, tapered wing at transonic speeds.

Thomas, J. L.↗

The Transference Number

The performance of rechargeable batteries and other electrochemical systems depends on the rate at which the working ion (often a cation) is transported from one electrode to the other. The cation transference number is an important transport parameter that affects this rate. The purpose of this perspective is to distinguish between approximate and rigorous methods used in the literature to measure the transference number. We emphasize the fact that this parameter is dependent on the reference frame used in the analysis; care must be taken when comparing values obtained from different sources to account for differences in reference frames. We present data obtained from a well‐characterized electrolyte. We compare rigorously determined transference numbers in two reference frames with values obtained by an approximate method. We conclude with a qualitative discussion of the relationship between the transference number and salt concentration gradients that are obtained when current is drawn through a battery.

Gao, Kevin W.↗

Revisiting the ODE Method for Recursive Algorithms: Fast Convergence Using Quasi Stochastic Approximation

Several decades ago, Profs. Sean Meyn and Lei Guo were postdoctoral fellows at ANU, where they shared interest in recursive algorithms. It seems fitting to celebrate Lei Guo's 60th birthday with a review of the ODE Method and its recent evolution. The method has been regarded as a technique for algorithm analysis. It is argued that this viewpoint is backwards: The original stochastic approximation method was surely motivated by an ODE, and tools for analysis came much later (based on establishing robustness of Euler approximations). The paper presents a brief survey of recent research in machine learning that shows the power of algorithm design in continuous time, following by careful approximation to obtain a practical recursive algorithm. While these methods are usually presented in a stochastic setting, this is not a prerequisite. In fact, recent theory shows that rates of convergence can be dramatically accelerated by applying techniques inspired by quasi Monte-Carlo. Subject to conditions, the optimal rate of convergence can be obtained by applying the averaging technique of Polyak and Ruppert. The conditions are not universal, but theory suggests alternatives to achieve acceleration. The theory is illustrated with applications to gradient-free optimization, and policy gradient algorithms for reinforcement learning.

learning and adaptive systems in artificial intell↗

Fourth order exponential time differencing method with local discontinuous Galerkin approximation for coupled nonlinear Schrodinger equations

In this paper, we study a local discontinuous Galerkin method combined with fourth order exponential time differencing Runge-Kutta time discretization and a fourth order conservative method for solving the nonlinear Schrödinger equations. Based on different choices of numerical fluxes, we propose both energy-conserving and energy-dissipative local discontinuous Galerkin methods, and have proven the error estimates for the semi-discrete methods applied to linear Schrödinger equation. The numerical methods are proven to be highly efficient and stable for long-range soliton computations. Finally, extensive numerical examples are provided to illustrate the accuracy, efficiency and reliability of the proposed methods.

97 MATHEMATICS AND COMPUTING↗

Methods of Constructing a Blended Performance Function Suitable for Formation Flight

This paper presents two methods for constructing an approximate performance function of a desired parameter using correlated parameters. The methods are useful when real-time measurements of a desired performance function are not available to applications such as extremum-seeking control systems. The first method approximates an a priori measured or estimated desired performance function by combining real-time measurements of readily available correlated parameters. The parameters are combined using a weighting vector determined from a minimum-squares optimization to form a blended performance function. The blended performance function better matches the desired performance function mini- mum than single-measurement performance functions. The second method expands upon the first by replacing the a priori data with near-real-time measurements of the desired performance function. The resulting blended performance function weighting vector is up- dated when measurements of the desired performance function are available. Both methods are applied to data collected during formation- flight-for-drag-reduction flight experiments.

control systems↗

Automated detection of pulmonary nodules in PET/CT images: Ensemble false-positive reduction using a convolutional neural network technique

Purpose: Automated detection of solitary pulmonary nodules using positron emission tomography (PET) and computed tomography (CT) images shows good sensitivity; however, it is difficult to detect nodules in contact with normal organs, and additional efforts are needed so that the number of false positives (FPs) can be further reduced. In this paper, the authors propose an improved FP-reduction method for the detection of pulmonary nodules in PET/CT images by means of convolutional neural networks (CNNs). Methods: The overall scheme detects pulmonary nodules using both CT and PET images. In the CT images, a massive region is first detected using an active contour filter, which is a type of contrast enhancement filter that has a deformable kernel shape. Subsequently, high-uptake regions detected by the PET images are merged with the regions detected by the CT images. FP candidates are eliminated using an ensemble method; it consists of two feature extractions, one by shape/metabolic feature analysis and the other by a CNN, followed by a two-step classifier, one step being rule based and the other being based on support vector machines. Results: The authors evaluated the detection performance using 104 PET/CT images collected by a cancer-screening program. The sensitivity in detecting candidates at an initial stage was 97.2%, with 72.8 FPs/case. After performing the proposed FP-reduction method, the sensitivity of detection was 90.1%, with 4.9 FPs/case; the proposed method eliminated approximately half the FPs existing in the previous study. Conclusions: An improved FP-reduction scheme using CNN technique has been developed for the detection of pulmonary nodules in PET/CT images. The authors’ ensemble FP-reduction method eliminated 93% of the FPs; their proposed method using CNN technique eliminates approximately half the FPs existing in the previous study. These results indicate that their method may be useful in the computer-aided detection of pulmonary nodules using PET/CT images.

60 APPLIED LIFE SCIENCES↗