Search NASA⌕ Search

SEARCH · Search NASA

Results for “RELAXATION METHOD (MATHEMATICS)”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Asymptotic-preserving semi-implicit finite volume scheme for extended magnetohydrodynamics

A Finite Volume (FV) scheme is developed for solving the extended magnetohydrodynamic (XMHD) equations, yielding accurate results in the ideal, resistive, and Hall MHD limits. This is accomplished by first re-writing the XMHD equations such that it allows the algorithm to retain the use of ideal MHD Riemann solvers and the constrained transport method to preserve divergence-free magnetic fields. Incorporation of electron inertia and displacement current introduces additional numerical stiffness which motivates a semi-implicit FV scheme that re-formulates the XMHD model as a relaxation system. The equations are then advanced in time using an explicit 2nd-order Runge–Kutta scheme with operator splitting applied to the implicit source term updates at each sub-stage. For additional numerical stability, a density-dependent slope limiter is implemented to increase flux diffusivity at low density regions where non-ideal effects become significant. The algorithm is subsequently implemented in a scalable adaptive mesh refinement (AMR) framework. As the new algorithm retains many aspects of the ideal MHD formulations, it asymptotes naturally to the ideal MHD limit. Moreover, it shows promising results at the resistive and Hall MHD limits. This is verified against reference test problems for ideal, resistive and Hall MHD.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallel-in-time methods, with the most common method, parareal, diverging in many cases. The current state of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be further researched and improved (including with a new relaxation method inspired by on Least Squares Shadowing (LSS)) and explored for more complicated problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Near-ideal relaxed MHD in slab geometry

We investigate the solutions of the relaxed magnetohydrodynamic (MHD) model (RxMHD) of R. Dewar and Z. Qu. This model generalizes Taylor relaxation by including the ideal Ohm's law constraint using an augmented Lagrangian method, providing a pathway to extend the multi-region relaxed MHD (MRxMHD) model. We present the first numerical solution of the RxMHD model by Dewar and Qu, demonstrating that it is mathematically well-defined and computationally feasible for constructing MHD equilibria in slab geometry. We also show that a cross-field flow can exist without enforcing an arbitrary constraint on the angular momentum, as is done in the case of MRxMHD with flow. Our results also demonstrate the self-organization of fully relaxed regions during the optimization, which was an important motivation behind developing this model.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Semi-Lagrangian nodal discontinuous Galerkin method for the BGK model

In this work, we propose a semi-Lagrangian (SL) nodal discontinuous Galerkin (DG) solver for the BGK equation. The BGK model was introduced by Bhatnagar, Gross, and Krook [1] as a relaxation model for the fundamental Boltzmann equation [5], which describes the kinetic dynamic of rarefied gases with a probability distribution function. The challenges of designing efficient numerical schemes for the Boltzmann equation mainly come from its high dimensionality and complicated nonlinear collision operator. The BGK model gains interests since it has much lower computational cost, due to the relatively simple structure of the relaxation operator in replacement of the collision operator, while simultaneously preserving several important physical properties, such as macroscopic quantities and dissipation of entropy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Decomposition-Based Learn-To-Optimize Approach with Feasibility Layer Assistance for Sub-Hourly Unit Commitment

Sub-hourly unit commitment (UC) with 15-min intervals is gaining significant attention as a way to respond rapidly to the fluctuations in electricity supply and demand introduced by renewable resources. However, the increased temporal resolution and complex inter-temporal dependencies pose substantial computational challenges for traditional optimization methods. To this end, this paper explores a decomposition-based learn-to-optimize approach. Building on recent advances in machine learning, our method revisits the long- overlooked Lagrangian relaxation framework, which is a classical decomposition technique that enables tractable subproblem solving. These smaller subproblems are inherently well-suited for machine learning, as their reduced dimensionality and structural regularity allow predictive models to efficiently learn and generalize solution patterns. We thus propose a generic predictive model, which embeds Gated Recurrent Units (GRUs) and Attention in the encoder-decoder structure, and integrate a rule-based feasibility layer to capture temporal dependencies, reduce training effort, and improve feasibility w.r.t. unit-level constraints. Our method has been validated on the IEEE 118-bus system, demonstrating promising performance in solving sub-hourly UC problems efficiently and feasibly.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Safe Deep Reinforcement Learning for Active Distribution System Model Predictive Control with EVs and DERs

The temporal and spatial mismatch between PV generation and electric vehicle (EV) charging and discharging may cause voltage violations in active distribution networks. Despite the widespread use of deep reinforcement learning (DRL) in power system optimization and control, it lacks guarantees on constraint satisfaction during both training and deployment. This paper proposes a Lagrangian-based safe DRL approach for model predictive control (MPC) of active distribution systems with large-scale integration of PVs, EVs, and energy storage systems (ESSs). A Transformer-LSTM time-series model is proposed to forecast EV charging demand, which is then formulated as a constraint to ensure charging requirements are met. Using this prediction, a Lagrangian-based safe soft actor-critic (SAC) framework is developed for real-time control in a three-phase unbalanced distribution system, enforcing voltage safety constraints while optimizing the cumulative net reward. By integrating the forecasting model with multi-period constraints, the proposed framework jointly coordinates PV systems, EV charging and discharging, and ESS scheduling within the MPC horizon. Numerical experiments on a modified IEEE 123-bus system with real-world data show that, under a high PV penetration scenario, the proposed method increases the net reward by 30.74% and reduces average voltage violations from 0.0011 p.u. to 0.0002 p.u. compared with standard SAC. Compared with the optimal power flow (OPF) approach, it achieves similar voltage security while yielding lower line losses. It also maintains real-time control capability, reducing operation latency to 53.21 ms per 15-minute control interval. The proposed method remains effective under varying PV/EV penetrations and load conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Uniformly decaying subspaces for error-mitigated quantum computation

Here, we present a general condition to obtain subspaces that decay uniformly in a system governed by the Lindblad master equation and use them to perform error-mitigated quantum computation. The expectation values of dynamics encoded in such subspaces are unbiased estimators of noise-free expectation values. In analogy to the decoherence free subspaces which are left invariant by the action of Lindblad operators, we show that the uniformly decaying subspaces are left invariant (up to orthogonal terms) by the action of the dissipative part of the Lindblad equation. We apply our theory to a system of qubits and qudits undergoing relaxation with varying decay rates and show that such subspaces can be used to eliminate bias up to first-order variations in the decay rates without requiring full knowledge of noise. Since such a bias cannot be corrected through standard symmetry verification, our method can improve error mitigation in dual-rail qubits and, given partial knowledge of noise, can perform better than probabilistic error cancellation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

D2NO: Efficient handling of heterogeneous input function spaces with distributed deep neural operators

Neural operators have been applied in various scientific fields, such as solving parametric partial differential equations, dynamical systems with control, and inverse problems. However, challenges arise when dealing with input functions that exhibit heterogeneous properties, requiring multiple sensors to handle functions with minimal regularity. To address this issue, discretization-invariant neural operators have been used, allowing the sampling of diverse input functions with different sensor locations. However, existing frameworks still require an equal number of sensors for all functions. We propose a novel distributed approach to further relax the discretization requirements and solve the heterogeneous dataset challenges. Our method involves partitioning the input function space and processing individual input functions using independent and separate neural networks. A centralized neural network is used to handle shared information across all output functions. This distributed methodology reduces the number of gradient descent back-propagation steps, improving efficiency while maintaining accuracy. Here, we demonstrate that the corresponding neural network is a universal approximator of continuous nonlinear operators and present three numerical examples to validate its performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Level-set topology optimization with PDE generated conformal meshes

This paper presents a level-set topology optimization approach that uses conformal meshes for the analysis of the displacement field. The structure’s boundary is represented by the iso-contour of a level-set field discretized on a fixed background design mesh. The conformal mesh is updated for each design iteration via a PDE based mesh morphing process that identifies the set of facets in the background mesh that are homeomorphic to the boundary and relaxes the homeomorphic mesh to conform to the structure’s boundary and ensure high element quality. The conformal mesh allows for a more accurate computation of the response versus density and some level-set based methods which interpolate material properties using the volume fraction. Numerical examples illustrate the proposed approach by optimizing linear-elastic two- and three-dimensional structures, wherein insight into the performance of the mesh morphing process is provided. The examples also highlight the scalability of the approach.

42 ENGINEERING↗
DOE OSTI2025

Understanding Viscoelasticity of an Entangled Silicone Copolymer via Coarse-Grained Molecular Dynamics Simulations

Entangled dynamics is important for understanding rheological properties of long-chain polymers. For entangled homopolymers, the classic tube-reptation model and its refinements have been successfully applied to quantify properties like diffusion coefficient and zero-rate viscosity. However, the application of such models to copolymers has been limited despite scientific and industrial importance. Here, we study the entangled melt dynamics of poly(dimethyl-co-diphenyl)siloxane random copolymer for a range of mean-composition-ratio ϕ of the diphenyl component via long-term molecular dynamics simulation with a recently developed coarse-grained model. We found that the segmental relaxation is heterogeneous at the monomeric level because of compositional fluctuations. However, at the chain-entanglement level and higher length scales, the viscoelastic response is homogeneous with compositional dependence only through the overall diphenyl fraction ϕ. The relaxation modulus of the entangled copolymer melt conforms to the Likhtman–McLeish model, and the viscosity predicted using our current coarse-grained parameters is in good quantitative agreement with experimental data.

Copolymers↗
DOE OSTI2024

Alternating Direction Decomposition with Strong Bounding and Convexification (ADDSBC) for Solving Security Constrained AC Unit Commitment Problems

This project aims to develop efficient and robust computational methods for solving the security-constrained unit commitment and alternating current optimal power flow problem (SC-UC-ACOPF). The SC-UC-ACOPF problem is at the center of the short-term operation of the U.S. Power Grid. It is solved every week, every day, and every 10 minutes to plan for the optimal action of electricity generation and consumption by minimizing the generation cost and maintaining power system reliability against potential disruptions of equipment failures. In mathematical terms, SC-UC-ACOPF is a challenging large-scale mixed-integer nonlinear optimization model. This means that the decisions involve both discrete variables, e.g. the turning on and off of generators and switching of transmission lines and transformers, and continuous decisions, e.g. the amount of energy generated by each generator and the power flows in the power grid. The physics of the power flow is described by nonlinear equations involving real and reactive power and bus voltages. Another key feature is the large number of contingencies, i.e. the system needs to stay reliable in face of failure of any one equipment, such as transmission lines and generators. The U.S. power grids are extremely complicated and large scale with more than 5,000 generators, 50,000 buses, and 100,000 high-voltage transmission lines, making the SC-UC-ACOPF a very large-scale computation challenge. The research developed in this project aims to solve the SC-UC-ACOPF problems in the three timescales, i.e. weekly, daily, and every 10-min. The proposed computational methods are built on a principled algorithmic approach of decomposition and penalization. More specifically, the algorithm develops spatial and temporal decomposition by exploiting the strong temporal coupling and weak spatial coupling of the UC problem and the complementary feature, i.e. weak temporal coupling and strong spatial coupling of the ACOPF problem. The algorithm also leverages recent progresses in strong convex relaxation of ACOPF. A unique feature of the proposed approach is that it generates a valid, global upper bound on the optimal maximum profit. In this way, a global optimality gap is available to measure the quality of the solution. To further speed up computation, the research team has developed a plethora of effective heuristics to strengthen the iterative penalty-based decomposition framework. For instance, a heuristic is developed to construct inner approximations of the time coupling constraints within the time decoupled problems. Contingencies are pre-screened and low-rank matrix computation is exploited to find the almost unique solution to each contingency. A novel heuristic for line switching is proposed and tested with positive impacts on instances where line switching is beneficial. Taking a systematic approach and carefully handling every detail of the problem pays off. The TIM-GO’s performance throughout the trials and the final event was stellar. TIM-GO garnered the second highest total prize money and is ranked in the top three positions across all categories of comparison.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2026

Quantum utility in simulating the real-time dynamics of the Fermi–Hubbard model using superconducting quantum computers

The Fermi–Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi–Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi–Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi–Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Lastly, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Thermal bootstrap of matrix quantum mechanics

We implement a bootstrap method that combines stationary state conditions, thermal inequalities, and semidefinite relaxations of matrix logarithm in the ungauged one-matrix quantum mechanics, at finite rank N as well as in the large N limit, and determine finite temperature observables that interpolate between available analytic results in the low and high temperature limits respectively. We also obtain bootstrap bounds on thermal phase transition as well as preliminary results in the ungauged two-matrix quantum mechanics.

1/N Expansion↗
DOE OSTI2025

Constraining the phase shift of relativistic species in DESI BAOs

In the early Universe, neutrinos decouple quickly from the primordial plasma and propagate without further interactions. The impact of free-streaming neutrinos is to create a temporal shift in the gravitational potential that impacts the acoustic waves known as baryon acoustic oscillations (BAOs), resulting in a non-linear spatial shift in the Fourier-space BAO signal. In this work, we make use of and extend upon an existing methodology to measure the phase shift amplitude $\beta _{\phi }$ and apply it to the Dark Energy Spectroscopic Instrument (DESI) Data Release 1 (DR1) BAOs with an anisotropic BAO fitting pipeline. We validate the fitting methodology by testing the pipeline with two publicly available fitting codes applied to highly precise cubic box simulations and realistic simulations representative of the DESI DR1 data. We find further study towards the methods used in fitting the BAO signal will be necessary to ensure accurate constraints on $\beta _{\phi }$ in future DESI data releases. Using DESI DR1, we present individual measurements of the anisotropic BAO distortion parameters and the $\beta _{\phi }$ for the different tracers, and additionally a combined fit to $\beta _{\phi }$ resulting in $\beta _{\phi } = 2.7 \pm 1.7$. After including a prior on the distortion parameters from constraints using Planck we find $\beta _{\phi } = 2.7^{+0.60}_{-0.67}$ suggesting $\beta _{\phi } > 0$ at 4.3$\sigma$ significance. This result may hint at a phase shift that is not purely sourced from the standard model expectation for $N_{\rm {eff}}$ or could be a upwards statistical fluctuation in the measured $\beta _{\phi }$; this result relaxes in models with additional freedom beyond Lambda-cold dark matter.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Robust 3D multi-material hydrodynamics using discontinuous Galerkin methods

A high-order discontinuous Galerkin (DG) method is presented for nonequilibrium multi-material (m ≥ 2) flow with sharp interfaces. Material interfaces are reconstructed using the algebraic THINC approach, resulting in a sharp interface resolution. The system assumes stiff velocity relaxation and pressure nonequilibrium. The presented DG method uses Dubiner's orthogonal basis functions on tetrahedral elements. This results in a unique combination of sharp multimaterial interfaces and high-order accurate solutions in smooth single-material regions. A novel shock indicator based on the interface conservation condition is introduced to mark regions with discontinuities. Slope limiting techniques are applied only in these regions so that nonphysical oscillations are eliminated while maintaining high-order accuracy in smooth regions. A local projection is applied on the limited solution to ensure discrete closure law preservation. The effectiveness of this novel limiting strategy is demonstrated for complex three-dimensional multi-material problems, where robustness of the method is critical. The presented numerical problems demonstrate that more accurate and efficient multi-material solutions can be obtained by the DG method, as compared to second-order finite volume methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A spline-based method to obtain spatially dependent viscosity in confined flows

Coupling chemical physics to continuum theories is a critical step to understanding multi-scale phenomena. This paper will connect non-equilibrium molecular dynamics simulations to a continuum-based Navier-Stokes equation that has relaxed the assumption of spatial uniformity in viscosity. Using a form for viscosity based on spline interpolation, viscosity as a function of position is obtained from the least squares fit of the velocity profile measured from molecular simulations of flow in a nanochannel. Viscosity can vary widely, particularly near the channel boundaries, indicating that uniform viscosity is no longer appropriate. Variations of the viscosity near the channel surfaces imply that considering solution and surface chemistry could be necessary to rigorously understand molecular-scale flows in nanochannels.

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

A Performance Portable, Fully Implicit Landau Collision Operator with Batched Linear Solvers

Modern accelerators use hierarchical parallel programming models that enable massive multithreading within a processing element (PE), with multiple PEs per device driven by traditional processes. Batching is a technique for exposing PE-level parallelism in algorithms that have traditionally run on MPI processes or multiple threads within a single process. Opportunities for batching arise in, for example, kinetic discretizations of magnetized plasmas where collisions are advanced in velocity space at each spatial point independently. This paper builds on previous work on a high-performance, fully nonlinear, Landau collision operator by batching the linear solver, as well as batching the spatial point problems and adding new support for multiple grids for multiscale, multispecies problems. An anisotropic relaxation verification test that agrees well with previously published results and analytical models is presented. The performance results from NVIDIA A100 and AMD MI250X nodes are presented with hardware utilization analysis for each architecture. Finally, the entire implicit Landau operator time advance is implemented in Kokkos for performance portability, running entirely on the device and is available in the PETSc numerical library.

97 MATHEMATICS AND COMPUTING↗