Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Eigenvalue”

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 919 records · Page 51
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Oscillation Risks of Grid-Following and Grid-Forming Inverter-Based Resources in Series-Compensated Networks

Here, this paper investigates the dynamic behavior of a grid-connected inverter-based resource (IBR) when connected radially to a series compensated line. Potential interactions between the series compensation and the IBR have been identified for both types: grid-following (GFL) or grid-forming (GFM). The study begins with electromagnetic transient (EMT) simulations to demonstrate stability issues. Subsequently, nonlinear analytical models are formulated in the dq frame, validated against the EMT simulation, and leveraged to assess eigenvalues and participation factors. Influencing factors of the dominant oscillation modes have been identified. The analysis results show that series compensation may make a mode associated with the synchronization unit unstable. Furthermore, customized feedback systems are built for the synchronizing loop. Series compensation can increase the sensitivity of the voltage phase angle towards the synchronizing angle, and introduce phase lag in the real power response towards the synchronizing angle. These factors may cause interactions with the phase-locked loop in GFL-IBR systems and with power-based synchronization in GFM-IBR systems, potentially leading to instability.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Application of Detectability Analysis for Power System Dynamic State Estimation

To guide the measurement placement and selection for dynamic state estimation in power systems, it is important to determine the existence of an observer that can estimate the dynamic states. Past studies have been focused on observability analysis, which determines whether the initial states can be uniquely determined. In this paper, detectability analysis is proposed to determine whether the current states can be estimated as time involving. Through the proposed detectability analysis, the states of an unobservable system can be categorized into the detectable states and undetectable states. It is shown that if the eigenvalues corresponding to the unobservable states are stable, the states are detectable and their estimates will converge to the true ones asymptotically. The study can be used to guide measurement placement and selection.

Detectability, dynamic state estimation↗
DOE OSTI2020

Distributed Conditions for Small-signal Stability of Power Grids and Local Control Design

Operating modern power grids with stability guarantees is markedly important. Typical methods for analyzing and certifying power grid stability are largely centralized relying on the ability of the system operator to gather network-wide information and accurately compute the system's eigenvalues. These methods are oftentimes not privacy-preserving and computationally burdensome. They are therefore, not well-suited to modern power grids where small-signal stability has to be evaluated timely, efficiently and in a privacy-preserving fashion. Herein, we introduce a distributed methodology for certifying small-signal stability of power grids and designing the local controllers. First, we analytically derive distributed conditions for network-wide stability that bus agents can inspect using local information. By leveraging these conditions, we then introduce a distributed control design algorithm (DCDA) that can guide the local control design so that stability of the interconnected system is guaranteed. The agents that adopt the proposed distributed algorithm are responsible for tuning their local controllers, producing their local control commands and ensuring that their local stability condition is met. The system operator is only responsible for verifying network-wide stability upon receiving affirmative responses from all agents and, announcing, that the overall system is stable. The proposed DCDA algorithm is numerically validated via simulations using the IEEE 39-bus system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

From Event Data to Wind Power Plant DQ Admittance and Stability Risk Assessment

This paper presents a dynamic event data-based stability risk assessment method for power grids with high penetrations of inverter-based resources (IBRs). This method relies on obtaining the IBRs' DQ admittance through dynamic event data and computing the system's eigenvalues based on the admittance models. Two critical technologies are employed in this research, including time-domain and frequency-domain data fitting and dq-frame voltage and current signal derivation. The first technology is key to obtaining the s-domain expressions from the transient response data, and the s-domain DQ admittance model from the frequency-domain measurements. The second technology is key to obtaining the dq-frame voltage and current signals from either the three-phase instantaneous measurements or the phasor measurement unit (PMU) data. The method is illustrated using data generated from a Type-4 wind power plant modeled in PSCAD. This paper demonstrates the technical feasibility of the proposed approach.

17 WIND ENERGY↗
DOE OSTI2022

Propagating Parameter Uncertainty in Power System Nonlinear Dynamic Simulations Using a Koopman Operator-Based Surrogate Model

In this work, we propose a Koopman operator-based surrogate model for propagating parameter uncertainties in power system nonlinear dynamic simulations. First, we augment a priori known state-space model by reformulating parameters deemed uncertain as pseudo-state variables. Then, we apply the Koopman operator theory to the resulting state-space model and obtain a linear dynamical system model. This transformation allows us to analyze the evolution of the system dynamics through its Koopman eigenfunctions, eigenvalues, and modes. Of particular importance for this letter, the obtained linear dynamical system is a surrogate that enables the evaluation of parameter uncertainties by simply perturbing the initial conditions of the Koopman eigenfunctions associated with the pseudo-state variables. Simulations carried out on the New England test system reveal the excellent performance of the proposed method in terms of accuracy and computational efficiency.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

A New Type of Weak Grid IBR Oscillations

This letter presents the discovery of a new type oscillations associated with inverter-based resources (IBRs) in weak grids. While typical weak grid oscillations become worse when the grid strength decreases and the power exporting level increases, this new type of oscillations appear when the grid becomes weaker and the power exporting level decreases. Electromagnetic transient (EMT) simulation results are presented, along with eigenvalue loci for a varying power. The notable signatures of such oscillations are also remarked. In further analysis, a feedback system consisting of two blocks is derived with one block associated with the phase-locked-loop (PLL) and the other associated with the rest of the system. Here, this feedback system quantitatively demonstrates why insufficient damping in the PLL may be an issue for stability. Open-loop analysis shows that a larger phase lag in angle tracking in the low-frequency range due to high power exporting level at the weak grid condition is beneficial to the open-loop poles introduced by the PLL. And this is the reason why such oscillations may appear when power is ramping down.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Analysis and Mitigation of Cascading Failures Using a Stochastic Interaction Graph with Eigen-analysis

In studies on complex network systems using graph theory, eigen-analysis is typically performed on an undirected graph model of the network. However, when analyzing cascading failures in a power system, the interactions among failures suggest the need for a directed graph beyond the topology of the power system to model directions of failure propagation. To accurately quantify failure interactions for effective mitigation strategies, this paper proposes a stochastic interaction graph model and associated eigen-analysis. Different types of modes on failure propagations are defined and characterized by the eigenvalues of a stochastic interaction matrix, whose absolute values are unity, zero, or in between. Finding and interpreting these modes helps identify the probable patterns of failure propagation, either local or widespread, and the participating components based on eigenvectors. Then, by lowering the failure probabilities of critical components highly participating in a mode of widespread failures, cascading can be mitigated. Here, the validity of the proposed stochastic interaction graph model, eigen-analysis and the resulting mitigation strategies is demonstrated using simulated cascading failure data on an NPCC 140-bus system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Isochronous Architecture-Based Voltage-Active Power Droop for Multi-Inverter Systems

This article proposes an isochronous architecture for parallel inverters with only voltage-active power droop (VP-D) control for improving active power sharing as well as plug-and-play of multi-inverter-based distributed energy resources (DERs). The isochronous framework obviates the need for an explicit regulation of the frequency while allowing for sharing of reactive power. The article shows that the detrimental effects of circulating currents between inverters can be addressed in the framework developed. The isochronous architecture is implemented by employing a GPS to disseminate clock timing signals that enable the microgrid to maintain the nominal system frequency. Small signal eigenvalue analysis of a Multi-inverter Microgrid system near the steady-state operating point is presented to evaluate the system stability. Moreover, unlike traditional droop-based methods, the isochronous strategy lends itself to analytical guarantees which are developed in the article. Furthermore, the effect of delays in receiving GPS clock signals by an inverter is experimentally characterized and an inverter isolation mechanism is proposed that disconnects inverters facing large GPS communication delays. Hardware experiments on an 1.2 kVA-prototype and controller-hardware-in-the-loop validation on the CIGRE distribution network are conducted to demonstrate the effectiveness of the proposed architecture towards active and reactive power sharing between inverters with load scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Bifurcation Buckling Analysis and Non-Linear Collapse Analysis of Teardrop Shaped Vacuum Chamber

The Spallation Neutron Source (SNS) accelerator is being upgraded to increase the beam power from 1.4MW at 1GeV to 2.8MW at 1.3GeV. The currents in the middle two injection chicane magnets cannot simply be scaled up to accommodate the increased injection energy of 1.3GeV due to potential excessive H- stripping; the magnets must be replaced with longer, lower-field magnets and the associated vacuum chambers need to be redesigned. A new teardrop-shaped vacuum chamber was initially designed to accommodate the new magnets and the updated beam paths and instrumentation. This paper focuses on the structural stability study of the teardrop shape vacuum chamber based on buckling analysis. Protection against collapse from buckling according to the ASME BPVC requirement has been evaluated in depth. First, a Type-1 bifurcation buckling analysis using a linear eigenvalue solution to determine the critical load factor was performed. Subsequently, a Type-3 nonlinear collapse analysis was conducted using the static Riks method with elastic-plastic material properties and imperfections explicitly considered in the model geometry. The critical buckling load for the teardrop shape vacuum chamber was confidently estimated based upon this two-stage approach.

Jiang, Hao↗
DOE OSTI2026

$\mathscr{PT}$ symmetry enforced twin exchange as the origin of chirality-induced spin selectivity

Chiral molecules, ubiquitous in chemistry and biology, can differentiate electrons by their spin, a phenomenon known as chirality-induced spin selectivity (CISS). Despite its robustness and technological relevance, CISS has resisted conventional explanation: Spin-orbit coupling (SOC) models cannot fully account for the observed magnitude, room-temperature persistence, or equilibrium signatures. Here, we argue that structural chirality enforces a twin-pair exchange mechanism via the indistinguishability principle, which intrinsically couples spin and spatial degrees of freedom such that wave functions cannot be factorized into spin and spatial components. We derive an effective Hamiltonian that describes both transport and equilibrium CISS phenomena and is non-Hermitian. However, the inherent pseudo-Hermiticity, with $\mathscr{PT}$ symmetry as a special case, ensures real eigenvalues and thermodynamic consistency. We demonstrate that our framework is a step toward resolving long-standing anomalies of CISS. It situates CISS alongside equilibrium symmetry-breaking phenomena such as ferromagnetism and superconductivity, with implications for spintronics, catalysis, and the origins of biological homochirality.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Multilevel Convergence Analysis of Multigrid-Reduction-in-Time

This study presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time-stepping operator, analyzed directly and bounded in the norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds are complemented by proposing analytic formulae for the approximate convergence factor of V-cycle algorithms that take the number of fine grid time points, the temporal coarsening factors, and the eigenvalues of the time-stepping operator as parameters. The paper concludes with supporting numerical investigations of parabolic (anisotropic diffusion) and hyperbolic (wave equation) model problems. We assess the sharpness of the bounds and the quality of the approximate convergence factors. Observations from these numerical investigations demonstrate the value of the proposed multilevel convergence framework for estimating MGRIT convergence a priori and for the design of a convergent algorithm. We further highlight that observations in the literature are captured by the theory, including that two-level Parareal and multilevel MGRIT with F-relaxation do not yield scalable algorithms and the benefit of a stronger relaxation scheme. An important observation is that with increasing numbers of levels MGRIT convergence deteriorates for the hyperbolic model problem, while constant convergence factors can be achieved for the diffusion equation. The theory also indicates that L-stable Runge--Kutta schemes are more amendable to multilevel parallel-in-time integration with MGRIT than A-stable Runge--Kutta schemes.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2021

Error Bounds for Dynamical Spectral Estimation

Dynamical spectral estimation is a well-established numerical approach for estimating eigenvalues and eigenfunctions of the Markov transition operator from trajectory data. Although the approach has been widely applied in biomolecular simulations, its error properties remain poorly understood. Here we analyze the error of a dynamical spectral estimation method called “the variational approach to conformational dynamics" (VAC). We bound the approximation error and estimation error for VAC estimates. Our analysis establishes VAC's convergence properties and suggests new strategies for tuning VAC to improve accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Reducing Operator Complexity of Galerkin Coarse-grid Operators with Machine Learning

Here, we propose a data-driven and machine-learning-based approach to compute non-Galerkin coarse-grid operators in multigrid (MG) methods, addressing the well-known issue of increasing operator complexity. Guided by the MG theory on spectrally equivalent coarse-grid operators, we have developed novel machine learning algorithms that utilize neural networks combined with smooth test vectors from multigrid eigenvalue problems. The proposed method demonstrates promise in reducing the complexity of coarse-grid operators while maintaining overall MG convergence for solving parametric partial differential equation problems. Numerical experiments on anisotropic rotated Laplacian and linear elasticity problems are provided to showcase the performance and comparison with existing methods for computing non-Galerkin coarse-grid operators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Robust Optimal Experimental Design of Infinite-Dimensional Bayesian Nonlinear Inverse Problems

Abstract. We consider robust optimal experimental design (ROED) for nonlinear Bayesian inverse problems governed by partial differential equations (PDEs). An optimal design is one that maximizes some utility quantifying the quality of the solution of an inverse problem. However, the optimal design is dependent on elements of the inverse problem such as the simulation model, the prior, or the measurement error model. ROED aims to produce an optimal design that is aware of the additional uncertainties encoded in the inverse problem and remains optimal even after variations in them. We follow a worst-case scenario approach to develop a new framework for robust optimal design of nonlinear Bayesian inverse problems. The proposed framework (a) is scalable and designed for infinite-dimensional Bayesian nonlinear inverse problems constrained by PDEs; (b) develops efficient approximations of the utility, namely the expected information gain; (c) employs eigenvalue sensitivity techniques to develop analytical forms and efficient evaluation methods of the gradient of the utility with respect to the uncertainties against which we wish to be robust; and (d) employs a probabilistic optimization paradigm that properly defines and efficiently solves the resulting combinatorial max-min optimization problem. The effectiveness of the proposed approach is illustrated for optimal sensor placement problem in an inverse problem governed by an elliptic PDE.

Chowdhary, Abhijit↗
DOE OSTI2024

Demonstration of the rodeo algorithm on a quantum computer

The rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer. This makes it a promising tool for studying the spectrum and structure of atomic nuclei as well as other fields of quantum many-body physics. The only requirement is that the initial state has sufficient overlap probability with the desired eigenstate. While it is exponentially faster than well-known algorithms such as phase estimation and adiabatic evolution for eigenstate preparation, it has yet to be implemented on an actual quantum device. In this work, we apply the rodeo algorithm to determine the energy levels of a random one-qubit Hamiltonian, resulting in a relative error of 0.08% using mid-circuit measurements on the IBM Q device Casablanca. This surpasses the accuracy of directly-prepared eigenvector expectation values using the same quantum device. We take advantage of the high-accuracy energy determination and use the Hellmann-Feynman theorem to compute eigenvector expectation values for a different random one-qubit observable. For the Hellmann-Feynman calculations, we find a relative error of 0.7%. Here, we conclude by discussing possible future applications of the rodeo algorithm for multi-qubit Hamiltonians.

algorithm↗