SEARCH · Search NASA

Results for “APPROXIMATION 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.

SourceResearch connectionFrom yearThrough year

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

At least 109 records · Page 6

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Development of a high-throughput method for processing sponge-stick samples to detect viable Bacillus anthracis spores

Since the national validation of the sponge-stick based method for detection of Bacillus anthracis spores in environmental samples, there have not been focused efforts to address the low throughput nature of the method, which processes only one sample at one time. Sample processing remains a serious bottleneck for rapidly analyzing large numbers of samples expected from a biological warfare attack. Therefore, we developed a high-throughput method to simultaneously process multiple sponge-stick samples to be better prepared for rapid response and recovery after wide area anthrax incidents. In this method, sponges are placed in 50 mL tubes containing 25 mL extraction buffer and shaken to release spores, after which the suspension is recovered for analysis. Here, we determined that an additional extraction step, conducted in the same tubes with 10 mL buffer, further increased spore recovery from sponge-stick by approximately 10 %. We determined that orbital shaking and multi-tube vortexing were both more effective than reciprocating shaking for recovering spores. We conducted simultaneous processing of up to 12 sponge-stick samples and demonstrated comparable spore recovery efficiencies to the traditional low-throughput stomacher-based method (approximately 60 % recovery at 10 2 -spore level and 75 % recovery at 10 4 -spore level for both methods in three replicate experiments, P > 0.05 for two-tailed t-tests for each experiment and spore level). We also demonstrated that our high-throughput method could be integrated with Rapid Viability-Polymerase Chain Reaction (RV-PCR) analysis and could detect levels as low as 40 spores per sponge even when challenged by a PCR particulate contaminant.

Anthrax↗

DOE OSTI2025

Multi-plane moment-of-fluid interface reconstruction in 3D

Moment-of-fluid (MOF) methods for interface reconstruction approximate the region occupied by material in each mesh element only through reference to its geometric moments. Here, we present a 3D MOF method that represents the material (POM) in each cell as the convex intersection of the cell and multiple half-spaces, each selected to minimize the least-squares error between computed moments of the approximated material and provided reference moments. This optimization problem is highly non-linear and non-convex, making the numerical result very sensitive to the initial guess. To create an effective initial guess in each cell, we construct an ellipsoid from 0th–2nd order reference moments such that its shape corresponds with that of the POM. Within this ellipsoid we inscribe a polyhedron, and initialize the minimization problem with the half-spaces defined by each of its faces. The inscribed polyhedron has minimally 4 faces, and using up to 3rd order moments permits optimization over up to 20 unknown values. We therefore define MOF methods that utilize 4, 5, or 6 half-spaces, correspondingly initialized with the faces of a single inscribed tetrahedron, triangular prism, or hexahedron. Stability of the non-linear optimization is further improved with a prepossessing step that normalizes the reference moments according to the axes of the reference ellipsoid. Using this approach, the non-linear least-squares solver reliably converges to a near-global minimum from a single initial guess. We demonstrate accuracy and robustness using single-cell and multi-cell examples over a wide spectrum of geometry. In particular, we demonstrate our ability to exactly reproduce several important and complex features defined by up to four half-spaces, such as corners, filaments, filament tips, and embedded material in the cell.

3D interface reconstruction↗

DOE OSTI2025

Construction of approximate invariants for nonintegrable Hamiltonian systems

We present a method to construct high-order polynomial approximate invariants (AI) for nonintegrable Hamiltonian dynamical systems and apply it to a modern ring-based particle accelerator. Taking advantage of a special property of one-turn transformation maps expressed as square matrices, AIs can be constructed order by order iteratively. Evaluating AI with simulation data, we observe that AI’s fluctuation is actually a measure of chaos. Through minimizing the fluctuations, the stable region of long-term motions, i.e., the dynamic aperture of the accelerator, could be enlarged.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Azimuthal anisotropies of charged particles with high transverse momentum in Pb + Pb collisions at $\sqrt{s_{\textrm{NN}}}$ = 5.02 TeV with the ATLAS detector

A measurement is presented of elliptic (𝑣 2 ) and triangular (𝑣 3 ) azimuthal anisotropy coefficients for charged particles produced in Pb + Pb collisions at $\sqrt{s_{\textrm{NN}}}$ = 5.02 TeV using a dataset corresponding to an integrated luminosity of 0.44nb −1 collected with the ATLAS detector at the LHC in 2018. The values of 𝑣 2 and 𝑣 3 are measured for charged particles over a wide range of transverse momentum (𝑝 T ), 1–400 GeV, and Pb + Pb collision centrality, 0–60%, using the scalar-product and multiparticle cumulant methods. These methods are sensitive to event-by-event fluctuations and nonflow effects in the measurements of azimuthal anisotropies. Positive values of 𝑣 2 are observed up to a 𝑝 T of approximately 100 GeV from both methods across all centrality intervals. Positive values of 𝑣 3 are observed up to approximately 25 GeV using both methods, though the application of the three-subevent technique to the multiparticle cumulant method leads to significant changes at the highest 𝑝 T . At high 𝑝 T (𝑝 T ⪆ 10 GeV), charged particles are dominantly from jet fragmentation. These jets, and hence the measurements presented here, are sensitive to the path-length dependence of parton energy loss in the quark-gluon plasma produced in Pb + Pb collisions.

Collective flow↗

DOE OSTI2025

An iterative dynamic chemical stiffness removal method for reacting flow simulations

Abstract An iterative dynamic chemical stiffness removal method (IDCSR) based on quasi-steady-state approximation (QSSA) is proposed. The IDCSR method is built on a previously developed non-iterative method which has proved to work well for small timestep sizes. A novel iterative procedure is designed in IDCSR to enable explicit time integration of stiff chemistry at relatively large timestep sizes relevant to practical reacting flow simulations. The effectiveness of the iterative procedure is first demonstrated with a toy problem and homogeneous auto-ignition with fixed integration step sizes, showing that larger timestep sizes can be allowed for explicit time integration using IDCSR compared with the previous non-iterative method. IDCSR is then compared with existing explicit chemistry solvers for simulations of homogeneous auto-ignition and shows similar or lower computational cost but significantly higher accuracy across a wide range of timestep sizes. IDCSR is further combined with an automatic adaptive time-stepping scheme for simulations of 0-D homogeneous auto-ignition and a 2-D laminar lifted n -dodecane jet flame. For the 0-D auto-ignition simulations, IDCSR is shown to reduce both the error (by 43%–90%) and computational cost (by 6–15 times) compared with existing explicit solvers, while achieving speed-up factors of up to 400 compared with VODE for a wide range of timestep sizes and reaction mechanisms. For the 2-D jet flame simulations, speed-up factors of 15 and 31 for chemistry integration, and 5 and 9 for overall simulation, are achieved by IDCSR compared with CVODE with and without analytic Jacobian, respectively.

Xu, Chao (ORCID:0000000153074159)↗

DOE OSTI2026

Determination of nuclear PDFs using Markov chain Monte Carlo methods

Global QCD analyses of nuclear parton distribution functions (nPDFs) have traditionally relied on the Hessian method for uncertainty estimation. However, the inherent Gaussian approximation and reliance on local curvature often prove insufficient for nPDF fits, which are frequently characterized by limited data constraints and non-Gaussian likelihoods. In this paper, we present the first nPDF determination based on Markov Chain Monte Carlo (MCMC) techniques, implemented within the nCTEQ framework using an adaptive Metropolis-Hastings algorithm. The MCMC approach enables a direct mapping of the posterior distribution and reveals a highly nontrivial parameter-space structure, including multiple modes and pronounced non-Gaussian behavior, particularly for the valence PDFs. We perform the first single-nucleus global analysis of lead PDFs using exclusively lead data and compare it to a multi-nuclei fit employing a standard analytic A dependence. The inclusion of lighter nuclei reduces quark uncertainties and modifies the shape of the lead PDFs, while leaving the gluon distribution largely unaffected. A complementary Hessian analysis exposes systematic limitations of the Gaussian approximation. Our results demonstrate that MCMC methods provide a more reliable framework for uncertainty quantification in nPDF determinations.

Derakhshanian, N. [Institute of Nuclear Physics Po↗

DOE OSTI2025

Low-energy enhancement of the magnetic dipole radiation in odd-mass lanthanides

We compute the magnetic dipole (M1) $\gamma$-ray strength functions ($\gamma$SF) for the odd-mass lanthanides $^{\textrm{143-151}}$Nd and $^{\textrm{147-153}}$Sm using the shell-model Monte Carlo method in combination with the static-path approximation and the maximum-entropy method. In particular, we quantify the statistical uncertainties in the calculated M1 $\gamma$SFs and show that they are under control for the excitation energies relevant to the experiments despite a Monte Carlo sign problem that originates in the projection onto an odd number of neutrons. We identify a low-energy enhancement (LEE) in the M1 $\gamma$SFs of these odd-mass lanthanides, which was recently observed experimentally in some of them. We also find a scissors mode resonance (SR) in the strongly deformed isotopes. We observe that the decrease in the LEE strength with neutron number along an isotopic chain is compensated for by an increase in the SR strength in the deformed nuclei. Furthermore, we compare our results with recent experiments.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2024

coh3

CoH3 (CoH ver.3) is an optical model, exciton pre-equilibrium, and Hauser-Feshbach statistical model code, which calculates nuclear reaction cross sections for medium to heavy targets in the keV to MeV energy region. This program is written in standard C++, divided into approximately 200 source and header files. CoH solves the Schroedinger equation for optical potentials defined in the code, and calculates differential elastic scattering, reaction, and total cross sections, for neutron, proton, deuteron, triton, 3He, and alpha-particle. Deformed optical potentials are solved with the coupled-channels method, in which the ground state rotational band members, or vibrational phonon states are coupled. The optical model gives particle transmission coefficients that are fed into the statistical model calculations. CoH includes the pre-equilibrium model (exciton model), the direct/semidirect capture model, and the multi-stage Hauser-Feshbach statistical decay with width fluctuation correction based on the Gaussian orthogonal ensemble. For weakly coupled levels, the DWBA (distorted wave Born approximation) method is used to calculate the direct inelastic scattering process to the excited states.

Kawano, Toshihiko↗

DOE OSTI2026

Effects of screening and pressure ionization on the electron broadening of spectral lines in dense plasmas

Collisions between electrons and radiating atoms broaden spectral absorption and emission lines in dense plasmas. High densities also introduce screening and pressure ionization effects that distort the wave functions of both bound and free electrons. In order to study how dense plasma effects influence the electron broadening of spectral lines, this paper incorporates electron wave functions from an average-atom (AA) model to calculate the linewidth of the B III 2⁢𝑝−2⁢𝑠 transition at 𝑇 = 10 eV for mass densities ranging from 𝜌 = 10 −4 to 0.4⁢ g⁡/cc. The calculation method uses the impact approximation, allowing the linewidth to be written in terms of electron-collision cross sections and an interference term. Compared to an otherwise identical calculation that uses Coulomb free wave functions, the AA method is found to modify both the cross sections and the resulting linewidth at sufficiently high density by introducing screening and pressure-ionized bound states. Screening lowers the cross sections at low energies and near electron excitation thresholds, while pressure-ionized bound states introduce resonances into the continuum. Thus, as the density increases, the relative linewidth between the AA and Coulomb calculations follows a general decrease because of screening, with sharp increases at various intervals due to pressure ionization. Finally, the AA results are also compared with a common approach to introduce screening through the interaction potential and reduced models that use the Bethe formula for the inelastic electron-collision cross sections.

electronic excitation & ionization↗

DOE OSTI2026

Taylor approximation variance reduction for approximation errors in PDE-constrained Bayesian inverse problems

In numerous applications, surrogate models are used as a replacement for accurate parameter-to-observable mappings when solving large-scale inverse problems governed by partial differential equations (PDEs). The surrogate model may be a computationally cheaper alternative to the accurate parameter-to-observable mappings and/or may ignore additional unknowns or sources of uncertainty. The Bayesian approximation error (BAE) approach provides a means to account for the induced uncertainties and approximation errors, i.e. the errors between the accurate parameter-to-observable mapping and the surrogate. The statistics of these errors are, however, in general unknown a priori, and are thus calculated using Monte Carlo sampling. Although the sampling is typically carried out offline, i.e. before considering the data, the process can still represent a computational bottleneck. In this work, we develop a scalable computational approach for reducing the costs associated with the sampling stage of the BAE approach. Specifically, we consider the Taylor expansion of the accurate and surrogate forward models with respect to the uncertain parameter fields either as a control variate for variance reduction or as a means to directly and efficiently approximate the mean and covariance of the approximation errors. We propose efficient methods for evaluating the expressions for the mean and covariance of the Taylor approximations based on linear(-ized) PDE solves. Furthermore, the proposed approach is independent of the dimension of the uncertain parameter, depending instead on the intrinsic dimension of the data, ensuring scalability to high-dimensional problems. The potential benefits of the proposed approach are demonstrated for two high-dimensional inverse problems governed by PDE examples, namely for the estimation of a distributed Robin boundary coefficient in a linear diffusion problem, and for a coefficient estimation problem governed by a nonlinear diffusion problem.

Bayesian approximation error↗

DOE OSTI2025

Construction of approximate invariants for non-integrable Hamiltonian systems

We present a method to construct high-order polynomial approximate invariants (AI) for non integrable Hamiltonian dynamical systems, and apply it to a modern ring-based particle accelerator. Taking advantage of a special property of one-turn transformation maps in the form of a square matrix, AIs can be constructed order-by-order iteratively. Evaluating AI with simulation data, we observe that AI’s fluctuation is actually a measure of chaos. Through minimizing the fluctuations, the stable region of long-term motions, i.e., the dynamic aperture of the accelerator, could be enlarged.

43 PARTICLE ACCELERATORS↗

DOE OSTI2024

Radiation image reconstruction and uncertainty quantification using a Gaussian process prior

We propose a complete framework for Bayesian image reconstruction and uncertainty quantification based on a Gaussian process prior (GPP) to overcome limitations of maximum likelihood expectation maximization (ML-EM) image reconstruction algorithm. The prior distribution is constructed with a zero-mean Gaussian process (GP) with a choice of a covariance function, and a link function is used to map the Gaussian process to an image. Unlike many other maximum a posteriori approaches, our method offers highly interpretable hyperparamters that are selected automatically with the empirical Bayes method. Furthermore, the GP covariance function can be modified to incorporate a priori structural priors, enabling multi-modality imaging or contextual data fusion. Lastly, we illustrate that our approach lends itself to Bayesian uncertainty quantification techniques, such as the preconditioned Crank–Nicolson method and the Laplace approximation. The proposed framework is general and can be employed in most radiation image reconstruction problems, and we demonstrate it with simulated free-moving single detector radiation source imaging scenarios. We compare the reconstruction results from GPP and ML-EM, and show that the proposed method can significantly improve the image quality over ML-EM, all the while providing greater understanding of the source distribution via the uncertainty quantification capability. Furthermore, significant improvement of the image quality by incorporating a structural prior is illustrated.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

A Particle-in-Cell Method for Plasmas with a Generalized Momentum Formulation, Part I: Model Formulation

Here, this paper formulates a new particle-in-cell method for the Vlasov–Maxwell system. Under the Lorenz gauge condition, Maxwell’s equations for the electromagnetic fields can be written as a collection of scalar and vector wave equations. The use of potentials for the fields motivates the adoption of a Hamiltonian formulation for particles that employs the generalized (conjugate) momentum. A notable advantage offered by the Hamiltonian formulation is the elimination of time derivatives in the Lorenz gauge formulation that are required by the standard Newton–Lorentz treatment of the particles. This allows the fields to retain the full time-accuracy guaranteed by the field solver. The resulting updates for particles require only knowledge of the fields and their spatial derivatives. An analytical method for constructing these spatial derivatives is presented that exploits the underlying integral solution used in the field solver for the wave equations. Moreover, these derivatives are demonstrated to converge at the same rate as the fields in both time and space. The Method of Lines Transpose field solver we consider in this work is globally first-order accurate in time and high-order accurate in space (e.g., fourth- and fifth-order) and belongs to a larger class of methods which are unconditionally stable, can address geometry, and leverage $\mathcal {O}(N)$ fast summation methods for efficiency. We demonstrate the method on several well-established benchmark problems on bounded domains, including a plasma sheath as well as a relativistic particle beam. The efficacy of the proposed formulation is established by comparing with a second-order accurate finite-difference time-domain method that employs a leapfrog time advance for particles and a charge conserving map suitable for bounded domains. The new method shows mesh-independent numerical heating properties even in cases where the plasma Debye length is smaller than the grid spacing. This is an important feature of the new method for problems defined on bounded domains, because it permits the use of coarser grids in space in the representation of the fields. Such a capability has significant implications for the simulation of plasmas in bounded domains with complex geometry, where the ratio between the largest and smallest cells can vary significantly. The use of high-order spatial approximations in the new method also means that fewer grid points are required in order to achieve a fixed accuracy. Our results also suggest that the new method can be used with fewer simulation particles per cell compared to the benchmark explicit method, which permits further computational savings.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗

DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

42 ENGINEERING↗

DOE OSTI2025

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

An adaptive, data-driven multiscale approach for dense granular flows

The accuracy of coarse-grained continuum models of dense granular flows is limited by the lack of high-fidelity closure models for granular rheology. One approach to addressing this issue, referred to as the hierarchical multiscale method, is to use a high-fidelity fine-grained model to compute the closure terms needed by the coarse-grained model. The difficulty with this approach is that the overall model can become computationally intractable due to the high computational cost of the high-fidelity model. In this work, we describe a multiscale modeling approach for dense granular flows that utilizes neural networks trained using high-fidelity discrete element method (DEM) simulations to approximate the constitutive granular rheology for a continuum incompressible flow model. Our approach leverages an ensemble of neural networks to estimate predictive uncertainty that allows us to determine whether the rheology at a given point is accurately represented by the neural network model. Additional DEM simulations are only performed when needed, minimizing the number of additional DEM simulations required when updating the rheology. This adaptive coupling significantly reduces the overall computational cost of the approach while controlling the error. In addition, the neural networks are customized to learn regularized rheological behavior to ensure well-posedness of the continuum solution. We first validate the approach using two-dimensional steady-state and decelerating inclined flows. We then demonstrate the efficiency of our approach by modeling three-dimensional sub-aerial granular column collapse for varying initial column aspect ratios, where our multiscale method compares well with the computationally expensive computational fluid dynamics (CFD)-DEM simulation.

Dense granular flows↗

DOE OSTI2025

SCULPT (Supervised Clustering and Uncovering Latent Patterns with Training) v1

SCULPT (Supervised Clustering and Uncovering Latent Patterns with Training) is a comprehensive data visualization and analysis application focused on working with COLTRIMS (COLd Target Recoil Ion Momentum Spectroscopy) data, which is used in atomic and molecular physics experiments. The application offers several powerful features: - Data uploading and processing capabilities for COLTRIMS files - Multiple visualization methods using UMAP (Uniform Manifold Approximation and Projection) for dimensionality reduction - Interactive selection of data points across multiple views - Feature engineering through various methods: - Manual feature selection from calculated physics parameters - Deep autoencoder for dimension reduction - Genetic programming for discovering meaningful features - Mutual information-based feature selection - Multiple clustering approaches (DBSCAN, KMeans, Agglomerative) - Quality metrics for evaluating clustering results - Export capabilities for selections and generated features

Daoud, Hazem [Lawrence Berkeley National Laborator↗