Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Linearity preservation”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Two-Stage Optimization Framework for Detecting and Correcting Parameter Cyber-Attacks in Power System State Estimation

One major tool of Energy Management Systems for monitoring the status of the power grid is State Estimation. Since the results of state estimation are used within the energy management system, the security of the state estimation process is most important. The focus research in this area is on detecting False Data Injection attacks on measurements. While this is important, State Estimation also rely on database that are used to describe the relationship between measurements and systems' states. This paper presents a two-stage programming framework to detect and correct attacks in the parameters of the measurement model used by the state estimation process in the Energy Management System. In the first stage, an estimate of the line parameters ratios are obtained. In the second stage, the estimated ratios from stage I are used in a Bi-Level model for obtaining a final estimate of the measurements' model parameters. Hence, the presented framework does not only unify the detection and correction in a single optimization run, but also provide a monitoring scheme for the SE database that is typically considered static. In addition, in the two stages, linear programming framework is preserved. For validation, the IEEE 118 bus system is used for implementation. The results of this paper illustrate the effectiveness of the proposed model for detecting attacks in the database used in the state estimation process.

state estimation, two-stage optimization, cyber-ph↗
DOE OSTI2023

Simulating Hydrodynamics in Cosmology with CRK-HACC

Abstract We introduce CRK-HACC, an extension of the Hardware/Hybrid Accelerated Cosmology Code (HACC), to resolve gas hydrodynamics in large-scale structure formation simulations of the universe. The new framework couples the HACC gravitational N -body solver with a modern smoothed-particle hydrodynamics (SPH) approach called conservative reproducing kernel SPH (CRKSPH). CRKSPH utilizes smoothing functions that exactly interpolate linear fields while manifestly preserving conservation laws (momentum, mass, and energy). The CRKSPH method has been incorporated to accurately model baryonic effects in cosmology simulations—an important addition targeting the generation of precise synthetic sky predictions for upcoming observational surveys. CRK-HACC inherits the codesign strategies of the HACC solver and is built to run on modern GPU-accelerated supercomputers. In this work, we summarize the primary solver components and present a number of standard validation tests to demonstrate code accuracy, including idealized hydrodynamic and cosmological setups, as well as self-similarity measurements.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Stress Tensor flows, birefringence in non-linear electrodynamics and supersymmetry

We identify the unique stress tensor deformation which preserves zero-birefringence conditions in non-linear electrodynamics, which is a 4d 4 d version of the T\overline{T} T T ¯ operator. We study the flows driven by this operator in the three Lagrangian theories without birefringence - Born-Infeld, Plebanski, and reverse Born-Infeld - all of which admit ModMax-like generalizations using a root- T\overline{T} T T ¯ -like flow that we analyse in our paper. We demonstrate one way of making this root- T\overline{T} T T ¯ -like flow manifestly supersymmetric by writing the deforming operator in \mathcal{N} = 1 𝒩 = 1 superspace and exhibit two examples of superspace flows. We present scalar analogues in d = 2 d = 2 with similar properties as these theories of electrodynamics in d = 4 d = 4 . Surprisingly, the Plebanski-type theories are fixed points of the classical T\overline{T} T T ¯ -like flows, while the Born-Infeld-type examples satisfy new flow equations driven by relevant operators constructed from the stress tensor. Finally, we prove that any theory obtained from a classical stress-tensor-squared deformation of a conformal field theory gives rise to a related “subtracted” theory for which the stress-tensor-squared operator is a constant.

Physics↗
DOE OSTI2025

Structure-preserving neural networks for the regularized entropy-based closure of a linear, kinetic, radiative transport equation

The main challenge of large-scale numerical simulation of radiation transport is the high memory and computation time requirements of discretization methods for kinetic equations. In this work, we derive and investigate a neural network-based approximation to the entropy-based closure method to accurately compute the solution of the multi-dimensional moment system with a low memory footprint and competitive computational time. We extend methods developed for the standard entropy-based closure to the regularized entropy-based closures. The main idea is to interpret structure-preserving neural network approximations of the regularized entropy-based closure as a two-stage approximation to the original entropy-based closure. We conduct a numerical analysis of this approximation and investigate optimal parameter choices. Our numerical experiments demonstrate that the method has a much lower memory footprint than traditional methods with competitive computation times and simulation accuracy. The code and all trained networks are provided on GitHub.

entropy closure↗
DOE OSTI2020

Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM

We analyze an expansion of the generalized block Krylov subspace framework of [Electron. Trans. Numer. Anal., 47 (2017), pp. 100--126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and contains, as special cases, the block GMRES method and the new block Radau--Arnoldi method. Within this general setting, we present results that extend the interpolation property from the nonblock case to a matrix polynomial interpolation property for the block case, and we relate the eigenvalues of the projected matrix to the latent roots of these matrix polynomials. Some error bounds for these modified block FOM methods for solving linear systems are presented. We then show how cospatial residuals can be preserved in the case of families of shifted linear block systems. This result is used to derive computationally practical restarted algorithms for block Krylov approximations that compute the action of a matrix function on a set of several vectors simultaneously. Finally, we prove some error bounds and present numerical results showing that two modifications of FOM, the block harmonic and the block Radau--Arnoldi methods for matrix functions, can significantly improve the convergence behavior.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Implicit fast sweeping method for hyperbolic systems of conservation laws

Implicit time-accurate methods are often used to integrate stiff problems where explicit schemes impose severe time step restrictions. This paper presents an efficient numerical framework based on the Fast Sweeping Method (FSM) for solving linear and nonlinear hyperbolic systems of conservation laws. The solution at each discrete location is computed by sweeping the numerical domain in several predetermined directions that follow the causality of the characteristic families. The use of a fractional step strategy eliminates the need for a solution selection criterion while one-sided stencils limit the number of sweeps to at most 2 d for d space dimensions. This work focuses on the first-order implicit upwind method since it constitutes the building block for high-order conservative schemes. For problems where the degree of stiffness evolves over time, implicit-explicit hybridization can be accomplished with the same algorithm by simply switching the stencil at each time level. As opposed to traditional implicit solvers, the sweeping method does not require a local time linearization of the fluxes thereby preserving the nonlinear stability properties of the original implicit scheme. It also avoids the large computational and memory requirements associated with solving large block-diagonal systems of equations. Here, a series of one- and two-dimensional test cases are presented for the inviscid Burgers' equation and the reactive Euler equations. The results indicate that the implicit FSM can allow a major reduction in the number of time steps even in the presence of discontinuous solution profiles.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2020

Free volume manipulation of a 6FDA-HAB polyimide using a solid-state protection/deprotection strategy

We report tert-butoxycarbonyl (t-BOC) is a thermally labile moiety that can be used to protect hydroxyl groups on polymers. In this study, t-BOC was appended onto a polyimide consisting of 2,2'-bis-(3,4-dicarboxyphenyl) hexafluoropropane dianhydride (6FDA) and 3,3'-dihydroxy-4,4'-diamino-biphenyl (HAB), after which the polymer was formed into self-standing films. Solid-state thermal treatments were performed to systematically remove t-BOC moieties to alter the physical packing structure and concomitant gas transport properties of the polymer. Despite performing deprotection reactions well below the glass transition temperature of 6FDA-HAB (~300 °C), this free volume manipulation (FVM) approach produced only subtle differences in polymer density, fractional free volume, average free volume element size, and gas transport properties relative to the unprotected polymer. While these findings suggest that thermally removing covalently bound functional groups from polymer films can be used to manipulate free volume and gas transport performance for glassy polymers, more robust polymer systems than linear polyimides are required to preserve the nascent free volume architecture generated from this approach.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Detection of the large-scale tidal field with galaxy multiplet alignment in the DESI Y1 spectroscopic survey

We explore correlations between the orientations of small galaxy groups, or ‘multiplets’, and the large-scale gravitational tidal field. Using data from the Dark Energy Spectroscopic Instrument (DESI) Y1 survey, we detect the intrinsic alignment (IA) of multiplets to the galaxy-traced matter field out to separations of $100\,h^{-1}$ Mpc. Unlike traditional IA measurements of individual galaxies, this estimator is not limited by imaging of galaxy shapes and allows for direct IA detection beyond redshift $z=1$. Multiplet alignment is a form of higher order clustering, for which the scale-dependence traces the underlying tidal field and amplitude is a result of small-scale ($\lt 1h^{-1}$ Mpc) dynamics. Within samples of bright galaxies, luminous red galaxies (LRG) and emission-line galaxies, we find similar scale-dependence regardless of intrinsic luminosity or colour. This is promising for measuring tidal alignment in galaxy samples that typically display no IA. DESI’s LRG mock galaxy catalogues created from the A BACUS S UMMIT N -body simulations produce a similar alignment signal, though with a 33 per cent lower amplitude at all scales. An analytic model using a non-linear power spectrum (NLA) only matches the signal down to 20 $h^{-1}$ Mpc. Our detection demonstrates that galaxy clustering in the non-linear regime of structure formation preserves an interpretable memory of the large-scale tidal field. Multiplet alignment complements traditional two-point measurements by retaining directional information imprinted by tidal forces, and contains additional line-of-sight information compared to weak lensing. This is a more effective estimator than the alignment of individual galaxies in dense, blue, or faint galaxy samples.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Conservative and Accurate Solution Transfer Between High-Order and Low-Order Refined Finite Element Spaces

Here, in this paper, we introduce general transfer operators between high-order and low-order refined finite element spaces that can be used to couple high-order and low-order simulations. Under natural restrictions on the low-order refined space we prove that both the high-to-low-order and low-to-high-order linear mappings are conservative, constant preserving, and high-order accurate. While the proof holds for affine geometries, numerical experiments indicate that the results hold for more general curved meshes. We present several numerical results confirming our analysis and demonstrate the utility of the new mappings in the context of adaptive mesh refinement and conservative multidiscretization coupling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

An MILP-Based Distributed Energy Management for Coordination of Networked Microgrids

An MILP-based distributed energy management for the coordination of networked microgrids is proposed in this paper. Multiple microgrids and the utility grid are coordinated through iteratively adjusted price signals. Based on the price signals received, the microgrid controllers (MCs) and distribution management system (DMS) update their schedules separately. Then, the price signals are updated according to the generation–load mismatch and distributed to MCs and DMS for the next iteration. The iteration continues until the generation–load mismatch is small enough, i.e., the generation and load are balanced under agreed price signals. Through the proposed distributed energy management, various microgrids and the utility grid with different economic, resilient, emission and socio-economic objectives are coordinated with generation–load balance guaranteed and the microgrid customers’ privacy preserved. In particular, a piecewise linearization technique is employed to approximate the augmented Lagrange term in the alternating direction method of multipliers (ADMM) algorithm. Thus, the subproblems are transformed into mixed integer linear programming (MILP) problems and efficiently solved by open-source MILP solvers, which would accelerate the adoption and deployment of microgrids and promote clean energy. The proposed MILP-based distributed energy management is demonstrated through various case studies on a networked microgrids test system with three microgrids.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

3D-printed mirror-less helicity preserving metasurface “mirror” for THz applications

Stimulated by seminal works on generalized reflection and refraction laws, metasurfaces have evolved to a highly promising research direction, as they allow a multitude of different functionalities by optically thin wave-control elements/structures. Among them, structures functioning in the low THz regime are of extensive research interest, due to their high potential in communication and sensing applications. In this paper we propose a simple THz metasurface design that exhibits ideally perfect cross-polarized reflection for linear polarization and perfect helicity-preserving reflection with a geometric (Pancharatnam–Berry) phase for circular polarization, without the presence of any back-reflector. Numerical calculations demonstrating the structure response are justified by analytical models, which provide physical insights on this response. The designed metasurfaces are fabricated using the direct laser writing 3D-printing technology, metallized with electroless silver plating, and are characterized by THz time domain spectroscopy, with the experimental results validating the corresponding theoretical ones. Applications including beam steering and focusing, exploring the Pancharatnam–Berry phase, are also demonstrated numerically. Besides those applications, the helicity preserving mirror response of our metasurfaces can be valuable, among others, also in molecular chirality sensing applications, an issue that is also highlighted here.

3D-printed metasurfaces↗
DOE OSTI2022

Physics-informed regularization and structure preservation for learning stable reduced models from data with operator inference

Operator inference learns low-dimensional dynamical-system models with polynomial nonlinear terms from trajectories of high-dimensional physical systems (non-intrusive model reduction). Here, this work focuses on the large class of physical systems that can be well described by models with quadratic and cubic nonlinear terms and proposes a regularizer for operator inference that induces a stability bias onto learned models. The proposed regularizer is physics informed in the sense that it penalizes higher-order terms with large norms and so explicitly leverages the polynomial model form that is given by the underlying physics. This means that the proposed approach judiciously learns from data and physical insights combined, rather than from either data or physics alone. Additionally, a formulation of operator inference is proposed that enforces model constraints for preserving structure such as symmetry and definiteness in linear terms. Numerical results demonstrate that models learned with operator inference and the proposed regularizer and structure preservation are accurate and stable even in cases where using no regularization and Tikhonov regularization leads to models that are unstable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Superposition principle and nonlinear response in spin glasses

The extended principle of superposition has been a touchstone of spin-glass dynamics for almost 30 years. Here the Uppsala group has demonstrated its validity for the metallic spin glass, CuMn, for magnetic fields H up to 10 Oe at the reduced temperature T r = T/T g = 0.95, where T g is the spin-glass condensation temperature. For H > 10 Oe, they observe a departure from linear response which they ascribe to the development of nonlinear dynamics. The thrust of this paper is to develop a microscopic origin for this behavior by focusing on the time development of the spin-glass correlation length, ξ(t, t w ; H). Here, t is the time after H changes, and t w is the time from the quench for T > T g to the working temperature T until H changes. We connect the growth of ξ(t, t w ; H) to the barrier heights Δ(t w ) that set the dynamics. The effect of H on the magnitude of Δ (t w ) is responsible for affecting differently the two dynamical protocols associated with turning H off (TRM, or thermoremanent magnetization) or on (ZFC, or zero-field-cooled magnetization). This difference is a consequence of nonlinearity based on the effect of H on Δ (t w ). Superposition is preserved if Δ(t w ) is linear in the Hamming distance Hd (proportional to the difference between the self-overlap q EA and the overlap q[Δ(t w )]). However, superposition is violated if Δ(t w ) increases faster than linear in Hd. We have previously shown, through experiment and simulation, that the barriers Δ(t w ) do increase more rapidly than linearly with Hd through the observation that the growth of ξ(t,t w ;H) slows down as ξ(t,t w ; H) increases. In this paper, we display the difference between the zero-field-cooled ξ ZFC (t, t w ; H) and the thermoremanent magnetization ξ TRM (t, t w ; H) correlation lengths as H increases, both experimentally and through numerical simulations, corresponding to the violation of the extended principle of superposition in line with the finding of the Uppsala Group.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Vertex Reordering for Real-world Graphs and Applications: An Empirical Evaluation

Vertex reordering is a way to improve locality in graph computations. Given an input (or ``natural'') order, reordering aims to compute an alternate permutation of the vertices that is aimed at maximizing a locality-based objective. Given decades of research on this topic, there are tens of graph reordering schemes, and there are also several linear arrangement ``gap'' measures for treatment as objectives. However, a comprehensive empirical analysis of the efficacy of the ordering schemes against the different gap measures, and against real-world applications is currently lacking. In this study, we present an extensive empirical evaluation of up to 11 ordering schemes, taken from different classes of approaches, on a set of 34 real-world graphs emerging from different application domains. Our study is presented in two parts: a) a thorough comparative evaluation of the different ordering schemes on their effectiveness to optimize different linear arrangement gap measures, relevant to preserving locality; and b) extensive evaluation of the impact of the ordering schemes on two real-world, parallel graph applications, namely, community detection and influence maximization. Our studies show a significant divergence among the ordering schemes (up to $40\times$ between the best and the poor) in their effectiveness to reduce the gap measures; and a wide ranging impact of the ordering schemes on various aspects including application runtime (up to $4\times$), memory and cache use, load balancing, and parallel work and efficiency. The comparative study also help reveal the nuances of a parallel environment (compared to serial) on the ordering schemes and their role in optimizing applications.

Barik, Reet↗
DOE OSTI2023

Learning Canonical Embeddings for Unsupervised Shape Correspondence With Locally Linear Transformations

We present a new approach to unsupervised shape correspondence learning between pairs of point clouds. We make the first attempt to adapt the classical locally linear embedding algorithm (LLE)-originally designed for nonlinear dimensionality reduction-for shape correspondence. The key idea is to find dense correspondences between shapes by first obtaining high-dimensional neighborhood-preserving embeddings of low-dimensional point clouds and subsequently aligning the source and target embeddings using locally linear transformations. We demonstrate that learning the embedding using a new LLE-inspired point cloud reconstruction objective results in accurate shape correspondences. More specifically, the approach comprises an end-to-end learnable framework of extracting high-dimensional neighborhood-preserving embeddings, estimating locally linear transformations in the embedding space, and reconstructing shapes via divergence measure-based alignment of probability density functions built over reconstructed and target shapes. Our approach enforces embeddings of shapes in correspondence to lie in the same universal/canonical embedding space, which eventually helps regularize the learning process and leads to a simple nearest neighbors approach between shape embeddings for finding reliable correspondences. Comprehensive experiments show that the new method makes noticeable improvements over state-of-the-art approaches on standard shape correspondence benchmark datasets covering both human and nonhuman shapes.

deformation↗
DOE OSTI2024

Stabilized bases for high-order, interpolation semi-Lagrangian, element-based tracer transport

In a computational fluid model of the atmosphere, the advective transport of trace species, or tracers, can be computationally expensive. For efficiency, models often use semi-Lagrangian advection methods. High-order interpolation semi-Lagrangian (ISL) methods, in particular, can be extremely efficient, if the problem of property preservation specific to them can be addressed. Atmosphere models often use geometrically and logically nonuniform grids for efficiency and, as a result, element-based discretizations. Such grids and discretizations make stability a particular problem for ISL methods. Generally, high-order, element-based ISL methods that use the natural polynomial interpolant associated with a nodal finite-element discretization are unstable. Here, we derive new bases having order of accuracy up to nine, with positive nodal weights, that stabilize the element-based ISL method. We use these bases to construct the linear advection operator in the property-preserving Interpolation Semi-Lagrangian Element-based Transport (Islet) method. Then we discuss key software implementation details. Finally, we show performance results for the Energy Exascale Earth System Model's atmosphere dynamical core, comparing the original and new transport methods. These simulations used up to 27,600 Graphical Processing Units (GPU) on the Oak Ridge Leadership Computing Facility's Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A review of high order strong stability preserving two-derivative explicit, implicit, and IMEX methods

High order strong stability preserving time discretizations ensure the nonlinear non-inner-product strong stability properties of spatial discretizations suited for the stable simulation of hyperbolic PDEs in a wide variety of application areas including fluid dynamics, magnetohydrodynamics, semiconductor devices, electromagnetics, and astrophysics. Over the past decade multiderivative time-stepping have been increasingly used for the time-evolution hyperbolic PDEs, so that the strong stability properties of these methods have become important. In this work we review sufficient conditions for a two-derivative multistage method to preserve the strong stability properties of spatial discretizations in a forward Euler and different conditions on the second derivative. In particular we present the strong stability preserving theory for explicit and implicit two-derivative Runge–Kutta schemes, including a special condition on the second derivative under which these implicit methods may be unconditionally strong stability preserving. This special condition is natural for the stiff component of wide range of plasma physics problems, and can be useful in the context of strong stability preserving implicit-explicit multi-derivative Runge–Kutta schemes, where the time-step restriction is then independent of the stiff term. Lastly, we present the strong stability preserving theory for implicit-explicit multi-derivative general linear methods, and some novel second and third order methods where the time-step restriction is independent of the stiff term.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A continuous metal-insulator transition driven by spin correlations

While Mott insulators induced by Coulomb interactions are a well-recognized class of metal-insulator transitions, insulators purely driven by spin correlations are much less common, as the reduced energy scale often invites competition from other degrees of freedom. Here, we demonstrate a clean example of a spin-correlation-driven metal-insulator transition in the all-in-all-out pyrochlore antiferromagnet Cd 2 Os 2 O 7 , where the lattice symmetry is preserved by the antiferromagnetism. After the antisymmetric linear magnetoresistance from conductive, ferromagnetic domain walls is removed experimentally, the bulk Hall coefficient reveals four Fermi surfaces of both electron and hole types, sequentially departing the Fermi level with decreasing temperature below the Néel temperature, T N = 227 K. In Cd 2 Os 2 O 7 , the charge gap of a continuous metal-insulator transition opens only at T ~ 10 K << T N . The insulating mechanism parallels the Slater picture, but without a folded Brillouin zone, and contrasts sharply with Mott insulators and spin density waves, where the electronic gap opens above and at T N , respectively.

36 MATERIALS SCIENCE↗