Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical algorithms”

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 91 records · Page 5

A massively parallel semi-Lagrangian algorithm for solving the transport equation

The scalar transport equation underpins many models employed in science, engineering, technology and business. Application areas include, but are not restricted to, pollution transport, weather forecasting, video analysis and encoding (the optical flow equation), options and stock pricing (the Black-Scholes equation) and spatially explicit ecological models. Unfortunately finding numerical solutions to this equation which are fast and accurate is not trivial. Moreover, finding such numerical algorithms that can be implemented on high performance computer architectures efficiently is challenging. In this paper the authors describe a massively parallel algorithm for solving the advection portion of the transport equation. We present an approach here which is different to that used in most transport models and which we have tried and tested for various scenarios. The approach employs an intelligent domain decomposition based on the vector field of the system equations and thus automatically partitions the computational domain into algorithmically autonomous regions. The solution of a classic pure advection transport problem is shown to be conservative, monotonic and highly accurate at large time steps. Additionally we demonstrate that the algorithm is highly efficient for high performance computer architectures and thus offers a route towards massively parallel application.

54 ENVIRONMENTAL SCIENCES↗

Representation independent algorithms for molecular response calculations in time-dependent self-consistent field theories

Four different numerical algorithms suitable for a linear scaling implementation of time-dependent Hartree-Fock and Kohn-Sham self-consistent field theories are examined. We compare the performance of modified Lanczos, Arooldi, Davidson, and Rayleigh quotient iterative procedures to solve the random-phase approximation (RPA) (non-Hermitian) and Tamm-Dancoff approximation (TDA) (Hermitian) eigenvalue equations in the molecular orbital-free framework. Semiempirical Hamiltonian models are used to numerically benchmark algorithms for the computation of excited states of realistic molecular systems (conjugated polymers and carbon nanotubes). Convergence behavior and stability are tested with respect to a numerical noise imposed to simulate linear scaling conditions. The results single out the most suitable procedures for linear scaling large-scale time-dependent perturbation theory calculations of electronic excitations.

74 ATOMIC AND MOLECULAR PHYSICS↗

A class of customized proximal point algorithms for linearly constrained convex optimization

In this paper, we propose a class of customized proximal point algorithms for linearly constrained convex optimization problems. The algorithms are implementable, provided that the proximal operator of the objective function is easy to evaluate. We show that, with special setting of the algorithmic scalar, our algorithms contain the customized proximal point algorithm (He et al., Optim Appl 56:559–572, 2013), the linearized augmented Lagrangian method (Yang and Yuan, Math Comput 82:301–329, 2013), the Bregman Operator Splitting algorithm (Zhang et al., SIAM J Imaging Sci 3:253–276, 2010) as special cases. The global convergence and worst-case convergence rate measured by the iteration complexity are established for the proposed algorithms. Numerical results demonstrate that the algorithms work well for a wide range of the scalar.

97 MATHEMATICS AND COMPUTING↗

Sparsified time-dependent Fourier neural operators for fusion simulations

This paper presents a sparsified Fourier neural operator for coupled time-dependent partial differential equations (ST-FNO) as an efficient machine learning surrogate for fluid and particle-based fusion codes such as NIMROD (Non-Ideal Magnetohydrodynamics with Rotation - Open Discussion) and GTC (Gyrokinetic Toroidal Code). ST-FNO leverages the structures in the governing equations and utilizes neural operators to represent Green's function-like numerical operators in the corresponding numerical solvers. Once trained, ST-FNO can rapidly and accurately predict dynamics in fusion devices compared with first-principle numerical algorithms. In general, ST-FNO represents an efficient and accurate machine learning surrogate for numerical simulators for multi-variable nonlinear time-dependent partial differential equations, with the proposed architectures and loss functions. The efficacy of ST-FNO has been demonstrated using quiescent H-mode simulation data from NIMROD and kink-mode simulation data from GTC. The ST-FNO H-mode results show orders of magnitude reduction in memory and central processing unit usage in comparison with the numerical solvers in NIMROD when computing fields over a selected poloidal plane. The ST-FNO kink-mode results achieve a factor of 2 reduction in the number of parameters compared to baseline FNO models without accuracy loss.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Bayesian optimization algorithms for accelerator physics

Accelerator physics relies on numerical algorithms to solve optimization problems in online accelerator control and tasks such as experimental design and model calibration in simulations. The effectiveness of optimization algorithms in discovering ideal solutions for complex challenges with limited resources often determines the problem complexity these methods can address. The accelerator physics community has recognized the advantages of Bayesian optimization algorithms, which leverage statistical surrogate models of objective functions to effectively address complex optimization challenges, especially in the presence of noise during accelerator operation and in resource-intensive physics simulations. In this review article, we offer a conceptual overview of applying Bayesian optimization techniques toward solving optimization problems in accelerator physics. We begin by providing a straightforward explanation of the essential components that make up Bayesian optimization techniques. We then give an overview of current and previous work applying and modifying these techniques to solve accelerator physics challenges. Finally, we explore practical implementation strategies for Bayesian optimization algorithms to maximize their performance, enabling users to effectively address complex optimization challenges in real-time beam control and accelerator design. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗

A Robust Numerical Treatment of Solid-Phase Diffusion in Pseudo Two-Dimensional Lithium-Ion Battery Models

Solid-phase diffusion in active materials of lithium-ion batteries significantly affects charging and safety-related behavior of lithium-ion batteries. Therefore, it is essential to develop an efficient and robust numerical algorithm for solving solid-phase diffusion equations in physics-based battery models. In this work, we discuss the origins of numerical instabilities that can occur when solving the solid-phase diffusion equations using iterative methods. Then, in order to resolve such issues, we propose a simple numerical treatment to the surface flux term of discretized solid-phase diffusion equations. To demonstrate its numerical robustness, the proposed method is implemented into a pseudo two-dimensional (P2D) physics-based battery model and simulations are conducted at wide ranges of operating conditions. Even with extremely poor initial guesses for the Li+ concentrations of the active materials, computations using the proposed method do not diverge and the their computational speeds are comparable to those with conventional initial guesses. Comprehensive tests of the proposed method are also performed with a dynamic current profile based on US06 driving profile and a multi-stage charging profile with very high initial C-rate (12C).

battery modeling↗

Factors impacting performance of multithreaded sparse triangular solve.

As computational science applications grow more parallel with multi-core supercomputers having hundreds of thousands of computational cores, it will become increasingly difficult for solvers to scale. Our approach is to use hybrid MPI/threaded numerical algorithms to solve these systems in order to reduce the number of MPI tasks and increase the parallel efficiency of the algorithm. However, we need efficient threaded numerical kernels to run on the multi-core nodes in order to achieve good parallel efficiency. In this paper, we focus on improving the performance of a multithreaded triangular solver, an important kernel for preconditioning. We analyze three factors that affect the parallel performance of this threaded kernel and obtain good scalability on the multi-core nodes for a range of matrix sizes.

99 GENERAL AND MISCELLANEOUS↗

Factors impacting performance of multithreaded triangular solve.

As computational science applications grow more parallel with multi-core supercomputers having hundreds of thousands of computational cores, it will become increasingly difficult for solvers to scale. Our approach is to use hybrid MPI/threaded numerical algorithms to solve these systems in order to reduce the number of MPI tasks and increase the parallel efficiency of the algorithm. However, we need efficient threaded numerical kernels to run on the multi-core nodes in order to achieve good parallel efficiency. In this paper, we focus on improving the performance of a multithreaded triangular solver, an important kernel for preconditioning. We analyze three factors that affect the parallel performance of this threaded kernel and obtain good scalability on the multi-core nodes for a range of matrix sizes.

99 GENERAL AND MISCELLANEOUS↗

A note on the S-matrix bootstrap for the 2d O(N) bosonic model

In this work we apply the S-matrix bootstrap maximization program to the 2d bosonic O ( N ) integrable model which has N species of scalar particles of mass m and no bound states. Since in previous studies theories were defined by maximizing the coupling between particles and their bound states, the main problem appears to be to find what other functional can be used to define this model. Instead, we argue that the defining property of this integrable model is that it resides at a vertex of the convex space determined by the unitarity and crossing constraints. Thus, the integrable model can be found by maximizing any linear functional whose gradient points in the general direction of the vertex, namely within a cone determined by the normals to the faces intersecting at the vertex. This is a standard problem in applied mathematics, related to semi-definite programming and solvable by fast available numerical algorithms. The information provided by the numerical solution is enough to reproduce the known analytical solution without using integrability, namely the Yang-Baxter equation. This situation seems quite generic so we expect that other theories without continuous parameters can also be found by maximizing linear functionals in the convex space of allowed S-matrices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exploiting data representation for fault tolerance

Incorrect computer hardware behavior may corrupt intermediate computations in numerical algorithms, possibly resulting in incorrect answers. Prior work models misbehaving hardware by randomly flipping bits in memory. We start by accepting this premise, and present an analytic model for the error introduced by a bit flip in an IEEE 754 floating-point number. We then relate this finding to the linear algebra concepts of normalization and matrix equilibration. In particular, we present a case study illustrating that normalizing both vector inputs of a dot product minimizes the probability of a single bit flip causing a large error in the dot product's result. Moreover, the absolute error is either less than one or very large, which allows detection of large errors. Then, we apply this to the GMRES iterative solver. We count all possible errors that can be introduced through faults in arithmetic in the computationally intensive orthogonalization phase of GMRES, and show that when the matrix is equilibrated, the absolute error is bounded above by one.

97 MATHEMATICS AND COMPUTING↗

Fluctuating hydrodynamics and the Rayleigh–Plateau instability

The Rayleigh–Plateau instability occurs when surface tension makes a fluid column become unstable to small perturbations. At nanometer scales, thermal fluctuations are comparable to interfacial energy densities. Consequently, at these scales, thermal fluctuations play a significant role in the dynamics of the instability. These microscopic effects have previously been investigated numerically using particle-based simulations, such as molecular dynamics (MD), and stochastic partial differential equation–based hydrodynamic models, such as stochastic lubrication theory. In this paper, we present an incompressible fluctuating hydrodynamics model with a diffuse-interface formulation for binary fluid mixtures designed for the study of stochastic interfacial phenomena. An efficient numerical algorithm is outlined and validated in numerical simulations of stable equilibrium interfaces. We present results from simulations of the Rayleigh–Plateau instability for long cylinders pinching into droplets for Ohnesorge numbers of Oh = 0.5 and 5.0. Both stochastic and perturbed deterministic simulations are analyzed and ensemble results show significant differences in the temporal evolution of the minimum radius near pinching. Short cylinders, with lengths less than their circumference, were also investigated. As previously observed in MD simulations, we find that thermal fluctuations cause these to pinch in cases where a perturbed cylinder would be stable deterministically. Finally, we show that the fluctuating hydrodynamics model can be applied to study a broader range of surface tension–driven phenomena.

97 MATHEMATICS AND COMPUTING↗

Achieving Higher Order Accuracy in Space in Hydrodynamic Simulations of Self-Gravitating Gas

Modern astrophysical simulation codes employ a variety of numerical algorithms capable of achieving higher-order accuracy in both space and time. Albeit they succeed in achieving an effective higher spatial resolution and in suppressing the numerical damping of waves, to our knowledge, all current astrophysical simulations invoking self-gravity are limited to second-order accuracy in space. If we can devise an algorithm to evaluate self-gravity with a higher-order spatial accuracy, we can better the evaluation of the gravitational acceleration and gravitational energy release which dictate the evolution of many astrophysical systems. Herein, we present a numerical algorithm for self-gravitating hydrodynamics capable of achieving fourth-order accuracy for a given density distribution on a Cartesian uniform grid. First, we derive the cell-averaged gravitational potential at fourth-order accuracy from the cell-averaged density by solving the Poisson equation. Next, we obtain the cell average of the product of the density and gravitational acceleration, which differs from the cell-averaged density multiplied by the cell-averaged gravitational acceleration. We then show the verification of the algorithm by applying it to critical test problems: (1) maintaining equilibria of self-gravitating slabs, even upon advection, (2) evolving a polytropic sphere with a massive power-law envelope, and (3) conservation of specific entropy during the propagation of a sound wave.

79 ASTRONOMY AND ASTROPHYSICS↗

Achieving Higher Order Accuracy in Space in Hydrodynamic Simulations of Self-Gravitating Gas

Modern astrophysical simulation codes employ a variety of numerical algorithms capable of achieving higher-order accuracy in both space and time. Albeit they succeed in achieving an effective higher spatial resolution and in suppressing the numerical damping of waves, to our knowledge, all current astrophysical simulations invoking self-gravity are limited to second-order accuracy in space. If we can devise an algorithm to evaluate self-gravity with a higher-order spatial accuracy, we can better the evaluation of the gravitational acceleration and gravitational energy release which dictate the evolution of many astrophysical systems. Herein, we present a numerical algorithm for self-gravitating hydrodynamics capable of achieving fourth order accuracy for a given density distribution on a Cartesian uniform grid. First, we derive the cell-averaged gravitational potential at fourth-order accuracy from the cell-averaged density by solving the Poisson equation. Next, we obtain the cell average of the product of the density and gravitational acceleration, which differs from the cell-averaged density multiplied by the cell-averaged gravitational acceleration. We then show the verification of the algorithm by applying it to critical test problems: (1) maintaining equilibria of self-gravitating slabs, even upon advection, (2) evolving a polytropic sphere with a massive power-law envelope, and (3) conservation of specific entropy during the propagation of a sound wave.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗