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 631 records · Page 35

Determination of photophysical parameters of chlorophyll {alpha} in photosynthetic organisms using the method of nonlinear laser fluorimetry

We study the possibility of solving the multiparameter inverse problem of nonlinear laser fluorimetry of molecular systems with high local concentration of fluorophores (by the example of chlorophyll {alpha} molecules in photosynthetic organisms). The algorithms are proposed that allow determination of up to four photophysical parameters of chlorophyll {alpha} from the experimental fluorescence saturation curves. The uniqueness and stability of the inverse problem solution obtained using the proposed algorithms were assessed numerically. The laser spectrometer, designed in the course of carrying out the work and aimed at nonlinear laser fluorimetry in the quasi-stationary and nonstationary excitation regimes is described. The algorithms, proposed in this paper, are tested on pure cultures of microalgae Chlorella pyrenoidosa and Chlamydomonas reinhardtii under different functional conditions. (optical technologies in biophysics and medicine)

60 APPLIED LIFE SCIENCES↗

Engineering Privacy at the Edge: A Practical Guide to Differential Privacy in System Architectures

The rapid expansion of distributed and edge computing platforms—spanning autonomous vehicles, IoT sensors, and healthcare monitors—has heightened concerns about data privacy. Differential Privacy (DP) offers a rigorous mathematical framework to protect sensitive information while retaining analytical utility. This tutorial introduces the foundations of DP for both numerical and categorical datasets and extends the discussion to correlation-aware techniques tailored for structured and high-dimensional data. Hands-on demonstrations will begin with the PETINA (Privacy prEservaTIoN Algorithms) package for numerical data and continue with MIC-DP (Maximum Information Correlated Differential Privacy) for tabular data. Designed for researchers and practitioners in secure systems, embedded architectures, and AI accelerators, the tutorial emphasizes practical and scalable methods for integrating DP into real-world system designs.

Kotevska, Olivera [ORNL] (ORCID:0000000316772243)↗

Synchrophasor Data Correction under GPS Spoofing Attack: A State Estimation-Based Approach

GPS spoofing attack (GSA) has been shown to be one of the most imminent threats to almost all cyber-physical systems incorporated with the civilian GPS signal. Specifically, for our current agenda of the modernization of the power grid, this may greatly jeopardize the benefits provided by the pervasively installed phasor measurement units (PMU). In this paper, we consider the case where synchrophasor data from PMUs are compromised due to the presence of a single GSA, and show that it can be corrected by signal processing techniques. In particular, we introduce a statistical model for synchrophasorbased power system state estimation (SE), and then derive the spoofing-matched algorithms for synchrophasor data correction against GPS spoofing attack. Different testing scenarios in IEEE 14-, 30-, 57-, 118-bus systems are simulated to show the proposed algorithms’ performance on GSA detection and state estimation. Numerical results demonstrate that our proposed algorithms can consistently locate and correct the spoofed synchrophasor data with good accuracy as long as the system observability is satisfied. The accuracy of state estimation is significantly improved compared with the traditional weighted least square method and approaches the performance under the Genie-aided method.

Phasor measurement units, Global Positioning Syste↗

Vibrations of Elastic Shells of Revolution Partially Filled with Ideal Liquid

We propose an algorithm for the numerical analyses of vibrations of elastic shells of revolution partially filled with ideal incompressible liquids. In the solution of this problem, the wave motions of liquid on its free surface are taken into account. The solution of the problem of hydroelasticity is based on the application of the method of decomposition of the domain of integration of equations of the theory of shells with the use of the variational statement of the problem and on the approximate construction of the operator inverse to the operator of the hydrodynamic part of the problem. We construct a generalized functional of displacements of the shell for which the role of conditions of matching for the solutions in different subdomains is played by the natural boundary conditions. The obtained numerical results are compared with the existing exact solutions of the analyzed problem for a shell in the form of a straight circular cylinder.

42 ENGINEERING↗

Variational control forces for enhanced sampling of nonequilibrium molecular dynamics simulations

We introduce a variational algorithm to estimate the likelihood of a rare event within a nonequilibrium molecular dynamics simulation through the evaluation of an optimal control force. Optimization of a control force within a chosen basis is made possible by explicit forms for the gradients of a cost function in terms of the susceptibility of driven trajectories to changes in variational parameters. We consider probabilities of time-integrated dynamical observables as characterized by their large deviation functions and find that in many cases, the variational estimate is quantitatively accurate. Additionally, we provide expressions to exactly correct the variational estimate that can be evaluated directly. We benchmark this algorithm against the numerically exact solution of a model of a driven particle in a periodic potential, where the control force can be represented with a complete basis. Additionally, we then demonstrate the utility of the algorithm in a model of repulsive particles on a line, which undergo a dynamical phase transition, resulting in singular changes to the form of the optimal control force. In both systems, we find fast convergence and are able to evaluate large deviation functions with significant increases in statistical efficiency over alternative Monte Carlo approaches.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An accelerated threshold-based back-projection algorithm for Compton camera image reconstruction

Purpose: Compton camera imaging (CCI) systems are currently under investigation for radiotherapy dose reconstruction and verification. The ability of such a system to provide real-time images during dose delivery will be limited by the computational speed of the image reconstruction algorithm. In this work, the authors present a fast and simple method by which to generate an initial back-projected image from acquired CCI data, suitable for use in a filtered back-projection algorithm or as a starting point for iterative reconstruction algorithms, and compare its performance to the current state of the art. Methods: Each detector event in a CCI system describes a conical surface that includes the true point of origin of the detected photon. Numerical image reconstruction algorithms require, as a first step, the back-projection of each of these conical surfaces into an image space. The algorithm presented here first generates a solution matrix for each slice of the image space by solving the intersection of the conical surface with the image plane. Each element of the solution matrix is proportional to the distance of the corresponding voxel from the true intersection curve. A threshold function was developed to extract those pixels sufficiently close to the true intersection to generate a binary intersection curve. This process is repeated for each image plane for each CCI detector event, resulting in a three-dimensional back-projection image. The performance of this algorithm was tested against a marching algorithm known for speed and accuracy. Results: The threshold-based algorithm was found to be approximately four times faster than the current state of the art with minimal deficit to image quality, arising from the fact that a generically applicable threshold function cannot provide perfect results in all situations. The algorithm fails to extract a complete intersection curve in image slices near the detector surface for detector event cones having axes nearly parallel to the image plane. This effect decreases the sum of the image, thereby also affecting the mean, standard deviation, and SNR of the image. All back-projected events associated with a simulated point source intersected the voxel containing the source and the FWHM of the back-projected image was similar to that obtained from the marching method. Conclusions: The slight deficit to image quality observed with the threshold-based back-projection algorithm described here is outweighed by the 75% reduction in computation time. The implementation of this method requires the development of an optimum threshold function, which determines the overall accuracy of the method. This makes the algorithm well-suited to applications involving the reconstruction of many large images, where the time invested in threshold development is offset by the decreased image reconstruction time. Implemented in a parallel-computing environment, the threshold-based algorithm has the potential to provide real-time dose verification for radiation therapy.

60 APPLIED LIFE SCIENCES↗

Numerical Based Linear Model for Dipole Magnets

In this paper, we discuss an algorithm for constructing a numerical linear optics model for dipole magnets from a 3D field map. The difference between the numerical model and K. Brown's analytic approach is investigated and clarified. It was found that the optics distortion due to the dipoles' fringe focusing must be properly taken into account to accurately determine the chromaticities. In NSLS-II, there are normal dipoles with 35-mm gap and dipoles for infrared sources with 90-mm gap. This linear model of the dipole magnets is applied to the NSLS-II lattice design to match optics parameters between the DBA cells having dipoles with different gaps.

43 PARTICLE ACCELERATORS↗

Efficient traveltime solutions of the acoustic TI eikonal equation

Numerical solutions of the eikonal (Hamilton–Jacobi) equation for transversely isotropic (TI) media are essential for imaging and traveltime tomography applications. Such solutions, however, suffer from the inherent higher-order nonlinearity of the TI eikonal equation, which requires solving a quartic polynomial for every grid point. Analytical solutions of the quartic polynomial yield numerically unstable formulations. Thus, it requires a numerical root finding algorithm, adding significantly to the computational load. Using perturbation theory we approximate, in a first order discretized form, the TI eikonal equation with a series of simpler equations for the coefficients of a polynomial expansion of the eikonal solution, in terms of the anellipticity anisotropy parameter. Such perturbation, applied to the discretized form of the eikonal equation, does not impose any restrictions on the complexity of the perturbed parameter field. Therefore, it provides accurate traveltime solutions even for models with complex distribution of velocity and anisotropic anellipticity parameter, such as that for the complicated Marmousi model. The formulation allows for large cost reduction compared to using the direct TI eikonal solver. Furthermore, comparative tests with previously developed approximations illustrate remarkable gain in accuracy in the proposed algorithm, without any addition to the computational cost.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient fully-coherent quantum signal processing algorithms for real-time dynamics simulation

Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the simulation of electronic dynamics, which plays an essential role in chemical reactions, non-equilibrium dynamics, and material design. These systems are time-dependent, which requires that the corresponding simulation algorithm can be successfully concatenated with itself over different time intervals to reproduce the overall coherent quantum dynamics of the system. In this paper, we quantify such simulation algorithms by the property of being fully-coherent: the algorithm succeeds with arbitrarily high success probability 1 − δ while only requiring a single copy of the initial state. Here we subsequently develop fully-coherent simulation algorithms based on quantum signal processing (QSP), including a novel algorithm that circumvents the use of amplitude amplification while also achieving a query complexity additive in time t, ln(1/δ), and ln(1/ϵ) for error tolerance ϵ: $Θ‖\mathscr{H}‖|t|+ln(1/ϵ)+ln(1/δ)$. Furthermore, we numerically analyze these algorithms by applying them to the simulation of the spin dynamics of the Heisenberg model and the correlated electronic dynamics of an H2 molecule. Since any electronic Hamiltonian can be mapped to a spin Hamiltonian, our algorithm can efficiently simulate time-dependent ab initio electronic dynamics in the circuit model of quantum computation. Accordingly, it is also our hope that the present work serves as a bridge between QSP-based quantum algorithms and chemical dynamics, stimulating a cross-fertilization between these exciting fields.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Towards a Verifiable Domain-Specific Language for Hardware-Accelerated Stencils

Defining a domain-specific language (DSL) that supports vector-calculus abstractions eases the porting of partial differential equation (PDE) solvers to specialized architectures. Sufficiently high-level abstractions empower users to express universal laws with sufficient generality that the laws must always hold true within their domain of validity. A broad class of PDE solvers employs stencil-based algorithms, the target domain of Berkeley Lab's stencil accelerator chip co-design project. First released as open-source in January 2026, the Formal software framework lays a foundation for defining an embedded DSL based on composable operators that implement mimetic numerical methods -- stencil algorithms that guarantee satisfaction of discrete versions of important vector calculus theorems. The Formal DSL will be the frontend to a new class of stencil-PDE accelerators developed jointly by LBNL, UHCL, and UC Berkeley through the DOE Competitive Portfolios for Computer Science Project. This offers the potential of an order of magnitude acceleration for this important category of computational methods to serve the DOE mission. Future work on the Formal DSL will facilitate software verification via type-safe templates that enable problem-specific correctness proofs relying upon generic function theory and carefully crafted unit tests.

Rouson, Damian↗

A crisis for the verification and validation of turbulence simulations

Three algorithms have been proposed for solution of the Rayleigh–Taylor turbulent mixing problem. They are based upon three different physical principles governing the Euler equations for fluid flow. The principles serve to select the physically relevant solution from among many nonunique solutions. The admissibility principle is in dispute. The three different algorithms, expressing the three physical admissibility principles can be formulated in terms of the three energy dissipation rates or the entropy production rates, as selected by the size of the sub grid scale coefficients. These have maximal values or less than maximal values. The resulting solutions are markedly different. We find strong validation evidence that supports the maximum rate principle, based on a review of prior results and on new results presented here. We review experimental data used for validation and sufficient to discriminate among the three. We present a new analysis of this data. We show that the hypothesized long wave length perturbations in the initial conditions are not significant, so that validation can be based on this data in a straight forward manner. One of the algorithms is labeled direct numerical simulation, but is not, and as a consequence, the two algorithms with less than maximal SGS coefficients are variants of one another. Finally recommendations for the numerical modeling of the deflagration to detonation transition in type Ia supernova are discussed.

79 ASTRONOMY AND ASTROPHYSICS↗

Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems

Algorithms from Randomized Numerical Linear Algebra (RandNLA) are known to be effective in handling high-dimensional computational problems, providing high-quality empirical performance as well as strong probabilistic guarantees. However, their practical application is complicated by the fact that the user needs to set various algorithm-specific tuning parameters which are different from those used in traditional NLA. This paper demonstrates how a surrogate-based autotuning approach can be used to address fundamental problems of parameter selection in RandNLA algorithms. In particular, we provide a detailed investigation of surrogate-based autotuning for sketch-and-precondition (SAP)-based randomized least squares methods, which have been one of the great success stories in modern RandNLA. Empirical results show that our surrogate-based autotuning approach can achieve near-optimal performance with much less tuning cost than a random search (up to about 7.6x fewer trials of different parameter configurations). Moreover, while our experiments focus on least squares, our results demonstrate a general-purpose autotuning pipeline applicable to any kind of RandNLA algorithm.

Cho, Younghyun↗

Nonlinear dynamics of drift structures in a magnetized dissipative plasma

A study is made of the nonlinear dynamics of solitary vortex structures in an inhomogeneous magnetized dissipative plasma. A nonlinear transport equation for long-wavelength drift wave structures is derived with allowance for the nonuniformity of the plasma density and temperature equilibria, as well as the magnetic and collisional viscosity of the medium and its friction. The dynamic equation describes two types of nonlinearity: scalar (due to the temperature inhomogeneity) and vector (due to the convectively polarized motion of the particles of the medium). The equation is fourth order in the spatial derivatives, in contrast to the second-order Hasegawa-Mima equations. An analytic steady solution to the nonlinear equation is obtained that describes a new type of solitary dipole vortex. The nonlinear dynamic equation is integrated numerically. A new algorithm and a new finite difference scheme for solving the equation are proposed, and it is proved that the solution so obtained is unique. The equation is used to investigate how the initially steady dipole vortex constructed here behaves unsteadily under the action of the factors just mentioned. Numerical simulations revealed that the role of the vector nonlinearity is twofold: it helps the dispersion or the scalar nonlinearity (depending on their magnitude) to ensure the mutual equilibrium and, thereby, promote self-organization of the vortical structures. It is shown that dispersion breaks the initial dipole vortex into a set of tightly packed, smaller scale, less intense monopole vortices-alternating cyclones and anticyclones. When the dispersion of the evolving initial dipole vortex is weak, the scalar nonlinearity symmetrically breaks a cyclone-anticyclone pair into a cyclone and an anticyclone, which are independent of one another and have essentially the same intensity, shape, and size. The stronger the dispersion, the more anisotropic the process whereby the structures break: the anticyclone is more intense and localized, while the cyclone is less intense and has a larger size. In the course of further evolution, the cyclone persists for a relatively longer time, while the anticyclone breaks into small-scale vortices and dissipation hastens this process. It is found that the relaxation of the vortex by viscous dissipation differs in character from that by the frictional force. The time scale on which the vortex is damped depends strongly on its typical size: larger scale vortices are longer lived structures. It is shown that, as the instability develops, the initial vortex is amplified and the lifetime of the dipole pair components-cyclone and anticyclone-becomes longer. As time elapses, small-scale noise is generated in the system, and the spatial structure of the perturbation potential becomes irregular. The pattern of interaction of solitary vortex structures among themselves and with the medium shows that they can take part in strong drift turbulence and anomalous transport of heat and matter in an inhomogeneous magnetized plasma.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fast verified computation for the minimal nonnegative solution of the nonsymmetric algebraic Riccati equation

A fast iterative algorithm is proposed for numerically computing an interval matrix containing the minimal nonnegative solution of the nonsymmetric algebraic Riccati equation associated with M-matrix. This algorithm involves only cubic complexity per iteration, and moreover verifies the uniqueness of the contained solution. Numerical results show properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗

Asynchronous Truncated Multigrid-Reduction-in-Time

In this paper, we present the new “asynchronous truncated multigrid-reduction-in-time” (AT-MGRIT) algorithm for introducing time parallelism to the solution of discretized time-dependent problems. The new algorithm is based on the multigrid-reduction-in-time (MGRIT) approach, which, in certain settings, is equivalent to another common multilevel parallel-in-time method, Parareal. In contrast to Parareal and MGRIT that both consider a global temporal grid over the entire time interval on the coarsest level, the AT-MGRIT algorithm uses truncated local time grids on the coarsest level, each grid covering certain temporal subintervals. Further, these local grids can be solved completely in an independent way from each other, which reduces the sequential part of the algorithm and, thus, increases parallelism in the method. Here, we study the effect of using truncated local coarse grids on the convergence of the algorithm, both theoretically and numerically, and show, using challenging nonlinear problems, that the new algorithm consistently outperforms classical Parareal/MGRIT in terms of time to solution.

97 MATHEMATICS AND COMPUTING↗

ARKODE: A Flexible IVP Solver Infrastructure for One-step Methods

We describe the ARKODE library of one-step time integration methods for ordinary differential equation (ODE) initial-value problems (IVPs). In addition to providing standard explicit and diagonally implicit Runge–Kutta methods, ARKODE supports one-step methods designed to treat additive splittings of the IVP, including implicit-explicit (ImEx) additive Runge–Kutta methods and multirate infinitesimal (MRI) methods. We present the role of ARKODE within the SUNDIALS suite of time integration and nonlinear solver libraries, the core ARKODE infrastructure for utilities common to large classes of one-step methods, as well as its use of “time stepper” modules enabling easy incorporation of novel algorithms into the library. Numerical results show example problems of increasing complexity, highlighting the algorithmic flexibility afforded through this infrastructure, and include a larger multiphysics application leveraging multiple algorithmic features from ARKODE and SUNDIALS.

97 MATHEMATICS AND COMPUTING↗

Large-scale atomistic calculations of clusters in intense x-ray pulses

Here, we present the methodology of our recently developed Monte-Carlo/ Molecular-Dynamics method for studying the fundamental ultrafast dynamics induced by high-fluence, high-intensity x-ray free electron laser (XFEL) pulses in clusters. The quantum nature of the initiating ionization process is accounted for by a Monte Carlo method to calculate probabilities of electronic transitions, including photo absorption, inner-shell relaxation, photon scattering, electron collision and recombination dynamics, and thus track the transient electronic configurations explicitly. The freed electrons and ions are followed by classical particle trajectories using a molecular dynamics algorithm. These calculations reveal the surprising role of electron-ion recombination processes that lead to the development of nonuniform spatial charge density profiles in x-ray excited clusters over femtosecond timescales. In the high-intensity limit, it is important to include the recombination dynamics in the calculated scattering response even for a 2- fs pulse. We also demonstrate that our numerical codes and algorithms can make e!cient use of the computational power of massively parallel supercomputers to investigate the intense-field dynamics in systems with increasing complexity and size at the ultrafast timescale and in non-linear x-ray interaction regimes. In particular, picosecond trajectories of XFEL clusters with attosecond time resolution containing millions of particles can be e!ciently computed on upwards of 262,144 processes.

74 ATOMIC AND MOLECULAR PHYSICS↗