Search NASA⌕ Search

SEARCH · Search NASA

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

The Study of Environmental Arctic Change (SEARCH) Arctic Futures 2050 Conference. Final Report

The Arctic Futures 2050 Conference was designed as a novel convening of Arctic scientists, Indigenous people, and decision makers, including policy makers at all levels of government. The conference was held 4–6 September 2019 in Washington, D.C. and gathered nearly 400 participants to explore six questions: What do we know, and what do we need to know about the Arctic—and why does it matter? What challenges confront policy makers in the rapidly changing Arctic? What basic research is needed to inform responses to Arctic change? What applied research is needed to inform responses to change? What tools can facilitate informing policy making with science and Indigenous knowledge? What opportunities exist for partnerships between policy makers and scientists? A conference report (see: https://www.searcharcticscience.org/arctic-2050/conference-2019/products) detailed all conference discussions. The main conference conclusion was that holistic understanding and useful adaptation to rapid Arctic change requires bringing together scientists, Indigenous Knowledge holders, and policy makers in all phases of defining the problems, conducting research, and sharing knowledge.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

ZEUS: An Efficient GPU Optimization Method Integrating PSO, BFGS, and Automatic Differentiation

We introduce a novel, efficient computational method, ZEUS, for numerical optimization, and provide an open-source implementation. It has four key ingredients: (1) particle swarm optimization (PSO), (2) the use of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method, (3) automatic differentiation (AD), and (4) GPUs. Our approach addresses the computational challenges inherent in high-dimensional, non-convex optimization problems. In the first phase of the algorithm, we get a potentially good set of starting points using PSO. Thereafter, we run BFGS independently in parallel from these starting points. BFGS is one of the best-performing algorithms for numerical optimization. However, it requires the gradient of the function being optimized. ZEUS integrates automatic differentiation into BFGS thus avoiding the need for the user to calculate derivatives explicitly. The use of GPUs allows ZEUS to speed up the calculations substantially. We carry out systematic studies to explore the trade-offs between the number of PSO iterations taken, starting points, and BFGS iteration depth. We show that a handful of iterations of PSO can improve global convergence when combined with BFGS. We also present performance studies using common test functions. The source code can be found at https://github.com/fnal-numerics/global-optimizer-gpu.

Soos, Dominik [Old Dominion U.]↗
DOE OSTI2022

A General State Estimation Formulation for Three-Phase Unbalanced Power Systems

Almost all of the three-phase state estimation algorithms assume existence of a reference bus whose phase angles are perfectly balanced. This assumption is quite realistic for transmission systems, and also for most distribution systems that are connected to a strong transmission system where transmission side can modeled by a balanced reference bus. However, for distribution systems having high penetration of renewable sources or for microgrids operating in islanded mode, the assumption of a balanced reference bus will not be realistic. While there are recent publications focusing on this problem, formulation of the three-phase unbalanced state estimation problem with proper treatment of the reference bus remains unaddressed. In this paper, a new formulation will be described where an accurate state estimation solution can be obtained for any unbalanced threephase system irrespective of its operating conditions (balanced or highly unbalanced), configuration (isolated microgrid, connected to transmission system, etc.) and whether or not it contains any synchronous generators. Validation of the proposed formulation will be carried out via simulations.

State Estimation, Distribution System, Unbalanced ↗
DOE OSTI2021

Random Close Packing as a Dynamical Phase Transition

Sphere packing is an ancient problem. The densest packing is known to be a face-centered cubic (FCC) crystal, with space-filling fraction Φ FCC = π / √ 18 ≈ 0.74 . The densest “random packing,” random close packing (RCP), is yet ill defined, although many experiments and simulations agree on a value Φ RCP ≈ 0.64 . We introduce a simple absorbing-state model, biased random organization (BRO), which exhibits a Manna class dynamical phase transition between absorbing and active states that has as its densest critical point Φ cmax ≈ 0.64 ≈ Φ RCP and, like other Manna class models, is hyperuniform at criticality. The configurations we obtain from BRO appear to be structurally identical to RCP configurations from other protocols. This leads us to conjecture that the highest-density absorbing state for an isotropic biased random organization model produces an ensemble of configurations that characterizes the state conventionally known as RCP.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Lattice $ \mathcal{N} $ = 4 super Yang-Mills at strong coupling

In this paper we present results from numerical simulations of N = 4 super Yang-Mills for two color gauge theory over a wide range of ’t Hooft coupling 0 < λ ≤ 30 using a supersymmetric lattice action. Numerical study of this lattice theory has been stymied until recently by both sign problems and the occurrence of lattice artifact phases at strong coupling. We have recently developed a new action that appears capable of solving both problems. The resulting action possesses just SU(2) rather than U(2) gauge symmetry. By explicit computations of the fermion Pfaffian we present evidence that the theory possesses no sign problem and exists in a single phase out to arbitrarily strong coupling. Furthermore, preliminary work shows that the logarithm of the supersymmetric Wilson loop varies as the square root of the ’t Hooft coupling λ for large λ in agreement with holographic predictions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

A consistent and conservative volume distribution algorithm and its applications to multiphase flows using Phase-Field models

In the present study, the multiphase volume distribution problem, where there can be an arbitrary number of phases, is addressed using a consistent and conservative volume distribution algorithm. The proposed algorithm satisfies the summation constraint, the conservation constraint, and the consistency of reduction. The first application of the volume distribution algorithm is to determine the Lagrange multipliers in multiphase Phase-Field models that enforce the mass conservation, and a multiphase conservative Allen-Cahn model that satisfies the consistency of reduction is developed. A corresponding consistent and conservative numerical scheme is developed for the model. The multiphase conservative Allen-Cahn model has a better ability than the multiphase Cahn-Hilliard model to preserve under-resolved structures. The second application is to develop a numerical procedure, called the boundedness mapping, to map the order parameters, obtained numerically from a multiphase model, into their physical interval, and at the same time to preserve the physical properties of the order parameters. Along with the consistent and conservative schemes for the multiphase Phase-Field models, the numerical solutions of the order parameters are reduction consistent, conservative, and bounded, which are theoretically analyzed and numerically validated. Then, the multiphase Phase-Field models are coupled with the momentum equation by satisfying the consistency of mass conservation and the consistency of mass and momentum transport, thanks to the consistent formulation. Finally, it is demonstrated that the proposed model and scheme converge to the sharp-interface solution and are capable of capturing the complicated multiphase dynamics even when there is a large density and/or viscosity ratio.

42 ENGINEERING↗
DOE OSTI2020

Simulation of mineral dissolution at the pore scale with evolving fluid-solid interfaces: review of approaches and benchmark problem set

This manuscript presents a benchmark problem for the simulation of single-phase flow, reactive transport, and solid geometry evolution at the pore scale. The problem is organized in three parts that focus on specific aspects: flow and reactive transport (part I), dissolution-driven geometry evolution in two dimensions (part II), and an experimental validation of three-dimensional dissolution-driven geometry evolution (part III). Five codes are used to obtain the solution to this benchmark problem, including Chombo-Crunch, OpenFOAM-DBS, a lattice Boltzman code, Vortex, and dissolFoam. These codes cover a good portion of the wide range of approaches typically employed for solving pore-scale problems in the literature, including discretization methods, characterization of the fluid-solid interfaces, and methods to move these interfaces as a result of fluid-solid reactions. A short review of these approaches is given in relation to selected published studies. Results from the simulations performed by the five codes show remarkable agreement both quantitatively--based on upscaled parameters such as surface area, solid volume, and effective reaction rate--and qualitatively--based on comparisons of shape evolution. This outcome is especially notable given the disparity of approaches used by the codes. Therefore, these results establish a strong benchmark for the validation and testing of pore-scale codes developed for the simulation of flow and reactive transport with evolving geometries. They also underscore the significant advances seen in the last decade in tools and approaches for simulating this type of problem.

58 GEOSCIENCES↗
DOE OSTI2020

Ex Machina Determination of Structural Correlation Functions

Determining the structural properties of condensed-phase systems is a fundamental problem in theoretical statistical mechanics. In this study, we present a machine learning method that is able to predict structural correlation functions with significantly improved accuracy in comparison with traditional approaches. The usefulness of this ex machina (from the machine) approach is illustrated by predicting the radial distribution functions of two paradigmatic condensed-phase systems, a Lennard-Jones fluid and a hard-sphere fluid, and then comparing those results to the results obtained using both integral equation methods and empirically motivated analytical functions. We find that application of the developed ex machina method typically decreases the predictive error by more than an order of magnitude in comparison with traditional theoretical methods.

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

Quantum cluster algorithm for data classification

Abstract We present a quantum algorithm for data classification based on the nearest-neighbor learning algorithm. The classification algorithm is divided into two steps: Firstly, data in the same class is divided into smaller groups with sublabels assisting building boundaries between data with different labels. Secondly we construct a quantum circuit for classification that contains multi control gates. The algorithm is easy to implement and efficient in predicting the labels of test data. To illustrate the power and efficiency of this approach, we construct the phase transition diagram for the metal-insulator transition of VO 2 , using limited trained experimental data, where VO 2 is a typical strongly correlated electron materials, and the metallic-insulating phase transition has drawn much attention in condensed matter physics. Moreover, we demonstrate our algorithm on the classification of randomly generated data and the classification of entanglement for various Werner states, where the training sets can not be divided by a single curve, instead, more than one curves are required to separate them apart perfectly. Our preliminary result shows considerable potential for various classification problems, particularly for constructing different phases in materials.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Implementing contact angle boundary conditions for second-order Phase-Field models of wall-bounded multiphase flows

In the present work, a general formulation is proposed to implement the contact angle boundary conditions for the second-order Phase-Field models, which is applicable to N-phase (N ≥ 2) moving contact line problems. To remedy the issue of mass change due to the contact angle boundary condition, a source term or Lagrange multiplier is added to the original second-order Phase-Field models, which is determined by the consistent and conservative volume distribution algorithm so that the summation of the order parameters and the consistency of reduction are not influenced. To physically couple the proposed formulation to the hydrodynamics, especially for large-density-ratio problems, the consistent formulation is employed. The reduction-consistent conservative Allen-Cahn models are chosen as examples to illustrate the application of the proposed formulation. The numerical scheme that preserves the consistency and conservation of the proposed formulation is employed to demonstrate its effectiveness. Results produced by the proposed formulation are in good agreement with the exact and/or asymptotic solutions. The proposed method captures complex dynamics of moving contact line problems having large density ratios.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Simulating scalar field theories on quantum computers with limited resources

Here we present a quantum algorithm for implementing φ 4 lattice scalar field theory on qubit computers. The field is represented in the discretized field amplitude basis. The number of qubits and elementary gates required by the implementation of the evolution operator is proportional to the lattice size. The algorithm allows efficient φ 4 state preparation for a large range of input parameters in both the normal and broken-symmetry phases. The states are prepared using a combination of variational and adiabatic evolution methods. First, the ground state of a local Hamiltonian, which includes the φ 4 self-interaction, is prepared using short variational circuits. Next, this state is evolved by switching on the coupling between the lattice sites adiabatically. The parameters defining the local Hamiltonian are adjustable and constitute the input of our algorithm. We present a method to optimize these parameters in order to reduce the adiabatic time required for state preparation. For preparing broken-symmetry states, the adiabatic evolution problems caused by crossing the phase transition critical line and by the degeneracy of the broken-symmetry ground state can be addressed using an auxiliary external field which gradually turns off during the adiabatic process. We show that the time dependence of the external field during the adiabatic evolution is important for addressing the broken-symmetry ground state degeneracy. The adiabatic time dependence on the inverse error tolerance can be reduced from quadratic to linear by using a field strength that decreases exponentially in time relative to one that decreases linearly.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Multi-qubit entanglement and algorithms on a neutral-atom quantum computer

Gate model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high fidelity logic. Neutral atom hyperfine qubits provide inherent scalability due to their identical characteristics, long coherence times, and ability to be trapped in dense multi-dimensional arrays. Combined with the strong entangling interactions provided by Rydberg states, all the necessary characteristics for quantum computation are available. Here we demonstrate several quantum algorithms on a programmable gate model neutral atom quantum computer in an architecture based on individual addressing of single atoms with tightly focused optical beams scanned across a two-dimensional array of qubits. Preparation of entangled Greenberger-Horne-Zeilinger (GHZ) states with up to 6 qubits, quantum phase estimation for a chemistry problem, and the Quantum Approximate Optimization Algorithm (QAOA) for the MaxCut graph problem are demonstrated. These results highlight the emergent capability of neutral atom qubit arrays for universal, programmable quantum computation, as well as preparation of non-classical states of use for quantum enhanced sensing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Accurately simulating core-collapse self-interacting dark matter halos

The properties of satellite halos provide a promising probe for dark matter (DM) physics. Observations have motivated current efforts to explain surprisingly compact DM halos. If DM is not collisionless, but has strong self-interactions, halos can undergo gravothermal collapse, leading to higher densities in the central region of the halo. However, it is challenging to model this collapse phase from first principles. To improve on this, we sought to better understand the numerical challenges and convergence properties of self-interacting dark matter (SIDM) N-body simulations in the collapse phase. Especially, our aim was to better understand the evolution of satellite halos. To do so, we ran SIDM N-body simulations of a low-mass halo in isolation and within an external gravitational potential. The simulation set-up was motivated by the perturber of the stellar stream GD-1. We find that the halo evolution is very sensitive to energy conservation errors, and a SIDM kernel size that is too large can artificially speed up the collapse. Moreover, we demonstrate that the King model can describe the density profile at small radii for the late stages that we have simulated. Furthermore, for our most highly resolved simulation (N = 5 × 10 7 ) we have made the data public. It can serve as a benchmark. Overall, we find that the current numerical methods do not suffer from convergence problems in the late collapse phase and provide guidance on how to choose numerical parameters, for example that the energy conservation error is better kept well below 1%. This allows simulations to be run of halos that become concentrated enough to explain observations of GD-1-like stellar streams or strong gravitational lensing systems.

dark matter↗
DOE OSTI2026

Causal horizons, geodesic completeness and stability in slow contraction cosmology

We show that cosmological models with a semi-infinite phase of slow contraction (ekpyrosis) possess a combination of properties that can address several fundamental problems in cosmology, otherwise faced in contracting de Sitter phases or standard big bang expansion. In particular, flat or open slow contraction admits a stable past attractor that asymptotes to Minkowski space and is past geodesically complete, as well as a stable, flat, homogeneous, and isotropic future attractor with negligible Weyl curvature (and, therefore, negligible gravitational entropy). In bouncing cosmologies, this contracting attractor is terminated by a smooth, non-singular bounce that transforms the attractor properties at the end of contraction into the initial conditions for the subsequent expanding phase. Cosmologies incorporating a slow contraction phase have no particle horizon and therefore avoid the causal horizon problem. The past Minkowski attractor also generates an initial spectrum of vacuum-like quantum fluctuations on all wavelengths. Moreover, because the averaged expansion rate along past-directed geodesics is non-positive, models incorporating a semi-infinite phase of slow contraction also evade the Borde–Guth–Vilenkin theorem. By contrast, contracting de Sitter space possesses a finite particle horizon and becomes unstable in the presence of scalar fields, matter, or radiation.

Cosmology and Nongalactic Astrophysics (astro-ph.C↗
DOE OSTI2025

Reducing the Parameter Dependency of Phase-Picking Neural Networks with Dice Loss

Training a neural network for picking seismic phase arrivals has been commonly posed as a segmentation problem. It is a highly imbalanced segmentation problem in the sense that the background vastly dominates the foreground because we are trying to pick the optimal single sample point that represents the arrival of a seismic phase in a many seconds long time window. Here, we test the Dice loss, which is a preferred loss function for highly imbalanced image segmentation problems. We show that phase-picking neural networks trained on the Dice loss behave in a binary fashion for which the prediction output is almost always either nearly 1 or nearly 0. This feature removes the strong dependence of data processing workflows on the prediction score threshold, which is an otherwise critical parameter to determine when using neural networks trained on the cross-entropy loss. When strategically used, models trained on the Dice loss can reduce the parameter dependency of machine learning-based seismic monitoring.

58 GEOSCIENCES↗
DOE OSTI2024

A General Materials Data Science Framework for Quantitative 2D Analysis of Particle Growth from Image Sequences

Abstract Phase transformations are a challenging problem in materials science, which lead to changes in properties and may impact performance of material systems in various applications. We introduce a general framework for the analysis of particle growth kinetics by utilizing concepts from machine learning and graph theory. As a model system, we use image sequences of atomic force microscopy showing the crystallization of an amorphous fluoroelastomer film. To identify crystalline particles in an amorphous matrix and track the temporal evolution of the particle dispersion, we have developed quantitative methods of 2D analysis. 700 image sequences were analyzed using a neural network architecture, achieving 0.97 pixel-wise classification accuracy as a measure of the correctly classified pixels. The growth kinetics of isolated and impinged particles were tracked throughout time using these image sequences. The relationship between image sequences and spatiotemporal graph representations was explored to identify the proximity of crystallites from each other. The framework enables the analysis of all image sequences without the requirement of sampling for specific particles or timesteps for various materials systems.

36 MATERIALS SCIENCE↗
DOE OSTI2024

SMARTER Rules-Based Distributed Deconfliction of ADMS Applications

A conceptual numerical methodology derived from Grid Architecture principles is introduced for deconflicting setpoints issued by multiple advanced distribution management system applications. The methodology applies technical, economic, environmental, and social rules to eliminate non-viable combinations. The concept of temporal equipment controls budgets is introduced to preserve the health of physical assets and avoid equipment damage through repeated controls cycling. The rules are combined with a multi-criteria decision-making framework to select a near-optimal set of deconflicted setpoints using a set of qualitative and quantitative decision criteria selected by the distribution system operator. Numerical results are demonstrated on the IEEE 123-bus test feeder for three competing applications. Three alternative distributed schemes are used to decompose the problem: by topological area, by phase, and fully decentralized. The fully decentralized implementation is shown to yield near-optimal deconfliction results with significantly reduced computational time.

Anderson, Alexander A.↗