Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iteration method”

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 469 records · Page 26

The 23rd National School on Neutron & X-Ray Scattering 2021—Virtual School with Remote Experiments

The National School on Neutron and X-ray Scattering (NXS) has been a yearly “institution” for North American graduate students interested in neutron and X-ray scattering since its inception 23 years ago. For the second year in a row, it was forced to go virtual. Nevertheless, the aim was to include user experiments and maximize interactions in this second virtual iteration rather than simply repeat the lecture series of the first virtual iteration. In this paper, we share our newly adopted methods and experiences.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Robust Scheduling of Microgrids Considering Unintentional Islanding Conditions

This paper proposes a robust scheduling model for microgrids considering the stochastic unintentional islanding conditions. The proposed model minimizes the total operating cost of the microgrid by efficiently coordinating the supply of power from local distributed energy resources and the main grid. To capture the prevailing uncertainties in renewable generation and demand as well as unintentional islanding conditions, a two-stage adaptive robust optimization model is formulated to minimize the total operating cost under the worst realization of the modeled uncertainties. The column and constraint generation (C&CG) method is used to solve the problem in an iterative manner. The solution of the proposed scheduling model ensures robust microgrid operation in consideration of all possible realization of renewable generation, demand and unintentional islanding condition. Numerical simulations on a microgrid consisting of a wind turbine, a PV panel, a fuel cell, two micro-turbines, a diesel generator and a battery demonstrate the effectiveness of the proposed approach.

Liu, Guodong↗

Dynamic Parameter Estimation with Physics-based Neural Ordinary Differential Equations

Accurate estimation of dynamic parameters of gen-erators is crucial to building a reliable model for dynamical studies and reliable operation of the power system. This paper develops a physics-based neural ordinary differential equations (ODE) approach to learn the parameters of generator dynamic model using phasor measurement units (PMU) data. We design a physics-based neural network to represent the swing equations of the power system dynamics. A loss function is defined as the difference between dynamic simulation results from the physics-based neural networks and pseudo PMU measurements. The parameters of generator dynamic model are iteratively updated using the neural ODEs and the adjoint method. By exploiting the mini-batch scheme in neural ODE training, the parameter estimation performance is significantly improved. Numerical study results on a 3-machine 9-bus system show that the proposed algorithm outperforms state-of-the-art baseline method in both computation time and dynamic parameter estimation accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Constructing approximately diagonal quantum gates

We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are conjectured to converge to diagonal gates doubly exponentially fast and are verified for small integers. We systemically study this conjecture and prove several important partial results. Some techniques are developed to pave the way for a final resolution of the conjecture. The sequences provided here have applications in quantum search algorithms, quantum circuit compilation, generation of leakage-free entangled gates in topological quantum computing, etc.

Computer Science↗

Multi-Rigor Agile Verification and Rapid Prototyping for Formally Verified Software

We propose a novel approach to developing formally verified systems through Multi-rigor Agile Verification. Multi-rigor Agile Verification is rooted in the hypothesis of Rigor Independence, that a system’s specification and verification architecture depend primarily on the system requirements to be verified, and they depend very little on the rigor level of the methods used to verify those requirements. Due to its iterative nature, Multi-rigor Agile Verification promises to mitigate many of the high upfront design costs experienced by formally verified systems and to deliver a better-architected, and thus better-trusted, system in the end. We then discuss the tooling needed to perform Multi-rigor Agile Verification and go in depth to build one of those tools, which directly generates executable prototype code from declarative formal specifications using the Maude rewrite-logic framework.

97 MATHEMATICS AND COMPUTING↗

Robust Control of Wave Energy Converters Using Unstructured Uncertainty

In the design of ocean wave energy converters, proper control design is essential to the maximization of the power generation performance for the device. However, in realistic applications, this control design must be undertaken in the presence of model uncertainty. This paper considers the use of robust control theory to optimize the nominal performance for a wave energy converter in stochastic waves, subject to the constraint that the controller be stability-robust to unstructured uncertainties. We formulate the problem as a multi-objective optimal control problem, in which the primary objective is the maximization of power generation for the nominal system, and the competing objective is the norm of the uncertainty input/output channel. This optimal control problem is nonconvex, and we therefore propose an iterative algorithm that can be used to arrive at a local optimal solution. This iterative approach employs the concept of Iterative Convex Overbounding, in the context of the classical Method of Centers. Here, the methodology is demonstrated on a model of a single, buoy- type wave energy converter.

16 TIDAL AND WAVE POWER↗

Retrieving microphysical properties of concurrent pristine ice and snow using polarimetric radar observations

Abstract. Ice and mixed-phase clouds play a key role in our climate system because of their strong controls on global precipitation and radiation budget. Their microphysical properties have been characterized commonly by polarimetric radar measurements. However, there remains a lack of robust estimates of microphysical properties of concurrent pristine ice and aggregates because larger snow aggregates often dominate the radar signal and mask contributions of smaller pristine ice crystals. This paper presents a new method that separates the scattering signals of pristine ice embedded in snow aggregates in scanning polarimetric radar observations and retrieves their respective abundances and sizes for the first time. This method, dubbed ENCORE-ice, is built on an iterative stochastic ensemble retrieval framework. It provides the number concentration, ice water content, and effective mean diameter of pristine ice and snow aggregates with uncertainty estimates. Evaluations against synthetic observations show that the overall retrieval biases in the combined total microphysical properties are within 5 % and that the errors with respect to the truth are well within the retrieval uncertainty. The partitioning between pristine ice and snow aggregates also agrees well with the truth. Additional evaluations against in situ cloud probe measurements from a recent campaign for a stratiform cloud system are promising. Our median retrievals have a bias of 98 % in the total ice number concentration and 44 % in the total ice water content. This performance is generally better than the retrieval from empirical relationships. The ability to separate signals of different ice species and to provide their quantitative microphysical properties will open up many research opportunities, such as secondary ice production studies and model evaluations for ice microphysical processes.

54 ENVIRONMENTAL SCIENCES↗

Designing a parallel Feel-the-Way clustering algorithm on HPC systems

This paper introduces a new parallel clustering algorithm, named Feel-the-Way clustering algorithm, that provides better or equivalent convergence rate than the traditional clustering methods by optimizing the synchronization and communication costs. Our algorithm design centers on how to optimize three factors simultaneously: reduced synchronizations, improved convergence rate, and retained same or comparable optimization cost. To compare the optimization cost, we use the Sum of Square Error (SSE) cost as the metric, which is the sum of the square distance between each data point and its assigned clusters. Compared with the traditional MPI k-means algorithm, the new Feel-the-Way algorithm requires less communications among participating processes. As for the convergence rate, the new algorithm requires fewer number of iterations to converge. As for the optimization cost, it obtains the SSE costs that are close to the k-means algorithm. In the paper, we first design the full-step Feel-the-Way k-means clustering algorithm that can significantly reduce the number of iterations that are required by the original k-means clustering method. Next, we improve the performance of the full-step algorithm by adopting an optimized sampling-based approach, named reassignment-history-aware sampling. Our experimental results show that the optimized sampling-based Feel-the-Way method is significantly faster than the widely used k-means clustering method, and can provide comparable optimization costs. More extensive experiments with several synthetic datasets and real-world datasets (e.g., MNIST, CIFAR-10, ENRON, and PLACES-2) show that the new parallel algorithm can outperform the open source MPI k-means library by up to 110% on a high-performance computing system using 4,096 CPU cores. In addition, the new algorithm can take up to 51% fewer iterations to converge than the k-means clustering algorithm.

97 MATHEMATICS AND COMPUTING↗

Fast and Invertible Simplicial Approximation of Magnetic‐Following Interpolation for Visualizing Fusion Plasma Simulation Data

We introduce a fast and invertible approximation for fusion plasma simulation data represented as 2D planar meshes with connectivities approximating magnetic field lines along the toroidal dimension in deformed 3D toroidal spaces. Scientific variables (e.g., density and temperature) in these fusion data are interpolated following a complex magnetic-field-line-following scheme in the toroidal space represented by a cylindrical coordinate system. This deformation in the 3D space poses challenges for root-finding and interpolation. To this end, we propose a novel paradigm for visualizing and analyzing such data based on a newly developed algorithm for constructing a 3D simplicial mesh within the deformed 3D space. Our algorithm generates a tetrahedral mesh that connects the 2D meshes using tetrahedra while adhering to the constraints on node connectivities imposed by the magnetic field-line scheme. Specifically, we first divide the space into smaller partitions to reduce complexity based on the input geometries and constraints on connectivities. Then, we independently search for a feasible tetrahedralization of each partition, considering nonconvexity. We demonstrate our method with two X-Point Gyrokinetic Code (XGC) simulation datasets on the International Thermonuclear Experimental Reactor (ITER) and Wendelstein 7-X (W7-X), and use an ocean simulation dataset to substantiate broader applicability of our method. An open source implementation of our algorithm is available at https://github.com/rcrcarissa/DeformedSpaceTet.

Ren, Congrong [The Ohio State Univ., Columbus, OH ↗

One-shot learning for solution operators of partial differential equations

Learning and solving governing equations of a physical system, represented by partial differential equations (PDEs), from data is a central challenge in many areas of science and engineering. Traditional numerical methods can be computationally expensive for complex systems and require complete governing equations. Existing data-driven machine learning methods require large datasets to learn a surrogate solution operator, which could be impractical. Here, we propose a solution operator learning method that requires only one PDE solution, i.e., one-shot learning, along with suitable initial and boundary conditions. Leveraging the locality of derivatives, we define a local solution operator in small local domains, train it using a neural network, and use it to predict solutions of new input functions via mesh-based fixed-point iteration or meshfree neural-network based approaches. We test our method on various PDEs, complex geometries, and a practical spatial infection spread application, demonstrating its effectiveness and generalization capabilities.

97 MATHEMATICS AND COMPUTING↗

Locating Partial Discharges in Power Transformers with Convolutional Iterative Filtering

The most common source of transformer failure is in the insulation, and the most prevalent warning signal for insulation weakness is partial discharge (PD). Locating the positions of these partial discharges would help repair the transformer to prevent failures. This work investigates algorithms that could be deployed to locate the position of a PD event using data from ultra-high frequency (UHF) sensors inside the transformer. These algorithms typically proceed in two steps: first determining the signal arrival time, and then locating the position based on time differences. This paper reviews available methods for each task and then propose new algorithms: a convolutional iterative filter with thresholding (CIFT) to determine the signal arrival time and a reference table of travel times to resolve the source location. The effectiveness of these algorithms are tested with a set of laboratory-triggered PD events and two sets of simulated PD events inside transformers in production use. Tests show the new approach provides more accurate locations than the best-known data analysis algorithms, and the difference is particularly large, 3.7X, when the signal sources are far from sensors.

47 OTHER INSTRUMENTATION↗

Error field identification through torque balance on a saturated island in DIII-D

Measurement of the electromagnetic torque on a magnetic island could be an attractive method for error field identification in the early phase of ITER operation. Previous DIII-D experiments (Strait 2014 Nucl. Fusion 54 073004; Shiraki et al 2015 Plasma Phys. Control. Fusion 57 025016) have demonstrated the principle of this approach using a stationary or slowly rotating island, while recent developments in magnetic data analysis (Sweeney and Strait 2019 Phys. Plasmas 26 012509) allow the field of a rapidly rotating island to be readily distinguished from that of the wall currents induced by its rotation. In a recent experiment, a rotating n = 1 magnetic perturbation forced a saturated magnetic island to rotate, thus sampling all toroidal phases periodically in a single discharge. The phase and amplitude of the error field are inferred from analysis of the time-dependent torque balance on the island, including torques from the error field, the applied magnetic perturbation, and the wall currents induced by rotation of the applied perturbation and the island. Furthermore, results agree well with those from more conventional methods.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Highly accelerated life testing (HALT): A review from a statistical perspective

Despite its use in one form or another for at least four decades, HALT and related techniques [e.g., highly accelerated-stress screening (HASS) and stress audits (HASA)] are not well understood within the statistical community and remain controversial. This largely reflects a conflict in motivation between engineers, testing under harsh conditions to discover and eliminate failure modes, and statisticians, taking a more cautious approach to develop quantitative estimates of parameters such as mean time between failures (MTBF). Here, this review article will clarify HALT concepts and methods and explain where it fits within the universe of methods that involve the application of accelerating factors to compress the time required to evaluate or enhance product reliability. A major distinction is between methods such as HALT, a high-stress test-analyze-fix-test iterative process directed at improving reliability by discovering and fixing weak points in a design, and quantitative accelerated life testing (QALT), whose goal is the estimation of product life for a fixed design. We discuss methods such as physics of failure that offer some hope of bridging the gap between the qualitative nature of HALT, and purely quantitative statistical methods. We present a variety of engineering applications of HALT including metal fatigue, piping and pressure vessels, structural damage, radiation damage, and rotating machinery. We also discuss potential synergies between HALT and QALT, such as rapid identification, through HALT, of failure modes requiring quantitative analysis. For further study, extensive references to the applicable literature are provided as well as an appendix that describes related methods.

97 MATHEMATICS AND COMPUTING↗

Assessing mass balance-based inverse modeling methods via a pseudo-observation test to constrain NO x emissions over South Korea

This study constrains NO x emissions by utilizing mass balance–based inverse modeling methods and examines the optimization of inverse modeling conditions through a pseudo-observation test for South Korea, which has complex topography. Here, we applied mass balance–based inverse modeling methods such as Basic Mass Balance (BMB), Finite Difference Mass Balance (FDMB), and Iterative Finite Difference Mass Balance (IFDMB). We performed a numerical simulation of air quality using the Community Multi-scale Air Quality (CMAQ) model to calculate the NO 2 column density required for the inverse modeling. The pseudo-observation test was performed according to season, modeling resolution, and regridding methodology of satellite observation data to identify various conditions while applying the inverse modeling for South Korea. Comparing the inverse modeling results from the BMB, FDMB, and IFDMB methods, IFDMB was the most effective method in constraining NO x emissions in the South Korean region since it minimized smearing effects (i.e., transport-induced errors) through iterative calculations. The accuracy of the constrained NO x emissions using mass balance–based inversions in South Korea was the highest in the summer due to the minimized smearing effects, and the 9 km resolution modeling was the most efficient for inverse modeling of the region. In addition, the results of inverse modeling varied depending on the regridding methods, implying the importance of using a suitable regridding method and modeling resolution. This study used pseudo-observations, but the inversions are expected to be applied based on actual satellite data in the future.

54 ENVIRONMENTAL SCIENCES↗

Evaluating pulse-shaping capabilities of next-generation pulsed power architectures

This project evaluated the pulse shaping capabilities of next-generation pulsed power (NGPP) architectures. NGPP architectures share several common attributes including multiple independent pulse-generation lines, a radial water-insulated impedance transformer, and a central vacuum insulated load region. A multi-module circuit model was developed, incorporating independent pulse-generation lines and a 2-D transmission line mesh of the radial impedance transformer to assess the effects of azimuthal asymmetry in pulse-shaped experiments. Circuit model simulations demonstrated that NGPP architectures are able to produce the the desired current pulse shapes for exemplar NGPP experiments. Additionally, the project explored automated methods for experiment design, including derivative -ree optimization and machine learning. Pulse-shaped experiments require designers to determine machine parameters that reliably produce the desired current pulse at the load, a process that typically relies on expert knowledge and iterative adjustments using the Z circuit model. Given the increased complexity of NGPP systems, this manual approach may be impractical. While the evaluated methods do not eliminate the need for manual iteration, they can reduce the time required for experiment design. Derivative-free optimization automates much of the trial-and-error process, providing a close starting point for manual adjustments or making small modifications to near-final designs. Meanwhile, deep neural network methods can generate a good qualitative match to the desired current pulse in under one second without requiring circuit model simulations.

42 ENGINEERING↗

Volumetric recombination in EMC3-EIRENE: Implementation and first application to the pre-fusion power operation phase in ITER

An upgrade to the 3D plasma boundary model EMC3-EIRENE for detached divertor plasmas is introduced and evaluated. Stabilization of the iterative approximation of a self-consistent plasma–neutral gas solution is required at low divertor plasma temperatures, and this has been achieved by linearization of the energy loss term associated with the electron–neutral gas interaction. An implicit method for volumetric recombination has been implemented, which improves agreement with SOLPS-ITER results for the pre-fusion power operation phase in ITER. Resonant magnetic perturbations for control of edge localized modes are found to result in a partially detached divertor plasma with a significantly broader reduction of particle loads in the traditional strike zone, which is attributed to volumetric recombination. The additional non-axisymmetric far scrape-off layer strike points, on the other hand, remain attached at relatively high temperature so that volumetric recombination is not effective there.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multilevel Graph Partitioning for Three-Dimensional Discrete Fracture Network Flow Simulations

We present a topology-based method for mesh-partitioning in three-dimensional discrete fracture network (DFN) simulations that takes advantage of the intrinsic multi-level nature of a DFN. DFN models are used to simulate flow and transport through low-permeability fractured media in the subsurface by explicitly representing fractures as discrete entities. The governing equations for flow and transport are numerically integrated on computational meshes generated on the interconnected fracture networks. Modern high-fidelity DFN simulations require high-performance computing on multiple processors where performance and scalability depends partially on obtaining a high-quality partition of the mesh to balance work-loads and minimize communication across all processors. The discrete structure of a DFN naturally lends itself to various graph representations, which can be thought of as coarse-scale representations of the computational mesh. Using this concept, we develop two applications of the multilevel graph partitioning algorithm to partition the mesh of a DFN. In the first, we project a partition of the graph based on the DFN topology onto the mesh of the DFN and in the second, this DFN-based projection is used as the initial condition for further partitioning refinement of the mesh. We compare the performance of these methods with standard multi-level graph partitioning using graph-based metrics (cut, imbalance, partitioning time), computational-based metrics (FLOPS, iterations, solver time), and total run time. The DFN-based and the mesh-based partitioning methods are comparable in terms of the graph-based metrics, but the time required to obtain the partition is several orders of magnitude faster using the DFN-based partitions. The computation-based metrics show comparable performance between both methods so, in combination, the DFN-based partitions are several orders of magnitude faster than the mesh-based partition. Furthermore, the method which uses the DFN-partition solution as the initial condition of the mesh partition provided cut and imbalance values that were close to the mesh-based partition but in a fraction of the time. In turn, this hybrid method outperformed both of the other methods in terms of the total run time.

58 GEOSCIENCES↗

Improvements to a class of hybrid methods for radiation transport: Nyström reconstruction and defect correction methods

In this study, two modifications are introduced for improving the accuracy, versatility, and robustness of a class of hybrid methods for radiation transport. In general, such methods are constructed by splitting the radiative flux into collided and uncollided components to which low- and high-resolution angular approximations are applied, respectively. In this work we focus on discrete ordinates discretizations of high and low order. The first modification we introduce changes the way in which the collided component is mapped into the uncollided component at the end of each time step in a simulation. The new mapping is a Nyström-type reconstruction that is applicable to arbitrary discrete ordinates quadratures, is guaranteed to preserve positivity of the solution provided that all ordinate weights are positive, is significantly more accurate than previous methods, and can be readily extended to other discretizations such as moment methods, finite element methods, and diffusion approximations. The second modification leverages integral deferred correction (IDC) to iteratively correct for the splitting error introduced by the inconsistency in angular discretization between the collided and uncollided components, in addition to improving the accuracy of the low-order temporal error that is treated by traditional IDC methods. Numerical tests in one- and two-dimensional geometries are used to demonstrate the increased accuracy and efficiency of the proposed modifications. It is found that the two techniques combined yield methods with solution accuracy and memory requirements comparable to that of monolithic discrete ordinates methods while reducing runtime by as much as a factor of between two and ten, depending on the problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗