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,657 records · Page 92

A hybrid-perturbation-Galerkin technique which combines multiple expansions

A two-step hybrid perturbation-Galerkin method for the solution of a variety of differential equations type problems is found to give better results when multiple perturbation expansions are employed. The method assumes that there is parameter in the problem formulation and that a perturbation method can be sued to construct one or more expansions in this perturbation coefficient functions multiplied by computed amplitudes. In step one, regular and/or singular perturbation methods are used to determine the perturbation coefficient functions. The results of step one are in the form of one or more expansions each expressed as a sum of perturbation coefficient functions multiplied by a priori known gauge functions. In step two the classical Bubnov-Galerkin method uses the perturbation coefficient functions computed in step one to determine a set of amplitudes which replace and improve upon the gauge functions. The hybrid method has the potential of overcoming some of the drawbacks of the perturbation and Galerkin methods as applied separately, while combining some of their better features. The proposed method is applied, with two perturbation expansions in each case, to a variety of model ordinary differential equations problems including: a family of linear two-boundary-value problems, a nonlinear two-point boundary-value problem, a quantum mechanical eigenvalue problem and a nonlinear free oscillation problem. The results obtained from the hybrid methods are compared with approximate solutions obtained by other methods, and the applicability of the hybrid method to broader problem areas is discussed.

Geer, James F.↗

A hybrid perturbation-Galerkin technique that combines multiple expansions

A two-step hybrid perturbation-Galerkin method for the solution of a variety of differential equations type problems is found to give better results when multiple perturbation expansions are employed. The method assumes that there is parameter in the problem formulation and that a perturbation method can be used to construct one or more expansions in this perturbation coefficient functions multiplied by computed amplitudes. In step one, regular and/or singular perturbation methods are used to determine the perturbation coefficient functions. The results of step one are in the form of one or more expansions each expressed as a sum of perturbation coefficient functions multiplied by a priori known gauge functions. In step two the classical Bubnov-Galerkin method uses the perturbation coefficient functions computed in step one to determine a set of amplitudes which replace and improve upon the gauge functions. The hybrid method has the potential of overcoming some of the drawbacks of the perturbation and Galerkin methods as applied separately, while combining some of their better features. The proposed method is applied, with two perturbation expansions in each case, to a variety of model ordinary differential equations problems including: a family of linear two-boundary-value problems, a nonlinear two-point boundary-value problem, a quantum mechanical eigenvalue problem and a nonlinear free oscillation problem. The results obtained from the hybrid methods are compared with approximate solutions obtained by other methods, and the applicability of the hybrid method to broader problem areas is discussed.

Geer, James F.↗

Stochastic modeling of catalytic processes in nanoporous materials: Beyond mean-field approach

Transport and reaction in zeolites and other porous materials, such as mesoporous silica particles, has been a focus of interest in recent years. This is in part due to the possibility of anomalous transport effects (e.g. single-file diffusion) and its impact in the reaction yield in catalytic processes. Computational simulations are often used to study these complex nonequilibrium systems. Computer simulations using Molecular Dynamics (MD) techniques are prohibitive, so instead coarse grained one-dimensional models with the aid of Kinetic Monte Carlo (KMC) simulations are used. Both techniques can be computationally expensive, both time and resource wise. These coarse-grained systems can be exactly described by a set of coupled stochastic master equations, that describe the reaction-diffusion kinetics of the system. The equations can be written exactly, however, coupling between the equations and terms within the equations make it impossible to solve them exactly; approximations must be made. One of the most common methods to obtain approximate solutions is to use Mean Field (MF) theory. MF treatments yield reasonable results at high ratios of reaction rate k to hop rate h of the particles, but fail completely at low k=h due to the over-estimation of fluxes of particles within the pore. We develop a method to estimate fluxes and intrapore diffusivity in simple one- dimensional reaction-diffusion models at high and low k=h, where the pores are coupled to an equilibrated three-dimensional fluid. We thus successfully describe analytically these simple reaction-diffusion one-dimensional systems. Extensions to models considering behavior with long range steric interactions and wider pores require determination of multiple boundary conditions. We give a prescription to estimate the required parameters for these simulations. For one dimensional systems, if single-file diffusion is relaxed, additional parameters to describe particle exchange have to be introduced. We use Langevin Molecular Dynamics (MD) simulations to assess these parameters.

36 MATERIALS SCIENCE↗

Analysis and Simulation of One-Dimensional Transport Models for Lithium Symmetric Cells

The main objective of this paper is to analyze transport models for lithium symmetric cells and arrive at an efficient model and code to simulate the same. Two one-dimensional models are considered. The first model uses the dilute solution Nernst–Planck equations in conjunction with the electroneutrality assumption (EN-NP model). For binary electrolytes, an analytical solution for electrolyte concentration is derived and compared with numerical solutions by an approximate finite volume method. The second approach relaxes the electroneutrality assumption by way of Poisson’s equation for the electrostatic potential (PNP model). The computational difficulties of the PNP model are tackled using the approximate finite volume method, with demonstrated convergence characteristics even with bulk dimensions several orders of magnitude larger than the characteristic double layer size. A robust code is developed for the PNP model. The computationally efficient transport models can facilitate simulations, physical understanding, and analysis. This is illustrated by a case study in which these models are coupled with modified kinetic models, which are then parameterized with experimental voltage response data using a systems-level approach. The estimated parameters provide further insight into the electrochemical phenomena underpinning voltage transitions in symmetric cells.

25 ENERGY STORAGE↗

Heuristic methods and performance bounds for photonic design

In the photonic design problem, a scientist or engineer chooses the physical parameters of a device to best match some desired device behavior. Many instances of the photonic design problem can be naturally stated as a mathematical optimization problem that is computationally difficult to solve globally. Because of this, several heuristic methods have been developed to approximately solve such problems. These methods often produce very good designs, and, in many practical applications, easily outperform ‘traditional’ designs that rely on human intuition. Yet, because these heuristic methods do not guarantee that the approximate solution found is globally optimal, the question remains of just how much better a designer might hope to do. This question is addressed by performance bounds or impossibility results, which determine a performance level that no design can achieve. We focus on algorithmic performance bounds, which involve substantial computation to determine. We illustrate a variety of both heuristic methods and performance bounds on two examples. In these examples (and many others not reported here) the performance bounds show that the heuristic designs are nearly optimal, and can be considered globally optimal in practice. This review serves to clearly set up the photonic design problem and unify existing approaches for calculating performance bounds, while also providing some natural generalizations and properties.

Angeris, Guillermo (ORCID:0000000249503990)↗

Approximation of periodic functions in the classes H{sub q}{sup {Omega}} by linear methods

The following result is proved: if approximations in the norm of L{sub {infinity}} (of H{sub 1}) of functions in the classes H{sub {infinity}}{sup {Omega}} (in H{sub 1}{sup {Omega}}, respectively) by some linear operators have the same order of magnitude as the best approximations, then the set of norms of these operators is unbounded. Also Bernstein's and the Jackson-Nikol'skii inequalities are proved for trigonometric polynomials with spectra in the sets Q(N) (in {Gamma}(N,{Omega})). Bibliography: 15 titles.

97 MATHEMATICS AND COMPUTING↗

Towards Off-policy Evaluation as a Prerequisite for Real-world Reinforcement Learning in Building Control

We present an initial study of off-policy evaluation (OPE), a problem prerequisite to real-world reinforcement learning (RL), in the context of building control. OPE is the problem of estimating a policy's performance without running it on the actual system, using historical data from the existing controller. It enables the control engineers to ensure a new, pretrained policy satisfies the performance requirements and safety constraints of a real-world system, prior to interacting with it. While many methods have been developed for OPE, no study has evaluated which ones are suitable for building operational data, which are generated by deterministic policies and have limited coverage of the state-action space. After reviewing existing works and their assumptions, we adopted the approximate model (AM) method. Furthermore, we used bootstrapping to quantify uncertainty and correct for bias. In a simulation study, we evaluated the proposed approach on 10 policies pretrained with imitation learning. On average, the AM method estimated the energy and comfort costs with 1.84% and 14.1% error, respectively.

Chen, B↗

Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras

The quantum approximate optimization algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the underlying algebraic properties of three QAOA ansätze for the maximum-cut problem on connected graphs, while focusing on the generated Lie algebras as well as their invariant subspaces. Specifically, we analyze the standard QAOA ansatz as well as the orbit and multiangle ansätze. We are able to fully characterize the Lie algebras of the multiangle ansatz across arbitrary connected graphs, finding that they only fall into one of just six families. Aside from the cycle and path graphs, the Lie dimensions for every graph are exponentially large in the system size, meaning that multiangle ansätze are extremely prone to exhibiting barren plateaus. Then, a similar quasi-graph-independent Lie-algebraic characterization beyond the multiangle ansatz is impeded as the circuit exhibits additional “hidden” symmetries besides those naturally arising from a certain parity-superselection operator and all automorphisms of the considered graph. Disregarding the “hidden” symmetries, we can upper bound the dimensions of the orbit and the standard Lie algebras, and the dimensions of the associated invariant subspaces are determined via explicit character formulas. To finish, we conjecture that (for most graphs) the standard Lie algebras have only components that are either exponential or that grow, at most, polynomially with the system size. This would imply that the QAOA is either prone to barren plateaus or classically simulable. More generally, our work provides a symmetry framework and tools to analyze any desired variational quantum algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The solution of transcendental equations

Some of the existing methods to globally approximate the roots of transcendental equations namely, Graeffe's method, are studied. Summation of the reciprocated roots, Whittaker-Bernoulli method, and the extension of Bernoulli's method via Koenig's theorem are presented. The Aitken's delta squared process is used to accelerate the convergence. Finally, the suitability of these methods is discussed in various cases.

Agrawal, K. M.↗

Iterative methods based upon residual averaging

Iterative methods for solving boundary value problems for systems of nonlinear partial differential equations are discussed. The methods involve subtracting an average of residuals from one approximation in order to arrive at a subsequent approximation. Two abstract methods in Hilbert space are given and application of these methods to quasilinear systems to give numerical schemes for such problems is demonstrated. Potential theoretic matters related to the iteration schemes are discussed.

Neuberger, J. W.↗

Design of structure/control systems with transient response constraints exhibiting relative minima

Structural optimization problems involving dynamic behavior constraints often exhibit nonconvex design spaces. The direct application of a global optimization algorithm requires a large number of function evaluations which in term require a large number of dynamic structural analyses. This work presents a strategy aimed at finding the global optimum for problems with transient dynamic behavior constraints based on approximation concepts. The method consists of generating and solving a sequence of approximate problems using a global optimizer. The approximations are explicit and capture the inherent nonconvexity of the exact functions. A simple example problem is presented.

Sepulveda, A. E.↗

Model reduction of nonsquare linear MIMO systems using multipoint matrix continued-fraction expansions

This paper deals with the multipoint Cauer matrix continued-fraction expansion (MCFE) for model reduction of linear multi-input multi-output (MIMO) systems with various numbers of inputs and outputs. A salient feature of the proposed MCFE approach to model reduction of MIMO systems with square transfer matrices is its equivalence to the matrix Pade approximation approach. The Cauer second form of the ordinary MCFE for a square transfer function matrix is generalized in this paper to a multipoint and nonsquare-matrix version. An interesting connection of the multipoint Cauer MCFE method to the multipoint matrix Pade approximation method is established. Also, algorithms for obtaining the reduced-degree matrix-fraction descriptions and reduced-dimensional state-space models from a transfer function matrix via the multipoint Cauer MCFE algorithm are presented. Practical advantages of using the multipoint Cauer MCFE are discussed and a numerical example is provided to illustrate the algorithms.

Guo, Tong-Yi↗

Calculation of the Coulomb Fission Cross Sections for Pb-Pb and Bi-Pb Interactions at 158 A GeV

The Weizsacker-Williams (WW) method of virtual quanta is used to make approximate cross section calculations for peripheral relativistic heavy-ion collisions. We calculated the Coulomb fission cross sections for projectile ions of Pb-208 and Bi-209 with energies of 158 A GeV interacting with a Pb-208 target. We also calculated the electromagnetic absorption cross section for Pb-208 ion interacting as described. For comparison we use both the full WW method and a standard approximate WW method. The approximate WW method in larger cross sections compared to the more accurate full WW method.

Poyser, William J.↗

The Best Rank-(R{sub 1},R{sub 2},R{sub 3}) Approximation of Tensors by Means of a Geometric Newton Method

In the matrix case, the best low-rank approximation can be obtained directly from the truncated singular value decomposition. However, the best rank-(R{sub 1},R{sub 2},...,R{sub N}) approximation of higher-order tensors cannot be computed in a straightforward way. An additional difficulty comes from an invariance property of the cost function by the action of the orthogonal group. This means that the zeros of the cost function are not isolated and the plain Newton method might have difficulties. In this paper, we derive a geometric Newton method using the theory of quotient manifolds. Our algorithm has fast convergence in a neighborhood of the solution and is useful for a large class of problems. We mention some applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Combined Uncertainty and A-Posteriori Error Bound Estimates for General CFD Calculations: Theory and Software Implementation

This workshop presentation discusses the design and implementation of numerical methods for the quantification of statistical uncertainty, including a-posteriori error bounds, for output quantities computed using CFD methods. Hydrodynamic realizations often contain numerical error arising from finite-dimensional approximation (e.g. numerical methods using grids, basis functions, particles) and statistical uncertainty arising from incomplete information and/or statistical characterization of model parameters and random fields. The first task at hand is to derive formal error bounds for statistics given realizations containing finite-dimensional numerical error [1]. The error in computed output statistics contains contributions from both realization error and the error resulting from the calculation of statistics integrals using a numerical method. A second task is to devise computable a-posteriori error bounds by numerically approximating all terms arising in the error bound estimates. For the same reason that CFD calculations including error bounds but omitting uncertainty modeling are only of limited value, CFD calculations including uncertainty modeling but omitting error bounds are only of limited value. To gain maximum value from CFD calculations, a general software package for uncertainty quantification with quantified error bounds has been developed at NASA. The package provides implementations for a suite of numerical methods used in uncertainty quantification: Dense tensorization basis methods [3] and a subscale recovery variant [1] for non-smooth data, Sparse tensorization methods[2] utilizing node-nested hierarchies, Sampling methods[4] for high-dimensional random variable spaces.

CFD↗

Fast iterative refinement method for mixed systems of integral and fractional integro-differential equations

The authors’ new method of iterative refinement has been successfully applied to the linear fractional Fredholm integro-differential equation. In this work, we adapt our method to obtain approximate analytical solutions for linear Volterra equations of both the first and the second kind of fractional type. A detailed convergence analysis is presented for each kind. The authors also apply their method to the challenging first kind linear Fredholm integral equation. Three different cases are considered to test the efficacy of our method. These include mixed systems of various forms of linear integral and fractional integro-differential equations. We compare our method with six well-established methods: Picard’s successive approximations, an accelerated form of the latter, the Adomian decomposition, the variational iteration, the homotopy perturbation and the homotopy analysis. The results show the versatility of the new method in solving a wide variety of equations, its high convergence speed and accuracy and its capability of directly dealing with equations of the first kind. We also prove that Picard’s method for linear equations is a special case of our method.

97 MATHEMATICS AND COMPUTING↗

Nonlinear vibrations of rectangular plates.

A finite-difference method is developed to determine the large amplitude dynamic responses of thin elastic plates subjected to uniform pressure pulse-type loads. Four different sets of boundary conditions are considered. Some specific problems are solved. The results are compared with approximate solutions obtained by Yamaki (1961). The numerical method presented provides an accurate and efficient approximate solution to the problem, and should be useful as a check on other approximate methods. The grid-size and the time-step necessary for obtaining numerical stability depend on the particular problem. For many cases the method converges rapidly and a rather large grid-size and time-step is adequate.

Bayles, D. J.↗

Two-dimensional gap solitons in elliptic-lattice potentials

We study two-dimensional (2D) matter-wave gap solitons trapped in an elliptically deformed concentric lattice potential, within the framework of the Gross-Pitaevskii equation (GPE) with self-attraction or self-repulsion. For a fixed eccentricity of the lattice, soliton families are found in both the repulsive and attractive models. In the former case, the analysis reveals two kinds of gap solitons trapped in the first oval trough (the ring-shaped potential minimum closest to the center): elliptic annular solitons (EASs), and double solitons (DSs), which are formed by two tightly localized density peaks located at diametrically opposite points of the trough, with zero phase difference between them. With the decrease of the norm, the density distribution in the EAS along the azimuthal direction changes from nearly uniform to double-peaked and, eventually, to the DS. In the attractive model, there exist only DSs in the oval trough, while EASs are not found. All such solitons without the angular momentum (l=0) are fully stable. For l{ne}0, vortical solitons--both EASs with a sufficiently large norm (in the repulsive model) and DSs (in models with both signs of the nonlinearity)--are quasistable, exhibiting rocking motion in the elliptic trough (we consider the cases of l=1 and l=2). At smaller values of the norm, the vortical annular solitons (in the repulsive model) are unstable. Stable fundamental solitons trapped in the central potential well are investigated, too, in both the attractive and repulsive models, by means of the variational approximation and numerical methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗