Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stefan problem”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

ASGarD: Adaptive Sparse Grid Discretization

Many areas of science exhibit physical processes that are described by high dimensional partial differential equations (PDEs), e.g., the 4D, 5D and 6D models describing magnetized fusion plasmas, models describing quantum chemistry, or derivatives pricing. Such problems are affected by the so-called “curse of dimensionality” where the number of degrees of freedom (or unknowns) required to be solved for scales as N D where N is the number of grid points in any given dimension D. A simple, albeit naive, 6D example is demonstrated in the left panel of Figure 1. With N = 1000 grid points in each dimension, the memory required just to store the solution vector, not to mention forming the matrix required to advance such a system in time, would exceed an exabyte - and also the available memory on the largest of supercomputers available today. The right panel of Figure 1 demonstrates potential savings for a range of problem dimensionalities and grid resolution. While there are methods to simulate such high-dimensional systems, they are mostly based on Monte-Carlo methods, which rely on a statistical sampling such that the resulting solutions include noise. Since the noise in such methods can only be reduced at a rate proportional to $\sqrt{N_p}$ where N p is the number of Monte-Carlo samples, there is a need for continuum, or grid/mesh-based methods for high-dimensional problems, which both do not suffer from noise and bypass the curse of dimensionality. We present a simulation framework that provides such a method using adaptive sparse grids.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Machine learning and LHC event generation

First-principle simulations are at the heart of the high-energy physics research program. They link the vast data output of multi-purpose detectors with fundamental theory predictions and interpretation. This review illustrates a wide range of applications of modern machine learning to event generation and simulation-based inference, including conceptional developments driven by the specific requirements of particle physics. New ideas and tools developed at the interface of particle physics and machine learning will improve the speed and precision of forward simulations, handle the complexity of collision data, and enhance inference as an inverse simulation problem.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Machine learning to alleviate Hubbard-model sign problems

Lattice Monte Carlo calculations of interacting systems on nonbipartite lattices exhibit an oscillatory imaginary phase known as the phase or sign problem, even at zero chemical potential. One method to alleviate the sign problem is to analytically continue the integration region of the state variables into the complex plane via holomorphic flow equations. For asymptotically large flow times, the state variables approach manifolds of constant imaginary phase known as Lefschetz thimbles. Furthermore, flowing such variables and calculating the ensuing Jacobian is a computationally demanding procedure. In this paper, we demonstrate that neural networks can be trained to parametrize suitable manifolds for this class of sign problem and drastically reduce the computational cost for different severely afflicted small volume systems. In particular, we apply our method to the Hubbard model on the triangle and tetrahedron, both of which are nonbipartite. At strong interaction strengths and modest temperatures, the tetrahedron suffers from a severe sign problem that cannot be overcome with standard reweighting techniques, while it quickly yields to our method. We benchmark our results with exact calculations and comment on future directions of this work.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Semi-Supervised Domain Adaptation for Cross-Survey Galaxy Morphology Classification and Anomaly Detection

In the era of big astronomical surveys, our ability to leverage artificial intelligence algorithms simultaneously for multiple datasets will open new avenues for scientific discovery. Unfortunately, simply training a deep neural network on images from one data domain often leads to very poor performance on any other dataset. Here we develop a Universal Domain Adaptation method DeepAstroUDA, capable of performing semi-supervised domain alignment that can be applied to datasets with different types of class overlap. Extra classes can be present in any of the two datasets, and the method can even be used in the presence of unknown classes. For the first time, we demonstrate the successful use of domain adaptation on two very different observational datasets (from SDSS and DECaLS). We show that our method is capable of bridging the gap between two astronomical surveys, and also performs well for anomaly detection and clustering of unknown data in the unlabeled dataset. We apply our model to two examples of galaxy morphology classification tasks with anomaly detection: 1) classifying spiral and elliptical galaxies with detection of merging galaxies (three classes including one unknown anomaly class); 2) a more granular problem where the classes describe more detailed morphological properties of galaxies, with the detection of gravitational lenses (ten classes including one unknown anomaly class).

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Optimization and supervised machine learning methods for fitting numerical physics models without derivatives

Here, we address the calibration of a computationally expensive nuclear physics model for which derivative information with respect to the fit parameters is not readily available. Of particular interest is the performance of optimization-based training algorithms when dozens, rather than millions or more, of training data are available and when the expense of the model places limitations on the number of concurrent model evaluations that can be performed. As a case study, we consider the Fayans energy density functional model, which has characteristics similar to many model fitting and calibration problems in nuclear physics. We analyze hyperparameter tuning considerations and variability associated with stochastic optimization algorithms and illustrate considerations for tuning in different computational settings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization

Here, we consider unconstrained stochastic optimization problems with no available gradient information. Such problems arise in settings from derivative-free simulation optimization to reinforcement learning. We propose an adaptive sampling quasi-Newton method where we estimate the gradients using finite differences of stochastic function evaluations within a common random number framework. We develop modified versions of a norm test and an inner product quasi-Newton test to control the sample sizes used in the stochastic approximations and provide global convergence results to the neighborhood of a locally optimal solution. We present numerical experiments on simulation optimization problems to illustrate the performance of the proposed algorithm. When compared with classical zeroth-order stochastic gradient methods, we observe that our strategies of adapting the sample sizes significantly improve performance in terms of the number of stochastic function evaluations required.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Portable, heterogeneous ensemble workflows at scale using libEnsemble

libEnsemble is a Python-based toolkit for running dynamic ensembles, developed as part of the DOE Exascale Computing Project. The toolkit utilizes a unique generator–simulator–allocator paradigm, where generators produce input for simulators, simulators evaluate those inputs, and allocators decide whether and when a simulator or generator should be called. The generator steers the ensemble based on simulation results. Generators may, for example, apply methods for numerical optimization, machine learning, or statistical calibration. libEnsemble communicates between a manager and workers. Flexibility is provided through multiple manager–worker communication substrates each of which has different benefits. These include Python’s multiprocessing, mpi4py, and TCP. Multisite ensembles are supported using Balsam or Globus Compute. We overview the unique characteristics of libEnsemble as well as current and potential interoperability with other packages in the workflow ecosystem. We highlight libEnsemble’s dynamic resource features: libEnsemble can detect system resources, such as available nodes, cores, and GPUs, and assign these in a portable way. These features allow users to specify the number of processors and GPUs required for each simulation; and resources will be automatically assigned on a wide range of systems, including Frontier, Aurora, and Perlmutter. Such ensembles can include multiple simulation types, some using GPUs and others using only CPUs, sharing nodes for maximum efficiency. We also describe the benefits of libEnsemble’s generator–simulator coupling, which easily exposes to the user the ability to cancel, and portably kill, running simulations based on models that are updated with intermediate simulation output. We demonstrate libEnsemble’s capabilities, scalability, and scientific impact via a Gaussian process surrogate training problem for the longitudinal density profile at the exit of a plasma accelerator stage. In conclusion, the study uses gpCAM for the surrogate model and employs either Wake-T or WarpX simulations, highlighting efficient use of resources that can easily extend to exascale.

Dynamic ensembles↗
DOE OSTI2025

2025 Advances in NekRS: Supporting improved performance for nuclear applications

This report presents several 2025 advancements in NekRS, a high-fidelity spectral element CFD code developed at Argonne National Laboratory to support the NEAMS thermal-hydraulics program. The forthcoming v25 release consolidates several of these advances, adding new features for portability across heterogeneous GPU architectures, real-time in situ visualization, improved turbulence modeling, and conjugate heat transfer coupling. Over the past year, NekRS has demonstrated strong scalability and performance on DOE’s leading exascale platforms, including Aurora and Frontier, confirming its readiness for some of the largest and most complex simulations attempted to date. These achievements provide a powerful new platform for high-fidelity data generation, which in turn supports the development and validation of advanced closure models critical for reactor safety and design. Significant algorithmic innovations have also been introduced. A new global runtime h-refinement capability simplifies workflows by reducing mesh preparation burdens and enabling coarse-to-fine restarts. Building on this, a novel multigrid strategy was implemented to accelerate pressure and transport solves at scale, addressing long-standing bottlenecks in exascale CFD. Together, these developments improve both the efficiency and accessibility of high-fidelity simulations for reactor-relevant problems. Collectively, these enhancements represent a major step forward in simulation technology, positioning NekRS as a cornerstone of NEAMS efforts to enable accurate, efficient, and scalable high-fidelity analysis of advanced nuclear systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Scalable statistical inference of photometric redshift via data subsampling

Handling big data has largely been a major bottleneck in traditional statistical models. Consequently, when accurate point prediction is the primary target, machine learning models are often preferred over their statistical counterparts for bigger problems. But full probabilistic statistical models often outperform other models in quantifying uncertainties associated with model predictions. We develop a data-driven statistical modeling framework that combines the uncertainties from an ensemble of statistical models learned on smaller subsets of data carefully chosen to account for imbalances in the input space. We demonstrate this method on a photometric redshift estimation problem in cosmology, which seeks to infer a distribution of the redshift—the stretching effect in observing the light of far-away galaxies—given multivariate color information observed for an object in the sky. Our proposed method performs balanced partitioning, graph-based data subsampling across the partitions, and training of an ensemble of Gaussian process models.

data subsampling↗
DOE OSTI2024

Implementing Superresolution of Nonstationary Tides with Wavelets: An Introduction to CWT_Multi

Abstract Tides are often nonstationary due to nonastronomical influences. Investigating variable tidal properties implies a trade-off between separating adjacent frequencies (using long analysis windows) and resolving their time variations (short analysis windows). Previous continuous wavelet transform (CWT) tidal methods resolved tidal species. Here, we present CWT_Multi, a MATLAB code that 1) uses CWT linearity (via the “response coefficient method”) to implement superresolution, i.e., resolving tidal constituents beyond the Rayleigh criterion; 2) provides a Munk–Hasselmann constituent selection criterion appropriate for superresolution; and 3) introduces an objective, time-variable form of inference (“dynamic inference”) based on time-varying data properties. CWT_Multi resolves tidal species on time scales of days, and multiple constituents per species with fortnightly filters. It outputs astronomical phase lags and admittances, analyzes multiple records, and provides power spectra of the signal(s), residual(s), and reconstruction(s); confidence limits; and signal-to-noise ratios. Artificial data and water levels from the Lower Columbia River Estuary (LCRE) and San Francisco Bay Delta (SFBD) are used to test CWT_Multi and compare it to harmonic analysis programs NS_Tide and UTide. CWT_Multi provides superior reconstruction, detiding, dynamic analysis utility, and time resolution of constituents (but with broader confidence limits). Dynamic inference resolves closely spaced constituents (like K 1 , S 1 , and P 1 ) on fortnightly time scales, quantifying impacts of diel power peaking (with a 24-h period, like S 1 ) on water levels in the LCRE. CWT_Multi also helps quantify the impacts of high flows and a salt barrier closing on tidal properties in the SFBD. On the other hand, CWT_Multi does not excel at prediction, and results depend on analysis details, as for any method applied to nonstationary data. Significance Statement Ocean tides, especially in coastal and estuarine systems, are often nonstationary, in the sense that the mean and standard deviation of tidal properties vary over time, usually in response to some nontidal process. We introduce here a MATLAB code, CWT_Multi, that uses wavelet transforms to resolve both tidal species and constituents on time scales from a few days to months. Our code accommodates multiple scalar time series and has typical tidal analysis features like constituent selection and inference, plus two forms of uncertainty analyses. It is flexible, allowing the user to adapt analysis properties to diverse datasets. CWT_Multi is applicable to many problems involving time-variable tides, including sea level rise, compound flooding, sediment transport, and wetland habitat analyses. Application to vector data is a straightforward extension, but further development of our uncertainty analysis is merited. Because nonstationary tidal analysis is rapidly advancing, we also define the features of a “well-formed” analysis code.

Lobo, Matthew↗
DOE OSTI2025

On High-Order/Low-Order and Micro-Macro Methods for Implicit Time-Stepping of the BGK Model

In this paper, a high-order/low-order (HOLO) method is combined with a micro-macro (MM) decomposition to accelerate iterative solvers in fully implicit time-stepping of the Bhatnagar–Gross–Krook (BGK) equation for gas dynamics. The MM formulation represents a kinetic distribution as the sum of a local Maxwellian and a perturbation. In highly collisional regimes, the perturbation away from initial and boundary layers is small and can be compressed to reduce the overall storage cost of the distribution. The convergence behavior of the MM methods, the usual HOLO method, and the standard source iteration method is analyzed on a linear BGK model. Both the HOLO and MM methods are implemented using a discontinuous Galerkin (DG) discretization in phase space, which naturally preserves the consistency between high- and low-order models required by the HOLO approach. Furthermore, the accuracy and performance of these methods are compared on the Sod shock tube problem and a sudden wall heating boundary layer problem. Overall, the results demonstrate the robustness of the MM and HOLO approaches and illustrate the compression benefits enabled by the MM formulation when the kinetic distribution is near equilibrium.

BGK model↗
DOE OSTI2021

Accelerating LHC phenomenology with analytic one-loop amplitudes: A C++ interface to MCFM

Abstract The evaluation of one-loop matrix elements is one of the main bottlenecks in precision calculations for the high-luminosity phase of the Large Hadron Collider. To alleviate this problem, a new C++ interface to the "Image missing" <#comment/> parton-level Monte Carlo is introduced, giving access to an extensive library of analytic results for one-loop amplitudes. Timing comparisons are presented for a large set of Standard Model processes. These are relevant for high-statistics event simulation in the context of experimental analyses and precision fixed-order computations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods

We explore novel approaches for solving nonlinear optimization problems with unrelaxable bound constraints, which must be satisfied before the objective function can be evaluated. Our method reformulates the unrelaxable bound-constrained problem as an unconstrained optimization problem that is amenable to existing unconstrained optimization methods. The reformulation relies on a domain warping to form a merit function; the choice of the warping determines the level of exactness with which the unconstrained problem can be used to find solutions to the bound-constrained problem, as well as key properties of the unconstrained formulation such as smoothness. We develop theory when the domain warping is a multioutput sigmoidal warping, and we explore the practical elements of applying unconstrained optimization methods to the formulation. Here, we develop an algorithm that exploits the structure of the sigmoidal warping to guarantee that unconstrained optimization algorithms applied to the merit function will find a stationary point to the desired tolerance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Study of neutron beta decay with the Nab experiment

The current three sigma tension in the unitarity test of the Cabbibo-Kobayashi-Maskawa (CKM) matrix is a notable problem with the Standard Model of elementary particle physics. A long-standing goal of the study of free neutron beta decay is to better determine the CKM element Vud through measurements of the neutron lifetime and a decay correlation parameter. The Nab collaboration intends to measure a, the neutrino-electron correlation, with accuracy sufficient for a competitive evaluation of Vud based on neutron decay data alone. This paper gives a status report and an outlook.

Baessler, Stefan↗
DOE OSTI2022

ORNL Neutron Cross Section Measurements of 90 Zr

Nuclear criticality modeling and simulations rely on the quality of the existing evaluated nuclear data libraries such as Evaluated Nuclear Data File (ENDF)/B, the Joint Evaluated Fission and Fusion (JEFF) nuclear data library, or the Japanese Evaluated Nuclear Data Library (JENDL). In some cases, the cross-section evaluations of those libraries were found to be deficient in describing criticality benchmarks accurately. More than two decades ago, the US Nuclear Criticality Safety Program (NCSP) established a Nuclear Data (ND) task which encompassed experiments and evaluations. In response to this, the Oak Ridge National Laboratory (ORNL) formed a Nuclear Criticality and Data group which performed ND experiments, data analysis, and evaluations to produce ENDF files for the ND libraries as identified in the NCSP Five-Year Plan. Before being submitted to the ENDF library, files were processed and tested for performance by running benchmark calculations. This procedure was centralized in the ORNL group and is now often referred to as the ND pipeline. NCSP collaborates with the Joint Research Center (JRC) of the European Commission in Geel, Belgium, to perform high-resolution neutron-induced cross section measurements at the Geel Linear Accelerator (GELINA). The objective is to address emerging ND problems in criticality calculations. Difficulties with ND include insufficient neutron energy range, missing covariances, and previously unrecognized inaccuracies with experiments. New neutron total and capture cross sections of 90 Zr in the neutron energy range from 100 eV to several hundred keV were recently performed. These measured data will be used, together with existing high-resolution transmission data from a metallic 90 Zr sample, to improve representation of the cross sections.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Pufferscale: Rescaling HPC Data Services for High Energy Physics Applications

User-space HPC data services are emerging as an appealing alternative to traditional parallel file systems, because of their ability to be tailored to application needs while eliminating unnecessary overheads incurred by POSIX compliance. The High Energy Physics (HEP) community is progressively turning towards such services to enable high-throughput accesses under heavy concurrency to billions of event data produced by instruments and consumed by subsequent analysis workflows. Such services would benefit from the possibility to be rescaled up and down to adapt to changing workloads, as experimental campaigns progress, in order to optimize resource usage. This paper formalizes rescaling a distributed storage system as a multi objective optimization problem considering three criteria: load balance, data balance, and duration of the rescaling operation. We propose a heuristic for rapidly finding a good approximate solution, while allowing users to weight the criteria as needed. The heuristic is evaluated with Pufferscale, a new rescaling manager for microservice-based distributed storage systems. To validate our approach in a real-world ecosystem, we showcase the use of Pufferscale as a means to enable storage malleability in the HEPnOS storage system for HEP applications.

Distributed Storage System↗
DOE OSTI2023

Dynamics and resilience of the unconventional charge density wave in ScV 6 Sn 6 bilayer kagome metal

Long-range electronic ordering descending from a metallic parent state constitutes a rich playground to study the interplay of structural and electronic degrees of freedom. In this framework, kagome metals are in the most interesting regime where both phonon and electronically mediated couplings are significant. Several of these systems undergo a charge density wave transition. However, to date, the origin and the main driving force behind this charge order is elusive. Here, we use the kagome metal ScV 6 Sn 6 as a platform to investigate this problem, since it features both a kagome-derived nested Fermi surface and van-Hove singularities near the Fermi level, and a charge-ordered phase that strongly affects its physical properties. By combining time-resolved reflectivity, first principles calculations and photo-emission experiments, we identify the structural degrees of freedom to play a fundamental role in the stabilization of charge order, indicating that ScV 6 Sn 6 features an instance of charge order predominantly originating from phonons.

36 MATERIALS SCIENCE↗