SEARCH · Search NASA
Results for “FOSLS”
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.
Forced Oscillation Source Location of Bulk Power Systems Using Synchrosqueezing Wavelet Transform
Forced oscillation source location (FOSL) plays a significant role in mitigating forced oscillations (FOs), which threaten the power system stability. Here, this paper proposes a data-driven approach for FOSL in power systems using synchrosqueezing wavelet transform (SWT). The proposed approach conducts SWT on the measured system responses to obtain the SWT matrix. Then, the SWT-based dissipating energy flow (DEF) model in time-frequency domain and dissipating energy spectrum (DES) model in frequency domain are derived from the traditional DEF model. Further, the characteristics of SWT-based DEF and DES are revealed by referring to the traditional DEF, and the FOSL criteria of the SWT-based DEF and DES can be hereby obtained. Using the obtained FOSL criteria, the FO source can be located from the measured responses. The performance of the proposed FOSL method is evaluated by simulation data of the WECC 179-bus test system and field-measurement PMU data of the ISO New England. The results confirm the accuracy and efficiency of the proposed method in the FOSL.
Forced Oscillation Source Location in Power Systems Using MVMD-assisted DEF in TF Plane
Fast and accurate forced oscillation source location (FOSL) is critical for mitigating forced oscillations in power systems. Here, to overcome the shortcomings of traditional dissipating energy flow (DEF) in decomposing the forced oscillation components from the measurement responses, a multivariate variational mode decomposition (MVMD)-assisted FOSL is proposed in this paper to locate the forced oscillation sources from measurements in time-frequency (TF) plane. The multi-channel measurement matrix of each generator is formed, then the multi-channel modes are decomposed from the formed multi-channel measurement matrix using the MVMD. Further, the intrinsic mode functions (IMFs) associated with the forced oscillation mode are distinguished from the decomposed modes according to the relative energy weights. With the distinguished IMFs, the MVMD-assisted DEF calculation method is developed to locate the forced oscillation source. Finally, the performance of the proposed method is evaluated using the simulation data of the WECC 179-bus test system and IEEE-NASPI Oscillation Source Location Contest as well as the actual PMU data of ISO New England. The results validated the effectiveness and accuracy of the proposed method in the FOSL.
Camellia v1.0 Manual: Part I
Camellia began as an effort to simplify implementation of efficient solvers for the discontinuous Petrov-Galerkin (DPG) finite element methodology of Demkowicz and Gopalakrishnan. Since then, the feature set has expanded, to allow implementation of traditional continuous Galerkin methods, as well as discontinuous Galerkin (DG) methods, hybridizable DG (HDG) methods, first-order-system least squares (FOSLS), and the primal DPG method. This manual serves as an introduction to using Camellia. We begin, in Section 1.1, by describing some of the core features of Camellia. In Section 1.2 we provide an outline of the manual as a whole.
A low-communication, parallel algorithm for solving PDEs based on range decomposition
This work proposes a new, low-communication algorithm for solving PDEs on massively parallel computers. The range decomposition (RD) algorithm exposes coarse-grain parallelism by applying nested iteration and adaptive mesh refinement locally before performing a global communication step. Just a few such steps are observed to be sufficient to obtain accuracy within a small multiple of discretization error. The target applications are petascale and exascale machines, where hierarchical parallelism is required and traditional parallel numerical PDE communication patterns are costly because of message latency. The RD algorithm uses a partition of unity to equally distribute the error, and thus, the work. The computational advantages of this approach are that the decomposed problems can be solved in parallel without any communication until the partitioned solutions are summed. This offers potential advantages in the paradigm of expensive communication but very cheap computation. This paper introduces the method and explains the details of the communication step. Two performance models are developed, showing that the latency cost associated with a traditional parallel implementation of nested iteration is proportional to log(P) 2 , whereas the RD method reduces the communication latency to log(P), while maintaining similar bandwidth costs. Numerical results for two problems, Laplace and advection diffusion, demonstrate the enhanced performance, and a heuristic argument explains why the method converges quickly.