Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical algorithm”

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 127 records · Page 7

Semiclassical Monte-Carlo approach for modelling non-adiabatic dynamics in extended molecules

Modelling of non-adiabatic dynamics in extended molecular systems and solids is a next frontier of atomistic electronic structure theory. The underlying numerical algorithms should operate only with a few quantities (that can be efficiently obtained from quantum chemistry), provide a controlled approximation (which can be systematically improved) and capture important phenomena such as branching (multiple products), detailed balance and evolution of electronic coherences. Here we propose a new algorithm based on Monte-Carlo sampling of classical trajectories, which satisfies the above requirements and provides a general framework for existing surface hopping methods for non-adiabatic dynamics simulations. In particular, our algorithm can be viewed as a post-processing technique for analysing numerical results obtained from the conventional surface hopping approaches. Presented numerical tests for several model problems demonstrate efficiency and accuracy of the new method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Coupled Electro-Thermal Analysis of Permanent Magnet Synchronous Motor for Electric Vehicles

Permanent magnet synchronous motors (PMSM) are extensively used in electric vehicles. However, high internal heat generation and inefficient heat dissipation often limit the operational reliability, and longevity of the PMSM. Therefore, proper quantification of heat generation in electric motor and advanced embedded motor cooling techniques remain topics of immense interest. In order to accurately predict electro-magnetic performance, i.e., efficiency, component-wise heat losses and the corresponding temperature distribution of a jacket cooled machine, this paper presents a two-way iteratively coupled electro-thermal modeling framework. Finite element based software Motor-CAD has been utilized for electro-magnetic performance calculation of BMW i3 PMSM. Finite volume based computational fluid dynamics/heat transfer (CFD/HT) software ANSYS® FLUENT® has been employed to simulate the temperature distribution of the PMSM, using the electro-magnetic losses as heat input. Computed heat losses, stator, winding, rotor, and magnet temperatures are utilized as coupling parameters between the electro-magnetic and thermal models. A conventional one-way coupling algorithm has also been developed and compared to the newly proposed two-way coupling algorithm. Numerical results confirm that at high current density, one-way coupling algorithm significantly over-predicts the motor temperature compared to the two-way algorithm. A comprehensive analysis has been carried out to characterize the influences of current density, speed, and forced convection heat transfer coefficient on the heat losses, overall efficiency, and maximum temperature of the PMSM. Lastly, an efficiency map has been interpreted from the coupled electro-magnetic simulation.

42 ENGINEERING↗

An Introduction of Numerical Methods for Unconstrained Nonlinear Equations

Many applications in computational physics are nonlinear problems. These nonlinear problems include quantitative object reconstruction problems, inverse transport problems, nuclear weapon design problems, and particle tracking on unstructured meshes. The numerical algorithms used to solve nonlinear equations should be robust, reliable, and efficient. Numerical methods for unconstrained nonlinear equations are introduced in the slides.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Construction of a Code Verification Matrix for Heat Conduction With Finite Element Code Applications

When establishing the pedigree of a simulation tool, code verification is used to ensure that the implemented numerical algorithm is a faithful representation of its underlying mathematical model. During this process, numerical results on various meshes are systematically compared to a reference analytic solution. The selection of analytic solutions can be a laborious process, as it is difficult to establish adequate code confidence without performing redundant work. In this report we address this issue by applying a physics-based process that establishes a set of reference problems. In this process, code simulation options are categorized and systematically tested, which ensures that gaps in testing are easily identified and addressed. The resulting problems are primarily intended for code verification analysis but may also be useful for comparison to other simulation codes, troubleshooting activities, or training exercises. The process is used to select fifteen code verification problems relevant for the one-dimensional steady-state heat conduction equation. These problems are applicable to a wide variety of simulation tools, but, in this work, a demonstration is performed using the finite element-based nuclear fuel performance code BISON. Convergence to the analytic solution at the theoretical rate is quantified for a selection of the problems, which establishes a baseline pedigree for the code. Not only can this standard set of conduction solutions be used for verification of other codes, but also the physics-based process for selecting problems can be utilized to quantify and expand testing for any simulation tool.

42 ENGINEERING↗

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↗

Efficient Integration of Quantum Mechanical Wave Equations by Unitary Transforms

The integration of time dependent quantum mechanical wave equations is a fundamental problem in computational physics and computational chemistry. The energy and momentum spectrum of a wave function imposes fundamental limits on the performance of numerical algorithms for this problem. We demonstrate how unitary transforms can help to surmount these limitations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A RAY-TRACING ALGORITHM FOR SPINNING COMPACT OBJECT SPACETIMES WITH ARBITRARY QUADRUPOLE MOMENTS. I. QUASI-KERR BLACK HOLES

We describe a new numerical algorithm for ray tracing in the external spacetimes of spinning compact objects characterized by arbitrary quadrupole moments. Such spacetimes describe non-Kerr vacuum solutions that can be used to test the no-hair theorem in conjunction with observations of accreting black holes. They are also appropriate for neutron stars with spin frequencies in the {approx_equal} 300-600 Hz range, which are typical of the bursting sources in low-mass X-ray binaries. We use our algorithm to show that allowing for the quadrupole moment of the spacetime to take arbitrary values leads to observable effects in the profiles of relativistic broadened fluorescent iron lines from geometrically thin accretion disks.

79 ASTRONOMY AND ASTROPHYSICS↗

Application of Gauss's law space-charge limited emission model in iterative particle tracking method

The particle tracking method with a so-called gun iteration for modeling the space charge is discussed in the following paper. We suggest to apply the emission model based on the Gauss's law for the calculation of the space charge limited current density distribution using considered method. Based on the presented emission model we have developed a numerical algorithm for this calculations. This approach allows us to perform accurate and low time consumpting numerical simulations for different vacuum sources with the curved emitting surfaces and also in the presence of additional physical effects such as bipolar flows and backscattered electrons. The results of the simulations of the cylindrical diode and diode with elliptical emitter with the use of axysimmetric coordinates are presented. The high efficiency and accuracy of the suggested approach are confirmed by the obtained results and comparisons with the analytical solutions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large-Scale Optimization for Bayesian Inference in Complex Systems

The SAGUARO (Scalable Algorithms for Groundwater Uncertainty Analysis and Robust Optimization) Project focused on the development of scalable numerical algorithms for large-scale Bayesian inversion in complex systems that capitalize on advances in large-scale simulation-based optimization and inversion methods. The project was a collaborative effort among MIT, the University of Texas at Austin, Georgia Institute of Technology, and Sandia National Laboratories. The research was directed in three complementary areas: efficient approximations of the Hessian operator, reductions in complexity of forward simulations via stochastic spectral approximations and model reduction, and employing large-scale optimization concepts to accelerate sampling. The MIT₋Sandia component of the SAGUARO Project addressed the intractability of conventional sampling methods for large-scale statistical inverse problems by devising reduced-order models that are faithful to the full-order model over a wide range of parameter values; sampling then employs the reduced model rather than the full model, resulting in very large computational savings. Results indicate little effect on the computed posterior distribution. On the other hand, in the Texas₋Georgia Tech component of the project, we retain the full-order model, but exploit inverse problem structure (adjoint-based gradients and partial Hessian information of the parameter-to-observation map) to implicitly extract lower dimensional information on the posterior distribution; this greatly speeds up sampling methods, so that fewer sampling points are needed. We can think of these two approaches as "reduce then sample" and "sample then reduce." In fact, these two approaches are complementary, and can be used in conjunction with each other. Moreover, they both exploit deterministic inverse problem structure, in the form of adjoint-based gradient and Hessian information of the underlying parameter-to-observation map, to achieve their speedups.

97 MATHEMATICS AND COMPUTING↗

Hierarchical Distributed Voltage Regulation in Networked Autonomous Grids

We propose a novel algorithm to solve optimal power flow (OPF) that aims at dispatching controllable distributed energy resources (DERs) for voltage regulation at minimum cost. The proposed algorithm features unprecedented scalability to large distribution networks by utilizing an information structure based on networked autonomous grids (AGs). Specifically, each AG is a subtree of a large distribution network that has a tree topology. The topology and line parameters of each AG are known only to a regional coordinator (RC) that is responsible for communicating with and dispatching the DERs within this AG. The reduced network, where each AG is treated as a node, is managed by a central coordinator (CC), which knows the topology and line parameters of the reduced network only and communicates with all the RCs. We jointly explore this information structure and the structure of the linearized distribution power flow (LinDistFlow) model to derive a hierarchical, distributed implementation of the primal-dual gradient algorithm that solves the OPF. The proposed implementation significantly reduces the computation burden compared to the centrally coordinated implementation of the primal-dual algorithm. Numerical results on a 4,521-node test feeder show that the proposed hierarchical distributed algorithm can achieve an improvement of more than tenfold in the speed of convergence compared to the centrally coordinated primal-dual algorithm.

Zhou, Xinyang↗

Hierarchical Distributed Voltage Regulation in Networked Autonomous Grids: Preprint

We propose a novel algorithm to solve optimal power flow (OPF) that aims at dispatching controllable distributed energy resources (DERs) for voltage regulation at minimum cost. The proposed algorithm features unprecedented scalability to large distribution networks by utilizing an information structure based on networked autonomous grids (AGs). Specifically, each AG is a subtree of a large distribution network that has a tree topology. The topology and line parameters of each AG are known only to a regional coordinator (RC) that is responsible for communicating with and dispatching the DERs within this AG. The reduced network, where each AG is treated as a node, is managed by a central coordinator (CC), which knows the topology and line parameters of the reduced network only and communicates with all the RCs. We jointly explore this information structure and the structure of the linearized distribution power flow (LinDistFlow) model to derive a hierarchical, distributed implementation of the primal-dual gradient algorithm that solves OPF. The proposed implementation significantly reduces the computation burden compared to the centrally coordinated implementation of the primal-dual algorithm. Numerical results on a 4,521-node test feeder show that the proposed hierarchical distributed algorithm can achieve more than 10-fold improvement in the speed of convergence compared to the centrally coordinated primal-dual algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hierarchical Distributed Voltage Regulation in Networked Autonomous Grids

We propose a novel algorithm to solve optimal power flow (OPF) that aims at dispatching controllable distributed energy resources (DERs) for voltage regulation at minimum cost. The proposed algorithm features unprecedented scalability to large distribution networks by utilizing an information structure based on networked autonomous grids (AGs). Specifically, each AG is a subtree of a large distribution network that has a tree topology. The topology and line parameters of each AG are known only to a regional coordinator (RC) that is responsible for communicating with and dispatching the DERs within this AG. The reduced network, where each AG is treated as a node, is managed by a central coordinator (CC), which knows the topology and line parameters of the reduced network only and communicates with all the RCs. We jointly explore this information structure and the structure of the linearized distribution power flow (LinDistFlow) model to derive a hierarchical, distributed implementation of the primal-dual gradient algorithm that solves the OPF. The proposed implementation significantly reduces the computation burden compared to the centrally coordinated implementation of the primal-dual algorithm. Numerical results on a 4,521-node test feeder show that the proposed hierarchical distributed algorithm can achieve an improvement of more than tenfold in the speed of convergence compared to the centrally coordinated primal-dual algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Thermodynamically consistent algorithms for models of incompressible multiphase polymer solutions with a variable mobility

Here we present a general strategy for developing structure and property preserving numerical algorithms for thermodynamically consistent models of incompressible multiphase polymer solutions with a variable mobility. We first present a formalism to derive thermodynamically consistent, incompressible, multiphase polymer models. Then, we develop the general strategy, known as the supplementary variable method, to devise thermodynamically consistent numerical approximations to the models. We illustrate the numerical strategy using newly developed models of incompressible diblock copolymer solutions coupled with an electric and a magnetic field, respectively. Mesh refinement is conducted to verify convergence rates of the developed schemes. Some numerical examples are given to exhibit underlying dynamics absent from and driven by the external fields, respectively, highlighting differences between models with the variable and constant mobilities.

97 MATHEMATICS AND COMPUTING↗

Structure and structure-preserving algorithms for plasma physics

Hamiltonian and action principle (HAP) formulations of plasma physics are reviewed for the purpose of explaining structure preserving numerical algorithms. Geometric structures associated with and emergent from HAP formulations are discussed. These include conservative integration, which exactly conserves invariants, symplectic integration, which exactly preserves the Hamiltonian geometric structure, and other Hamiltonian integration techniques. Basic ideas of variational integration and Poisson integration, which can preserve the noncanonical Hamiltonian structure, are discussed. Metriplectic integration, which preserves the structure of conservative systems with both Hamiltonian and dissipative parts, is proposed. Two kinds of simulated annealing, a relaxation technique for obtaining equilibrium states, are reviewed: one that uses metriplectic dynamics, which maximizes an entropy at fixed energy, and the other that uses double bracket dynamics, which preserves Casimir invariants. Throughout, applications to plasma systems are emphasized. The paper concludes with a discussion of geometric electromagnetic particle-in-cell [Kraus et al., J. Plasma Phys. (to be published); e-print arXiv:1609.03053v1 [math.NA]], a particle in cell code that incorporates Hamiltonian and geometrical structure preserving properties.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

INTEGRATION OF PARTICLE-GAS SYSTEMS WITH STIFF MUTUAL DRAG INTERACTION

Numerical simulation of numerous mm/cm-sized particles embedded in a gaseous disk has become an important tool in the study of planet formation and in understanding the dust distribution in observed protoplanetary disks. However, the mutual drag force between the gas and the particles can become so stiff—particularly because of small particles and/or strong local solid concentration—that an explicit integration of this system is computationally formidable. In this work, we consider the integration of the mutual drag force in a system of Eulerian gas and Lagrangian solid particles. Despite the entanglement between the gas and the particles under the particle-mesh construct, we are able to devise a numerical algorithm that effectively decomposes the globally coupled system of equations for the mutual drag force, and makes it possible to integrate this system on a cell-by-cell basis, which considerably reduces the computational task required. We use an analytical solution for the temporal evolution of each cell to relieve the time-step constraint posed by the mutual drag force, as well as to achieve the highest degree of accuracy. To validate our algorithm, we use an extensive suite of benchmarks with known solutions in one, two, and three dimensions, including the linear growth and the nonlinear saturation of the streaming instability. We demonstrate numerical convergence and satisfactory consistency in all cases. Our algorithm can, for example, be applied to model the evolution of the streaming instability with mm/cm-sized pebbles at high mass loading, which has important consequences for the formation scenarios of planetesimals.

79 ASTRONOMY AND ASTROPHYSICS↗

A space-time smooth artificial viscosity method with wavelet noise indicator and shock collision scheme, Part 2: The 2-D case

This is the second part to our companion paper. Herein, we generalize to two space dimensions the C-method developed in for adding localized, space-time smooth artificial viscosity to nonlinear systems of conservation laws that propagate shock waves, rarefaction waves, and contact discontinuities. For gas dynamics, the C-method couples the Euler equations to scalar reaction-diffusion equations, which we call C-equations, whose solutions serve as space-time smooth artificial viscosity indicators for shocks and contacts. We develop a high-order numerical algorithm for gas dynamics in 2-D which can accurately simulate the Rayleigh-Taylor (RT) instability with Kelvin-Helmholtz (KH) roll-up of the contact discontinuity, as well as shock collision and bounce-back. Solutions to our C-equations not only indicate the location of the shocks and contacts, but also track the geometry of the evolving fronts. This allows us to implement both directionally isotropic and anisotropic artificial viscosity schemes, the latter adding diffusion only in directions tangential to the evolving front. We additionally produce a novel shock collision indicator function, which naturally activates during shock collision, and then smoothly deactivates. Moreover, we implement a high-frequency 2-D wavelet-based noise detector together with an efficient and localized noise removal algorithm. To test the methodology, we use a highly simplified WENO-based discretization scheme. We provide numerical results for some classical 2-D test problems, including the RT problem, the Noh problem, a circular explosion problem from the Liska & Wendroff [13] review paper, the Sedov blast wave problem, the double Mach 10 reflection test, and a shock-wall collision problem. In particular, we show that our artificial viscosity method can eliminate the wall-heating phenomenon for the Noh problem, and thereby produce an accurate, non-oscillatory solution, even though our simplified WENO-type scheme fails to run for this problem.

97 MATHEMATICS AND COMPUTING↗

Asymptotic and spectral analysis of the gyrokinetic-waterbag integro-differential operator in toroidal geometry

Achieving plasmas with good stability and confinement properties is a key research goal for magnetic fusion devices. The underlying equations are the Vlasov–Poisson and Vlasov–Maxwell (VPM) equations in three space variables, three velocity variables, and one time variable. Even in those somewhat academic cases where global equilibrium solutions are known, studying their stability requires the analysis of the spectral properties of the linearized operator, a daunting task. We have identified a model, for which not only equilibrium solutions can be constructed, but many of their stability properties are amenable to rigorous analysis. It uses a class of solution to the VPM equations (or to their gyrokinetic approximations) known as waterbag solutions which, in particular, are piecewise constant in phase-space. It also uses, not only the gyrokinetic approximation of fast cyclotronic motion around magnetic field lines, but also an asymptotic approximation regarding the magnetic-field-induced anisotropy: the spatial variation along the field lines is taken much slower than across them. Together, these assumptions result in a drastic reduction in the dimensionality of the linearized problem, which becomes a set of two nested one-dimensional problems: an integral equation in the poloidal variable, followed by a one-dimensional complex Schrödinger equation in the radial variable. We show here that the operator associated to the poloidal variable is meromorphic in the eigenparameter, the pulsation frequency. We also prove that, for all but a countable set of real pulsation frequencies, the operator is compact and thus behaves mostly as a finite-dimensional one. The numerical algorithms based on such ideas have been implemented in a companion paper [D. Coulette and N. Besse, “Numerical resolution of the global eigenvalue problem for gyrokinetic-waterbag model in toroidal geometry” (submitted)] and were found to be surprisingly close to those for the original gyrokinetic-Vlasov equations. The purpose of the present paper is to make these new ideas accessible to two readerships: applied mathematicians and plasma physicists.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

High-order entropy-based closures for linear transport in slab geometry II: A computational study of the optimization problem

We present a numerical algorithm to implement entropy-based (M{sub N}) moment models in the context of a simple, linear kinetic equation for particles moving through a material slab. The closure for these models - as is the case for all entropy-based models - is derived through the solution of constrained, convex optimization problem. The algorithm has two components. The first component is a discretization of the moment equations which preserves the set of realizable moments, thereby ensuring that the optimization problem has a solution (in exact arithmetic). The discretization is a second-order kinetic scheme which uses MUSCL-type limiting in space and a strong-stability-preserving, Runge-Kutta time integrator. The second component of the algorithm is a Newton-based solver for the dual optimization problem, which uses an adaptive quadrature to evaluate integrals in the dual objective and its derivatives. The accuracy of the numerical solution to the dual problem plays a key role in the time step restriction for the kinetic scheme. We study in detail the difficulties in the dual problem that arise near the boundary of realizable moments, where quadrature formulas are less reliable and the Hessian of the dual objection function is highly ill-conditioned. Extensive numerical experiments are performed to illustrate these difficulties. In cases where the dual problem becomes 'too difficult' to solve numerically, we propose a regularization technique to artificially move moments away from the realizable boundary in a way that still preserves local particle concentrations. We present results of numerical simulations for two challenging test problems in order to quantify the characteristics of the optimization solver and to investigate when and how frequently the regularization is needed.

99 GENERAL AND MISCELLANEOUS↗