SEARCH · Search NASA

Results for “LAPLACE TRANSFORM”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

13 records

All sources NASA NTRS DOE OSTI

DOE OSTI2026

A Monte Carlo Laplace Transform Estimator for Radiation Transport

This work formulates and implements a Laplace transform estimator in a simple Monte Carlo radiation transport code. The estimator maps flux-based quantities of interest, like reaction rates, from a desired phase-space dimension to the complex Laplace domain. This on-the-fly Monte Carlo integration technique enables the spectral analysis of arbitrary nuclear systems via the Laplace transform. A simple code tests the estimator in neutron slowing-down problems across various infinite media, and the results compare well with Ganapol’s uninverted analytical solution of the neutron slowing-down equation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Laplace Transform–Based Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation

Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value transformations are well studied, eigenvalue transformations are distinct, especially for nonnormal matrices. Here, we propose an efficient quantum algorithm for performing a class of eigenvalue transformations that can be expressed as a certain type of matrix Laplace transformation. This allows us to significantly extend the recently developed linear combination of Hamiltonian simulation method [D. An, J.-P. Liu, and L. Lin, Phys. Rev. Lett., 131 (2023), 150603; D. An, A. M. Childs, and L. Lin, Commun. Math. Phys. 407, 19 (2026)] to represent a wider class of eigenvalue transformations, such as powers of the matrix inverse, 𝐴 −𝑘 , and the exponential of the matrix inverse, 𝑒 −𝐴 −1 . The latter can be interpreted as the solution of a mass-matrix differential equation of the form form 𝐴⁢𝑢′⁡⁡(𝑡) =−𝑢⁡(𝑡). We demonstrate that our eigenvalue transformation approach can solve this problem without explicitly inverting 𝐴, thereby reducing the computational complexity.

Laplace transform↗

DOE OSTI2026

Second Order System Study

During my education in mathematics, engineering and physics, I learned transform pairs and their usage mechanics but I never remember seeing the derivations of the solutions to second order ordinary differential equations (ODE) and difference equations. A solution to a question posed in a potential funder meeting put me on a path to solving second order systems using the five principal Fourier based methods: Fourier transform (FT), Z-transform (ZT), discrete time Fourier transform (DTFT), discrete Fourier transform (DFT) and Laplace transform (LT).

42 ENGINEERING↗

DOE OSTI2026

Spectral deconvolution without the deconvolution: Extracting temperature from x-ray Thomson scattering spectra without the source-and-instrument function

X-ray Thomson scattering (XRTS) probes the dynamic structure factor of the system, but the measured spectrum is broadened by the combined source-and-instrument function (SIF) of the setup. In order to extract properties such as temperature from an XRTS spectrum, the broadening by the SIF needs to be removed. Recent work [Dornheim et al. Nat. Commun. 13 , 7911 (2022)] has suggested that the SIF may be deconvolved using the two-sided Laplace transform. However, the extracted information can depend strongly on the shape of the input SIF, and the SIF is in practice challenging to measure accurately. Here, we propose an alternative approach: we demonstrate that considering ratios of Laplace-transformed XRTS spectra collected at different scattering angles is equivalent to performing the deconvolution, but without the need for explicit knowledge of the SIF. From these ratios, it is possible to directly extract the temperature from the scattering spectra, when the system is in thermal equilibrium. We find the method to be generally robust to spectral noise and physical differences between the spectrometers, and we explore situations in which the method breaks down. Furthermore, the fact that consistent temperatures can be extracted for systems in thermal equilibrium indicates that non-equilibrium effects could be identified by inconsistent temperatures of a few eV between the ratios of three or more scattering angles.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

Current interrupt method for calculating the electrochemical impedance in a solid oxide electrolysis stack

Here, in this work the time domain response of Solid Oxide Electrolysis Cells (SOEC) to a current interruption was transformed into the frequency domain using a carrier function Laplace transform, which is fit to the experimental data using a MATLAB Complex Nonlinear Least Squares (CNLS) solver. The hardware implementation, consisting principally of a high-speed switch and a fast-logging Analog to Digital Converter (ADC), was assembled and tested using a calibration module to assess the accuracy, repeatability, and speed of acquisition of the prototype device as compared against a calibrated commercial impedance spectrometer. Additionally, the current interrupt device and commercial FRA were used to acquire the impedance spectra of a four cell SOEC stack with a large, 300 cm 2 , active cell area.

SOEC↗

DOE OSTI2024

Uncertainty-quantification-enabled inversion of nuclear responses

Nuclear quantum many-body methods rely on integral transform techniques to infer properties of electroweak response functions from ground-state expectation values. Retrieving the energy dependence of these responses is highly nontrivial, especially for quantum Monte Carlo methods, as it requires inverting the Laplace transform, a notoriously ill-posed problem. Here, in this work, we propose an artificial neural network architecture suitable for accurate response function reconstruction with precise estimation of the uncertainty of the inversion. We demonstrate the capabilities of this new architecture benchmarking it against maximum entropy and previously developed neural network methods designed for a similar task, paying particular attention to its robustness noise in the Euclidean

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

Orientation reversal and the Chern-Simons natural boundary

We show that the fundamental property of preservation of relations, underlying resurgent analysis, provides a new perspective on crossing a natural boundary, an important general problem in theoretical and mathematical physics. This reveals a deeper rigidity aspect of resurgence in a quantum field theory path integral. The physical context here is the non-perturbative completion of complex Chern-Simons theory that associates to a 3-manifold a collection of q-series invariants labeled by Spinc structures, for which crossing the natural boundary corresponds to orientation reversal of the 3-manifold. Our new resurgent perspective leads to a practical numerical algorithm that generates q-series which are dual to unary q-series composed of false theta functions. Until recently, these duals were only known in a limited number of cases, essentially based on Ramanujan’s mock theta functions, and the common belief was that the duals might not even exist in the general case. Resurgence analysis identifies as primary objects Mordell integrals: up to changes of variables, they are Laplace transforms of resurgent functions. Their unique Borel summed transseries decomposition on either side of the Stokes line is simply the unique decomposition into real and imaginary parts. In turn, the latter are combinations of unary q-series in terms of q and its modular counterpart $\overset{\sim }{q}$ , and are resurgent by construction. The Mordell integral is analytic across the natural boundary of the q and $\overset{\sim }{q}$ series, and uniqueness of a similar decomposition which preserves algebraic relations on the other side of the boundary defines the unique boundary crossing of the q series. We demonstrate that this continuation can be efficiently implemented numerically. In the cases where unique mock modular identities are known, they are found by this numerical procedure, but the procedure can go well beyond the known list of identities. A particularly interesting feature of the resurgent approach is that it reveals new aspects, and is very different from other known approaches based on indefinite theta series, Appell-Lerch sums, and representation theory of logarithmic vertex operator algebras.

Chern-Simons theories↗

DOE OSTI2024

A new method for solving the linearized 1D Vlasov–Poisson system yielding a new class of solutions

We describe a new method for solving the linearized 1D Vlasov–Poisson system by using properties of Cauchy-type integrals. Our method remedies critical flaws of the two standard methods, reveals a previously unrecognized Gaussian-in-time-like decay, and can also account for an externally applied electric field. The Landau approximation involves deforming the Bromwich contour around the poles closest to the real axis due to the analytically continued dielectric function, finding the long-time behavior for a stable system: Landau damping. Jackson's generalization encircles all poles while sending the contour to infinity, assuming its contribution vanishes, which is not true in general. This gives incorrect solutions for physically reasonable configurations and can exhibit pathological behavior, of which we show examples. The van Kampen method expresses the solution for a stable equilibrium as a continuous superposition of waves, resulting in an opaque integral. Case's generalization includes unstable systems and predicts a decaying discrete mode for each growing discrete mode, an apparent contradiction to both the Jackson solution and ours. We show, without imposing additional constraints, that the decaying modes are never present in the time evolution due to an exact cancellation with part of the continuum. Our solution is free of integral expressions, is obtained using algebra and Laurent series expansions, does not rely on analytic continuations, and results in a correct asymptotically convergent form in the case of infinite sums. The analysis used can be readily applied in higher-dimensional, electromagnetic systems and also provides a new technique for evaluating certain inverse Laplace transforms.

Physics↗

DOE OSTI2026

Computing neutrino cross sections from Euclidian responses

Energy integrated neutrino cross sections are integrals of nuclear responses weighted with kinematic prefactors. We decompose the prefactors into a limited set of functions of energy transfer and show the relevant integrals are the moments of the responses, and integrals weighted with $1/(a+ω)^n$ with $n\leq 2$. These can be directly obtained from the Euclidean response, avoiding the need for inversion of the Laplace transform. As a proof of concept we study the procedure with toy-model responses for the quasielastic peak. We show that the different contributions can be straightforwardly organized in terms of relative importance, and how flux-averaged cross sections can be obtained. Using a realistic model for the response and numerical uncertainty we show that it is feasible to obtain the required integrals from the Euclidean response, with large uncertainties only for the third moment. Due to kinematic restrictions, the integrals contain contributions from the unphysical region for neutrino scattering, coming from high-momentum nucleons. We show that (in the absence of two-body currents) robust corrections for this contamination are obtained from the single-nucleon momentum distribution. These results present an opportunity to compute certain neutrino cross sections with ab-initio methods with controlled uncertainties.

Nikolakopoulos, A. [Washington U., Seattle]↗

DOE OSTI2026

Computing neutrino cross sections from Euclidian responses

Nikolakopoulos, A. [Washington U., Seattle]↗

DOE OSTI2025

Differentially Private Adaptive Noise Injection (DP-ANI) v1.0

Location data is collected from users continuously to understand their mobility patterns. Releasing the user trajectories may compromise user privacy. Therefore, the general practice is to release aggregated location datasets. However, private information may still be inferred from an aggregated version of location trajectories. Differential privacy (DP) protects the query output against inference attacks regardless of background knowledge. This software implements a differential privacy-based privacy model that protects the user's origins and destinations from being inferred from aggregated mobility datasets. This is achieved by injecting Planar Laplace noise to the user origin and destination GPS points. The noisy GPS points are then transformed into a link representation using a link-matching algorithm. Finally, the link trajectories form an aggregated mobility network. The injected noise level is selected using the Sparse Vector Mechanism. This DP selection mechanism considers the link density of the location and the functional category of the localized links. Compared to the different baseline models, including a k-anonymity method, our differential privacy-based aggregation model offers query responses that are close to the raw data in terms of aggregate statistics at both the network and trajectory-levels with maximum 9% deviation from the baseline in terms of network length.

Peisert, Sean [Lawrence Berkeley National Laborato↗

DOE OSTI2026

Differential Privacy in Grid Kitchen: Implementation & Software Documentation

Sharing of power grid feeder models faces significant challenges due to the potential risk of exposing sensitive operational information. Traditional anonymization techniques have shown notable limitations in other sensitive domains, as evidenced by documented re-identification attacks that combine supposedly anonymized datasets with auxiliary information, raising concerns that similar vulnerabilities could affect power grid data. Consequently, there is a pressing need for a more rigorous privacy protection strategy that not only delivers formal mathematical guarantees but also preserves the analytical value of the shared models. To address this challenge, we have enhanced the Grid Kitchen framework by implementing differential privacy mechanisms within the distribution model dehydration pipeline. This implementation carefully calibrates and applies noise to sensitive attributes in feeder models according to configurable privacy levels—low, moderate, and high—each offering different balances between data utility and privacy protection. Our approach uses established noise functions (Gaussian for continuous data and Discrete Laplace for integer values) with parameters carefully calibrated so that the impact of individual data points is effectively masked in the final output. The integration leverages our Noise Catalog, which we developed to categorize feeder model properties by component type, data type, and sensitivity. This catalog guides the application of appropriate noise functions and privacy parameters ($\varepsilon$ and $\delta$) to each attribute, ensuring consistent privacy protection across the model while maintaining its structural integrity and analytical usefulness. This implementation also includes evaluation tools that allow model owners to assess the impact of privacy-preserving transformations before sharing data with external parties. This report provides documentation for the differential privacy capabilities added to the Grid Kitchen project. It includes a primer on differential privacy concepts and their importance in modern data sharing, details the architecture of our implementation, explains the privacy modes and parameter configurations, and offers practical guidance on using the code for applying differential privacy to grid feeder models. Through examples and code snippets, we demonstrate the effective application of these privacy-enhancing technologies, enabling utility operators and researchers to confidently share grid data while protecting sensitive information.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2025

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker–Planck Equations

The Fokker-Planck (FP) equation is a foundational partial differential equation (PDE) in stochastic processes involving Brownian motions. However, the curse of dimensionality (CoD) poses a formidable challenge when dealing with high-dimensional FP equations. Although Monte Carlo simulation and (vanilla) Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit significant numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimensionality increases, surpassing the precision of numerical simulations and resulting in substantial errors. In addition, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a notoriously difficult Hamilton-Jacobi-Bellman (HJB) equation, which is impractical for PINN learning, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in stochastic differential equations (SDEs). The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling, offering an effective means to overcome the CoD. Three fitting methods, Score Matching (SM), Sliced Score Matching (SSM), and Score-PINN, are introduced, each contributing unique advantages in computational complexity, accuracy, and generality. The proposed score-based SDE solver operates in two stages: first, employing score matching or Score-PINN to acquire the score function; and second, solving the LL via an ordinary differential equation (ODE) using the obtained score function. Comparative evaluations across these methods showcase varying trade-offs. The proposed methodology is evaluated across diverse SDEs, including anisotropic Ornstein-Uhlenbeck processes, geometric Brownian motion, and Brownian motion with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy distributions. The numerical results demonstrate the score-based SDE solver’s stability, speed, and performance across different experimental settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

97 MATHEMATICS AND COMPUTING↗