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 433 records · Page 24

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↗

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↗

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↗

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↗

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↗

The widths of classes of analytic functions in a disc

The precise values of several n-widths of the classes W{sup m}{sub p,R}({Psi}), 1{<=}p<{infinity}, m element of N, R{>=}1, in the Banach spaces L{sub p,{gamma}}and B{sub p,{gamma}}are calculated, where {gamma} is a weight. These are classes of analytic functions f in a disc of radius R whose mth derivatives f{sup (m)} belong to the Hardy space H{sub p,R} and whose angular boundary values have averaged moduli of smoothness of second order which are majorized by the fixed function {Psi} on the point set {l_brace}{pi}/(2k){r_brace}{sub ki} {sub sanelementof} {sub N}. For the classes W{sup m}{sub p,R}({Psi}) best linear methods of approximation in L{sub p,{gamma}}are developed. Extremal problems of related content are also considered. Bibliography: 37 titles.

97 MATHEMATICS AND COMPUTING↗

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↗

Approximate error conjugation gradient minimization methods

In one embodiment, a method includes selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, calculating an approximate error using the subset of rays, and calculating a minimum in a conjugate gradient direction based on the approximate error. In another embodiment, a system includes a processor for executing logic, logic for selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, logic for calculating an approximate error using the subset of rays, and logic for calculating a minimum in a conjugate gradient direction based on the approximate error. In other embodiments, computer program products, methods, and systems are described capable of using approximate error in constrained conjugate gradient minimization problems.

97 MATHEMATICS AND COMPUTING↗

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.↗

Strain induced modification in phonon dispersion curves of monolayer boron pnictides

In the frame work of density functional theory, the biaxial strain induced phonon dispersion curves of monolayer boron pnictides (BX, X = N, P, As, and Sb) have been investigated. The electron-ion interactions have been modelled using ultrasoft pseudopotentials while exchange-correlation energies have been approximated by the method of local density approximation in the parameterization of Perdew-Zunger. The longitudinal and transverse acoustic phonon modes of boron pnictide sheets show linear dependency on wave vector k{sup →} while out of plane mode varies as k{sup 2}. The in-plane longitudinal and out of plane transverse optical modes in boron nitride displaying significant dispersion similar to graphene. We have analyzed the biaxial strain dependent behaviour of out of plane acoustic phonon mode which is linked to ripple for four BX sheets using a model equation with shell elasticity theory. The strain induces the hardening of this mode with tendency to become more linear with increase in strain percentage. The strain induced hardening of out of plane acoustic phonon mode indicates the absence of rippling in these compounds. Our band structure calculations for both unstrained and strained 2D h-BX are consistent with previous calculations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

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↗

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↗

Generalized density matrix reexamined: Microscopic approach to collective dynamics in soft spherical nuclei

The generalized density matrix method is used to calculate microscopically the parameters of the collective Hamiltonian. Higher-order anharmonicities are obtained consistently with the lowest-order results, the mean field (Hartree-Fock-Bogoliubov equation), and the harmonic potential (quasiparticle random-phase approximation). The method is applied to soft spherical nuclei, where the anharmonicities are essential for restoring the stability of the system, as the harmonic potential becomes small or negative. The approach is tested in three models of increasing complexity: the Lipkin model, model with factorizable forces, and the quadrupole plus pairing model.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗