Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 199 records · Page 11

Informed Feature Selection for Data Clustering of CSP Plant Production

To make concentrating solar power (CSP) more cost competitive, rigourous optimizations must be run to improve plant design and operations. However, these optimizaitons rely on time consuming annual simulations that solve an electricity dispatch scheduling problem to maximize plant revenue. To reduce the runtime of annual dispatch simulations of CSP plants, a data clustering approach is utilized. This approach assumes that like days of revenue and electricity generation can be identified using weather and price data. Although weather and price are important factors for electricity production, this work investigates how thermal energy storage (TES) inventory at the beginning of a day, denoted as Si, can be used as a supplemental feature to group like days. A framework for creating and training a deep neural network to predict Si is proposed. This model is validated and assessed using eleven sets of testing data that were not used during training. Then, the data clustering approach is performed three seperate times with features of weather and price along with either Si from the neural network, Si from the full annual simulation, or no Si. Ultimately, the results suggest that using Si as an additional clustering feature improves the data clustering simulation accuracy by 1.4%.

Tuman, Matthew J. (ORCID:000900038772051X)↗

Machine Learning–Guided Boolean Matrix Inference for Real-Time O-RAN Conflict Detection

Open Radio Access Networks (O-RAN) are emerging, software-driven cellular architectures that promote flexibility by enabling components from different vendors to interoperate. Multiple control applications called xApps can independently adjust network parameters in near real time, often without awareness of each other's actions. This creates a system highly prone to unintended conflicts and performance degradation due to the inherent complexity of such openness. To model such systems and ultimately prevent or mitigate xApp conflicts, it is essential to understand the dynamic relationships between xApps (A), the control parameters they adjust (P), and the resulting KPI responses (K). While the mappings from A to P and from K to A can often be derived from xApp specifications, the relationship from P to K is typically hidden within the system’s dynamics and must be inferred from observed data. We propose a novel data-driven Boolean inference framework that uncovers the hidden P?K dependencies using machine learning and interpretable rule induction. Continuous parameters and KPIs are first binarized using decision tree classifiers, and a binary influence matrix L is then inferred by solving Boolean matrix equations over time. This compact representation improves interpretability and enables real-time tracking of dynamically evolving parameter-KPI dependencies. We demonstrate the effectiveness of our method in a realistic mobile handover scenario, where it accurately recovers the underlying logic and enables proactive conflict detection.

42 - ENGINEERING↗

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems

Security-constrained unit commitment (SCUC) is a fundamental problem in power systems and electricity markets. In practical settings, SCUC is repeatedly solved via mixed-integer linear programming (MIP), sometimes multiple times per day, with only minor changes in input data. In this work, we propose a number of machine learning techniques to effectively extract information from previously solved instances in order to significantly improve the computational performance of MIP solvers when solving similar instances in the future. Based on statistical data, we predict redundant constraints in the formulation, good initial feasible solutions, and affine subspaces where the optimal solution is likely to lie, leading to a significant reduction in problem size. Computational results on a diverse set of realistic and large-scale instances show that using the proposed techniques, SCUC can be solved on average 4.3 times faster with optimality guarantees and 10.2 times faster without optimality guarantees, with no observed reduction in solution quality. Out-of-distribution experiments provide evidence that the method is somewhat robust against data-set shift. Summary of Contribution. The paper describes a novel computational method, based on a combination of mixed-integer linear programming (MILP) and machine learning (ML), to solve a challenging and fundamental optimization problem in the energy sector. The method advances the state-of-the-art, not only for this particular problem, but also, more generally, in solving discrete optimization problems via ML. We expect that the techniques presented can be readily used by practitioners in the energy sector and adapted, by researchers in other fields, to other challenging operations research problems that are solved routinely.

Machine Learning↗

Optical neural engine for solving scientific partial differential equations

Abstract Solving partial differential equations (PDEs) is the cornerstone of scientific research and development. Data-driven machine learning (ML) approaches are emerging to accelerate time-consuming and computation-intensive numerical simulations of PDEs. Although optical systems offer high-throughput and energy-efficient ML hardware, their demonstration for solving PDEs is limited. Here, we present an optical neural engine (ONE) architecture combining diffractive optical neural networks for Fourier space processing and optical crossbar structures for real space processing to solve time-dependent and time-independent PDEs in diverse disciplines, including Darcy flow equation, the magnetostatic Poisson’s equation in demagnetization, the Navier-Stokes equation in incompressible fluid, Maxwell’s equations in nanophotonic metasurfaces, and coupled PDEs in a multiphysics system. We numerically and experimentally demonstrate the capability of the ONE architecture, which not only leverages the advantages of high-performance dual-space processing for outperforming traditional PDE solvers and being comparable with state-of-the-art ML models but also can be implemented using optical computing hardware with unique features of low-energy and highly parallel constant-time processing irrespective of model scales and real-time reconfigurability for tackling multiple tasks with the same architecture. The demonstrated architecture offers a versatile and powerful platform for large-scale scientific and engineering computations.

Tang, Yingheng (ORCID:0009000153622546)↗

Machine Learning Based Network Parameter Estimation Using AMI Data

The expansion of distribution power system and the growing penetration of distributed energy resources present new challenges for situational awareness. Calibrating the extended system model with sensor measurements and maintaining the usability is critical for utilities. This paper presents a distribution network parameter estimation (DNPE) approach using machine learning (ML) and metering data that improve the quality of extended distribution power system modeling. The reliability model can improve the ability of endpoint data to be translated into network-level situational awareness in real time and help distribution system operators (DSOs) solve branch flow and voltage problems. In addition, a data analytic and automate processing scheme is proposed to improve the sensor data quality and prevent misleading information. The effectiveness of the proposed method is verified with actual advanced metering infrastructure (AMI) data on a real utility feeder model, while considering the higher penetration of photovoltaic power generation. The test of DNPE and study results are demonstrated in this paper.

Parameter estimation, machine learning, power dist↗

Full wave modeling of radio-frequency beams in tokamaks in the electron cyclotron frequency range

Simulation of full wave, without paraxial approximation, high-resolution solution of wave equations in frequency domain in the electron cyclotron resonance (ECR) frequency range for realistic Tokamak plasma parameters became possible by using recently formulated hybrid iterative algorithm [Svidzinski et al., Phys. Plasmas 25, 082509 (2018)] for numerically solving discretized wave equations. This approach combines time evolution and iterative relaxation techniques into iteration cycles. This algorithm is implemented in 2D code FullWave, solving wave equations in Tokamaks in cold and hot plasma models, and it has been tested in 3D full wave iterative RF beams simulation tool, which is presently being developed to model 3D ECRH RF beams in fusion devices using dynamic grid adaptation. The results of 2D full wave modeling, assuming specified toroidal mode number, of ECRH RF beams in DIII-D plasma, performed in the cold and hot plasma models for outboard and top launch scenarios using FullWave are presented. Nonlocal hot plasma response model, based on accurate numerical solution of linearized Vlasov equation, is used to model beam propagation and absorption in the 2nd electron cyclotron harmonic region. Demonstration of capability of the hybrid iterative algorithm to model ECRH RF beams in 3D is made by simulating a substantial part of realistic beam in DIII-D, launched from outboard side of the machine. All relevant physics of RF beam propagation, most of which is not captured in paraxial approximation, such as beam's divergence, interference between the X and O modes in the beam, X-O mode conversion, beam splitting into the X and O mode beams, transformation of beam's cross section, and absorption at the 2nd electron cyclotron harmonic, is captured in the simulations. A numerical technique to find an optimal beam polarization at the launcher to launch a nearly pure X or O mode beam in plasma is developed and tested.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Real time trajectory optimization for hybrid energy management utilizing connected information technologies

The disclosure is directed to solving a full trajectory optimization problem in real-time for a hybrid electric vehicle (HEV) such that future driving conditions and energy usage may be fully considered in determining optimal engine energy usage and battery energy usage in real-time during a trip. An electronic control unit of the HEV may be configured to: receive route information for a route to be driven by the HEV; and after receiving the route information, iterating the operations of: measuring a current state of charge (SOC) of the battery; using at least the measured SOC and an initial co-state value stored in a memory, performing a process to iteratively update the co-state value to obtain an updated co-state value; using at least the updated co-state value, computing an updated control value; and applying the updated control value to control a usage of the battery and the internal combustion engine.

Huang, Mike X.↗

Decomposing a renewable energy design and dispatch model

We address a mixed-integer linear programming model which selects a cost-minimizing set of available technologies with which to design a renewable energy system and prescribe their associated dispatch decisions. Realistically sized instances of such models pose computational challenges. To this end, we develop a Lagrangian heuristic based on a decomposition methodology which partitions the model into blocks and optimizes these more manageable, smaller subproblems. It also provides a lower bound to assess solution quality. In conclusion, we apply this methodology to the National Renewable Energy Laboratory's Renewable Energy Integration and Optimization (REopt TM ) model to generate near-optimal solutions to realistic instances containing, on average, approximately 300,000 variables and at least as many constraints, with a mean 30% optimality gap improvement using a five-minute solution time limit, compared to directly solving the original monolith.

97 MATHEMATICS AND COMPUTING↗

Adaptive workflow for simulation of RF heaters

Accurate RF (Radio Frequency) simulations of fusion systems like ITER require the definition of high-fidelity analysis geometries that include detailed antenna, reactor wall, and physics regions. Here, this paper will describe a workflow for the execution of adaptive high-performance simulations of RF fusion systems. In this workflow, the simulation input consists of a CAD model attributed with the needed analysis attributes. The analysis mesh is automatically generated and the analysis steps are executed using the time-harmonic Maxwell's equations solved using high-order Nédélec finite elements. A patch recovery-based error estimator is used to drive a conforming mesh adaptation procedure.

97 MATHEMATICS AND COMPUTING↗

Benchmarking magnetised three-wave coupling for laser backscattering: analytic solutions and kinetic simulations

Understanding magnetised laser–plasma interactions is important for controlling magneto-inertial fusion experiments and developing magnetically assisted radiation and particle sources. For nanosecond pulses at non-relativistic intensities, interactions are dominated by coherent three-wave interactions, whose nonlinear coupling coefficients became known only recently when waves propagate at oblique angles with the magnetic field. In this paper, backscattering coupling coefficients predicted by warm-fluid theory are benchmarked using particle-in-cell simulations in one spatial dimension, and excellent agreements are found for a wide range of plasma temperatures, magnetic field strengths and laser propagation angles, when the interactions are mediated by electron-dominant hybrid waves. Systematic comparisons between theory and simulations are made possible by a rigorous protocol. On the theory side, the initial boundary value problem of linearised three-wave equations is solved, and the transient-time solutions allow the effects of growth and damping to be distinguished. On the simulation side, parameters are carefully chosen and calibration runs are performed to ensure that comparisons are well controlled. Fitting simulation data to analytical solutions yields numerical growth rates that match theory predictions within error bars. Although warm-fluid theory is found to be valid for a wide parameter range, genuine kinetic effects have also been observed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Efficient Step-Merged Quantum Imaginary Time Evolution Algorithm for Quantum Chemistry

In this work, we develop a resource-efficient step-merged quantum imaginary time evolution approach (smQITE) to solve for the ground state of a Hamiltonian on quantum computers. This heuristic method features a fixed shallow quantum circuit depth along the state evolution path. We use this algorithm to determine the binding energy curves of a set of molecules, including H 2 , H 4 , H 6 , LiH, HF, H 2 O, and BeH 2 , and find highly accurate results. The required quantum resources of smQITE calculations can be further reduced by adopting the circuit form of the variational quantum eigensolver (VQE) technique, such as the unitary coupled cluster ansatz. We demonstrate that smQITE achieves a similar computational accuracy as VQE at the same fixed-circuit ansatz, without requiring a generally complicated high-dimensional nonconvex optimization. Finally, smQITE calculations are carried out on Rigetti quantum processing units, demonstrating that the approach is readily applicable on current noisy intermediate-scale quantum devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Chiral soft algebras for $\mathcal{N}$ = $2$ gauge theory

Some time ago, Seiberg and Witten solved for moduli spaces of vacua parameterized by scalar vacuum expectation values in $\mathcal{N}$ = $2$ gauge theories. More recently, new vacua associated to soft theorems and asymptotic symmetries have been found. Furthermore, this paper takes some first steps towards a complete picture of the infrared geometry of $\mathcal{N}$ = $2$ gauge theory incorporating both of these infrared structures.

N = 2 gauge theory↗

Bringing Trimmed Serendipity Methods to Computational Practice in Firedrake

We present an implementation of the trimmed serendipity finite element family, using the open-source finite element package Firedrake. The new elements can be used seamlessly within the software suite for problems requiring H 1 , H (curl), or H (div)-conforming elements on meshes of squares or cubes. To test how well trimmed serendipity elements perform in comparison to traditional tensor product elements, we perform a sequence of numerical experiments including the primal Poisson, mixed Poisson, and Maxwell cavity eigenvalue problems. Overall, we find that the trimmed serendipity elements converge, as expected, at the same rate as the respective tensor product elements, while being able to offer significant savings in the time or memory required to solve certain problems.

97 MATHEMATICS AND COMPUTING↗

Juqbox.jl

The Juqbox.jl package implements functionality for solving the quantum optimal control problem for realizing logical gates in closed quantum systems. The dynamics of the quantum system is modeled by Schroedinger's equation, which takes to form of a linear system of ordinary differential equations (ODE). Juqbox.jl solves this ODE by numerical time stepping and applies a gradient-based optimization technique to determine control pulses for driving an initial state to a final state, according to the desired logical gate transformation. To evaluate the gradient, Juqbox.jl applies the ``first discretize, then optimize'' approach based on a discrete adjoint time stepping technique. The actual optimization is performed by the open source Ipopt libaray. Juqbox.jl is written in the Julia programming language which, among many other features, provides a convenient interface to the Ipopt library.

PETERSSON, NILSA.↗

Machine-learning-aided cognitive reconfiguration for flexible-bandwidth HPC and data center networks [Invited]

This paper proposes a machine-learning (ML)-aided cognitive approach for effective bandwidth reconfiguration in optically interconnected datacenter/high-performance computing (HPC) systems. The proposed approach relies on a Hyper-X-like architecture augmented with flexible-bandwidth photonic interconnections at large scales using a hierarchical intra/inter-POD photonic switching layout. We first formulate the problem of the connectivity graph and routing scheme optimization as a mixed-integer linear programming model. A two-phase heuristic algorithm and a joint optimization approach are devised to solve the problem with low time complexity. Then, we propose an ML-based end-to-end performance estimator design to assist the network control plane with intelligent decision making for bandwidth reconfiguration. Numerical simulations using traffic distribution profiles extracted from HPC applications traces as well as random traffic matrices verify the accuracy performance of the ML design estimator ( < <#comment/> 9 % <#comment/> error) and demonstrate up to 5 × <#comment/> throughput gain from the proposed approach compared with the baseline Hyper-X network using fixed all-to-all intra/inter-portable data center interconnects.

Chen, Xiaoliang (ORCID:0000000278056237)↗

Optimizing Performance on Trinity Utilizing Machine Learning, Proxy Applications and Scheduling Priorities

The sheer number of nodes continues to increase in today’s supercomputers, the first half of Trinity alone contains more than 9400 compute nodes. Since the speed of today’s clusters are limited by the slowest nodes, it more important than ever to identify slow nodes, improve their performance if it can be done, and assure minimal usage of slower nodes during performance critical runs. This is an ongoing maintenance task that occurs on a regular basis and, therefore, it is important to minimize the impact upon its users by assessing and addressing slow performing nodes and mitigating their consequences while minimizing down time. These issues can be solved, in large part, through a systematic application of fast running hardware assessment tests, the application of Machine Learning, and making use of performance data to increase efficiency of large clusters. Proxy applications utilizing both MPI and OpenMP were developed to produce data as a substitute for long runtime applications to evaluate node performance. Machine learning is applied to identify underperforming nodes, and policies are being discussed to both minimize the impact of underperforming nodes and increase the efficiency of the system. In this paper, I will describe the process used to produce quickly performing proxy tests, consider various methods to isolate the outliers, and produce ordered lists for use in scheduling to accomplish this task.

97 MATHEMATICS AND COMPUTING↗

High-Throughput Field Plant Phenotyping: A Self-Supervised Sequential CNN Method to Segment Overlapping Plants

High-throughput plant phenotyping—the use of imaging and remote sensing to record plant growth dynamics—is becoming more widely used. The first step in this process is typically plant segmentation, which requires a well-labeled training dataset to enable accurate segmentation of overlapping plants. However, preparing such training data is both time and labor intensive. To solve this problem, we propose a plant image processing pipeline using a self-supervised sequential convolutional neural network method for in-field phenotyping systems. This first step uses plant pixels from greenhouse images to segment nonoverlapping in-field plants in an early growth stage and then applies the segmentation results from those early-stage images as training data for the separation of plants at later growth stages. The proposed pipeline is efficient and self-supervising in the sense that no human-labeled data are needed. We then combine this approach with functional principal components analysis to reveal the relationship between the growth dynamics of plants and genotypes. We show that the proposed pipeline can accurately separate the pixels of foreground plants and estimate their heights when foreground and background plants overlap and can thus be used to efficiently assess the impact of treatments and genotypes on plant growth in a field environment by computer vision techniques. This approach should be useful for answering important scientific questions in the area of high-throughput phenotyping.

59 BASIC BIOLOGICAL SCIENCES↗

QES-Plume v1.0: a Lagrangian dispersion model

Low-cost simulations providing accurate predictions of transport of airborne material in urban areas, vegetative canopies, and complex terrain are demanding because of the small-scale heterogeneity of the features influencing the mean flow and turbulence fields. Common models used to predict turbulent transport of passive scalars are based on the Lagrangian stochastic dispersion model. The Quick Environmental Simulation (QES) tool is a low-computational-cost framework developed to provide high-resolution wind and concentration fields in a variety of complex atmospheric-boundary-layer environments. Part of the framework, QES-Plume, is a Lagrangian dispersion code that uses a time-implicit integration scheme to solve the generalized Langevin equations which require mean flow and turbulence fields. Here, QES-Plume is driven by QES-Winds, a 3D fast-response model that computes mass-consistent wind fields around buildings, vegetation, and hills using empirical parameterizations, and QES-Turb, a local-mixing-length turbulence model. In this paper, the particle dispersion model is presented and validated against analytical solutions to examine QES-Plume’s performance under idealized conditions. In particular, QES-Plume is evaluated against a classical Gaussian plume model for an elevated continuous point-source release in uniform flow, the Lagrangian scaling of dispersion in isotropic turbulence, and a non-Gaussian plume model for an elevated continuous point-source release in a power-law boundary-layer flow. In these cases, QES-Plume yields a maximum relative error below 6 % when compared with analytical solutions. In addition, the model is tested against wind-tunnel data for a uniform array of cubical buildings. QES-Plume exhibits good agreement with the experiment with 99 % of matched zeros and 59 % of the predicted concentrations falling within a factor of 2 of the experimental concentrations. Furthermore, results also emphasize the importance of using high-quality turbulence models for particle dispersion in complex environments. Finally, QES-Plume demonstrates excellent computational performance.

58 GEOSCIENCES↗