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 199 records · Page 11

NSLS-II HIGH LEVEL APPLICATION INFRASTRUCTURE AND CLIENT API DESIGN

The beam commissioning software framework of NSLS-II project adopts a client/server based architecture to replace the more traditional monolithic high level application approach. It is an open structure platform, and we try to provide a narrow API set for client application. With this narrow API, existing applications developed in different language under different architecture could be ported to our platform with small modification. This paper describes system infrastructure design, client API and system integration, and latest progress. As a new 3rd generation synchrotron light source with ultra low emittance, there are new requirements and challenges to control and manipulate the beam. A use case study and a theoretical analysis have been performed to clarify requirements and challenges to the high level applications (HLA) software environment. To satisfy those requirements and challenges, adequate system architecture of the software framework is critical for beam commissioning, study and operation. The existing traditional approaches are self-consistent, and monolithic. Some of them have adopted a concept of middle layer to separate low level hardware processing from numerical algorithm computing, physics modelling, data manipulating, plotting, and error handling. However, none of the existing approaches can satisfy the requirement. A new design has been proposed by introducing service oriented architecture technology. The HLA is combination of tools for accelerator physicists and operators, which is same as traditional approach. In NSLS-II, they include monitoring applications and control routines. Scripting environment is very important for the later part of HLA and both parts are designed based on a common set of APIs. Physicists and operators are users of these APIs, while control system engineers and a few accelerator physicists are the developers of these APIs. With our Client/Server mode based approach, we leave how to retrieve information to the developers of APIs and how to use them to form a physics application to the users. For example, how the channels are related to magnet and what the current real-time setting of a magnet is in physics unit are the internals of APIs. Measuring chromaticities are the users of APIs. All the users of APIs are working with magnet and instrument names in a physics unit. The low level communications in current or voltage unit are minimized. In this paper, we discussed our recent progress of our infrastructure development, and client API.

43 PARTICLE ACCELERATORS↗

Determining the memory kernel from a fixed point measurement data for a parabolic equation with memory effect

We consider an inverse problem for a parabolic equation with memory effect. This inverse problem aims to identify the memory kernel function from a fixed point measurement data. Based on the fixed point arguments, we derive the global in time existence and uniqueness of our inverse problem. Moreover, we present a numerical algorithm to reconstruct the memory kernel function. Numerical simulations show the effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗

Experimental and theoretical study of energy transfer in a chromophore triad: What makes modeling dynamics successful?

Simulation of electronic dynamics in realistically large molecular systems is a demanding task that has not yet achieved the same level of quantitative prediction already realized for its static counterpart. This is particularly true for processes occurring beyond the Born–Oppenheimer regime. Non-adiabatic molecular dynamics (NAMD) simulations suffer from two convoluted sources of error: numerical algorithms for dynamics and electronic structure calculations. While the former has gained increasing attention, particularly addressing the validity of ad hoc methodologies, the effect of the latter remains relatively unexplored. Indeed, the required accuracy for electronic structure calculations to reach quantitative agreement with experiment in dynamics may be even more strict than that required for static simulations. In this study, we address this issue by modeling the electronic energy transfer in a donor–acceptor–donor (D–A–D) molecular light harvesting system using fewest switches surface hopping NAMD simulations. In the studied system, time-resolved experimental measurements deliver complete information on spectra and energy transfer rates. Subsequent modeling shows that the calculated electronic transition energies are “sufficiently good” to reproduce experimental spectra but produce over an order of magnitude error in simulated dynamical rates. We further perform simulations using artificially shifted energy gaps to investigate the complex relationship between transition energies and modeled dynamics to understand factors affecting non-radiative relaxation and energy transfer rates.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum Fourier transform revisited

Summary The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐ d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.

Camps, Daan↗

An approach of orthogonalization within the Gram–Schmidt algorithm

In this paper we consider the variants of Gram–Schmidt such as Classical Gram–Schmidt and Modified Gram–Schmidt algorithms. It is shown that for problems of dimension more than two the round-off error of operation q{sub 1}{sup T}q{sub 2} has more propagation in both of algorithms. To cure this difficulty we will present an algorithm, namely Optimized Modified Gram–Schmidt algorithm. Numerical examples indicate the accuracy of this algorithm. We show that this method can improve the loss of orthogonality of the orthogonalization in some ill-conditioned cases.

97 MATHEMATICS AND COMPUTING↗

Modeling Mesoscale Processes of Scalable Synthesis (Final Report)

The main objective of the center is to develop tools that can help for the understanding of equilibrium and non-equilibrium properties of nanoparticles in aqueous electrolytes. To achieve this goal, we need to develop new computational methodologies that can integrate molecular level description such as the electronic structure analysis to mesoscale description such as generalized hydrodynamics. The challenge is to develop systematic coarse graining techniques that can adaptively choose the level of description needed for the particular task. For example, if bonding breaking is involved, then one should use appropriate models from quantum mechanics to accurately model the time scale and molecular mechanism for the breaking process. However, to model transport process or the process of self-assembly, much less detailed models can be used. There are two main components to this task. One is to develop accurate models that bridge different levels of description. The classical example is the QM/MM model that bridges quantum mechanics and molecular mechanics for studying chemical reactions of large molecules. This work was awarded the Nobel prize this year. For our purpose, we also need to develop methods that bridge molecular and continuum levels of description. Another main task is to develop systematic coarse-graining methods that can give rise to accurate mesoscale and macroscale models, starting from more detailed models at the atomic or molecular scale. None of these ideas are new. By now they have been fashionable topics for quite some time. But neither problem is satisfactorily resolved. The main problem is that uncontrolled approximations are used. As a result, we have very little idea about the validity and accuracy of these models. The main purpose of the center is to exploit the Mori-Zwanzig formalism to achieve the goals stated above. The Mori-Zwanzig formalism is a general tool for eliminating degrees of freedom from existing models. What is attractive about this formalism is its generality. The flip side is that it is also somewhat of a tautology. In order to make it a practical tool, one has to make approximations and this is where the trouble comes. Instead of focusing on Mori-Zwanzig formalism, the PI proposes to study the closely related renormalization group formalism (RG). Like Mori-Zwanzig, RG is a general strategy for eliminating small scale degrees of freedom in a model. Unlike Mori-Zwanzig, RG has the advantage that at least for some problems, one can write a PDE (partial differential equation) type of model for the exact RG flow, without any approximation. This gives us a solid starting point for discussing and analyzing approximations. The PI studied approximate RG flows for turbulent diffusion and related problems. However, extending it to more practical problems proved to be hard. The second line that the PI has pursued is to develop special numerical algorithms for studying particularly important events for dynamics processes in meso-scale systems. The PI succeeded in doing so for the problem of understanding phase transition in metallic systems.

97 MATHEMATICS AND COMPUTING↗

Simulating pitch angle scattering using an explicitly solvable energy-conserving algorithm

Particle distribution functions evolving under the Lorentz operator can be simulated with the Langevin equation for pitch angle scattering. This approach is frequently used in particle based Monte-Carlo simulations of plasma collisions, among others. However, most numerical treatments do not guarantee energy conservation, which may lead to unphysical artifacts such as numerical heating and spectra distortions. In this paper, we present a novel structure-preserving numerical algorithm for the Langevin equation for pitch angle scattering. Similar to the well-known Boris algorithm, the proposed numerical scheme takes advantage of the structure-preserving properties of the Cayley transform when calculating the velocity-space rotations. The resulting algorithm is explicitly solvable, while preserving the norm of velocities down to machine precision. We demonstrate that the method has the same order of numerical convergence as the traditional stochastic Euler-Maruyama method. The numerical scheme is benchmarked by simulating the pitch angle scattering of a particle beam, and comparing with the analytical solution. Benchmark results show excellent agreement with theoretical predictions, showcasing the remarkable long time accuracy of the proposed algorithm.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Algorithms for Computing the Magnetic Field, Vector Potential, and Field Derivatives for Circular Current Loops in Cylindrical Coordinates

A numerical algorithm for computing the field components B r and B z and their r and z derivatives with open boundaries in cylindrical coordinates for circular current loops is described. An algorithm for computing the vector potential is also described. For the convenience of the reader, derivations of the final expressions from their defining integrals are given in detail, since their derivations (especially for the field derivatives) are not all easily found in textbooks. Numerical calculations are based on evaluation of complete elliptic integrals using the Bulirsch algorithm cel. Since cel can evaluate complete elliptic integrals of a fairly general type, in some cases the elliptic integrals can be evaluated without first reducing them to forms containing standard Legendre forms. The algorithms avoid the numerical difficulties that many of the textbook solutions have for points near the axis because of explicit factors of 1=r or 1=r 2 in the some of the expressions.

97 MATHEMATICS AND COMPUTING↗

Simulating pitch angle scattering using an explicitly solvable energy-conserving algorithm

Particle distribution functions evolving under the Lorentz operator can be simulated with the Langevin equation for pitch angle scattering. This approach is frequently used in particle based Monte-Carlo simulations of plasma collisions, among others. However, most numerical treatments do not guarantee energy conservation, which may lead to unphysical artifacts such as numerical heating and spectra distortions. We present a novel structure-preserving numerical algorithm for the Langevin equation for pitch angle scattering. Similar to the well-known Boris algorithm, the proposed numerical scheme takes advantage of the structure-preserving properties of the Cayley transform when calculating the velocity-space rotations. The resulting algorithm is explicitly solvable, while preserving the norm of velocities down to machine precision. We demonstrate that the method has the same order of numerical convergence as the traditional stochastic Euler-Maruyama method.

Zhang, Xin↗

Implementation, Realization and an Effective Solver of Two-Equation Turbulence Models

Currently, when the Reynolds-Averaged Navier-Stokes (RANS) equations are solved using turbulence modeling, most often the one-equation model of Spalart and Allmaras is used. Then, it is only necessary to solve the RANS equations in conjunction with a single transport equation for modeling turbulence. For this model, considerable assessment and analysis has been performed, allowing the possibility of a reliable solution method for an eddy viscosity required to compute the Reynolds stresses in the RANS equations. Such evaluation along with analysis has not been achieved to realize similar performance with two-equation models of the k-w type. The primary objective of this paper is to present and discuss the components of an effective numerical algorithm for solving the RANS equations and the two transport equations of k-w type turbulence models. All the important details of the turbulence model as actually implemented are given, which is sometimes not done in various papers considering such modeling. The viability and effectiveness of this solution algorithm are demonstrated by solving both two-dimensional and three-dimensional aerodynamic flows. In all applications, a linear rate of convergence without oscillations or other evidence of unstable behavior is observed. This behavior is also particularly true when the proposed algorithm is applied to systematically renewed mesh sequences, which is generally not observed with algorithms solving more than one transport equation. Thus, numerical integration errors are systematically reduced, allowing for a significantly more reliable assessment of the effectiveness of the turbulence model. Additionally, in this paper, analysis of the solution algorithm, including linear stability, is also performed for a particular flow problem.

Turbulence↗

Improved Algorithm Computes Incompressible Flow

Algorithm numerically integrates Navier-Stokes equations of time-dependent or steady flow of incompressible, viscous fluid. Simulates realistic three-dimensional flows bounded by stationary or moving surface(s) of complicated shape(s). Only two arbitrary parameters specified by user. Algorithm described in "Numerical Simulation Of Flow Through An Artificial Heart" (ARC-12478). Algorithm tested by application to number of steady and unsteady flows, including flow in artificial heart discussed in noted prior article.

Rogers, Stuart E.↗

Numerical simulation of three-dimensional unsteady vortex flow using a compact vorticity-velocity algorithm

A numerical algorithm is presented which is used to solve the unsteady, fully three-dimensional, incompressible Navier-Stokes equations in vorticity-velocity variables. A discussion of the discrete approximation scheme is presented as well as the solution method used to solve the resulting algebraic set of difference equations. Second order spatial and temporal accuracy is verified through solution comparisons with exact results obtained for steady three-dimensional stagnation point flow and unsteady axisymmetric vortex spin-up. In addition, results are presented for the problem of unsteady bubble-type vortex breakdown with emphasis on internal bubble dynamics and structure.

Gatski, T. B.↗

Implementation of a partitioned algorithm for simulation of large CSI problems

The implementation of a partitioned numerical algorithm for determining the dynamic response of coupled structure/controller/estimator finite-dimensional systems is reviewed. The partitioned approach leads to a set of coupled first and second-order linear differential equations which are numerically integrated with extrapolation and implicit step methods. The present software implementation, ACSIS, utilizes parallel processing techniques at various levels to optimize performance on a shared-memory concurrent/vector processing system. A general procedure for the design of controller and filter gains is also implemented, which utilizes the vibration characteristics of the structure to be solved. Also presented are: example problems; a user's guide to the software; the procedures and algorithm scripts; a stability analysis for the algorithm; and the source code for the parallel implementation.

Alvin, Kenneth F.↗

Exascale applications: skin in the game

As noted in Wikipedia, skin in the game refers to having ‘incurred risk by being involved in achieving a goal’, where ‘ skin is a synecdoche for the person involved, and game is the metaphor for actions on the field of play under discussion’. For exascale applications under development in the US Department of Energy Exascale Computing Project, nothing could be more apt, with the skin being exascale applications and the game being delivering comprehensive science-based computational applications that effectively exploit exascale high-performance computing technologies to provide breakthrough modelling and simulation and data science solutions. These solutions will yield high-confidence insights and answers to the most critical problems and challenges for the USA in scientific discovery, national security, energy assurance, economic competitiveness and advanced healthcare. This article is part of a discussion meeting issue ‘Numerical algorithms for high-performance computational science’.

97 MATHEMATICS AND COMPUTING↗

Continuum gyrokinetic simulations of edge plasmas in single-null geometries

The first continuum gyrokinetic calculations of electrostatic ion scale turbulence are presented for the case of a diverted tokamak geometry. The simulation model solves the long-wavelength limit of the full-F gyrokinetic equation for ion species coupled to the quasi-neutrality equation for electrostatic potential variations, where a fluid model is used for an electron response. Furthermore, in order to facilitate simulations of highly-anisotropic microturbulence in the presence of strong magnetic shear and a magnetic X-point, a numerical algorithm utilizing a locally field-aligned multiblock coordinate system has been developed and implemented in the 5D finite-volume code COGENT. In this approach, the toroidal direction is divided into blocks, such that within each block, the cells are field-aligned and a non-matching grid interface is allowed at block boundaries. The toroidal angle corresponds to the “coarse” field-aligned coordinate, whereas the poloidal cross section, comprised of the radial and poloidal directions, is finely gridded to resolve short-scale perpendicular turbulence structures and to support accurate re-mapping (interpolation) at block boundaries. The 5D simulations explore cross-separatrix ion scale turbulence in the presence of a self-consistent radial electric field and address the effects of magnetic-shear stabilization in the X-point region.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Specular reflection treatment for the 3D radiative transfer equation solved with the discrete ordinates method

The contribution of this paper relies in the development of numerical algorithms for the mathematical treatment of specular reflection on borders when dealing with the numerical solution of radiative transfer problems. The radiative transfer equation being integro-differential, the discrete ordinates method allows to write down a set of semi-discrete equations in which weights are to be calculated. The calculation of these weights is well known to be based on either a quadrature or on angular discretization, making the use of such method straightforward for the state equation. Also, the diffuse contribution of reflection on borders is usually well taken into account. However, the calculation of accurate partition ratio coefficients is much more tricky for the specular condition applied on arbitrary geometrical borders. This paper presents algorithms that calculate analytically partition ratio coefficients needed in numerical treatments. The developed algorithms, combined with a decentered finite element scheme, are validated with the help of comparisons with analytical solutions before being applied on complex geometries.

97 MATHEMATICS AND COMPUTING↗

Qualitative Analysis, Structure-Preserving Discretizations and Scalable Solvers for Multiphysics Problems. Final Technical Report

Many problems in physics, engineering, meteorology, computer science, and other fields involve a certain level of coupling between different physical quantities. With the development of advanced computational modeling, simulation, and hardware, simulations for many important multiphysics/multiscale coupling effects are now more tractable. In this project, we have developed robust, efficient, and practical numerical algorithms for such simulation software that are capable of tackling these complex mathematical models in many fundamental ways such as stability, wellposedness, and consistency. We expect that such an integrated theoretical and algorithmic framework will have a substantial impact on numerous multiscale and multiphysics modeling and simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗