Search NASA⌕ Search

SEARCH · Search NASA

Results for “solving”

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

Impacts of Spatial Resolution in a High-Fidelity Capacity Expansion Model: An ERCOT Case Study

Capacity expansion models are important tools in examining the evolution of the electric power sector. Embedded in these tools are many modeling choices with consequential impacts on computational burden and associated analysis. In this study, we adjust the spatial resolution of the Regional Energy Deployment System (ReEDS) to understand the implications of higher-fidelity modeling on energy system projections and model solve times. The native ReEDS regions capture the contiguous United States in 134 balancing areas whereas the regions in the higher-resolution version are defined by over 3,000 U.S. counties. Using both resolutions, we conduct a case study of the Texas Interconnection (The Electric Reliability Council of Texas [ERCOT]) to explore differences in model projections and to inform appropriate applications of high spatial resolution in a large-scale, applied capacity expansion model.

county↗
DOE OSTI2024

Preventive Power Outage Estimation Based on a Novel Scenario Clustering Strategy

The increasing occurrence of extreme weather events is challenging power grid operation. For extreme weather events, the system operator is responsible for estimating the power outages and scheduling the restoration resources. This paper proposes an outage evaluation framework to identify the possible unserved load profiles, vulnerable areas, and mobile energy adequacy. The outputs of an outage prediction model tool are used to generate numerous faulted line scenarios. Next, each scenario's nodal unserved load profile is obtained by solving a three-phase restoration model that considers repair crews and mobile energy resources (MERs). Then, a novel scenario clustering strategy is developed to cluster the unserved load profiles into multiple representative profiles which the system operator can focus on. Finally, case studies on a distribution system evaluate the damage caused by an extreme weather event and verify the effectiveness of the proposed scenario clustering strategy.

MATHEMATICS AND COMPUTING,POWER TRANSMISSION AND D↗
DOE OSTI2024

Fast Iterative Multi-site Hosting Capacity Analysis for Distribution Systems With Search Space Pruning

Interconnection studies for distributed energy resources (DERs) is a time-intensive process, primarily due to the necessity of solving large number of power flow scenarios. Hosting capacity analysis (HCA) is a time-consuming aspect of interconnection studies that is divided into single-site HCA (SHCA) and multi-site HCA (MHCA). From a computational and understandable standpoint, the industry seeks iteration-based solutions for SHCA, although it doesn't maximize the total DER hosting capacity (DERHC) of the grid, as MHCA does. While non-iterative solutions are available for MHCA, they involve a trade-off between the modeling accuracy of the distribution system, solution quality, and ease of understanding. In this work, we present a fast iterative solution for MHCA, reducing computational complexity by eliminating the need to solve power flows for a large amount of search space, thus making iterative solutions feasible. This iterative approach guarantees both a global optimal solution with sufficient time and a fast, close-to-optimal solution through efficient search space pruning. It also easily integrates with existing utility HCA tools. The results are demonstrated on select locations in the IEEE-123 bus system for community-scale interconnection studies. We highlight the benefits of skipping the need to solve millions of power flows, all while maximizing the grid's total DERHC.

Guddanti, Kishan Prudhvi↗
DOE OSTI2025

Simulations of Quantum Approximate Optimization Algorithm on HPC-QC Integrated Systems

The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising tool for accelerating optimization processes in the Noisy Intermediate-Scale Quantum (NISQ) era. Compared to classical methods, QAOA efficiently solves optimization problems, often formulated as Quadratic Unconstrained Binary Optimization (QUBO) problems. Classical quantum simulators are crucial for evaluating quantum algorithms due to limited quantum resources. However, QAOA's performance can vary with different simulation methods. This study analyzes QAOA's performance using various quantum simulators (e.g., density _matrix, statevector, and matrix_product_state) and demonstrates the benefits of HPC-QC integrated systems in solving QUBO problems on an active learning workflow. By simulating QAOA on dense, large-matrix QUBO problems, we evaluate accuracy and problem-solving time. We also assess QAOA's performance on local computers and HPC-QC inte-grated systems, using Oak Ridge Leadership Computing Facility (OLCF)'s Frontier supercomputer with local Qiskit Aer and remote IBM Quantum simulators.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗
DOE OSTI2024

Robust Iterative Method for Symmetric Quantum Signal Processing in All Parameter Regimes

Here, this paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing target polynomials as products of matrices in SU(2) that possess symmetry properties. We present a novel Newton’s method tailored for efficiently solving the nonlinear system involved in determining the phase factors within the symmetric QSP framework. Our method demonstrates rapid and robust convergence in all parameter regimes, including the challenging scenario with ill-conditioned Jacobian matrices, using standard double precision arithmetic operations. For instance, solving symmetric QSP for a highly oscillatory target function α cos(1000x) (polynomial degree ≈ 1433) takes 6 iterations to converge to machine precision when α = 0.9, and the number of iterations only increases to 18 iterations when α = 1 – 10 -9 with a highly ill-conditioned Jacobian matrix. Leveraging the matrix product state structure of symmetric QSP, the computation of the Jacobian matrix incurs a computational cost comparable to a single function evaluation. Moreover, we introduce a reformulation of symmetric QSP using real-number arithmetics, further enhancing the method’s efficiency. Extensive numerical tests validate the effectiveness and robustness of our approach, which has been implemented in the QSPPACK software package.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

An Optimization-Based Coupling of Reduced Order Models with an Efficient Reduced Adjoint Basis Generation Approach

Optimization-based coupling (OBC) is an attractive alternative to traditional Lagrange multiplier approaches in multiple modeling and simulation contexts. However, application of OBC to time-dependent problems has been hindered by the computational cost of finding the stationary points of the associated Lagrangian, which requires primal and adjoint solves. This issue can be mitigated by using OBC in conjunction with computationally efficient reduced order models (ROMs). To demonstrate the potential of this combination, in this paper, we develop an optimization-based ROM-ROM coupling for a transient advection-diffusion transmission problem. We pursue the “optimize-then-reduce” path toward solving the minimization problem at each time step and solve reduced space adjoint system of equations, where the main challenge in this formulation is the generation of adjoint snapshots and reduced bases for the adjoint systems required by the optimizer. One of the main contributions of the paper is a new technique for an efficient adjoint snapshot collection for gradient-based optimizers in the context of optimization-based ROM-ROM couplings. In conclusion, we present numerical studies demonstrating the accuracy of the approach along with comparison between various approaches for selecting a reduced order basis for the adjoint systems, including decay of snapshot energy, average iteration counts, and timings.

coupled problems↗
DOE OSTI2024

NeuroFEM

SAND2025-00525O NeuroFEM is a software tool that demonstrates a neuromorphic algorithm for solving finite element problems. It sets up a 2D finite element problem for the Poisson equation on a disk, constructs synaptic matrices, and simulates neural dynamics to solve the resulting sparse linear system. The software illustrates how the algorithm converges to the solution and plots the results, showcasing a neuromorphic counterpart to traditional methods like Conjugate Gradient or GMRES. This tool is designed to highlight the potential of neuromorphic algorithms for solving sparse linear systems, which are prevalent in various computational applications. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗
DOE OSTI2025

Self-Consistent Relativistic Electron Scattering using the Sherlock Scattering Model for X-ray Diagnostics

We present on a new, self-consistent, arbitrary-temperature Romberg integration scheme for modeling electron scattering in materials in a LANL Lagrangian Shock Hydro (LSH) code. Electron beam-target interactions are fundamental to a wide range of scientific and technological applications. When high-energy electron beams hit their target, they may scatter, deposit energy, or ionize the source. These processes govern the behavior and outcomes in nanotechnology manufacturing, electron microscopy, and modern X-ray diagnostics. Simulating these interactions is essential for interpreting experimental results, predicting material responses, and designing efficient tools and experiments. At Los Alamos, this is done using a LSH code, which is a multi-dimension, multi-material, massively parallel, multi-physics code used to simulate applications from asteroid impacts to electron beam interactions. By effectively and efficiently modeling the way that electrons scatter from the beam we can bolster these simulations and more accurately predict experimental outcomes. The model currently implemented in the LSH of interest is based on work by Papp and does not self-consistently preserve momentum in the slightly relativistic regime; here we adopt a model proposed by Braams and Karney and implement a Romberg integration scheme to compute the diffusion tensor. In this paper we will provide background on the Braams-Karney diffusion tensor as well as the Romberg integration scheme we employed to numerically solve for it. We will show that our integration scheme is accurate in solving for the set of scalar potentials used to re-express the diffusion tensor in differential form, and in solving for the diffusion coefficients in the larger LSH code. By using this diffusion tensor rather than the existing Papp one, and numerically integrating it with a Romberg method, we produce much more accurate, self-consistent results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Frontal Slice Approaches for Tensor Linear Systems

Inspired by the row and column action methods for solving large-scale linear systems, in this work, we explore the use of frontal slices for solving tensor linear systems. In particular, this paper presents a novel approach for using frontal slices of a tensor $\mathcal{A}$ to solve tensor linear systems $\mathcal{A} ∗\mathcal{X} = \mathcal{B}$ where ∗ denotes the $t$-product. In addition, we consider variations of this method, including cyclic, block, and randomized approaches, each designed to optimize performance in different operational contexts. Our primary contribution lies in the development and convergence analysis of these methods. Experimental results on synthetically generated and real-world data, including applications such as image and video deblurring, demonstrate the efficacy of our proposed approaches and validate our theoretical findings.

Luo, Hengrui↗
DOE OSTI2026

Convergence Criteria for Multiphysics Simulations

The behavior of engineered systems is often influenced by multiple physical phenomena, such as mechanical deformation, heat transfer, and chemical species transport and reactions. There are often strong interactions between these phenomena, and there is increasing interest in applying coupled-physics models to improve understanding of physical behavior under complex environmental conditions. Multiple simulation frameworks that facilitate coupled-physics simulations are in widespread use, and these employ a variety of techniques to account for interactions between those physics. Many frameworks solve the physics models independently and transfer results between them. Alternatively, a single monolithic system of equations for every physics model can be formed and solved. Each of these approaches has its benefits and drawbacks, and the optimal approach varies depending on the nature of the problem. The open-source MOOSE framework was developed targeting solution of large-scale multiphysics problems. Although it provides options for all these coupling approaches, its standard approach for multiphysics solutions is to form and solve a single monolithic system of equations containing the unknowns for all physics models. MOOSE provides a streamlined approach for users to define the solution variables, the terms in the partial differential equations pertaining to each variable, and interactions between solution variables. One aspect of the monolithic solution approach that can be problematic, however, is defining appropriate convergence criteria for the nonlinear system. A standard approach is to determine convergence is to simply take a norm of the residual vector corresponding to the full vector of unknowns. However, if the residual vector contains variables for multiple physics models, the magnitudes of those variables can differ significantly, and the variables can converge at significantly different rates from each other. It is important to ensure that the variables for each of the physics are converged, and also ensure that the convergence criteria are not excessively stringent in cases when there is little change in the solution. This talk presents representative multiphysics problems to highlight these issues, and shows strategies for convergence criteria in MOOSE that are robust for multiphysics models under a variety of conditions.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

SAGIPS: a physics-inspired scalable asynchronous generative inverse-problem solver

Abstract Solving large-scale inverse problems using deep-learning algorithms have become an essential part of modern research and industrial applications. The complexity of the underlying inverse problem may require the utilization of high performance computing systems which poses a challenge on the algorithmic design of the inverse problem solver. Most deep learning algorithms require, due to their design, custom parallelization techniques in order to be resource efficient while showing a reasonable convergence. In this paper we introduce a S calable A synchronous G enerative I nverse P roblem S olver (SAGIPS) on high-performance computing systems. We present a workflow that utilizes an asynchronous ring-allreduce algorithm to transfer the gradients of the generator network across multiple GPUs. Experiments with a scientific proxy application demonstrate that SAGIPS shows near linear weak scaling, together with a convergence quality that is comparable to traditional methods. The approach presented here allows leveraging Generative Adverserial Network across multiple GPUs, promising advancements in solving complex inverse problems at scale.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Ligand‐Mediated Quantum Yield Enhancement in 1‐D Silver Organothiolate Metal–Organic Chalcogenolates

X-ray free electron laser (XFEL) microcrystallography and synchrotron single-crystal crystallography are used to evaluate the role of organic substituent position on the optoelectronic properties of metal–organic chalcogenolates (MOChas). MOChas are crystalline 1D and 2D semiconducting hybrid materials that have varying optoelectronic properties depending on composition, topology, and structure. While MOChas have attracted much interest, small crystal sizes impede routine crystal structure determination. A series of constitutional isomers where the aryl thiol is functionalized by either methoxy or methyl ester are solved by small molecule serial femtosecond X-ray crystallography (smSFX) and single crystal rotational crystallography. While all the methoxy examples have a low quantum yield (0-1%), the methyl ester in the ortho position yields a high quantum yield of 22%. Here, the proximity of the oxygen atoms to the silver inorganic core correlates to a considerable enhancement of quantum yield. Four crystal structures are solved at a resolution range of 0.8–1.0 Å revealing a collapse of the 2D topology for functional groups in the 2- and 3- positions, resulting in needle-like crystals. Further analysis using density functional theory (DFT) and many-body perturbation theory (MBPT) enables the exploration of complex excitonic phenomena within easily prepared material systems.

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

Lepton flavor asymmetries: from the early Universe to BBN

Large primordial lepton flavor asymmetries with almost vanishing total baryon-minus-lepton number can evade the usual BBN and CMB constraints if neutrino oscillations lead to perfect flavor equilibration. Solving the momentum averaged quantum kinetic equations (QKEs) describing neutrino oscillations and interactions, we perform the first systematic investigation of this scenario, uncovering a rich flavor structure in stark contradiction to the assumption of simple flavor equilibration. We find (i) a particular direction in flavor space, ∆ne ≃ – 2/3 (– 1)∆n μ for normal (inverted) neutrino mass hierarchy, in which the flavor equilibration is efficient and primordial asymmetries are essentially unconstrained, (ii) a minimal washout factor, ∆$n_{e}^{2}$| BBN ≤ 0.03 (0.016) ∑ α ∆$n_{α}^{2}$| ini yielding a conservative estimate for the allowed primordial asymmetries in a generic flavor direction, and (iii) particularly strong or weak washout if one of the initial flavor asymmetries vanishes due to non-adiabatic muon- or electron-driven MSW transitions. These results open up the possibility of a first-order QCD phase transition facilitated by large lepton asymmetries as well as baryogenesis from large and compensated ∆n e = ∆n μ asymmetries. Our systematic approach of deriving momentum averaged QKEs includes collision terms beyond the damping approximation, energy transfer between the neutrino and electron-photon plasma, and provides a fast and reliable way to investigate the impact of primordial lepton asymmetries at the time of BBN. We publicly release the Mathematica code COFLASY-M on https://github.com/mariofnavarro/COFLASY which solves the QKEs numerically.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Analytic bounds on late-time axion-scalar cosmologies

The cosmological dynamics of multiple scalar/pseudoscalar fields are difficult to solve, especially when the field-space metric is curved. This presents a challenge in determining whether a given model can support cosmic acceleration, without solving for the on-shell solution. In this work, we present bounds on late-time FLRW-cosmologies in classes of theories that involve arbitrary numbers of scalar and pseudoscalar fields coupled both kinetically (leading to a curved field space metric) and through scalar potentials. Such bounds are proven analytically, independently of initial conditions, with no approximation in the field equations and without referring to explicit solutions. Besides their broad applications to cosmological model building, our bounds can be applied to studying asymptotic cosmologies of certain classes of string compactifications.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Toward real-time optimization through model reduction and model discrepancy sensitivities

Optimization problems arise in a range of scenarios, from optimal control to model parameter estimation. In many applications, such as the development of digital twins, it is essential to solve these optimization problems within wall-clock-time limitations. However, this is often unattainable for complex systems, such as those modeled by nonlinear partial differential equations. One strategy for mitigating this issue is to construct a reduced-order model (ROM) that enables more rapid optimization. In particular, the use of nonintrusive ROMs—those that do not require access to the full-order model at evaluation time—is popular because they facilitate the computation of optimization solutions within the wall-clock time requirements. However, the optimization solution will be unreliable if the iterates move outside the ROM training data. This article proposes the use of hyper-differential sensitivity analysis with respect to model discrepancy (HDSA-MD) as a computationally efficient tool to augment ROM-constrained optimization and improve its reliability. The proposed approach consists of two phases: (i) an offline phase where several full-order model evaluations are computed to train the ROM, and (ii) an online phase where a ROM-constrained optimization problem is solved, a limited number of full-order model evaluations are computed, and HDSA-MD is used to enhance the optimization solution. Numerical results are demonstrated for two examples, atmospheric contaminant control and wildfire ignition location estimation, in which a ROM is trained offline using inaccurate atmospheric data. In conclusion, the HDSA-MD update yields a significant improvement in the ROM-constrained optimization solution using only one full-order model evaluation online with corrected atmospheric data.

PDE-constrained optimization↗
DOE OSTI2025

Quantum Algorithm for Linear Non-unitary Dynamics with Near-Optimal Dependence on All Parameters

We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.

Applied Dynamical Systems↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗