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

Axion Dark Matter EXperiment 2A Cavity Characterization

The axion is a highly motivated dark matter candidate for its capacity to solve the strong CP problem in quantum chromodynamics. To detect the axion, the 2A phase of the Axion Dark Matter EXperiment (ADMX) utilizes four identical cylindrical resonant cavities that can detect the photons converted from axions in a strong magnetic field. We found the quality factors for various tunings in cavity D, and we also learned that the piezo motors are not currently equipped to handle cryogenic temperatures. However, the measured quality factors are much more promising than those shown in the last 2A cooldown, improving by about a factor of five.

Maglione, Diego↗
DOE OSTI2021

High-order algorithmic developments and optimizations for large-scale GPU-accelerated simulations (Milestone CEED-MS36)

The goal of this milestone was to improve the high-order software ecosystem for CEED-enabled ECP applications by making progress on efficient matrix-free kernels targeting forthcoming ECP architectures. These kernels included matrix-free preconditioning and the development of new set of CEED solver bake-off problems. As part of this milestone, we also released the next version of the CEED software stack, CEED-4.0, reported on results from several application collaborations, and documented the efforts of porting to AMD GPUs for Frontier and other modern architectures, such as Fugaku. The specific tasks addressed in this milestone were: (1) Port and run CEED benchmarks/miniapps on Frontier EA systems; (2) Demonstrate performant libCEED integration in MFEM, Nek and applications; (3) Matrix-free preconditioning of high-order operators; (4) Benchmark problems for fast high-order solvers on GPU platforms; and (5) Public release of CEED-4.0. The artifacts delivered include the next version of the CEED software stack, CEED-4.0, the next libCEED release, libCEED-0.8, and a number of developments integrated within applications to improve their GPU and CPU performance and capabilities. See the CEED website, https://ceed.exascaleproject.org and the CEED GitHub organization, https://github.com/ceed for more details.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Quantum approximate multi-objective optimization

The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Machine-learning-based inversion of nuclear responses

A microscopic description of the interaction of atomic nuclei with external electroweak probes is required for elucidating aspects of short-range nuclear dynamics and for the correct interpretation of neutrino oscillation experiments. Nuclear quantum Monte Carlo methods infer the nuclear electroweak response functions from their Laplace transforms. Inverting the Laplace transform is a notoriously ill-posed problem; and Bayesian techniques, such as maximum entropy, are typically used to reconstruct the original response functions in the quasielastic region. In this work, we present a physics-informed artificial neural network architecture suitable for approximating the inverse of the Laplace transform. Utilizing simulated, albeit realistic, electromagnetic response functions, we show that this physics-informed artificial neural network outperforms maximum entropy in both the low-energy transfer and the quasielastic regions, thereby allowing for robust calculations of electron scattering and neutrino scattering on nuclei and inclusive muon capture rates.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Accelerating $\mathrm{LHC}$ event generation with simplified pilot runs and fast $\mathrm{PDF}$s

Poor computing efficiency of precision event generators for LHC physics has become a bottleneck for Monte-Carlo event simulation campaigns. We provide solutions to this problem by focusing on two major components of general-purpose event generators: The PDF evaluator and the matrix-element generator. For a typical production setup in the ATLAS experiment, we show that the two can consume about 80% of the total runtime. Using NLO simulations of pp→ℓ + ℓ - +jets and pp→$t\bar{t}$+jets as an example, we demonstrate that the computing footprint of LHAPDF and SHERPA can be reduced by factors of order 10, while maintaining the formal accuracy of the event sample. The improved codes are made publicly available.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Quantum Optimization: Potential, Challenges, and the Path Forward

Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of algorithmic approaches, often with little linkage. This is further complicated by the fragmented nature of the field of mathematical optimization, where major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions, have devoted communities. With these aspects in mind, this work draws on multiple approaches to study quantum optimization. Provably exact versus heuristic settings are first explained using computational complexity theory — highlighting where quantum advantage is possible in each context. Then, the core building blocks for quantum optimization algorithms are outlined to subsequently define prominent problem classes and identify key open questions that, if answered, will advance the field. The effects of scaling relevant problems on noisy quantum devices are also outlined in detail, alongside meaningful benchmarking problems. We underscore the importance of benchmarking by proposing clear metrics to conduct appropriate comparisons with classical optimization techniques. Lastly, we highlight two domains – finance and sustainability – as rich sources of optimization problems that could be used to benchmark, and eventually validate, the potential real-world impact of quantum optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

TAO Users Manual (Rev. 3.15)

The Toolkit for Advanced Optimization (TAO) focuses on the development of algorithms and software for the solution of large-scale optimization problems on high-performance architectures. Areas of interest include unconstrained and bound-constrained optimization, nonlinear least squares problems, optimization problems with partial differential equation constraints, and variational inequalities and complementarity constraints. The development of TAO was motivated by the scattered support for parallel computations and the lack of reuse of external toolkits in current optimization software. Our aim is to produce high-quality optimization software for computing environments ranging from workstations and laptops to massively parallel high-performance architectures. Our design decisions are strongly motivated by the challenges inherent in the use of large-scale distributed memory architectures and the reality of working with large, often poorly structured legacy codes for specific applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The Artificial Scientist: in-Transit Machine Learning of Plasma Simulations

Large-scale simulations or scientific experiments produce petabytes of data per run. This poses massive challenges for I/O and storage when scientific analysis workflows are run manually offline. Unsupervised deep learning-based techniques to extract patterns and non-linear relations from these large amounts of data provide a way to build scientific understanding from raw data, reducing the need for manual pre-selection of analysis steps, but require exascale compute and memory to process the full dataset available. In this paper, we demonstrate a heterogeneous streaming workflow in which plasma simulation data is streamed directly to a Machine Learning (ML) application training a model on the simulation data in-transit, completely circumventing the capacity-constrained filesystem bottleneck. This workflow employs openPMD to provide a high level interface to describe scientific data and also uses ADIOS2, to transfer volumes of data that exceed the capabilities of the filesystem. We employ experience replay to avoid catastrophic forgetting in learning from this non-steady state process in a continual manner and adapt it to improve model convergence while learning in-transit. As a proof-of-concept, we approach the ill-posed inverse problem of predicting particle dynamics from radiation in a particle-incell (PIConGPU) simulation of the Kelvin-Helmholtz instability (KHI). We detail hardware-software co-design challenges as we scale PIConGPU to full Frontier, the Top-1 system as of June 2024 Top500 list.

Kelling, Jeffrey [Helmholtz-Zentrum Dresden Rossen↗
DOE OSTI2024

Stochastic average model methods

We consider the solution of finite-sum minimization problems, such as those appearing in nonlinear least-squares or general empirical risk minimization problems. We are motivated by problems in which the summand functions are computationally expensive and evaluating all summands on every iteration of an optimization method may be undesirable. Here we present the idea of stochastic average model (SAM) methods, inspired by stochastic average gradient methods. SAM methods sample component functions on each iteration of a trust-region method according to a discrete probability distribution on component functions; the distribution is designed to minimize an upper bound on the variance of the resulting stochastic model. We present promising numerical results concerning an implemented variant extending the derivative-free model-based trust-region solver POUNDERS, which we name SAM-POUNDERS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Exploiting Chemistry and Molecular Systems for Quantum Information Science

The power of chemistry to prepare new compositions of matter has driven the quest for new approaches to solve problems having global societal impact, such as renewable energy, healthcare, and information science. In the latter case, the intrinsic quantum nature of molecules offers intriguing new possibilities to advance the emerging field of Quantum Information Science (QIS). In this Perspective, we discuss how chemical systems and reactions can impact quantum computing, communication, and sensing. Hierarchical molecular design and synthesis, from small molecules to supramolecular assemblies, combined with new spectroscopic probes of quantum coherence and theoretical modeling of complex systems, offer a broad range of possibilities to realize practical QIS applications.

quantum computing, Spectrocopy, computational chem↗
DOE OSTI2023

Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their simulation, analysis, and data resources. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. In this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

Alexeev, Yuri↗
DOE OSTI2024

Focusing Optics for Axion Detection: Simulating Sensing Enhancements of Photons in InfraBREAD

The Broadband Reflector Experiment for Axion Detection (BREAD) will search for axions, a promising particle candidate for dark matter, in the high mass range of [$10^{-3}$,1]eV. BREAD acts like a telescope for dark matter, using a parabolic reflector to direct axion-induced photons onto a precise focal spot. InfraBREAD is the experimental version designed to detect photons resulting from axions with infrared frequency using a 1mm × 1mm Superconducting Nanowire Singe Photon Detector (SNSPD). However, at this frequency scale two problems arise: 1) the focal spot becomes smeared across an area larger than the size of the SNSPD detector; 2) any millimeter-scale misalignment shifts in the SNSPD can greatly diminish photon signal. This study performed simulations of novel optical configurations of lenses and reflectors placed around the SNSPD to achieve a greater efficiency than the SNSPD alone through both of these effects. One optical setup was identified called the “Parabolo id to Winston Cone (PTW) Configuration,” which exploits the optics of parabolic reflectors to focus incoming photons from the larger area of the smeared focal spot onto the smaller 1mm 2 area of the detector. The PTW configuration demonstrated overall improvements in efficiency by around 10% through misalignment shifts, with a maximal improvement of 55% in one region.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Quantum-centric supercomputing for materials science: A perspective on challenges and future directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Computationally hard tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their resources for simulation, analysis, and data processing. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. Here in this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Towards dynamical low-rank approximation for neutrino kinetic equations. Part I: Analysis of an idealized relaxation model

Dynamical low-rank approximation (DLRA) is an emerging tool for reducing computational costs and provides memory savings when solving high-dimensional problems. Here, in this work, we propose and analyze a semi-implicit dynamical low-rank discontinuous Galerkin (DLR-DG) method for the space homogeneous kinetic equation with a relaxation operator, modeling the emission and absorption of particles by a background medium. Both DLRA and the discontinuous Galerkin (DG) scheme can be formulated as Galerkin equations. To ensure their consistency, a weighted DLRA is introduced so that the resulting DLR-DG solution is a solution to the fully discrete DG scheme in a subspace of the standard DG solution space. Similar to the standard DG method, we show that the proposed DLR-DG method is well-posed. We also identify conditions such that the DLR-DG solution converges to the equilibrium. Numerical results are presented to demonstrate the theoretical findings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Hybrid Quantum-Classical Eigensolver without Variation or Parametric Gates

The use of near-term quantum devices that lack quantum error correction, for addressing quantum chemistry and physics problems, requires hybrid quantum-classical algorithms and techniques. Here, we present a process for obtaining the eigenenergy spectrum of electronic quantum systems. This is achieved by projecting the Hamiltonian of a quantum system onto a limited effective Hilbert space specified by a set of computational bases. From this projection, an effective Hamiltonian is obtained. Furthermore, a process for preparing short depth quantum circuits to measure the corresponding diagonal and off-diagonal terms of the effective Hamiltonian is given, whereby quantum entanglement and ancilla qubits are used. The effective Hamiltonian is then diagonalized on a classical computer using numerical algorithms to obtain the eigenvalues. The use case of this approach is demonstrated for ground state and excited states of BeH2 and LiH molecules, and the density of states, which agrees well with exact solutions. Additionally, hardware demonstration is presented using IBM quantum devices for H2 molecule.

Jouzdani, Pejman (ORCID:0000000256470381)↗
DOE OSTI2021

Refined Telluric Absorption Correction for Low-resolution Ground-based Spectroscopy: Resolution and Radial Velocity Effects in the O{sub 2}A-band for Exoplanets and K i Emission Lines

Telluric correction of spectroscopic observations is either performed via standard stars that are observed close in time and airmass along with the science target, or recently growing in importance, by theoretical telluric absorption modeling. Both approaches work fine when the telluric lines are resolved, i.e., at a spectral resolving power larger than about 10,000, and it is sufficient to facilitate the detection of spectral features at lower resolution. However, a meaningful quantitative analysis also requires the reliable recovery of line strengths. Here, we show for the Fraunhofer A-band of molecular O{sub 2} that the standard telluric correction approach fails in this at lower spectral resolutions, as an example for the general problem. Doppler-shift-dependent errors of the restored flux may arise, which can amount to more than 50% in extreme cases, depending on the line shapes of the target spectral features. Two applications are discussed: the recovery of the O{sub 2} band in the reflected light of an Earth analog atmosphere, as facilitated potentially in the future using an orbiting starshade and a ground-based extremely large telescope; and the recovery of the intrinsic ratio of the K i lines in the post-nova V4332 Sgr tracing the optical depth of the emitting region, to exemplify the relevance using present-day instrumentation. We show how one should derive correction functions for the compensation of the error in dependence of radial velocity shift, spectral resolution, and target line-profile function by use of high-resolution atmospheric transmission modeling, which has to be solved for the individual case.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Provable bounds for noise-free expectation values computed from noisy samples

Quantum computing has emerged as a powerful computational paradigm capable of solving problems beyond the reach of classical computers. However, today’s quantum computers are noisy, posing challenges to obtaining accurate results. Here, we explore the impact of noise on quantum computing, focusing on the challenges in sampling bit strings from noisy quantum computers and the implications for optimization and machine learning. We formally quantify the sampling overhead to extract good samples from noisy quantum computers and relate it to the layer fidelity, a metric to determine the performance of noisy quantum processors. Further, we show how this allows us to use the conditional value at risk of noisy samples to determine provable bounds on noise-free expectation values. We discuss how to leverage these bounds for different algorithms and demonstrate our findings through experiments on real quantum computers involving up to 127 qubits. The results show strong alignment with theoretical predictions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Catalytic properties of model supported nanoparticles

Nanoparticles of late transition metals are used as catalysts and electrocatalysts for industrial chemical reactions that produce fuels, convert chemical energy to electricity and clean up pollution associated with the generation and use of these fuels. For such applications, metals are usually bonded onto the surfaces of oxide or carbon support materials. To provide the energy needed for sustained economic development, we must develop new and improved solid catalysts and electrocatalysts for a variety of reactions that take better advantage of traditional and alternate energy sources (solar, wind, biomass, etc.) and avoid serious environmental problems. Additionally, since these metals are often expensive and in limited supply (e.g., Pt), we also need to develop catalysts that do not require precious metals. As a consequence, recent years have seen a dramatic increase in research aimed at providing the basic understanding needed to develop new and improved catalysts and electrocatalysts for a variety of reactions that involve nanoparticles of late transition metals supported on oxide or carbon materials. It is therefore timely to present a special issue that focusses on Catalytic Properties of Model Supported Nanoparticles. The collection highlights some of the most exciting new directions for research in this area, and provides in depth examples of some of the most cutting-edge methods, both experimental and theoretical, for studying this class of catalysts, which provide insights into structure, mechanisms, kinetics and energetics with unprecedented accuracy and detail. Finally, as Guest Editors, we present below a few of the many excellent papers published in the collection.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗