Search NASA⌕ Search

SEARCH · Search NASA

Results for “solve time”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

AN ALGORITHM FOR RADIATION MAGNETOHYDRODYNAMICS BASED ON SOLVING THE TIME-DEPENDENT TRANSFER EQUATION

We describe a new algorithm for solving the coupled frequency-integrated transfer equation and the equations of magnetohydrodynamics in the regime that light-crossing time is only marginally shorter than dynamical timescales. The transfer equation is solved in the mixed frame, including velocity-dependent source terms accurate to O(v/c). An operator split approach is used to compute the specific intensity along discrete rays, with upwind monotonic interpolation used along each ray to update the transport terms, and implicit methods used to compute the scattering and absorption source terms. Conservative differencing is used for the transport terms, which ensures the specific intensity (as well as energy and momentum) are conserved along each ray to round-off error. The use of implicit methods for the source terms ensures the method is stable even if the source terms are very stiff. To couple the solution of the transfer equation to the MHD algorithms in the ATHENA code, we perform direct quadrature of the specific intensity over angles to compute the energy and momentum source terms. We present the results of a variety of tests of the method, such as calculating the structure of a non-LTE atmosphere, an advective diffusion test, linear wave convergence tests, and the well-known shadow test. We use new semi-analytic solutions for radiation modified shocks to demonstrate the ability of our algorithm to capture the effects of an anisotropic radiation field accurately. Since the method uses explicit differencing of the spatial operators, it shows excellent weak scaling on parallel computers.

79 ASTRONOMY AND ASTROPHYSICS↗

A POD reduced order model for resolving angular direction in neutron/photon transport problems

This article presents the first Reduced Order Model (ROM) that efficiently resolves the angular dimension of the time independent, mono-energetic Boltzmann Transport Equation (BTE). It is based on Proper Orthogonal Decomposition (POD) and uses the method of snapshots to form optimal basis functions for resolving the direction of particle travel in neutron/photon transport problems. A unique element of this work is that the snapshots are formed from the vector of angular coefficients relating to a high resolution expansion of the BTE's angular dimension. In addition, the individual snapshots are not recorded through time, as in standard POD, but instead they are recorded through space. In essence this work swaps the roles of the dimensions space and time in standard POD methods, with angle and space respectively. It is shown here how the POD model can be formed from the POD basis functions in a highly efficient manner. The model is then applied to two radiation problems; one involving the transport of radiation through a shield and the other through an infinite array of pins. Both problems are selected for their complex angular flux solutions in order to provide an appropriate demonstration of the model's capabilities. It is shown that the POD model can resolve these fluxes efficiently and accurately. In comparison to high resolution models this POD model can reduce the size of a problem by up to two orders of magnitude without compromising accuracy. Solving times are also reduced by similar factors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Objective and Efficient Method for Assessing the Impact of Reduced-Precision Calculations On Solution Correctness

Recent studies have shown that reducing the precision of floating-point calculations in an atmospheric model can improve the models' computational performance without affecting model fidelity, but code changes are needed to accommodate lower precision, and a small number of calculations might need to retain higher precision to prevent undue round-off error. For complex and computationally expensive systems like the Energy Exascale Earth System Model (E3SM), a method is needed to objectively assess the quality of the lower-precision simulations and to quickly identify problematic code pieces This paper demonstrates that solution correctness can be evaluated through a simple and quantitative error metric based on time step convergence. The proposed test method can unambiguously detect the accumulation of precision error and objectively assess its impact on solution accuracy. Since fast physical processes are known to affect key features of the multi-year mean climate in an atmospheric model, we show that the convergence test applied to short simulations can provide useful information about the impact of reduced precision on a model’s long-term behavior. In contrast, the traditional way of climate model evaluation requires multi-year simulations and involves inspecting many physical quantities for statistical significance in the presence of natural variability. The simplicity, computational efficiency, and objectivity of the proposed method makes it very attractive for high-resolution model development. The method is also expected to be applicable to other models that numerically solve time evolution equations.

97 MATHEMATICS AND COMPUTING↗

Eastern Renewable Generation Integration Study

The Eastern Interconnection (EI) is one of the largest power systems in the world, and its size and complexity have historically made it difficult to study in high levels of detail in a modeling environment. In order to understand how this system might be impacted by high penetrations (30% of total annual generation) of wind and solar photovoltaic (PV) during steady state operations, the National Renewable Energy Laboratory (NREL) and the U.S. Department of Energy (DOE) conducted the Eastern Renewable Generation Integration Study (ERGIS). This study investigates certain aspects of the reliability and economic efficiency problem faced by power system operators and planners. Specifically, the study models the ability to meet electricity demand at a 5-minute time interval by scheduling resources for known ramping events, while maintaining adequate reserves to meet random variation in supply and demand, and contingency events. To measure the ability to meet these requirements, a unit commitment and economic dispatch (UC&ED) model is employed to simulate power system operations. The economic costs of managing this system are presented using production costs, a traditional UC&ED metric that does not include any consideration of long-term fixed costs. ERGIS simulated one year of power system operations to understand regional and sub-hourly impacts of wind and PV by developing a comprehensive UC&ED model of the EI. In the analysis, it is shown that, under the study assumptions, generation from approximately 400 GW of combined wind and PV capacity can be balanced on the transmission system at a 5-minute level. In order to address the significant computational burdens associated with a model of this detail we apply novel computing techniques to dramatically reduce simulation solve time while simultaneously increasing the resolution and fidelity of the analysis. Our results also indicate that high penetrations of wind and PV (collectively variable generation (VG)), significantly impact the operation of traditional generating resources and cause these resources to be used less frequently and operate across a broader output range because wind and PV have lower operating costs and variable output levels.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Improvement of transport-corrected scattering stability and performance using a Jacobi inscatter algorithm for 2D-MOC

The MPACT code, being developed collaboratively by the University of Michigan and Oak Ridge National Laboratory, is the primary deterministic neutron transport solver being deployed within the Virtual Environment for Reactor Applications (VERA) as part of the Consortium for Advanced Simulation of Light Water Reactors (CASL). In many applications of the MPACT code, transport-corrected scattering has proven to be an obstacle in terms of stability, and considerable effort has been made to try to resolve the convergence issues that arise from it. Most of the convergence problems seem related to the transport-corrected cross sections, particularly when used in the 2D method of characteristics (MOC) solver, which is the focus of this work. Here in this paper, the stability and performance of the 2-D MOC solver in MPACT is evaluated for two iteration schemes: Gauss-Seidel and Jacobi. With the Gauss-Seidel approach, as the MOC solver loops over groups, it uses the flux solution from the previous group to construct the inscatter source for the next group. Alternatively, the Jacobi approach uses only the fluxes from the previous outer iteration to determine the inscatter source for each group. Consequently for the Jacobi iteration, the loop over groups can be moved from the outermost loop$-$as is the case with the Gauss-Seidel sweeper$-$to the innermost loop, allowing for a substantial increase in efficiency by minimizing the overhead of retrieving segment, region, and surface index information from the ray tracing data. Several test problems are assessed: (1) Babcock & Wilcox 1810 Core I, (2) Dimple S01A-Sq, (3) VERA Progression Problem 5a, and (4) VERA Problem 2a. The Jacobi iteration exhibits better stability than Gauss-Seidel, allowing for converged solutions to be obtained over a much wider range of iteration control parameters. Additionally, the MOC solve time with the Jacobi approach is roughly 2.0-2.5× faster per sweep. While the performance and stability of the Jacobi iteration are substantially improved compared to the Gauss-Seidel iteration, it does yield a roughly 8$-$10% increase in the overall memory requirement.

97 MATHEMATICS AND COMPUTING↗

Optimization strategies for produced water networks with integrated desalination facilities

Optimal management and desalination of produced water is a major challenge for U.S. oil and gas development. Integrating rigorous desalination models into multi-period produced water network optimization problems presents several hurdles, which need to be tackled using advanced optimization strategies. Here, in this work, a novel multi-period produced water network formulation with separate solid and liquid flows is introduced to avoid singularities at zero flows. Rigorous steady state desalination models based on mechanical vapor recompression are embedded at the desalination sites in the network model. An integrated optimization formulation is developed to co-optimize the design of desalination units along with the operation of the network. Furthermore, a more robust approach based on the trust region filter method is developed to efficiently integrate complex desalination models into the multi-period planning problem. Both optimization approaches are demonstrated on a produced water network from the PARETO library (Drouven et al., 2022) using thermal desalination units. Our results show that while the TRF and integrated approaches have comparable solve times, the TRF approach has better performance reliability in terms of solver convergence. Furthermore, the optimal solution obtained by embedding rigorous models into the network is significantly different than when desalination costs are approximated using simple cost models, which motivates further research in this field.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On the scalability of the Albany/FELIX first-order Stokes approximation ice sheet solver for large-scale simulations of the Greenland and Antarctic ice sheets

We examine the scalability of the recently developed Albany/FELIX finite-element based code for the first-order Stokes momentum balance equations for ice flow. We focus our analysis on the performance of two possible preconditioners for the iterative solution of the sparse linear systems that arise from the discretization of the governing equations: (1) a preconditioner based on the incomplete LU (ILU) factorization, and (2) a recently-developed algebraic multigrid (AMG) preconditioner, constructed using the idea of semi-coarsening. A strong scalability study on a realistic, high resolution Greenland ice sheet problem reveals that, for a given number of processor cores, the AMG preconditioner results in faster linear solve times but the ILU preconditioner exhibits better scalability. A weak scalability study is performed on a realistic, moderate resolution Antarctic ice sheet problem, a substantial fraction of which contains floating ice shelves, making it fundamentally different from the Greenland ice sheet problem. Here, we show that as the problem size increases, the performance of the ILU preconditioner deteriorates whereas the AMG preconditioner maintains scalability. This is because the linear systems are extremely ill-conditioned in the presence of floating ice shelves, and the ill-conditioning has a greater negative effect on the ILU preconditioner than on the AMG preconditioner.

54 ENVIRONMENTAL SCIENCES↗

Benders Decomposition Using Graph Modeling and Multi-Parametric Programming

Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose a flexible and modular algorithmic framework for accelerating Benders decomposition. Specifically, we express the problem structure by using a graph-theoretic modeling abstraction in which nodes represent optimization subproblems and edges represent connectivity between subproblems. A key innovation of our approach is that we embed multiparametric programming (mp) surrogates for node subproblems, which maps the exact analytical map of the subproblem solution space. The use of mp surrogates allows us to replace subproblem solves with fast look-ups and function evaluations for primal and dual variables during the iterative Benders process. We formally show the equivalence between classical Benders cuts and those derived from the mp solution. We implement our framework in the open-source PlasmoBenders.jl software package. To demonstrate the capabilities of the proposed framework, we apply it to a two-stage stochastic programming problem, which aims to make optimal capacity expansion decisions under market uncertainty. We evaluate both single-cut and multicut variants of Benders decomposition and show that the use of mp surrogates achieves substantial speedups in subproblem solve time, while preserving the convergence guarantees of Benders decomposition. We highlight advantages in solution analysis and interpretability that is enabled by mp critical region tracking; specifically, we show that these reveal how decisions evolve geometrically across the Benders search. Our results aim to demonstrate that combining surrogate modeling with graph modeling offers a promising and extensible foundation for structure-exploiting decomposition. In addition, by decomposing the problem into more tractable subproblems, the proposed approach also aims to overcome scalability issues of mp. Finally, the use of mp surrogates provides a unifying and modular optimization framework that enables the representation of heterogeneous node subproblems as modeling objects with a homogeneous structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Molecular photoelectron angular distribution rotations in multi-photon resonant ionization of H{sub 2}{sup +} by circularly polarized ultraviolet laser pulses

We study effects of pulse durations on molecular photoelectron angular distributions (MPADs) in ultrafast circular polarization ultraviolet resonant ionization processes. Simulations performed on aligned H{sub 2}{sup +} by numerically solving time dependent Schrödinger equations show rotations of MPADs with respect to the molecular symmetry axes. It is found that in multi-photon resonant ionization processes, rotation angles are sensitive to pulse durations, which we attribute to the coherent resonant excitation between the ground state and the intermediate excited electronic state induced by Rabi oscillations. Multi-photon nonresonant and single photon ionization processes are simulated and compared which exhibit a constant rotation angle. An asymmetry parameter is introduced to describe the pulse duration sensitivity by perturbation theory models. Influence of pulse frequency detunings on MPADs is also investigated where oscillations of rotations are absent at long pulse durations due to nonresonance excitation.

74 ATOMIC AND MOLECULAR PHYSICS↗

Feasibility Study on Implementing a Staggered-Grid Finite Volume Method for System Analysis Code Development Under the MOOSE Framework

Here, this work summarizes a feasibility study on testing numerical algorithms that are suitable and efficient for advanced system analysis code development under the mutli-physics framework, MOOSE. The key to the test bed is the implementation of high-order one-dimensional staggered-grid finite volume method (SG-FVM), and its direct interaction with the linear/nonlinear solver, PETSc. The test bed utilized a more flexible code structure to enable the finite volume method implementation and direct interacting with the solver package, instead of using the natively supported finite element method by the framework. Using a suite of selected test problems with different problem sizes and levels of complexity, the implemented SG-FVM demonstrated superior performance improvement against a direct finite element method implementation through MOOSE. On two computer systems, the speedup was observed to be significant, with at least one order of magnitude of solving time reduction. For a complex reactor model, transient simulation was performed using the newly developed finite volume method code, the results of which agree very well with the reference results from the finite element method code. Overall, this study demonstrates a successful feasibility study on the proposed numerical algorithms and software structure to support advanced system analysis tool development.

MOOSE↗

Photochemically induced acousto-optics in gases

Acousto-optics consists of launching acoustic waves in a medium (usually a crystal) in order to modulate its refractive index and create a tunable optical grating. Here, in this article, we present the theoretical basis of an alternative scheme to generate acousto-optics in a gas, where the acoustic waves are initiated by the localized absorption (and thus gas heating) of spatially modulated UV light, as was demonstrated by Michine and Yoneda [Commun. Phys. 3, 24 (2020)]. We identify the chemical reactions initiated by the absorption of UV light via the photodissociation of ozone molecules present in the gas, and calculate the resulting temperature increase in the gas as a function of space and time. Solving the Euler fluid equations shows that the modulated, isochoric heating initiates a mixed acoustic-entropy wave in the gas, whose high-amplitude density (and thus refractive index) modulation can be used to manipulate a high-power laser. We calculate that diffraction efficiencies near 100% can be obtained using only a few millimeters of gas containing a few percent ozone fraction at room temperature, with UV fluences of less than 100 mJ/cm 2 —consistent with the experimental measurements. Our analysis suggests possible ways to optimize the diffraction efficiency by changing the buffer gas composition. Gases have optics damage thresholds 2–3 orders of magnitude beyond those of solids; these optical elements should therefore be able to manipulate kilojoule-class lasers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Tachyacoustic cosmology: An alternative to inflation

We consider an alternative to inflation for the generation of superhorizon perturbations in the Universe in which the speed of sound is faster than the speed of light. We label such cosmologies, first proposed by Armendariz-Picon, tachyacoustic, and explicitly construct examples of noncanonical Lagrangians which have superluminal sound speed, but which are causally self-consistent. Such models possess two horizons, a Hubble horizon and an acoustic horizon, which have independent dynamics. Even in a decelerating (noninflationary) background, a nearly scale-invariant spectrum of perturbations can be generated by quantum perturbations redshifted outside of a shrinking acoustic horizon. The acoustic horizon can be large or even infinite at early times, solving the cosmological horizon problem without inflation. These models do not, however, dynamically solve the cosmological flatness problem, which must be imposed as a boundary condition. Gravitational wave modes, which are produced by quantum fluctuations exiting the Hubble horizon, are not produced.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Neutrino dark energy with more than one neutrino species

The mass varying neutrino scenario is a model that successfully explains the origin of dark energy while at the same time solves the coincidence problem. The model is, however, heavily constrained by its stability towards the formation of neutrino bound states when the neutrinos become nonrelativistic. We discuss these constraints and find that natural, adiabatic, stable models with the right amount of dark energy today do not exist. Second, we explain why using the lightest neutrino, which is still relativistic, as an explanation for dark energy does not work because of a feedback mechanism from the heavier neutrinos.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

AMG Preconditioners based on parallel hybrid coarsening and multi-objective graph matching

We describe preliminary results from a multi-objective graph matching algorithm, in the coarsening step of an aggregation-based Algebraic MultiGrid (AMG) preconditioner, for solving large and sparse linear systems of equations on high-end parallel computers. We have two objectives. First, we wish to improve the convergence behavior of the AMG method when applied to highly anisotropic problems. Second, we wish to extend the parallel package \texttt{PSCToolkit} to exploit multi-threaded parallelism at the node level on multi-core processors. Our matching proposal balances the need to simultaneously compute high weights and large cardinalities by a new formulation of the weighted matching problem combining both these objectives using a parameter $\lambda$. We compute the matching by a parallel $2/3-\varepsilon$-approximation algorithm for maximum weight matchings. Results with the new matching algorithm show that for a suitable choice of the parameter $\lambda$ we compute effective preconditioners in the presence of anisotropy, i.e., smaller solve times, setup times, iterations counts, and operator complexity.

D'Ambra, Pasqua↗

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)↗

Applications of Lifted Nonlinear Cuts to Convex Relaxations of the AC Power Flow Equations

Here, we demonstrate that valid inequalities, or lifted nonlinear cuts (LNC), can be projected to tighten the Second Order Cone (SOC), Convex DistFlow (CDF), and Network Flow (NF) relaxations of the AC Optimal Power Flow (AC-OPF) problem. We conduct experiments on 38 cases from the PGLib-OPF library, showing that the LNC strengthen the SOC and CDF relaxations in 100% of the test cases, with average and maximum differences in the optimality gaps of 6.2% and 17.5% respectively. The NF relaxation is strengthened in 46.2% of test cases, with average and maximum differences in the optimality gaps of 1.3% and 17.3% respectively. We also study the trade-off between relaxation quality and solve time, demonstrating that the strengthened CDF relaxation outperforms the strengthened SOC formulation in terms of runtime and number of iterations needed, while the strengthened NF formulation is the most scalable with the lowest relaxation quality improvement due to these LNC.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Reducing Parallel Communication in Algebraic Multigrid through Sparsification

Algebraic multigrid (AMG) is an $\mathcal{O}(n)$ solution process for many large sparse linear systems. A hierarchy of progressively coarser grids which utilize complementary relaxation and interpolation operators is constructed. High-energy error is reduced by relaxation, while low-energy error is mapped to coarse-grid matrices and reduced there. However, large parallel communication costs often limit parallel scalability. Furthermore, as the multigrid hierarchy is formed, each coarse matrix is formed through a triple matrix product. The resulting coarse grids often have significantly more nonzeros per row than the original fine-grid operator, thereby generating high parallel communication costs associated with sparse matrix-vector multiplication (SpMV) on coarse levels. In this paper, we introduce a method that systematically removes entries in coarse-grid matrices after the hierarchy is formed, leading to improved communication costs. We sparsify by removing weakly connected or unimportant entries in the matrix, leading to improved solve time. The main trade-off is that if the heuristic identifying unimportant entries is used too aggressively, then AMG convergence can suffer. To counteract this, the original hierarchy is retained, allowing entries to be reintroduced into the solver hierarchy if convergence is too slow. This enables a balance between communication cost and convergence, as necessary. In this paper we present new algorithms for reducing communication and present a number of computational experiments in support.

97 MATHEMATICS AND COMPUTING↗