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,027 records · Page 57

Rational RBF-based partition of unity method for efficiently and accurately approximating 3D objects

We consider the problem of reconstructing 3D objects via meshfree interpolation methods. In this framework, we usually deal with large data sets and thus develop an efficient local scheme via the well-known partition of unity method. The main contribution in this paper consists in constructing the local interpolants for the implicit interpolation by means of rational radial basis functions. Numerical experiments, devoted to test the accuracy of the scheme, confirm that the proposed method is particularly performing when 3D objects, or more in general implicit functions defined by scattered points, need to be approximated.

97 MATHEMATICS AND COMPUTING↗

An Ellipsoidal Model for Small Multilayer Particles

This paper presents an ellipsoidal model that is constructed for small layered nonspherical particles and methods for constructing “effective” multilayer ellipsoids, the light-scattering properties of which would be close to the corresponding properties of original particles. In the case of axisymmetric particles, prolate or oblate spheroids (ellipsoids of revolution) are implied. Numerical calculations of the polarizability and scattering cross sections of small layered nonspherical particles, including nonconfocal (similar) spheroids, Chebyshev particles, and pseudospheroids, are performed by different approximate and rigorous methods. Approximate approaches involve the use of an ellipsoidal model, in which the polarizability of a layered particle is determined in two ways. In the first case, the polarizability is calculated in the approximation of confocal spheroids, while, in the second case, it is sought as a linear combination of the polarizabilities of embedded spheroids proportionally to the volumes of layers. Among rigorous methods, the extended boundary conditions method and the generalized separation of variables method are applied. On the basis of a comparison of the results obtained with rigorous and approximate approaches, their drawbacks and advantages are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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

We compare dilute-limit segregation energies 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 parameters. Quantum approximate segregation energies are computed with and without atomistic relaxation. Results are discussed within the context of segregation models driven by strain and bond-breaking effects. We compare our results with full-potential quantum calculations and with available experimental results.

Good, Brian S.↗

Surface Segregation Energies of BCC Binaries from Ab Initio and Quantum Approximate Calculations

We compare dilute-limit segregation energies for selected BCC transition metal binaries computed using ab initio and quantum approximate energy method. 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 parameterization. Quantum approximate segregation energies are computed with and without atomistic relaxation. The ab initio calculations are performed without relaxation for the most part, but predicted relaxations from quantum approximate calculations are used in selected cases to compute approximate relaxed ab initio segregation energies. Results are discussed within the context of segregation models driven by strain and bond-breaking effects. We compare our results with other quantum approximate and ab initio theoretical work, and available experimental results.

Good, Brian S.↗

Numerical multi-scaling method to solve the linear stochastic partial differential equations

In this paper, we propose a multi-scaling method to solve a class of the stochastic partial differential equations (SPDEs) of Itô-type. By this method, we approximate the solution of the SPDEs with strongly elliptic operator on a finite domain. The method is based on B-spline wavelet approximations; some of these functions are reshaped to satisfy on boundary conditions exactly. We prove the consistency and stability of the method. Illustrative examples are included to demonstrate the validity and applicability of our proposed technique.

97 MATHEMATICS AND COMPUTING↗

Controlled Nonlinear Stochastic Delay Equations: Part II: Approximations and Pipe-Flow Representations

This is the second part of a work dealing with key issues that have not been addressed in the modeling and numerical optimization of nonlinear stochastic delay systems. We consider new classes of models, such as those with nonlinear functions of several controls (such as products), each with is own delay, controlled random Poisson measure driving terms, admissions control with delayed retrials, and others. Part I was concerned with issues concerning the class of admissible controls and their approximations, since the classical definitions are inadequate for our models. This part is concerned with transportation equation representations and their approximations. Such representations of nonlinear stochastic delay models have been crucial in the development of numerical algorithms with much reduced memory and computational requirements. The representations for the new models are not obvious and are developed. They also provide a template for the adaptation of the Markov chain approximation numerical methods.

97 MATHEMATICS AND COMPUTING↗

Geometric multigrid for an implicit-time immersed boundary method

The immersed boundary (IB) method is an approach to fluid-structure interaction that uses Lagrangian variables to describe the deformations and resulting forces of the structure and Eulerian variables to describe the motion and forces of the fluid. Explicit time stepping schemes for the IB method require solvers only for Eulerian equations, for which fast Cartesian grid solution methods are available. Such methods are relatively straightforward to develop and are widely used in practice but often require very small time steps to maintain stability. Implicit-time IB methods permit the stable use of large time steps, but efficient implementations of such methods require significantly more complex solvers that effectively treat both Lagrangian and Eulerian variables simultaneously. Moreover, several different approaches to solving the coupled Lagrangian-Eulerian equations have been proposed, but a complete understanding of this problem is still emerging. This paper presents a geometric multigrid method for an implicit-time discretization of the IB equations. This multigrid scheme uses a generalization of box relaxation that is shown to handle problems in which the physical stiffness of the structure is very large. Numerical examples are provided to illustrate the effectiveness and efficiency of the algorithms described herein. Finally, these tests show that using multigrid as a preconditioner for a Krylov method yields improvements in both robustness and efficiency as compared to using multigrid as a solver. They also demonstrate that with a time step 100–1000 times larger than that permitted by an explicit IB method, the multigrid-preconditioned implicit IB method is approximately 50–200 times more efficient than the explicit method.

97 MATHEMATICS AND COMPUTING↗

High conductivity magnetic tearing instability

Linearized equations of magnetohydrodynamics are used to investigate the tearing mode, for arbitrary values of the conductivity, through a consideration of the additional effect of the electron-inertia contribution to Ohm's law. A description is provided of the equilibrium and subsequent instability in the magnetohydrodynamic approximation. A method for solving the perturbation equations in the linear approximation is discussed and attention is given to the results in the high conductivity limit.

Cross, M. A.↗

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

An implementation of the approximate statistical moment method for uncertainty propagation and robust optimization for quasi 3-D Euler CFD code is presented. Given uncertainties in statistically independent, random, normally distributed input variables, first- and second-order statistical moment procedures are 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, these 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.↗

Accelerated solution of discrete ordinates approximation to the Boltzmann transport equation via model reduction

Radiation heat transfer is an important phenomenon in many physical systems of practical interest. When participating media is important, the radiative transfer equation (RTE) must be solved for the radiative intensity as a function of location, time, direction, and wavelength. In many heat-transfer applications, a quasi-steady assumption is valid, thereby removing time dependence. The dependence on wavelength is often treated through a weighted sum of gray gases (WSGG) approach. The discrete ordinates method (DOM) is one of the most common methods for approximating the angular (i.e., directional) dependence. The DOM exactly solves for the radiative intensity for a finite number of discrete ordinate directions and computes approximations to integrals over the angular space using a quadrature rule; the chosen ordinate directions correspond to the nodes of this quadrature rule. This paper applies a projection-based model-reduction approach to make high-order quadrature computationally feasible for the DOM for purely absorbing applications. First, the proposed approach constructs a reduced basis from (high-fidelity) solutions of the radiative intensity computed at a relatively small number of ordinate directions. Then, the method computes inexpensive approximations of the radiative intensity at the (remaining) quadrature points of a high-order quadrature using a reduced-order model constructed from the reduced basis. Finally, this results in a much more accurate solution than might have been achieved using only the ordinate directions used to compute the reduced basis. One- and three-dimensional test problems highlight the efficiency of the proposed method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A methodology for airplane parameter estimation and confidence interval determination in nonlinear estimation problems

An algorithm for maximum likelihood (ML) estimation is developed with an efficient method for approximating the sensitivities. The ML algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. With the fitted surface, sensitivity information can be updated at each iteration with less computational effort than that required by either a finite-difference method or integration of the analytically determined sensitivity equations. MNRES eliminates the need to derive sensitivity equations for each new model, and thus provides flexibility to use model equations in any convenient format. A random search technique for determining the confidence limits of ML parameter estimates is applied to nonlinear estimation problems for airplanes. The confidence intervals obtained by the search are compared with Cramer-Rao (CR) bounds at the same confidence level. The degree of nonlinearity in the estimation problem is an important factor in the relationship between CR bounds and the error bounds determined by the search technique. Beale's measure of nonlinearity is developed in this study for airplane identification problems; it is used to empirically correct confidence levels and to predict the degree of agreement between CR bounds and search estimates.

Murphy, P. C.↗

An algorithm for linearizing convex extremal problems

This paper suggests a method of approximating the solution of minimization problems for convex functions of several variables under convex constraints is suggested. The main idea of this approach is the approximation of a convex function by a piecewise linear function, which results in replacing the problem of convex programming by a linear programming problem. To carry out such an approximation, the epigraph of a convex function is approximated by the projection of a polytope of greater dimension. In the first part of the paper, the problem is considered for functions of one variable. In this case, an algorithm for approximating the epigraph of a convex function by a polygon is presented, it is shown that this algorithm is optimal with respect to the number of vertices of the polygon, and exact bounds for this number are obtained. After this, using an induction procedure, the algorithm is generalized to certain classes of functions of several variables. Applying the suggested method, polynomial algorithms for an approximate calculation of the L{sub p}-norm of a matrix and of the minimum of the entropy function on a polytope are obtained. Bibliography: 19 titles.

97 MATHEMATICS AND COMPUTING↗

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↗

Thermodynamics of an interacting Fermi system in the static fluctuation approximation

We suggest a new method of calculation of the equilibrium correlation functions of an arbitrary order for the interacting Fermi-gas model in the framework of the static fluctuation approximation method. This method based only on a single and controllable approximation allows obtaining the so-called far-distance equations. These equations connecting the quantum states of a Fermi particle with variables of the local field operator contain all necessary information related to the calculation of the desired correlation functions and basic thermodynamic parameters of the many-body system. The basic expressions for the mean energy and heat capacity for the electron gas at low temperatures in the high-density limit were obtained. All expressions are given in the units of r{sub s}, where r{sub s} determines the ratio of a mean distance between electrons to the Bohr radius a{sub 0}. In these expressions, we calculate terms of the respective order r{sub s} and r{sub s}{sup 2}. It is also shown that the static fluctuation approximation allows finding the terms related to higher orders of the decomposition with respect to the parameter r{sub s}.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Approximate Hessian for accelerating ab initio structure relaxation by force fitting

We present a method to approximate the Hessian matrix of the Born-Oppenheimer energy landscape by using a simple force field model whose parameters are fitted to on-the-flight ab initio results. The inversed Hessian matrix is used as the preconditioner of conjugate gradient algorithms to speed up the atomic structure relaxation, resulting in a speedup factor of 2 to 5 on systems of bulk, slab, sheets, and atomic clusters. Because the force field model employed is simple and general, the parameter fitting is straightforward; the method is applicable to a variety of complicated systems for minimum structure relaxation. In the metal cluster new structure search, the new method yields better structures than the one obtained before with conventional algorithms.

36 MATERIALS SCIENCE↗