Tensor lattice field theory for renormalization and quantum computing
Not Available
Meurice, Yannick (ORCID:0000000209959694)↗
SEARCH · Search NASA
Results for “CONNECT algorithm”
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.
A Field Enhancement Integration Design Featuring Misalignment Tolerance for Wireless EV Charging Using LCL Topology
This article proposes a magnetic integration design for EV wireless power transfer (WPT) systems, where the compensation and transmitting coils overlap one on top of the other to share the ferrite layer without any decoupling consideration. The magnetic field generated by both the compensation and transmitting coils are exploited to transfer power. To this end, a compensation method is proposed to enable magnetic field enhancement without any reactive power flow between the compensation and the transmitting coils, and to achieve input zero phase angle and constant current output. In addition, an efficient finite element analysis-based coil optimization algorithm is proposed to improve the coil misalignment tolerance on the horizontal plane, in which a reversely connected inner coil is used to stabilize the system output under misalignment conditions. Analytical and simulation results confirm transmission flux density enhancement and reduced leakage field characteristics of the proposed coil design. Finally, a scaled-down WPT prototype is built and tested to verify the performance and effectiveness of the design. The proposed design achieves 91.17% efficiency and misalignment tolerance up to 200 mm in any XY-direction while maintaining the power transfer and its efficiency. The results of this work provide insights into magnetic integration design of high-order compensation topologies featuring higher compactness, less ferrite usage, magnetic field enhancement, and misalignment tolerance for WPT systems.
42 ENGINEERING↗
A Deep Learning Filter for the Intraseasonal Variability of the Tropics
Abstract This paper presents a novel application of convolutional neural network (CNN) models for filtering the intraseasonal variability of the tropical atmosphere. In this deep learning filter, two convolutional layers are applied sequentially in a supervised machine learning framework to extract the intraseasonal signal from the total daily anomalies. The CNN-based filter can be tailored for each field similarly to fast Fourier transform filtering methods. When applied to two different fields (zonal wind stress and outgoing longwave radiation), the index of agreement between the filtered signal obtained using the CNN-based filter and a conventional weight-based filter is between 95% and 99%. The advantage of the CNN-based filter over the conventional filters is its applicability to time series with the length comparable to the period of the signal being extracted. Significance Statement This study proposes a new method for discovering hidden connections in data representative of tropical atmosphere variability. The method makes use of an artificial intelligence (AI) algorithm that combines a mathematical operation known as convolution with a mathematical model built to reflect the behavior of the human brain known as artificial neural network. Our results show that the filtered data produced by the AI-based method are consistent with the results obtained using conventional mathematical algorithms. The advantage of the AI-based method is that it can be applied to cases for which the conventional methods have limitations, such as forecast (hindcast) data or real-time monitoring of tropical variability in the 20–100-day range.
Stan, Cristiana↗
Optimized Dispatch of Distributed Energy Resources for Resiliency and Power Quality Improvements at the Grid-Edge
Distributed Energy Resources (DERs) installed on low-voltage distribution systems, both utility-owned and nonutility owned may be employed to make improvements to system resiliency and power quality, in addition to simply serving load demand. By selectively dispatching active and reactive power from these existing DERs, improvements in voltage profiles and service availability during adverse events may be achieved. Further benefits can be gained by optimally choosing which DERs to dispatch power from, and the distribution of power from those DERs. For a given operating condition, using Linear Programming methods, optimal power dispatch values for individual DERs can be determined, while considering variables such as voltage gains, losses in the lines and the DERs, and DER reserve capacities. One such optimization technique is developed in this paper, and results from a real-time simulation study on a modified IEEE 13-bus distribution system with three DERs, are being presented. The operation of the optimized DER selection and dispatch algorithm is shown during normal operation of the transmission system when the DERs operate in grid-connected mode. Similar analyses can drive decision making during transmission system failure when the DERs operate in grid-forming or islanded mode.
Chowdhury, Prithwiraj Roy↗
Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs
This paper considers structures of systems beyond dyadic (pairwise) interactions and investigates mathematical modeling of multi-way interactions and connections as hypergraphs, where captured relationships among system entities are set-valued. To date, in most situations, entities in a hypergraph are considered connected as long as there is at least one common ``neighbor''. However, minimal commonality sometimes discards the ``strength'' of connections and interactions among groups. To this end, considering the ``width'' of a connection, referred to as the \emph{$s$-overlap} of neighbors, provides more meaningful insights into how closely the communities or entities interact with each other. In addition, $s$-overlap computation is the fundamental kernel to construct the line graph of a hypergraph, a low-order approximation of the hypergraph which can carry significant information about the original hypergraph. Subsequent stages of a data analytics pipeline then can apply highly-tuned graph algorithms on the line graph to reveal important features. Given a hypergraph, computing the $s$-overlaps by exhaustively considering all pairwise entities can be computationally prohibitive. To tackle this challenge, we develop efficient algorithms to compute $s$-overlaps and the corresponding line graph of a hypergraph. We propose several heuristics to avoid execution of redundant work and improve performance of the $s$-overlap computation. Our parallel algorithm, combined with these heuristics, is orders of magnitude (more than $10\times$) faster than the naive algorithm in all cases and the SpGEMM algorithm with filtration in most cases (especially with large $s$ value).
hypergraph algorithms, graph algorithms, parallel ↗
Model Based Validation of Intelligent Powertrain Strategies for Connected and Automated Vehicles
Systems incorporating Vehicle to Everything (V2X) and conventional cellular based communication in vehicles can significantly help improve energy consumption via a combination of intelligent powertrain control strategies, smarter routing algorithms and driving in such a way as to minimize fuel economy and the emission of carbon dioxide, known as "eco-driving." In projects led by the Southwest Research Institute (SwRI), large-scale traffic simulations are created to model real-world scenarios with dynamic behavior that is reactive to imposed changes. Coupled with high fidelity powertrain models, the closed loop framework enables research and development of such Connected and Automated Vehicle (CAV) enabled technologies at scale. This paper will discuss a traffic system simulation environment that was built based on the High Street urban corridor in Columbus, Ohio. Eco-driving strategies were tested at scale on a variety of powertrain platforms – internal combustion engines, hybrid electric and fully electric vehicles. Furthermore, the paper will focus on hybrid electric powertrain modeling along with details on how the powertrain model was leveraged to develop a sophisticated clustering scheme to help down-select speed traces from large scale simulation studies for validation on vehicle dynamometer. Nominal energy consumption improvement around 12% was observed with good match between simulation studies and vehicle testing.
33 ADVANCED PROPULSION SYSTEMS↗
Revising Apetrei’s bounding volume hierarchy construction algorithm to allow stackless traversal
Stackless traversal is a technique to speed up range queries by avoiding usage of a stack during the tree traversal. One way to achieve that is to transform a given binary tree to store a left child and a skip-connection (also called an escape index). In general, this operation requires an additional tree traversal during the tree construction. For some tree structures, however, it is possible to achieve the same result at a reduced cost. We propose one such algorithm for a GPU hierarchy construction algorithm proposed by Karras in Karras 2012. Furthermore, we show that our algorithm also works with the improved algorithm proposed by Apetrei in Apetrei 2014, despite a different ordering of the internal nodes. We achieve that by modifying Apetrei’s algorithm to restore the original Karras’ ordering of the internal nodes. Using the modified algorithm, we show how to construct a hierarchy suitable for a stackless traversal in a single bottom-up pass.
97 MATHEMATICS AND COMPUTING↗
Multilevel well modeling in aggregation-based nonlinear multigrid for multiphase flow in porous media
A full approximation scheme (FAS) nonlinear multigrid solver for two-phase flow and transport problems driven by wells with multiple perforations is developed here. It is an extension to our previous work on FAS solvers for diffusion and transport problems. The solver is applicable to discrete problems defined on unstructured grids as the coarsening algorithm is aggregation-based and algebraic. To construct coarse basis that can better capture the radial flow near wells, coarse grids in which perforated well cells are not near the coarse-element interface are desired. This is achieved by an aggregation algorithm proposed in this paper that makes use of the location of well cells in the cell-connectivity graph. Numerical examples in which the FAS solver is compared against Newton's method on benchmark problems are given. In particular, for a refined version of the SAIGUP model, the FAS solver is at least 35% faster than Newton's method for time steps with a CFL number greater than 10.
58 GEOSCIENCES↗
Metric Learning to Accelerate Convergence of Operator Splitting Methods
Recent developments in machine learning have led to promising advances in accelerating the solution of constrained optimization problems. Increasing demand for real-time decision-making capabilities in applications such as artificial intelligence and optimal control has led to a variety of proposed strategies for learning to produce fast solutions to optimization problems. For example, recent works have shown that it is possible to accelerate the convergence of optimization algorithms by learning to select their parameters, such as gradient descent stepsizes. This work proposes a new approach, in which the underlying metric spaces of proximal operator splitting algorithms are learned to maximize convergence rate. While prior works in optimization theory have derived optimal metrics in simple cases, no such result exists for many practical problem forms including general Quadratic Programming (QP). This paper shows how differentiable optimization can enable the end-to-end learning of proximal metrics, enhancing the convergence of proximal algorithms for QP problems beyond what is possible based on known theory. Additionally, the results illustrate a strong connection between the learned proximal metrics and active constraints at the optima, leading to an interpretation in which the predicted proximal metrics can be viewed as a form of active set prediction.
King, Ethan [BATTELLE (PACIFIC NW LAB)]↗
Hydra Network Automatic Configuration (Hydra Autoconfig) v1
Hydra Autoconfig is an algorithm and software program to automatically configure a resilient network of independent ASICs that are capable of being connected as a Hydra network. The Hydra network itself is described in an invention disclosure titled: "Ad-Hoc Networks of Readout ASICs for Reliable Detector Instrumentation" (2020-091). The Hydra Autoconfig software works by first configuring a Hydra node. Then it recursively builds a Hydra network by attempting to link to each available upstream node in succession, keeping links that are verified. It then repeats on each newly generated node until no possible links remain. Once it is so configured, a reliable Hydra network of ASICs remains that can be reconfigured later to respond to damage or malfunction of one or more of the constituent ASICs.
Grace, Carl↗
A Summary of the UCLA HANE-Laser Experiment: 2011-2020
In the early years of this century, there was renewed interest at DTRA in artificial radiation belts, the dynamics of high altitude nuclear explosions that produced them, the development of large-scale kinetic plasma computer models at LLNL and LANL (particularly in the form of “hybrid” {i.e., particle ions, massless fluid electrons} algorithms), and the building of a laser facility at UCLA, under the direction of Prof. Niemann, which was connected to the Large Plasma Device (LAPD), a DOE user facility. These advances sparked the idea for a new laser experimental program to examine early-time HANE issues, reviving the concept from a former program at NRL in the 90’s. The basic motivation for this new effort can be traced back to the first DTRA artificial radiation belt workshop at Stanford in 2009. Subsequent discussions then led to a formal proposal from UCLA that was submitted to DTRA (Grant Jones) in 2010, vigorously reviewed, and finally approved in 2011, with funding begun in 2012. An historical perspective of this development process was presented at a DTRA review last year. In this document we review and summarize the major achievements of the DTRA-sponsored UCLA HANE-laser experiment over the past eight years. Our purpose is to briefly describe the major achievements of this program, as documented in the included extensive list of journal publications [which does not include all the publications nor any of the many invited and contributed presentations of the UCLA group], the role of the national laboratories in this effort, and how this work has impacted (and will continue to improve) our understanding of high altitude nuclear events.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
An immersed interface method for the 2D vorticity-velocity Navier-Stokes equations with multiple bodies
We present an immersed interface method for the vorticity-velocity form of the 2D Navier Stokes equations that directly addresses challenges posed by nonconvex immersed bodies, multiply connected domains, and the calculation of force distributions on immersed surfaces. The immersed interface method is re-interpreted as a polynomial extrapolation of flow quantities and boundary conditions into the immersed solid bodies, reducing computational cost and enabling simulations with nonconvex bodies that could not be discretized with previous immersed interface methods. In the flow, the vorticity transport equation is discretized using a conservative finite difference scheme and explicit Runge-Kutta time integration. The velocity reconstruction problem is transformed to a scalar Poisson equation that is discretized with conservative finite differences, and solved using an FFT-accelerated iterative algorithm. The use of conservative differencing throughout leads to exact enforcement of a discrete Kelvin's theorem, allowing for simulations with multiply connected domains and outflow boundaries that have challenged other immersed interface vortex methods. We also explore novel methods for recovering time-dependent pressure distributions on immersed bodies within a vorticity-based method and present a novel control volume formulation for recovering aerodynamic moments from only the vorticity and velocity fields. The method achieves second order spatial accuracy and third order temporal accuracy, and is validated on a variety of 2D flows in internal and free-space domains.
97 MATHEMATICS AND COMPUTING↗
Spatiotemporal Automatic Calibration of Infrastructure Lidar, Radar, and Camera with a Global Navigation Satellite System
Robust and accurate perception is important for modern intelligent transportation systems (ITS), which use sensors of various modalities for data fusion to create a digital twin of an intersection. Sensor calibration is an important process that creates a unified coordinate frame for the sensor output data so that it can be used for data fusion. Classical approaches for sensor calibration are time-consuming, require an overlapping field of view for feature matching, and are not feasible for ITS application as they cause disruptions in the flow of traffic. In this paper, we present a spatiotemporal automatic calibration approach to calibrate multiple infrastructure lidar, radar, and cameras installed at a traffic intersection. The approach uses global navigation satellite system (GNSS) positioning information shared by connected vehicles, and when the vehicle is detected by the sensor, we match the sensor detections with the GNSS coordinates. The proposed algorithm is evaluated with a real-world dataset utilizing detections from two radars, cameras, and lidars with a test vehicle instrumented with a post-processing kinematic (PPK)-corrected GNSS driving past the sensors installed at a four-way traffic intersection. The experimental results show that the proposed automatic calibration approach can achieve the transformation with a root mean squared error of less than 0.5 for radar and lidar and less than 2 for camera detections. The ability to rapidly calibrate sensors not only benefits initial installations, but can also be used for system health monitoring, while utilizing available connected vehicle data to test the real-time sensor fidelity and operational status.
ADVANCED PROPULSION SYSTEMS,ENERGY CONSERVATION, C↗
Spatiotemporal Automatic Calibration of Infrastructure Lidar, Radar, and Camera with a Global Navigation Satellite System: Preprint
Robust and accurate perception is important for modern intelligent transportation systems (ITS), which use sensors of various modalities for data fusion to create a digital twin of an intersection. Sensor calibration is an important process that creates a unified coordinate frame for the sensor output data so that it can be used for data fusion. Classical approaches for sensor calibration are time-consuming, require an overlapping field of view for feature matching, and are not feasible for ITS application as they cause disruptions in the flow of traffic. In this paper, we present a spatiotemporal automatic calibration approach to calibrate multiple infrastructure lidar, radar, and cameras installed at a traffic intersection. The approach uses global navigation satellite system (GNSS) positioning information shared by connected vehicles, and when the vehicle is detected by the sensor, we match the sensor detections with the GNSS coordinates. The proposed algorithm is evaluated with a real-world dataset utilizing detections from two radars, cameras, and lidars with a test vehicle instrumented with a post-processing kinematic (PPK)-corrected GNSS driving past the sensors installed at a four-way traffic intersection. The experimental results show that the proposed automatic calibration approach can achieve the transformation with a root mean squared error of less than 0.5 for radar and lidar and less than 2 for camera detections. The ability to rapidly calibrate sensors not only benefits initial installations, but can also be used for system health monitoring, while utilizing available connected vehicle data to test the real-time sensor fidelity and operational status.
ADVANCED PROPULSION SYSTEMS↗
Delineation of endorheic drainage basins in the MERIT-Plus dataset for 5 and 15 minute upscaled river networks
Abstract The MERIT-Hydro networks re-gridded by the Iterative Hydrography Upscaling (IHU) algorithm do not retain exo- or endorheic basin attributes from the original data. Here we developed methods to assign such attributes to those and any other digital river networks. The motivation is that endorheic inland drainage basins are essential for hydrologic modelling of global and regional water balances, land surface water storage, gravity anomalies, sea level rise, etc. First, we create basin attributes that explicitly label endorheic and exorheic catchments by the criteria of direct or hidden connectivity to the ocean without changing their flow direction grid. In the second step we alter the delineation of endorheic basins by the merging algorithm that eliminates small inland watersheds to the adjacent host basins. The resulting datasets have a significantly reduced number of endorheic basins while preserving the total land portion and topology of the inland basins. The data was validated using the Water Balance Model by comparing volume of endorheic inland depressions with modelled water accumulation in their inland lakes.
58 GEOSCIENCES↗
Optimal Operation of PV Sources in DC Grids for Improving Technical, Economical, and Environmental Conditions by Using Vortex Search Algorithm and a Matrix Hourly Power Flow
This document presents a master–slave methodology for solving the problem of optimal operation of photovoltaic (PV) distributed generators (DGs) in direct current (DC) networks. This problem was modeled using a nonlinear programming model (NLP) that considers the minimization of three different objective functions in a daily operation of the system. The first one corresponds to the minimization of the total operational cost of the system, including the energy purchasing cost to the conventional generators and maintenance costs of the PV sources; the second objective function corresponds to the reduction of the energy losses associated with the transport of energy in the network, and the third objective function is related to the minimization of the total emissions of CO2 by the conventional generators installed on the DC grid. The minimization of these objective functions is achieved by using a master–slave optimization approach through the application of the Vortex Search algorithm combined with a matrix hourly power flow. To evaluate the effectiveness and robustness of the proposed approach, two test scenarios were used, which correspond to a grid-connected and a standalone network located in two different regions of Colombia. The grid-connected system emulates the behavior of the solar resource and power demand of the city of Medellín-Antioquia, and the standalone network corresponds to an adaptation of the generation and demand curves for the municipality of Capurganá-Choco. A numerical comparison was performed with four optimization methodologies reported in the literature: particle swarm optimization, multiverse optimizer, crow search algorithm, and salp swarm algorithm. The results obtained demonstrate that the proposed optimization approach achieved excellent solutions in terms of response quality, repeatability, and processing times.
14 SOLAR ENERGY↗
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↗
Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes
In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.
97 MATHEMATICS AND COMPUTING↗