Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Physics-Based Machine Learning Methods for U-235 Forensics Signatures

Signatures of low-intensity U-235 sources have been recently studied by utilizing a variety of machine learning (ML) classifiers using features derived from gamma spectral measurements collectedunder structured campaigns. Several ML classifiers, such as ensemble of tress and classification trees, revealed misleadingly-optimistic training error due to over-fitting, and furthermore,their performance is not directly relatable to the physical properties due to their data-driven, opaque designs. We present a regression-based ML method that first estimates the inverse distanceto the source and then utilizes a threshold to infer its presence, by representing the background as a source located at an infinite distance. For the inverse distance estimation, we study the ensembleof trees and Gaussian process regression methods, and a hyper parameter auto-tuning and selection method that employs five regression estimators. These methods avoid the over-fittingobserved in several ML classifiers, while providing the classification error nearly comparable to them based on independent test data. Their error is directly related to estimates of the inversephysical distance to source, and the precision of error determines the seperability property that determines the false alarm and missed detection rates. The property of monotonic decrease of thesource strength with increasing detector distance combined with Poisson distribution of measurements is utilized to analytically validate these methods by deriving the generalization equations ofunderlying regression methods.

Rao, Nageswara↗
DOE OSTI2024

Physics-Based Machine Learning Methods for U-235 Forensics Signatures

Signatures of low-intensity U-235 sources have been recently studied by utilizing a variety of machine learning (ML) classifiers using features derived from gamma spectral measurements collected under structured campaigns. Several ML classifiers, such as ensemble of tress and classification trees, revealed misleadingly-optimistic training error due to over-fitting, and furthermore, their performance is not directly relatable to the physical properties due to their data-driven, opaque designs. We present a regression-based ML method that first estimates the inverse distance to the source and then utilizes a threshold to infer its presence, by representing the background as a source located at an infinite distance. For the inverse distance estimation, we study the ensemble of trees and Gaussian process regression methods, and a hyper parameter auto-tuning and selection method that employs five regression estimators. These methods avoid the over-fitting observed in several ML classifiers, while providing the classification error nearly comparable to them based on independent test data. Their error is directly related to estimates of the inverse physical distance to source, and the precision of error determines the seperability property that determines the false alarm and missed detection rates. The property of monotonic decrease of the source strength with increasing detector distance combined with Poisson distribution of measurements is utilized to analytically validate these methods by deriving the generalization equations of underlying regression methods.

Rao, Nageswara↗
DOE OSTI2024

DeepUQ: Assessing the Aleatoric Uncertainties from two Deep Learning Methods

Assessing the quality of aleatoric uncertainty estimates from uncertainty quantification (UQ) deep learning methods is important in scientific contexts, where uncertainty is physically meaningful and important to characterize and interpret exactly. We systematically compare aleatoric uncertainty measured by two UQ techniques, Deep Ensembles (DE) and Deep Evidential Regression (DER). Our method focuses on both zero-dimensional (0D) and two-dimensional (2D) data, to explore how the UQ methods function for different data dimensionalities. We investigate uncertainty injected on the input and output variables and include a method to propagate uncertainty in the case of input uncertainty so that we can compare the predicted aleatoric uncertainty to the known values. We experiment with three levels of noise. The aleatoric uncertainty predicted across all models and experiments scales with the injected noise level. However, the predicted uncertainty is miscalibrated to $\rm{std}(\sigma_{\rm al})$ with the true uncertainty for half of the DE experiments and almost all of the DER experiments. The predicted uncertainty is the least accurate for both UQ methods for the 2D input uncertainty experiment and the high-noise level. While these results do not apply to more complex data, they highlight that further research on post-facto calibration for these methods would be beneficial, particularly for high-noise and high-dimensional settings.

Nevin, Rebecca↗
DOE OSTI2024

Methods for promoting myelination and for treating demyelinating diseases

This invention provides novel methods for treating or ameliorating symptoms of demyelinating diseases such as multiple sclerosis. The methods involve administering to subjects in need of treatment a pharmaceutical composition that contains a therapeutically effective amount of taurine and also a compound that induces oligodendrocyte precursor cell (OPC) differentiation (e.g., T3, benztropine, clemastine or miconazole). Some of the methods additionally involve administration to the subject a known agent for treating demyelinating diseases (e.g., SIP receptor agonists) or a known disease modifying drug. The invention also provides methods for increasing myelination and methods for promoting OPC differentiation into oligodendrocytes. These methods entail contacting a population of OPCs with a combination of taurine and a known OPC differentiation-inducing agent such as T3, clemastine, benztropine or miconazole.

Lairson, Luke↗
DOE OSTI2025

An eigenvalue-based method for computing the relaxed pressure in compressible multiphase flow with N phases

The modeling of compressible multiphase flows is a decades-old area of study with many applications across various fields. Many of these application areas use stiff pressure relaxation. This process involves the solution of a nonlinear system with N + 1 equations and N + 1 unknowns, where N is the number of phases. The resolution of this system with general equations of state (EOSs) is difficult. Furthermore, nonlinear systems can admit multiple solutions, and current solution methods do not address this possibility. Very recently, a thermodynamic relaxation method was introduced, which effectively maps a relatively simple predictor equation of state onto a more complex target equation of state. In this context, the target EOSs are the chosen EOSs for the thermodynamic model. Furthermore, this thermodynamic relaxation has the benefit of simplifying the stiff pressure relaxation system of equations. In this article, we show this system reduces to a polynomial of degree N, which can be recast as an eigenvalue problem through the use of the associated companion matrix. We show that although this eigenvalue method is generally less efficient than Newton–Raphson iteration, it does not suffer from convergence issues and finds all N roots of the polynomial. Hence, the method provides a fail-safe for root-finding iterative methods and a way to address the issue of multiple solutions to the nonlinear system of equations in stiff pressure relaxation.

Eigenvalue algorithm↗
DOE OSTI2024

The eXtended virtual element method for elliptic problems with weakly singular solutions

This paper introduces a novel eXtended virtual element method, an extension of the conforming virtual element method. The X-VEM is formulated by incorporating appropriate enrichment functions in the local spaces. The method is designed to handle highly generic enrichment functions, including singularities arising from fractured domains. By achieving consistency on the enrichment space, the method is proven to achieve arbitrary approximation orders even in the presence of singular solutions. The paper includes a complete convergence analysis under general assumptions on mesh regularity, and numerical experiments validating the method’s accuracy on various mesh families, demonstrating optimal convergence rates in the L 2 - and H 1 - norms on fractured or L-shaped domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Estimating Large Global Significances with a New Monte Carlo Extrapolation Method

In particle physics, it is needed to evaluate the possibility that excesses of events in mass spectra are due to statistical fluctuations as quantified by the standards of local and global significances. Without prior knowledge of a particle’s mass, it is especially critical to estimate its global significance. The usual approach is to count the number of times a significance limit is exceeded in a collection of simulated Monte Carlo (MC) “toy experiments”. To demonstrate this conventional method for global significance, we performed simulation studies according to a recent Compact Muon Solenoid (CMS) result to show its effectiveness. However, this counting method is not practical for computing large global significances. To address this problem, we developed a new “extrapolation” method to evaluate the global significance. We compared the global significance estimated by our new method with that of the conventional approach, and verified its feasibility and effectiveness. This method is also applicable for cases where only small toy MC samples are available. In this approach, the significance is calculated based on p-values, assuming symmetrical Gaussian distributions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Demystifying Piecewise and Localized Scatter Correction Methods

Multiplicative scatter is a common source of noise in near-infrared spectroscopy and other related instrumental techniques. A wide variety of methods are commonly used for the correction of multiplicative scatter. However, the majority of such methods assume that the parameters that describe the scatter are constant throughout the measured spectrum, which is often not the case. This work investigates a family of methods that perform scatter correction using local regions of neighboring wavelengths in order to better account for wavelength-dependent scattering. The methods in question are piecewise standard normal variate, localized standard normal variate, piecewise multiplicative scatter correction, and localized multiplicative scatter correction. This work describes the theoretical and algorithmic foundations of the family of local region-based scatter correction methods and compares their application and optimization at a qualitative and quantitative level using several datasets.

NIR spectroscopy↗
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 OSTI2026

Magnus method for electronic structure calculations at extreme conditions

We present the application of Magnus based methods to the solution of first order coupled ordinary differential equations in High Energy Density (HED) physics applications. Our focus is on the application to quantum mechanical methods, specifically on the solution of the radial Dirac equation for real and complex energies. HED applications require accurate solutions across a wide range of spatial and energy domains, including regimes where the solutions exhibit pronounced oscillatory behavior. Such cases pose significant computational challenges. We demonstrate that Magnus-based integrators can efficiently and accurately address these challenges. We discuss the implementation of the Magnus method for the solution of the radial Dirac equation, including practical considerations such as the evaluation of matrix exponentials, numerical integration, error estimation, and adaptive step size control. We also discuss the application of these methods to complex energy Green’s function techniques and the efficient approximation of integrals of the solutions relevant to HED electronic structure calculations. Here, we demonstrate the accuracy and robustness of the resulting method in applications to the free-particle case, for which analytic solutions are available for comparison, as well as the challenging case of gold at HED conditions.

general physics↗
DOE OSTI2024

A high-order, localized-artificial-diffusivity method for Eulerian simulation of multi-material elastic-plastic deformation with strain hardening

A high-order method for Eulerian simulation of material undergoing large elastic–plastic deformation is developed. Thermodynamically consistent hyperelastic constitutive relations are assumed, facilitating the treatment of solids, liquids, and gases in a unified manner. Here, the method enables the simulation of multi-material interactions using a diffuse interface approach. Numerical capturing of material interfaces, shock waves, contact surfaces, and elastic-plastic strain discontinuities using high-order compact-difference schemes is assisted by Localized Artificial Diffusivity (LAD). In the new setting involving elastic–plastic deformation, the previously established terms for the artificial properties are verified to effectively regularize normal shocks. Additional LAD terms are introduced to the elastic and plastic kinematic equations to regularize shear shocks and other strain discontinuities, improving solution stability. Other important features of the method that improve robustness include the numerical treatment of compatibility terms in the kinematic equations, and the treatment of rotation. Particular emphasis is focused toward new advancements of the methods for plastic-deformation integration and the associated strain hardening of the material, including rate-dependent plasticity. The method is demonstrated on a variety of test problems, including 1-D impacts, a variant of the Shu-Osher problem, a Taylor impact, and a Richtmyer-Meshkov instability between two elastic–plastic solids with strain hardening.

42 ENGINEERING↗
DOE OSTI2025

A review of low-rank methods for time-dependent kinetic simulations

Time-dependent kinetic models are ubiquitous in computational science and engineering. The underlying integro-differential equations in these models are high-dimensional, comprised of a six–dimensional phase space, making simulations of such phenomena extremely expensive. In this article we demonstrate that in many situations, the solution to kinetics problems lives on a low dimensional manifold that can be described by a low-rank matrix or tensor approximation. We then review the recent development of so-called low-rank methods that evolve the solution on this manifold. The two classes of methods we review are the dynamical low-rank (DLR) method, which derives differential equations for the low-rank factors, and a Step-and-Truncate (SAT) approach, which projects the solution onto the low-rank representation after each time step. Thorough discussions of time integrators, tensor decompositions, and method properties such as structure preservation and computational efficiency are included. We further show examples of low-rank methods as applied to particle transport and plasma dynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A hybrid Monte Carlo-deterministic second moment method with efficient variance reduction

In this work, we present a hybrid method that combines Monte Carlo with deterministic finite element methods to solve a linear Boltzmann transport equation. Our hybrid method runs orders of magnitude faster than Monte Carlo, without sacrificing accuracy, for a proxy problem from radiative transfer that contains both optically-thick and optically-thin material. We believe that this is the first demonstration of a hybrid Second Moment Method in more than one spatial dimension, the first to consider more than one material, and the first to use variance reduction. Our variance reduction approach arises from an asymptotic analysis in which we show that the magnitude of the scattering source grows without bound. We transform the problem to compute the deviation of the radiation intensity from isotropy. The magnitude of the source in the transformed problem is bounded, and the quality of the hybrid method solution is dramatically improved by a substantial reduction in the variance.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Ensemble methods for quantification of potassium oxide in ChemCam Mars and laboratory spectra

In this paper we test new approaches for predicting the amount of element oxides in rock samples from the ChemCam instrument suite onboard the NASA Curiosity rover by focusing on K 2 O. Using the expanded dataset compiled by Gasda et al. (2021) with and without the Earth to Mars (E2M and NoE2M) transformation discussed in Clegg et al. (2017) we trained blended submodels using the “double blending” technique and compared these to ensemble methods (Random Forest, ExtraTrees, and Gradient Boosting Regression). We found that ensemble methods performed similar to blended submodels when looking at RMSE-P on the laboratory spectra and provided significant advantages when looking at spectra coming from Mars. For the full model, blended submodels achieved an RMSE-P of 0.62 and 0.60 (E2M and NoE2M respectively) while Gradient Boosting Regression resulted in a slightly improved RMSE-P of 0.59 and 0.60. More importantly, by employing a local RMSE-P estimation technique where model performance is evaluated based on nearby test samples we found that using ensemble methods can lower the quantification limit for K 2 O from the current value of ≈0.6 wt% to ≈0.08 wt% using Extra Trees and Random Forest. This would allow for a much larger range of K 2 O values to be quantified on Mars with greater certainty given that most targets seen on Mars tend to have <1 wt% K2O. Finally, we used both Mean Decrease in Impurity (MDI) and permutation importance techniques to investigate the wavelengths used by the ensemble methods and found that they correspond to known potassium emission lines. This suggests that ensemble methods can provide an easier to train and improved alternative to blended submodels for predicting potassium compositions from Laser Induced Breakdown Spectroscopy (LIBS) data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Enhancing risk and crisis communication with computational methods: A systematic literature review

Abstract Recent developments in risk and crisis communication (RCC) research combine social science theory and data science tools to construct effective risk messages efficiently. However, current systematic literature reviews (SLRs) on RCC primarily focus on computationally assessing message efficacy as opposed to message efficiency. We conduct an SLR to highlight any current computational methods that improve message construction efficacy and efficiency. We found that most RCC research focuses on using theoretical frameworks and computational methods to analyze or classify message elements that improve efficacy. For improving message efficiency, computational and manual methods are only used in message classification. Specifying the computational methods used in message construction is sparse. We recommend that future RCC research apply computational methods toward improving efficacy and efficiency in message construction. By improving message construction efficacy and efficiency, RCC messaging would quickly warn and better inform affected communities impacted by current hazards. Such messaging has the potential to save as many lives as possible.

Mathematical Methods In Social Sciences↗
DOE OSTI2025

Convergence Analysis of the Alternating Anderson–Picard Method for Nonlinear Fixed-Point Problems

Anderson acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This work focuses on a variant of AA in which multiple Picard iterations are performed between each AA step, referred to as the Alternating Anderson–Picard (AAP) method. Furthermore, despite introducing more “slow” Picard iterations, this method has been shown to be efficient and even more robust in both linear and nonlinear cases. However, there is a lack of theoretical analysis for AAP in the nonlinear case. In this paper, we address this gap by establishing the equivalence between AAP and a multisecant-GMRES method that uses GMRES to solve a multisecant linear system at each iteration. From this perspective, we show that AAP “converges” to the Newton-GMRES method. Specifically, as the residual approaches zero, the multisecant matrix, the approximate Jacobian inverse, the search direction, and the optimization gain of AAP converge to their counterparts in the Newton-GMRES method. These connections provide insights for analyzing the asymptotic convergence properties of AAP. Consequently, we show that AAP is locally 𝑞-linear convergent and provide an upper bound for the convergence factor of AAP. To validate the theoretical results, numerical examples are provided.

Anderson acceleration↗
DOE OSTI2026

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗
DOE OSTI2024

A weighted shifted boundary method for immersed moving boundary simulations of Stokes' flow

The Shifted Boundary Method (SBM) belongs to the class of unfitted (or immersed, or embedded) finite element methods, and relies on reformulating the original boundary value problem over a surrogate (approximate) computational domain. The surrogate domain is constructed so as to avoid cut cells and the associated problematic implementation and numerical integration issues. Accuracy is maintained by modifying the original boundary conditions using Taylor expansions: hence the name of the method, that shifts the location and values of the boundary conditions. Here, in this article, we extend the SBM to the simulation of incompressible Stokes flow, by appropriately weighting its variational form with the elemental volume fraction of active fluid. This approach allows to drastically reduce spurious pressure oscillations in time, which are produced if the total volume of active fluid were to change abruptly over a time step. The proposed Weighted SBM (W-SBM) exactly preserves states of hydrostatic equilibrium, and induces small mass and momentum conservation errors, which converge as the grid is refined. This is in analogy to cutFEMs and related unfitted approaches, which rely on an affine representation of cut boundaries. We demonstrate the robustness and accuracy of the proposed method with an extensive suite of two-dimensional tests.

97 MATHEMATICS AND COMPUTING↗