Engineering Papers⌕ Search

SEARCH · Engineering Papers

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,477 records · Page 82

Phase-Free Orbital Element Model Designed to Enable Rapid Assessment of Eclipse and Radiation Profiles for Low-Thrust Spiral Transfers Around the Earth

The Gateway Power and Propulsion Element (PPE) will be the first low-thrust solar electric ion propulsion mission to transfer from a highly elliptical Earth-bound orbit to a southern near-rectilinear halo orbit (NRHO) at the Earth-Moon L2 point. Due to the low thrust nature of the transfer orbit, it is desirable to locate viable trajectories that minimize the time spent in the Van Allen radiation belts to reduce solar array degradation and keep radiation dosages below design limits. In addition to radiation, low thrust trajectories which spiral around the Earth will pass through at least one or more seasons of Earth eclipses. The solar electric propulsion system relies on sunlight to generate the power necessary to operate the ion thrusters. Therefore, it is advantageous to find trajectories which also minimize the amount of time spent in eclipse and avoid excessive battery draw-down periods. We present an analytical method which rapidly approximates low-thrust spiral trajectories, fit to high-fidelity simulated data and parameterized to allow for changes in vehicle thrust characteristics, that is post-processed to determine eclipse profiles and time spent in the belts using a novel approach that estimates the geometry of the belts using a first-order dipole approximation of the Earth’s magnetic field. This method can be used to find satisfactory launch dates and orbit orientations that can serve as initial guesses when optimizing such missions in high-fidelity software.

low thrust trajectory design↗

Phase-Free Orbital Element Model Designed to Enable Rapid Assessment of Eclipse and Radiation Profiles for Low-Thrust Spiral Transfers Around the Earth

The Gateway Power and Propulsion Element (PPE) will be the first low-thrust solar electric ion propulsion mission to transfer from a highly elliptical Earth-bound orbit to a southern near-rectilinear halo orbit (NRHO) at the Earth-Moon L2 point. Due to the low thrust nature of the transfer orbit, it is desirable to locate viable trajectories that minimize the time spent in the Van Allen radiation belts to reduce solar array degradation and keep radiation dosages below design limits. In addition to radiation, low thrust trajectories which spiral around the Earth will pass through at least one or more seasons of Earth eclipses. The solar electric propulsion system relies on sunlight to generate the power necessary to operate the ion thrusters. Therefore, it is advantageous to find trajectories which also minimize the amount of time spent in eclipse and avoid excessive battery draw-down periods. We present an analytical method which rapidly approximates low-thrust spiral trajectories, fit to high-fidelity simulated data and parameterized to allow for changes in vehicle thrust characteristics, that is post-processed to determine eclipse profiles and time spent in the belts using a novel approach that estimates the geometry of the belts using a first-order dipole approximation of the Earth’s magnetic field. This method can be used to find satisfactory launch dates and orbit orientations that can serve as initial guesses when optimizing such missions in high-fidelity software.

low thrust trajectory design↗

The conforming virtual element method for polyharmonic problems

Here, we exploit the capability of virtual element methods in accommodating approximation spaces featuring high-order continuity to numerically approximate differential problems of the form $(–Δ)^pu = f , p ≥ 1$. More specifically, we develop and analyze the conforming virtual element method for the numerical approximation of polyharmonic boundary value problems, and prove an abstract result that states the convergence of the method in suitable norms.

97 MATHEMATICS AND COMPUTING↗

Nonadiabatic Quantum Molecular Dynamics in Dense Manifolds of Electronic States

Most nonadiabatic molecular dynamics methods require the determination of a basis of adiabatic or diabatic electronic states at every time step, but in dense manifolds of electronic states, such approaches become intractable. A notable exception is Ehrenfest molecular dynamics, which can be implemented without explicit determination of such a basis but suffers from unphysical behavior when propagation on a mean-field potential energy surface (PES) does not accurately reflect the true dynamics on multiple electronic states. Here we introduce the multiple cloning for dense manifolds of states (MCDMS) method, a systematically improvable approximation to the multiple cloning method. MCDMS avoids both the mean-field PES problem and the need to compute the full electronic spectrum. This is achieved by reformulating multiple cloning to use a subspace of approximate eigenstates constructed from the time-dependent Ehrenfest electronic wave function. Finally, by application to model systems, we show that this approach allows a substantial reduction in the size of the required electronic basis without significant loss in accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fractional dynamics of an erbium-doped fiber laser model

In this paper we investigate the model of the time-fractional dynamics of an erbium-doped fiber laser model (TFDEFL) with Liouville–Caputo (LC), Caputo–Fabrizio–Caputo (CFC) and Atangana–Baleanu–Caputo (ABC) time-fractional derivatives. We employ the homotopy analysis transform method (HATM) to calculate approximate solutions for the TFDEFL model. This method gives the solution in the form of a rapidly convergent series that can ensure the convergence in solving the resultant series. We study the convergence analysis of HATM by computing the interval of convergence through the h-curves, the residual error function and the average residual error, respectively. We also show the effectiveness and accuracy of this method by comparing the approximate solutions based upon the LC, CFC and ABC time-fractional derivatives.

36 MATERIALS SCIENCE↗

Perspective on Kramers symmetry breaking and restoration in relativistic electronic structure methods for open-shell systems

Without rigorous symmetry constraints, solutions to approximate electronic structure methods may artificially break symmetry. In the case of the relativistic electronic structure, if time-reversal symmetry is not enforced in calculations of molecules not subject to a magnetic field, it is possible to artificially break Kramers degeneracy in open shell systems. This leads to a description of excited states that may be qualitatively incorrect. Despite this, different electronic structure methods to incorporate correlation and excited states can partially restore Kramers degeneracy from a broken symmetry solution. For single-reference techniques, the inclusion of double and possibly triple excitations in the ground state provides much of the needed correction. Formally, however, this imbalanced treatment of the Kramers-paired spaces is a multi-reference problem, and so methods such as complete-active-space methods perform much better at recovering much of the correct symmetry by state averaging. Using multi-reference configuration interaction, any additional corrections can be obtained as the solution approaches the full configuration interaction limit. A recently proposed “Kramers contamination” value is also used to assess the magnitude of symmetry breaking.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Acceleration of diffusive molecular dynamics simulations through mean field approximation and subcycling time integration

Highlights: • Two numerical methods are presented to accelerate DMD simulations. • The methods greatly reduce the computation time without much loss of accuracy. • The accelerated DMD model is capable of simulating long-term mass transport at atomistic length scales. • Demonstrated for the propagation of an atomically sharp phase boundary over 30 seconds. - Abstract: Diffusive Molecular Dynamics (DMD) is a class of recently developed computational models for the simulation of long-term diffusive mass transport at atomistic length scales. Compared to previous atomistic models, e.g., transition state theory based accelerated molecular dynamics, DMD allows the use of larger time-step sizes, but has a higher computational complexity at each time-step due to the need to solve a nonlinear optimization problem at every time-step. This paper presents two numerical methods to accelerate DMD based simulations. First, we show that when a many-body potential function, e.g., embedded atom method (EAM), is employed, the cost of DMD is dominated by the computation of the mean of the potential function and its derivatives, which are high-dimensional random variables. To reduce the cost, we explore both first- and second-order mean field approximations. Specifically, we show that the first-order approximation, which uses a point estimate to calculate the mean, can reduce the cost by two to three orders of magnitude, but may introduce relatively large error in the solution. We show that adding an approximate second-order correction term can significantly reduce the error without much increase in computational cost. Second, we show that DMD can be significantly accelerated through subcycling time integration, as the cost of integrating the empirical diffusion equation is much lower than that of the optimization solver. To assess the DMD model and the numerical approximation methods, we present two groups of numerical experiments that simulate the diffusion of hydrogen in palladium nanoparticles. In particular, we show that the computational framework is capable of capturing the propagation of an atomically sharp phase boundary over a time window of more than 30 seconds. The effects of the proposed numerical methods on solution accuracy and computation time are also assessed quantitatively.

36 MATERIALS SCIENCE↗

Communication-efficient Distributed Solutions to a System of Linear Equations with Laplacian Sparse Structure

Two communication-efficient distributed algorithms are proposed to solve a system of linear equations Ax = b with Laplacian sparse A. A system of linear equations with Laplacian sparse A can be found in many applications, e.g., the power flow problems and other network flow problems. The first algorithm is based on the gradient descent method in optimization and the agents only share two parts of the system state instead of that of the whole system state, which saves significant communication. The two parts shared by every agent through a communication link are the state information of its own and its neighbors connected by the communication link. The second method is obtained from an approximation of the Newton method, which converges faster. It requires twice as much communication as the first one but is still communicationefficient due to the low dimension of each part shared between agents. The convergence at a linear rate of both methods is proved. A comprehensive comparison of the convergence rate, communication burden, and computation costs between the methods is made. Finally, a simulation is conducted to show the effectiveness of both methods.

Wang, Peng↗

The development of accurate and efficient methods of numerical quadrature

Some new methods for performing numerical quadrature of an integrable function over a finite interval are described. Each method provides a sequence of approximations of increasing order to the value of the integral. Each approximation makes use of all previously computed values of the integrand. The points at which new values of the integrand are computed are selected in such a way that the order of the approximation is maximized. The methods are compared with the quadrature methods of Clenshaw and Curtis, Gauss, Patterson, and Romberg using several examples.

Feagin, T.↗

Assessment of existing analytic methods for prediction of high angle-of-attack loads on delta wings at supersonic speeds

An assessment of the applicability of four loading prediction methods to high angle-of-attack conditions for simplified wing-body configurations is provided. The methods are: The tangent wedge approximation, the linear theory methods of Middleton and Woodward, and a shock-fitting finite-difference technique. Estimates obtained by these methods were compared with experimental pressure data on delta wings to examine the effects of Mach number, camber, sweep angle, and angle of attack. Results indicate that all of the methods provided reasonable estimates at moderate angles of attack. At these moderate angles of attack, the methods of Middleton and Woodward provided good estimates at Mach numbers higher than those usually associated with linear theory. Only the finite-difference method provided reasonable load estimates at high angles of attack.

Landrum, E. J.↗

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

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