Search NASA⌕ Search

SEARCH · Search NASA

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 1,513 records · Page 84

On the Numerical Dispersion of Electromagnetic Particle-In-Cell Code : Finite Grid Instability

The Particle-In-Cell (PIC) method is widely used in relativistic particle beam and laser plasma modeling. However, the PIC method exhibits numerical instabilities that can render unphysical simulation results or even destroy the simulation. For electromagnetic relativistic beam and plasma modeling, the most relevant numerical instabilities are the finite grid instability and the numerical Cherenkov instability. We review the numerical dispersion relation of the electromagnetic PIC algorithm to analyze the origin of these instabilities. We rigorously derive the faithful 3D numerical dispersion of the PIC algorithm, and then specialize to the Yee FDTD scheme. In particular, we account for the manner in which the PIC algorithm updates and samples the fields and distribution function. Temporal and spatial phase factors from solving Maxwell's equations on the Yee grid with the leapfrog scheme are also explicitly accounted for. Numerical solutions to the electrostatic-like modes in the 1D dispersion relation for a cold drifting plasma are obtained for parameters of interest. In the succeeding analysis, we investigate how the finite grid instability arises from the interaction of the numerical 1D modes admitted in the system and their aliases. The most significant interaction is due critically to the correct representation of the operators in the dispersion relation. We obtain a simple analytic expression for the peak growth rate due to this interaction.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An Eulerian multimaterial framework for simulating high-explosive aquarium tests

Aquarium tests of cylindrical high-explosive charges provide optical data of the detonation front velocity and shape, propagation of the shock wave in the surrounding water, and expansion rates of the detonation products behind the front. Data from aquarium experiments is often used for calibration of reactive burn models based on phenomenological equations of state (EOS) and reaction rate laws. This paper presents a multimaterial numerical modeling framework to solve the 2D axisymmetric reactive Euler equations for high-explosive aquarium tests, in particular for ammonium nitrate - fuel oil (ANFO) explosives. An extension of the Ghost Fluid Method (GFM) is used to handle the dynamic material interfaces for the ANFO explosion products, the charge-confining material (polymethyl methacrylate PMMA), and the surrounding water. This study analyzes the sensitivity of calculations (both computational efficiency and numerical accuracy) to different algorithms for the material interface models including the original GFM versus Riemann solver-based strategies. A novel method for defining the left and right states in the interfacial Riemann problem eliminates the need for sorting or nodal interpolation during the projection along the material interface. Numerical tests indicate that populating the interface node values using the Riemann solution mitigate the overheating error observed in steady-state calculations. Solution convergence and computational efficiency are explored as a function of the spatial and temporal order of the schemes. Results from the computational model with analytical equations of state and fitted reaction rate parameters show very good quantitative agreement with experimentally observed detonation front velocity, reaction products expansion, and shock wave propagation in the surrounding water for a cylindrical ANFO charge encased in PMMA. Finally, the proposed modeling framework, in conjunction with experimental tests, provides a reliable tool to assess equations of state and reaction rate expressions for reactive burn models of confined high explosives.

42 ENGINEERING↗

A self-correcting variable-metric algorithm framework for nonsmooth optimization

Abstract An algorithm framework is proposed for minimizing nonsmooth functions. The framework is variable metric in that, in each iteration, a step is computed using a symmetric positive-definite matrix whose value is updated as in a quasi-Newton scheme. However, unlike previously proposed variable-metric algorithms for minimizing nonsmooth functions, the framework exploits self-correcting properties made possible through Broyden–Fletcher–Goldfarb–Shanno-type updating. In so doing, the framework does not overly restrict the manner in which the step computation matrices are updated, yet the scheme is controlled well enough that global convergence guarantees can be established. The results of numerical experiments for a few algorithms are presented to demonstrate the self-correcting behaviours that are guaranteed by the framework.

Mathematics↗

Solar-Tracker Diffuse-Response Algorithm for Balancing Energy Gain and Mechanical Wear in Photovoltaic Systems

Single-axis solar tracking maximizes photovoltaic energy production under clear-sky conditions; however, its effectiveness decreases under cloudy and overcast skies, where diffuse irradiance dominates and the optimal module orientation changes. Conventional tracking algorithms either neglect sky conditions or rely on simplified diffuse-response strategies that may trigger frequent tracker repositioning under variable cloud cover, leading to increased mechanical wear with marginal energy gains. This work proposes an enhanced diffuse-response tracking algorithm that explicitly accounts for both the intensity and temporal persistence of cloudiness. By requiring overcast conditions to persist for a minimum duration before reorienting the tracker to a diffuse-stow position, the proposed approach reduces unnecessary movements while preserving the benefits of diffuse-response operation. The algorithm is evaluated through numerical simulations based on historical meteorological data and validated using field measurements on monofacial and bifacial photovoltaic strings. The results show that the proposed strategy reduces excess tracker movement from 114% to 0.16% while maintaining nearly the same energy yield. Compared to a conventional diffuse-response algorithm, the associated energy reduction is minimal (≈0.17%) relative to the ≈0.37% yield gain observed at the studied location. These findings demonstrate that incorporating cloudiness duration enables a practical compromise between energy performance and tracker durability, particularly for monofacial photovoltaic systems.

14 SOLAR ENERGY↗

Study of the Z{sub 3} symmetry in QCD at finite temperature and chemical potential using a worm algorithm

Traditional Monte Carlo simulations of QCD in the presence of a baryon chemical potential are plagued by the complex phase problem and new numerical approaches are necessary for studying the phase diagram of the theory. In this work we consider a Z{sub 3} Polyakov loop model for the deconfining phase transition in QCD and discuss how a flux representation of the model in terms of dimer and monomer variable solves the complex action problem. We present results of numerical simulations using a worm algorithm for the specific heat and two-point correlation function of Polyakov loops. Evidences of a first order deconfinement phase transition are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Real Time Optima Tracking Using Harvesting Models of the Genetic Algorithm

Tracking optima in real time propulsion control, particularly for non-stationary optimization problems is a challenging task. Several approaches have been put forward for such a study including the numerical method called the genetic algorithm. In brief, this approach is built upon Darwinian-style competition between numerical alternatives displayed in the form of binary strings, or by analogy to 'pseudogenes'. Breeding of improved solution is an often cited parallel to natural selection in.evolutionary or soft computing. In this report we present our results of applying a novel model of a genetic algorithm for tracking optima in propulsion engineering and in real time control. We specialize the algorithm to mission profiling and planning optimizations, both to select reduced propulsion needs through trajectory planning and to explore time or fuel conservation strategies.

Baskaran, Subbiah↗

Data-Centric Approach to Capture Non-Polynomial Nonlinear Dynamics

We propose an analytical construction of observable functions in the extended dynamic mode decomposition (EDMD) algorithm. EDMD is a numerical method for approximating the spectral properties of the Koopman operator. The choice of observable functions is fundamental for applying EDMD to nonlinear problems arising in systems and control. Existing methods either start from a set of dictionary functions and look for the subset that best fits the underlying nonlinear dynamics or rely on machine learning algorithms to “learn” observable functions. Conversely, in this paper, we start from the dynamical system model and lift it through the Lie derivatives, rendering it into a polynomial form. This proposed transformation into a polynomial form is exact and provides an adequate set of observable functions. The strength of the proposed approach is its applicability to a broader class of nonlinear dynamical systems, particularly those with nonpolynomial functions and compositions thereof. Moreover, it retains the physical interpretability of the underlying dynamical system and can be readily integrated into existing numerical libraries. We demonstrate the proposed approach with an application to electric power systems. The modeled system consists of a single generator connected to an infinite bus, where nonlinear terms include sine and cosine functions. The results demonstrate the effectiveness of the proposed procedure in off-attractor nonlinear dynamics for estimation and prediction; the observable functions obtained from the proposed construction outperform methods that use dictionary functions comprising monomials or radial basis functions.

extended dynamic mode decomposition↗

Motion-map constrained image reconstruction (MCIR): Application to four-dimensional cone-beam computed tomography

Purpose: Utilization of respiratory correlated four-dimensional cone-beam computed tomography (4DCBCT) has enabled verification of internal target motion and volume immediately prior to treatment. However, with current standard CBCT scan, 4DCBCT poses challenge for reconstruction due to the fact that multiple phase binning leads to insufficient number of projection data to reconstruct and thus cause streaking artifacts. The purpose of this study is to develop a novel 4DCBCT reconstruction algorithm framework called motion-map constrained image reconstruction (MCIR), that allows reconstruction of high quality and high phase resolution 4DCBCT images with no more than the imaging dose as well as projections used in a standard free breathing 3DCBCT (FB-3DCBCT) scan.Methods: The unknown 4DCBCT volume at each phase was mathematically modeled as a combination of FB-3DCBCT and phase-specific update vector which has an associated motion-map matrix. The motion-map matrix, which is the key innovation of the MCIR algorithm, was defined as the matrix that distinguishes voxels that are moving from stationary ones. This 4DCBCT model was then reconstructed with compressed sensing (CS) reconstruction framework such that the voxels with high motion would be aggressively updated by the phase-wise sorted projections and the voxels with less motion would be minimally updated to preserve the FB-3DCBCT. To evaluate the performance of our proposed MCIR algorithm, we evaluated both numerical phantoms and a lung cancer patient. The results were then compared with the (1) clinical FB-3DCBCT reconstructed using the FDK, (2) 4DCBCT reconstructed using the FDK, and (3) 4DCBCT reconstructed using the well-known prior image constrained compressed sensing (PICCS).Results: Examination of the MCIR algorithm showed that high phase-resolved 4DCBCT with sets of up to 20 phases using a typical FB-3DCBCT scan could be reconstructed without compromising the image quality. Moreover, in comparison with other published algorithms, the image quality of the MCIR algorithm is shown to be excellent.Conclusions: This work demonstrates the potential for providing high-quality 4DCBCT during on-line image-guided radiation therapy (IGRT), without increasing the imaging dose. The results showed that (at least) 20 phase images could be reconstructed using the same projections data, used to reconstruct a single FB-3DCBCT, without streak artifacts that are caused by insufficient projections.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Unsupervised classification of Space Acceleration Measurement System (SAMS) data using ART2-A

The Space Acceleration Measurement System (SAMS) has been developed by NASA to monitor the microgravity acceleration environment aboard the space shuttle. The amount of data collected by a SAMS unit during a shuttle mission is in the several gigabytes range. Adaptive Resonance Theory 2-A (ART2-A), an unsupervised neural network, has been used to cluster these data and to develop cause and effect relationships among disturbances and the acceleration environment. Using input patterns formed on the basis of power spectral densities (psd), data collected from two missions, STS-050 and STS-057, have been clustered.

STS-57 Shuttle Project↗

Non-adiabatic molecular dynamics by accelerated semiclassical Monte Carlo

Non-adiabatic dynamics, where systems non-radiatively transition between electronic states, plays a crucial role in many photo-physical processes, such as fluorescence, phosphorescence, and photoisomerization. Methods for the simulation of non-adiabatic dynamics are typically either numerically impractical, highly complex, or based on approximations which can result in failure for even simple systems. Recently, the Semiclassical Monte Carlo (SCMC) approach was developed in an attempt to combine the accuracy of rigorous semiclassical methods with the efficiency and simplicity of widely used surface hopping methods. However, while SCMC was found to be more efficient than other semiclassical methods, it is not yet as efficient as is needed to be used for large molecular systems. Here, we have developed two new methods: the accelerated-SCMC and the accelerated-SCMC with re-Gaussianization, which reduce the cost of the SCMC algorithm up to two orders of magnitude for certain systems. In most cases shown here, the new procedures are nearly as efficient as the commonly used surface hopping schemes, with little to no loss of accuracy. This implies that these modified SCMC algorithms will be of practical numerical solutions for simulating non-adiabatic dynamics in realistic molecular systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dynamical approach study of spurious steady-state numerical solutions of nonlinear differential equations. Part 1: The ODE connection and its implications for algorithm development in computational fluid dynamics

Spurious stable as well as unstable steady state numerical solutions, spurious asymptotic numerical solutions of higher period, and even stable chaotic behavior can occur when finite difference methods are used to solve nonlinear differential equations (DE) numerically. The occurrence of spurious asymptotes is independent of whether the DE possesses a unique steady state or has additional periodic solutions and/or exhibits chaotic phenomena. The form of the nonlinear DEs and the type of numerical schemes are the determining factor. In addition, the occurrence of spurious steady states is not restricted to the time steps that are beyond the linearized stability limit of the scheme. In many instances, it can occur below the linearized stability limit. Therefore, it is essential for practitioners in computational sciences to be knowledgeable about the dynamical behavior of finite difference methods for nonlinear scalar DEs before the actual application of these methods to practical computations. It is also important to change the traditional way of thinking and practices when dealing with genuinely nonlinear problems. In the past, spurious asymptotes were observed in numerical computations but tended to be ignored because they all were assumed to lie beyond the linearized stability limits of the time step parameter delta t. As can be seen from the study, bifurcations to and from spurious asymptotic solutions and transitions to computational instability not only are highly scheme dependent and problem dependent, but also initial data and boundary condition dependent, and not limited to time steps that are beyond the linearized stability limit.

Yee, H. C.↗

A Leap-Frog Discontinuous Galerkin Method for the Time-Domain Maxwell's Equations in Metamaterials

Numerical simulation of metamaterials play a very important role in the design of invisibility cloak, and sub-wavelength imaging. In this paper, we propose a leap-frog discontinuous Galerkin method to solve the time-dependent Maxwell’s equations in metamaterials. Conditional stability and error estimates are proved for the scheme. The proposed algorithm is implemented and numerical results supporting the analysis are provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distributionally Robust Variational Quantum Algorithms With Shifted Noise

Given their potential to demonstrate near-term quantum advantage, variational quantum algorithms (VQAs) have been extensively studied. Although numerous techniques have been developed for VQA parameter optimization, it remains a significant challenge. A practical issue is the high sensitivity of quantum noise to environmental changes, and its propensity to shift in real time. This presents a critical problem as an optimized VQA ansatz may not perform effectively under a different noise environment. For the first time, we explore how to optimize VQA parameters to be robust against unknown shifted noise. We model the noise level as a random variable with an unknown probability density function (PDF), and we assume that the PDF may shift within an uncertainty set. This assumption guides us to formulate a distributionally robust optimization problem, with the goal of finding parameters that maintain effectiveness under shifted noise. We utilize a distributionally robust Bayesian optimization solver for our proposed formulation. This provides numerical evidence in both the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) with hardware-efficient ansatz, indicating that we can identify parameters that perform more robustly under shifted noise. We regard this work as the first step towards improving the reliability of VQAs influenced by real-time noise.

97 MATHEMATICS AND COMPUTING↗

Numerical heating in particle-in-cell simulations with Monte Carlo binary collisions

The binary Monte Carlo (MC) collision algorithm is a standard and robust method to include binary Coulomb collision effects in particle-in-cell (PIC) simulations of plasmas. Here we show that the coupling between PIC and MC algorithms can give rise to (nonphysical) numerical heating of the system that significantly exceeds that observed when these algorithms operate independently. We argue that this deleterious effect results from an inconsistency between the particle motion associated with MC collisions and the work performed by the collective electromagnetic field on the PIC grid. This inconsistency manifests as the (artificial) stochastic production of electromagnetic energy, which ultimately heats the plasma particles. Here, the MC-induced numerical heating can significantly impact the evolution of the simulated system for long simulation times (≳10 3 collision periods, for typical numerical parameters). We describe the source of the MC-induced numerical heating analytically and discuss strategies to minimize it.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Preprocessing Inconsistent Linear System for a Meaningful Least Squares Solution

Mathematical models of many physical/statistical problems are systems of linear equations. Due to measurement and possible human errors/mistakes in modeling/data, as well as due to certain assumptions to reduce complexity, inconsistency (contradiction) is injected into the model, viz. the linear system. While any inconsistent system irrespective of the degree of inconsistency has always a least-squares solution, one needs to check whether an equation is too much inconsistent or, equivalently too much contradictory. Such an equation will affect/distort the least-squares solution to such an extent that renders it unacceptable/unfit to be used in a real-world application. We propose an algorithm which (i) prunes numerically redundant linear equations from the system as these do not add any new information to the model, (ii) detects contradictory linear equations along with their degree of contradiction (inconsistency index), (iii) removes those equations presumed to be too contradictory, and then (iv) obtain the minimum norm least-squares solution of the acceptably inconsistent reduced linear system. The algorithm presented in Matlab reduces the computational and storage complexities and also improves the accuracy of the solution. It also provides the necessary warning about the existence of too much contradiction in the model. In addition, we suggest a thorough relook into the mathematical modeling to determine the reason why unacceptable contradiction has occurred thus prompting us to make necessary corrections/modifications to the models - both mathematical and, if necessary, physical.

Sen, Syamal K.↗