Search NASA⌕ Search

SEARCH · Search NASA

Results for “Sparse particle method”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Modeling stratified flames with and without shear using multiple mapping conditioning

A stochastic sparse particle approach is coupled with an artificial thickening flame (ATF) model for large eddy simulations (LES) to predict a series of turbulent premixed-stratified flames with and without shear and stratification. The thickened reaction progress variable serves as reference variable for the multiple mapping conditioning (MMC) mixing model which emulates turbulent mixing of the stochastic particles. The key feature of MMC is to enforce localness in this reference space when particle pairs are mixed and prevents unphysical mixing of burnt and unburnt fluid across the flame front. We apply MMC-ATF to three flames of a series of turbulent stratified flames and validate the method by comparison with experimental data. The new measurements feature increased accuracy in comparison to previously published data of the same flames due to a better signal-to-noise ratio and a setup which is less prone to beam steering. All flame locations are well predicted by the LES-ATF approach and an analysis of the MMC particle statistics demonstrates that MMC preserves the flamelet-like behaviour in regions where the experiments show low scatter around the flamelet solution. Predicted (local) deviations from the flamelet-solution are comparable to deviations observed in the measurements and variations in the flame structure due to differences in stratification and shear are reasonably well captured by the method.

47 OTHER INSTRUMENTATION↗
NASA NTRS2019

Electromagnetic Scattering by Discrete Random Media. IV: Coherent Backscattering

The problem of backscattering of light by a discrete random medium illuminated by an obliquely incident plane electromagnetic wave is considered.The analysis is performed in a linear-polarization basis and includes a complete derivation of the cross reflection matrix for a layer with densely and sparsely distributed particles, the design of an approximate method for computing the ladder and cross reflection matrices in the case of a semi-infinite medium with a sparse distribution of particles, the derivation of the relations between the elements of the ladder and cross reflection matrices in the exact backscattering direction for dense and sparse media, and the development of practical algorithms for solving the underlying integral equations by the method of Picard iterations and the discrete ordinate method. Simulation results for particles with large size parameters are also presented.

Adrian Doicu↗
DOE OSTI2021

A Computational Information Criterion for Particle-Tracking with Sparse or Noisy Data

Traditional probabilistic methods for the simulation of advection-diffusion equations (ADEs) often overlook the entropic contribution of the discretization, e.g., the number of particles, within associated numerical methods. Many times, the gain in accuracy of a highly discretized numerical model is outweighed by its associated computational costs or the noise within the data. Herein, we address the question of how many particles are needed in a simulation to best approximate and estimate parameters in one-dimensional advective-diffusive transport. To do so, we use the well-known Akaike Information Criterion (AIC) and a recently-developed correction called the Computational Information Criterion (COMIC) to guide the model selection process. Random-walk and mass-transfer particle tracking methods are employed to solve the model equations at various levels of discretization. Numerical results demonstrate that the COMIC provides an optimal number of particles that can describe a more efficient model in terms of parameter estimation and model prediction compared to the model selected by the AIC even when the data is sparse or noisy, the sampling volume is not uniform throughout the physical domain, or the error distribution of the data is non-IID Gaussian.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2023

Efficient Two-Way Coupled Analysis of Steady-State Particle-Laden Hypersonic Flows

A direct solution approach for surface erosion in particle-laden hypersonic flows is extended for use in low-cost two-way coupled solutions of dilute gas-particle flows. The Trajectory Control Volume method, which uses a sparse set of probe particles to predict surface erosion distributions on general vehicles, is reformulated for the solution of source terms by mean trajectory subdivision and computing a flux differencing. The approach is verified successfully against a boundary layer solution and shown to agree well with experimental measurements. A representative Mars entry case, with conditions and geometry based on the ExoMars Schiaparelli capsule, is solved with the approach to study the impact of two-way coupling on surface heating and erosion. Results indicate that for realistic loading conditions, heating is largely unmodified compared to one-way coupled results at peak heating trajectory conditions, and no measureable difference is observed in the surface erosion rate. At exaggerated loading conditions high enough to observe coupling effects, the worst case collisional heating can increase heating by up to 60%.

Particle Laden Flow↗
NASA NTRS1992

Digital Correlation In Laser-Speckle Velocimetry

Periodic recording helps to eliminate spurious results. Improved digital-correlation process extracts velocity field of two-dimensional flow from laser-speckle images of seed particles distributed sparsely in flow. Method which involves digital correlation of images recorded at unequal intervals, completely automated and has potential to be fastest yet.

Gilbert, John A.↗
NASA NTRS1991

A geometrical model for shepherding

Shepherding is the process by which a satellite secularly exchanges angular momentum with a nearby particle or gaseous disk. The sense of the torque is such that the separation between the orbits of the particles and the shepherd increases secularly with time. I devised a new technique to analyze the physical nature of shepherding through study of evolution of the vector eccentricity of the particles. This method appears to analyze the physical nature of shepherding in sparse particle disks. Thus, it may be very useful in calculating the torque on Neptune's rings and on protoplanets in the solar nebula. Moreover, the techniques are useful in estimating how long numerical simulations of resonant processes must be run in order to reach a quasi-steady state.

Lissauer, Jack J.↗
DOE OSTI2023

Interpretable Joint Event-Particle Reconstruction for Neutrino Physics at NOvA with Sparse CNNs and Transformers

The complex events observed at the NOvA long-baseline neutrino oscillation experiment contain vital information for understanding the most elusive particles in the standard model. The NOvA detectors observe interactions of neutrinos from the NuMI beam at Fermilab. Associating the particles produced in these interaction events to their source particles, a process known as reconstruction, is critical for accurately measuring key parameters of the standard model. Events may contain several particles, each producing sparse high-dimensional spatial observations, and current methods are limited to evaluating individual particles. To accurately label these numerous, high-dimensional observations, we present a novel neural network architecture that combines the spatial learning enabled by convolutions with the contextual learning enabled by attention. This joint approach, TransformerCVN, simultaneously classifies each event and reconstructs every individual particle's identity. TransformerCVN classifies events with 90% accuracy and improves the reconstruction of individual particles by 6% over baseline methods which lack the integrated architecture of TransformerCVN. In addition, this architecture enables us to perform several interpretability studies which provide insights into the network's predictions and show that TransformerCVN discovers several fundamental principles that stem from the standard model.

Shmakov, Alexander↗
DOE OSTI2023

Sparse Convolutional Neural Networks for particle classification in ProtoDUNE-SP events

Deep Learning (DL) methods and Computer Vision are becoming important tools for event reconstruction in particle physics detectors. In this work, we report on the use of submanifold sparse convolutional neural networks (SparseNets) for the classification of track and shower hits from a DUNE prototype liquid-argon detector at CERN (ProtoDUNE-SP). By taking advantage of the three-dimensional nature of the problem we use a set of nine input features to classify sparse and locally dense hits associated to track or shower particles. The SparseNet has been trained on a test sample and shows promising results: efficiencies and purities greater than 90%. This has also been achieved with a considerable speedup and substantially less resource utilization with respect to other DL networks such as graph neural networks. This method offers great scalability advantages for future large neutrino detectors such as the planned DUNE experiment.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

Imaging particle collision data for event classification using machine learning

We propose a method to organize experimental data from particle collision experiments in a general format which can enable a simple visualisation and effective classification of collision data using machine learning techniques. The method is based on sparse fixed-size matrices with single- and two-particle variables containing information on identified particles and jets. As a result, we illustrate this method using an example of searches for new physics at the LHC experiments.

47 OTHER INSTRUMENTATION↗
DOE OSTI2026

A projection method for particle resampling

Particle discretizations of partial differential equations are advantageous for high-dimensional kinetic models in phase-space due to their better scalability than continuum approaches with respect to dimension. Complex processes collectively referred to as particle noise hamper long time simulations with particle methods. One approach to address this problem is particle mesh adaptivity, or remapping, known as particle resampling and remeshing. Here, this work introduces a resampling method that projects particles to and from a (finite element) function space. The method is simple, using standard sparse linear algebra and finite element techniques, and it preserves all moments up to the order of a polynomial represented exactly by the continuum function space. It is distinguished from most other mesh-based methods in that new particle positions and number are decoupled from the mesh, allowing particle and continuum meshes to be adapted relatively independently. While this work is developed with structured particle and continuum phase-space grids on 1X + 1V Vlasov-Poisson models of Landau damping and two-stream instability, the method is well-suited to unstructured grids. Stable long time dynamics are demonstrated up to time T = 500. Reproducibility artifacts and data are publicly available.

Kinetic methods↗
DOE OSTI2025

Particle hit clustering and identification using point set transformers in liquid argon time projection chambers

Liquid argon time projection chambers are often used in neutrino physics and dark-matter searches because of their high spatial resolution. The images generated by these detectors are extremely sparse, as the energy values detected by most of the detector are equal to 0, meaning that despite their high resolution, most of the detector is unused in a particular interaction. Instead of representing all of the empty detections, the interaction is usually stored as a sparse matrix, a list of detection locations paired with their energy values. Traditional machine learning methods that have been applied to particle reconstruction such as convolutional neural networks (CNNs), however, cannot operate over data stored in this way and therefore must have the matrix fully instantiated as a dense matrix. Operating on dense matrices requires a lot of memory and computation time, in contrast to directly operating on the sparse matrix. We propose a machine learning model using a point set neural network that operates over a sparse matrix, greatly improving both processing speed and accuracy over methods that instantiate the dense matrix, as well as over other methods that operate over sparse matrices. Compared to competing state-of-the-art methods, our method improves classification performance by 14%, segmentation performance by more than 22%, while taking 80% less time and using 66% less memory. Compared to state-of-the-art CNN methods, our method improves classification performance by more than 86%, segmentation performance by more than 71%, while reducing runtime by 91% and reducing memory usage by 61%.

calibration and fitting methods↗
DOE OSTI2019

Accelerating and Parallelizing Lagrangian Simulations of Mixing-Limited Reactive Transport

Recent advances in random walk particle tracking have enabled direct simulation of mixing and reactions by allowing the particles to interact with each other using a multipoint mass transfer scheme. The mass transfer scheme allows separation of mixing and spreading processes, among other advantages, but it is computationally expensive because its speed depends on the number of interacting particle pairs. This note explores methods for relieving the computational bottleneck caused by the mass transfer step, and we use these algorithms to develop a new parallel, interacting particle model. The new model is a combination of a sparse search algorithm and a novel domain decomposition scheme, both of which offer significant speedup relative to the reference case—even when they are executed serially. We combine the strengths of these methods to create a parallel particle scheme that is highly accurate and efficient with run times that scale as 1/P for a fixed number of particles, where P is the number of computational cores (equivalently, subdomains, in this work) being used. Here, the new parallel model is a significant advance because it enables efficient simulation of large particle ensembles that are needed for environmental simulations and also because it can naturally pair with parallel geochemical solvers to create a practical Lagrangian tool for simulating mixing and reactions in complex chemical systems.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Immersion Freezing in Particle-Based Aerosol-Cloud Microphysics: A Probabilistic Perspective on Singular and Time-Dependent Models

Cloud droplets containing immersed ice-nucleating particles (INPs) may freeze at temperatures above the homogeneous freezing threshold temperature in a process referred to as immersion freezing. In modeling studies, immersion freezing is often described using either so-called “singular” or “time-dependent” parameterizations. Here, we compare both approaches and discuss them in the context of probabilistic particle-based (super-droplet) cloud microphysics modeling. First, using a box model, we contrast how both parameterizations respond to idealized ambient cooling rate profiles and quantify the impact of the polydispersity of the immersed surface spectrum on the frozen fraction evolution. Presented simulations highlight that the singular approach, constituting a time-integrated form of a more general time-dependent approach, is only accurate under a limited range of ambient cooling rates. The time-dependent approach is free from this limitation. Second, using a prescribed-flow two-dimensional cloud model, we illustrate the macroscopic differences in the evolution in time of ice particle concentrations in simulations with flow regimes relevant to ambient cloud conditions. The flow-coupled aerosol-budget-resolving simulations highlight the benefits and challenges of modeling cloud condensation nuclei activation and immersion freezing on insoluble ice nuclei with super-particle methods. The challenges stem, on the one hand, from heterogeneous ice nucleation being contingent on the presence of relatively sparse immersed INPs, and on the other hand, from the need to represent a vast population of particles with relatively few so-called super particles (each representing a multiplicity of real particles). We discuss the critical role of the sampling strategy for particle attributes, including the INP size, the freezing temperature (for singular scheme) and the multiplicity.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Solving Inverse Stochastic Problems from Discrete Particle Observations Using the Fokker--Planck Equation and Physics-Informed Neural Networks

The Fokker--Planck (FP) equation governing the evolution of the probability density function (PDF) is applicable to many disciplines, but it requires specification of the coefficients for each case, which can be functions of space-time and not just constants and hence require the development of a data-driven modeling approach. When the data available is directly on the PDF, there exist methods for inverse problems that can be employed to infer the coefficients and thus determine the FP equation and subsequently obtain its solution. Herein, we address a more realistic scenario, where only sparse data are given on the particles' positions at a few time instants, which are not sufficient to accurately construct directly the PDF even at those times from existing methods, e.g., kernel estimation algorithms. To this end, we develop a general framework based on physics-informed neural networks (PINNs) that introduces a new loss function using the Kullback--Leibler divergence to connect the stochastic samples with the FP equation to simultaneously learn the equation and infer the multidimensional PDF at all times. In particular, we consider two types of inverse problems, type I, where the FP equation is known but the initial PDF is unknown, and type II, in which, in addition to the unknown initial PDF, the drift and diffusion terms are also unknown. In both cases, we investigate problems with either Brownian or Lévy noise or a combination of both. Here, we demonstrate the new PINN framework in detail in the one-dimensional (1D) case, but we also provide results for up to five dimensions demonstrating that we can infer both the FP equation and dynamics simultaneously at all times with high accuracy using only very few discrete observations of the particles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Generative Ensemble Regression: Learning Particle Dynamics from Observations of Ensembles with Physics-informed Deep Generative Models

Here, we propose a new method for inferring the governing stochastic ordinary differential equations (SODEs) by observing particle ensembles at discrete and sparse time instants, i.e., multiple “snapshots.” Particle coordinates at a single time instant, possibly noisy or truncated, are recorded in each snapshot but are unpaired across the snapshots. By training a physics-informed generative model that generates “fake” sample paths, we aim to fit the observed particle ensemble distributions with a curve in the probability measure space, which is induced from the inferred particle dynamics. We employ different metrics to quantify the differences between distributions, e.g., the sliced Wasserstein distances and the adversarial losses in generative adversarial networks. We refer to this method as generative “ensemble-regression” (GER), in analogy to the classic “point-regression,” where we infer the dynamics by performing regression in the Euclidean space. We illustrate the GER by learning the drift and diffusion terms of particle ensembles governed by SODEs with Brownian motions and Lévy processes up to 100 dimensions. We also discuss how to treat cases with noisy or truncated observations. Apart from systems consisting of independent particles, we also tackle nonlocal interacting particle systems with unknown interaction potential parameters by constructing a physics-informed loss function. Finally, we investigate scenarios of paired observations and discuss how to reduce the dimensionality in such cases by proving a convergence theorem that provides theoretical support.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2018

Overview of Methods for Deriving the Radiative Transfer Theory from the Maxwell Equations. I: Approach Based on the Far-Field Foldy Equations

In this paper, we revisit, with further enhancements and clarifications, the self-consistent first-principles approach developed previously for deriving the vector radiative transfer theory for a discrete random medium with a sparse concentration of particles. We specifically consider the case of a plane-parallel particulate layer embedded in an otherwise homogeneous unbounded medium. The solution method is based on the far-field Foldy equations, an order-of-scattering expansion for the total field derived under the Twersky approximation, the computation of the coherent field by assuming that the positions of the particles are uncorrelated, and the ladder approximation for the coherency dyadic. The latter yields an integral equation for the diffuse specific coherency dyadic, defined through an angular spectrum repre- sentation for the coherency dyadic, which in turn, gives the vector radiative transfer equation for the diffuse specific intensity column vector. We analyze specifically the computation of the coherent field for inhomogeneous particulate media and multiple species of particles, the continuous extension of the far-field representation to the near field, the Foldy approximation, and the Foldy integral equation for the coherent field. Finally, we discuss the transition from the vector to the scalar radiative transfer equation.

Doicu, Adrian↗
DOE OSTI2021

Comparison of MCNP thermal scattering laws to inelastic neutron scattering data

Neutron transport computations employ thermal scattering laws (TSLs) to account for the influence of material structure and collective excitations at low energy (≲ 10 eV). Recent work has been undertaken to improve TSL accuracy and expand the number of available materials in the Evaluated Nuclear Data File (ENDF). However, comparison of TSL to measured data is often sparse. In this work, we present a method to evaluate TSL accuracy in the Monte Carlo N-Particle (MCNP) code by simulating inelastic neutron scattering (INS) measurement and comparing to data. The method is briefly described with example application to the recently released ENDF-VIII TSL library for polyethylene as well as a cryogenic PE TSL we are separately developing.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2026

Variable rate neural compression for sparse detector data

Particle colliders produce data at extraordinary rates, posing major challenges for transmission and storage. High-throughput compression algorithms are therefore essential. In the sPHENIX experiment taking data at the Relativistic Heavy Ion Collider, a time projection chamber records three-dimensional (3D) particle trajectories that are highly sparse, making conventional learning-free lossy compression ineffective. Convolutional neural networks have surpassed traditional methods in compression ratio and accuracy. However, they fail to exploit sparsity for efficiency. To address these gaps, we present BCAE-VS, a bicephalous convolutional autoencoder with variable compression ratio for sparse data, which adapts compression to input complexity through key-point identification and sparse convolution. BCAE-VS achieves higher accuracy and compression ratios than prior neural approaches while being orders of magnitude smaller. Moreover, its throughput increases with sparsity—a property not observed in other methods. Although it was developed for collider experiments, BCAE-VS readily extends to other sparse data domains, such as light detection and ranging (LiDAR) sensing and 3D microscopy.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗