Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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.

At least 955 records · Page 53

Identifying Light-Duty Vehicle Travel from Large-Scale Multimodal Wearable GPS Data with Novelty Detection Algorithms

Identifying travel mode within travel survey data sets, especially light-duty vehicle (LDV) travel, is foundational, though nontrivial, to travel behavior analysis and fuel consumption estimation. Current travel mode detection approaches require well-sampled and balanced data sets with ground truth travel mode labels. They are rarely applied and validated on large-scale, real-world data sets, which may not satisfy the data requirements. This paper proposes an LDV travel mode detection model as a supplement to current travel mode detection methods, for the case when the training set is highly (and/or completely) unbalanced, to the extent that classical machine-learning approaches become difficult or impossible to deploy. The proposed model uses a novelty detection technique-one-class support vector machines (OCSVMs)-and a novel exhaustive feature extraction (EFE) technique on continuous time series data (i.e., Global Positioning System [GPS] speed profiles) for single-mode trip trajectories. Training and validation of the model are conducted on a large-scale, real-world data set. The proposed method accurately identifies LDV trips from a broad set of multimodal trips by leveraging a wealth of preexisting in-vehicle GPS travel data. Additional sensitivity analysis sheds light on the optimal training size, which will benefit applications limited by highly imbalanced data. The paper also discusses performance comparison with regular machine-learning approaches, the model's robustness, and the potential to extend the proposed model to multimodal prediction.

47 OTHER INSTRUMENTATION↗

Flow and heat transfer in the wake of a triangular arrangement of spheres

This research work seeks to investigate the influence of spacing and heat transfer on the wake behavior of a triangular arrangement of spheres. Four experimental configurations have been investigated at three Reynolds numbers, Re 1 = 350, Re 2 = 700, and Re 3 = 1050. Two isothermal cases were investigated with spacing between the spheres of zero and one sphere diameter, and two cases were investigated with an applied heat flux at the same spacing conditions. The time resolved particle image velocimetry results revealed various flow phenomena including flow separations, von Karman vortex shedding, and Kelvin–Helmholtz instabilities. The turbulent statistics reveal the effect of proximity and heat transfer on the time averaged values of the wake size, turbulent strengths, and Reynolds shear stress in the wake of each sphere, namely, the laminarization effects from the addition of heat and the suppression of the lead sphere wake from the proximity of the trailing spheres. These results are complemented by the application of proper orthogonal decomposition (POD) to the flow fields, which extracts the coherent structures from the flow. Here the modes that describe the coherent structures are extracted and described in detail, which provide further insight into effects of the experimental conditions on the temporal behavior of the flow. Many of the low order modes are found to be associated in pairs, corresponding to asymmetric structures or advection of a given structure downstream. The capability of POD to produce reduced order models of the flow is then utilized to facilitate vortex identification analysis. A turbulent kinetic energy based mode truncation criteria, which has been found to enhance vortex identification capability, is applied to select the POD modes and temporal coefficients to be used in the reduced order modeling. The reconstructed velocity fields are then analyzed with vortex identification algorithms to extract the vortex cores and boundaries. The combination of these approaches allows the study of the effect of proximity and heat transfer on the vortex characteristics, such as size, strength, and distribution.

42 ENGINEERING↗

Towards a quantum field theory of primitive string fields

We denote generating functions of massless even higher-spin fields 'primitive string fields' (PSF's). In an introduction we present the necessary definitions and derive propagators and currents of these PDF's on flat space. Their off-shell cubic interaction can be derived after all off-shell cubic interactions of triplets of higher-spin fields have become known. Then we discuss four-point functions of any quartet of PSF's. In subsequent sections we exploit the fact that higher-spin field theories in AdS{sub d+1} are determined by AdS/CFT correspondence from universality classes of critical systems in d-dimensional flat spaces. The O(N) invariant sectors of the O(N) vector models for 1 {<=} N {<=}{infinity} play for us the role of 'standard models', for varying N, they contain, e.g., the Ising model for N = 1 and the spherical model for N = {infinity}. A formula for the masses squared that break gauge symmetry for these O(N) classes is presented for d = 3. For the PSF on AdS space it is shown that it can be derived by lifting the PSF on flat space by a simple kernel which contains the sum over all spins. Finally we use an algorithm to derive all symmetric tensor higher-spin fields. They arise from monomials of scalar fields by derivation and selection of conformal (quasiprimary) fields. Typically one monomial produces a multiplet of spin s conformal higher-spin fields for all s {>=} 4, they are distinguished by their anomalous dimensions (in CFT{sub 3}) or by theirmass (in AdS{sub 4}). We sum over these multiplets and the spins to obtain 'string type fields', one for each such monomial.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Developing reservoir monthly inflow forecasts using artificial intelligence and climate phenomenon information

Reservoirs are fundamental human–built infrastructures that collect, store, and deliver fresh surface water in a timely manner for many purposes. Efficient reservoir operation requires policy makers and operators to understand how reservoir inflows are changing under different hydrological and climatic conditions to enable forecast–informed operations. Over the last decade, the uses of Artificial Intelligence and Data Mining [AI & DM] techniques in assisting reservoir streamflow subseasonal to seasonal forecasts have been increasing. In this study, Random Forest [RF), Artificial Neural Network (ANN), and Support Vector Regression (SVR) are employed and compared with respect to their capabilities for predicting 1 month–ahead reservoir inflows for two headwater reservoirs in USA and China. Both current and lagged hydrological information and 17 known climate phenomenon indices, i.e., PDO and ENSO, etc., are selected as predictors for simulating reservoir inflows. Here, the results show three methods are capable of providing monthly reservoir inflows with satisfactory statistics; the results obtained by Random Forest have the best statistical performances compared with the other two methods; another advantage of Random Forest algorithm is its capability of interpreting raw model inputs; climate phenomenon indices are useful in assisting monthly or seasonal forecasts of reservoir inflow; and different climate conditions are autocorrelated with up to several months, and the climatic information and their lags are cross correlated with local hydrological conditions in our case studies.

54 ENVIRONMENTAL SCIENCES↗

Sparse Matrix-Based HPC Tomography

Tomographic imaging has benefited from advances in X-ray sources, detectors and optics to enable novel observations in science, engineering and medicine. These advances have come with a dramatic increase of input data in the form of faster frame rates, larger fields of view or higher resolution, so high performance solutions are currently widely used for analysis. Tomographic instruments can vary significantly from one to another, including the hardware employed for reconstruction: from single CPU workstations to large scale hybrid CPU/GPU supercomputers. Furthermore, flexibility on the software interfaces and reconstruction engines are also highly valued to allow for easy development and prototyping. This paper presents a novel software framework for tomographic analysis that tackles all aforementioned requirements. The proposed solution capitalizes on the increased performance of sparse matrix-vector multiplication and exploits multi-CPU and GPU reconstruction over MPI. Furthermore, the solution is implemented in Python and relies on CuPy for fast GPU operators and CUDA kernel integration, and on SciPy for CPU sparse matrix computation. As opposed to previous tomography solutions that are tailor-made for specific use cases or hardware, the proposed software is designed to provide flexible, portable and high-performance operators that can be used for continuous integration at different production environments, but also for prototyping new experimental settings or for algorithmic development. The experimental results demonstrate how our implementation can even outperform state-of-the-art software packages used at advanced X-ray sources worldwide.

97 MATHEMATICS AND COMPUTING↗

Spinor representations for fields with any spin: Lorentz tensor basis for operators and covariant multipole decomposition

This paper discusses a framework to parametrize and decompose operator matrix elements for particles with higher spin (j > 1/2) using chiral representations of the Lorentz group, i.e. the (j, 0) and (0, j) representations and their parity-invariant direct sum. Unlike traditional approaches that require imposing constraints to eliminate spurious degrees of freedom, these chiral representations contain exactly the 2j + 1 components needed to describe a spin-j particle. The central objects in the construction are the t-tensors, which are generalizations of the Pauli four-vector σ μ for higher spin. For the generalized spinors of these representations, we demonstrate how the algebra of the t-tensors allows to formulate a generalization of the Dirac matrix basis for any spin. For on-shell bilinears, we show that a set consisting exclusively of covariant multipoles of order 0 ≤ m ≤ 2j forms a complete basis. We provide explicit expressions for all bilinears of the generalized Dirac matrix basis, which are valid for any spin value. As a byproduct of our derivations we present an efficient algorithm to compute the t-tensor matrix elements. The formalism presented here paves the way to use a more unified approach to analyze the non-perturbative QCD structure of hadrons and nuclei across different spin values, with clear physical interpretation of the resulting distributions as covariant multipoles.

Angular momentum of light↗

Model-Based Detection of Coordinated Attacks (DCA) in Distribution Systems

The fast-paced growth in digitization of smart grid components enhances system observability and remote-control capabilities through efficient communication. However, enhanced connectivity results in heightened system vulnerability towards cybersecurity risks in the cyber-physical power system. Coordinated cyber-attacks (CCA), when undetected, lead to system-wide impact in terms of large disturbances or widespread outages. Detecting CCA in the cyber layer is critical to thwart cyber-attacks in real-time before the attack impacts the physical system. The challenge of locating CCA stems from the complex grid dynamics, making it difficult to distinguish between normal operational variations and cyber-attack impact. CCA often employs multiple attack vectors targeting geographically distributed components, further complicating CCA identification. Existing research in intrusion detection is primarily focused on the transmission network and limited to detecting individual attacks. In this paper, a novel proactive DCA strategy is proposed for early detection of CCA by establishing correlations among distinct attack events through model-based reinforcement learning that utilizes abductive reasoning to conclude the attacker goal. The solution includes understanding the system model, learning the system dynamics, and correlating individual cyber-attacks to extract the attacker’s objective. The developed learning algorithm identifies the most probable attack path to reach the attacker’s objective by predicting the next attack steps. A DNP3-based cyber-physical co-simulation testbed is developed to test the proposed algorithm using the IEEE 13-node test feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Estimating Higher-Order Moments Using Symmetric Tensor Decomposition

In this paper, we consider the problem of decomposing higher-order moment tensors, i.e., the sum of symmetric outer products of data vectors. Such a decomposition can be used to estimate the means in a Gaussian mixture model and for other applications in machine learning. The dth-order empirical moment tensor of a set of p observations of n variables is a symmetric d-way tensor. Our goal is to nd a low-rank tensor approximation comprising r $\ll$ p symmetric outer products. The challenge is that forming the empirical moment tensor costs O(pn d ) operations and O(n d ) storage, which may be prohibitively expensive; additionally, the algorithm to compute the low-rank approximation costs O(n d ) per iteration. Our contribution is avoiding formation of the moment tensor, computing the low-rank tensor approximation of the moment tensor implicitly using O(pnr) operations per iteration and no extra memory. This advance opens the door to more applications of higher-order moments since they can now be efficiently computed. We present numerical evidence of the computational savings and show an example of estimating the means for higher-order moments.

97 MATHEMATICS AND COMPUTING↗

Spectrograph stabilization using a single-delay interferometer on the Hale Telescope

We describe a technique for spectrograph stabilization useful when conventional mitigation techniques of vacuum tanks, thermal insulation, and laser frequency comb may be impractical, expensive, heavy, or bulky. This includes spectrographs on airborne platforms or mounted on telescopes where they suffer a changing gravity vector or other drifts. Placing a fixed-delay interferometer in series with a spectrograph forms an externally dispersed interferometer (EDI). This produces a uniform sinusoidal comb multiplying input spectrum, creating (through heterodyning) beats (moiré patterns). In Fourier space for low frequencies up to the comb frequency, the moiré generated signal counter-rotates to ordinary spectra under an unknown disperser wavenumber drift Δx. This generates a large negative feedback signal useful in a conceptual control loop, to converge rapidly to a stable spectrum and yield Δx. A modified EDI data analysis algorithm (“crossfading”) combines frequency-weighted moiré with conventional spectrum to cancel net output spectrum reaction to Δx. Needing only a single-delay, this is a practical improvement over prior crossfading analyses requiring multiple delays. We test crossfading on ThAr data near 4850 cm−1 taken on Hale telescope in an earlier project. In a single pass, we reduce drift 20 times. Using seven iterations, we reduce 0.5 cm−1 (31 km/s Doppler equivalent) drift to 4×10−7 cm−1 (2.5 cm/s). The interferometer delay can wander, because linearity of phase versus wavenumber interpolates science features between bracketing calibrating spectral references. Second, mathematically reversing the heterodyning effect doubles effective spectral resolution without changing disperser slit.

Erskine, David J [Lawrence Livermore National Labo↗

SU-F-BRF-03: Quality Assurance of Deformable Image Registration in Radiotherapy

Purpose: To introduce methods to analyze Deformable Image Registration (DIR) and identify regions of potential DIR errors. Methods: DIR Deformable Vector Fields (DVFs) quantifying patient anatomic changes were evaluated using the Jacobian determinant and the magnitude of DVF curl as functions of tissue density and tissue type. These quantities represent local relative deformation and rotation, respectively. Large values in dense tissues can potentially identify non-physical DVF errors. For multiple DVFs per patient, histograms and visualization of DVF differences were also considered. To demonstrate the capabilities of methods, we computed multiple DVFs for each of five Head and Neck (H'N) patients (P1–P5) via a Fast-symmetric Demons (FSD) algorithm and via a Diffeomorphic Demons (DFD) algorithm, and show the potential to identify DVF errors. Results: Quantitative comparisons of the FSD and DFD registrations revealed <0.3 cm DVF differences in >99% of all voxels for P1, >96% for P2, and >90% of voxels for P3. While the FSD and DFD registrations were very similar for these patients, the Jacobian determinant was >50% in 9–15% of soft tissue and in 3–17% of bony tissue in each of these cases. The volumes of large soft tissue deformation were consistent for all five patients using the FSD algorithm (mean 15%±4% volume), whereas DFD reduced regions of large deformation by 10% volume (785 cm{sup 3}) for P4 and by 14% volume (1775 cm{sup 3}) for P5. The DFD registrations resulted in fewer regions of large DVF-curl; 50% rotations in FSD registrations averaged 209±136 cm{sup 3} in soft tissue and 10±11 cm{sup 3} in bony tissue, but using DFD these values were reduced to 42±53 cm{sup 3} and 1.1±1.5 cm{sup 3}, respectively. Conclusion: Analysis of Jacobian determinant and curl as functions of tissue density can identify regions of potential DVF errors by identifying non-physical deformations and rotations. Collaboration with Phillips Healthcare, as indicated in authorship.

60 APPLIED LIFE SCIENCES↗

An Exploration of Climate Data Using Complex Networks

To discover patterns in historical data, climate scientists have applied various clustering methods with the goal of identifying regions that share some common climatological behavior. However, past approaches are limited by the fact that they either consider only a single time period (snapshot) of multivariate data, or they consider only a single variable by using the time series data as multi-dimensional feature vector. In both cases, potentially useful information may be lost. Moreover, clusters in high-dimensional data space can be dicult to interpret, prompting the need for a more eective data representation. We address both of these issues by employing a complex network (graph) to represent climate data, a more intuitive model that can be used for analysis while also having a direct mapping to the physical world for interpretation. A cross correlation function is used to weight network edges, thus respecting the temporal nature of the data, and a community detection algorithm identies multivariate clusters. Examining networks for consecutive periods allows us to study structural changes over time. We show that communities have a climatological interpretation and that disturbances in structure can be an indicator of climate events (or lack thereof). Finally, we discuss how this model can be applied for the discovery of more complex concepts such as unknown teleconnections or the development of multivariate climate indices and predictive insights.

99 GENERAL AND MISCELLANEOUS↗

Petascale direct numerical simulation of blood flow on 200K cores and heterogeneous architectures

We present a fast, petaflop-scalable algorithm for Stokesian particulate flows. Our goal is the direct simulation of blood, which we model as a mixture of a Stokesian fluid (plasma) and red blood cells (RBCs). Directly simulating blood is a challenging multiscale, multiphysics problem. We report simulations with up to 260 million deformable RBCs. The largest simulation amounts to 90 billion unknowns in space. In terms of the number of cells, we improve the state-of-the art by several orders of magnitude: the previous largest simulation, at the same physical fidelity as ours, resolved the flow of O(1,000-10,000) RBCs. Our approach has three distinct characteristics: (1) we faithfully represent the physics of RBCs by using nonlinear solid mechanics to capture the deformations of each cell; (2) we accurately resolve the long-range, N-body, hydrodynamic interactions between RBCs (which are caused by the surrounding plasma); and (3) we allow for highly non-uniform spatial distributions of RBCs. The new method has been implemented in the software library MOBO (for 'Moving Boundaries'). We designed MOBO to support parallelism at all levels, including inter-node distributed memory parallelism, intra-node shared memory parallelism, data parallelism (vectorization), and fine-grained multithreading for GPUs. We have implemented and optimized the majority of the computation kernels on both Intel/AMD x86 and NVidia's Tesla/Fermi platforms for single and double floating point precision. Overall, the code has scaled on 256 CPU-GPUs on the Teragrid's Lincoln cluster and on 200,000 AMD cores of the Oak Ridge National Laboratory's Jaguar PF system. In our largest simulation, we have achieved 0.7 Petaflops/s of sustained performance on Jaguar.

59 BASIC BIOLOGICAL SCIENCES↗

Learning Optimal Aerodynamic Designs

This project created a framework for efficient, accurate, and scalable deep neural network representations of design optimization problem solutions. The inputs to these DNN representations are the vector of design requirement parameters, the outputs are the optimal design variables, and the goal is to learn the map from inputs to outputs (i.e., inverse design). The team addressed the problem of the optimal shape design of aerodynamic lifting surfaces—in particular aircraft wings—using a Reynolds-Average Navier Stokes model to govern the CFD-based aerodynamic shape optimization. The inverse design map for such problems is very complex and high-dimensional, involving inputs and outputs on the order of 1000s. To approximate this inverse design map, the team developed algorithms to construct parsimonious DNN architectures, which automatically identify low-dimensional manifolds in which design requirements affect optimal shape parameters, and trained these architectures with multifidelity optimization methods. The resulting methodology accurately and automatically designs optimal aerodynamic lifting surfaces with very high accuracy (99%) at interactive speeds, of the order of milliseconds, resulting in factors of one million or more speedup relative to CFD-based design optimization.

97 MATHEMATICS AND COMPUTING↗

FFT-based solver for higher-order and multi-phase-field fracture models applied to strongly anisotropic brittle materials

This paper presents the application of a fast Fourier transform (FFT) based method to solve two phase field models designed to simulate crack growth of strongly anisotropic materials in the brittle regime. By leveraging the ability of the FFT-based solver to generate solutions with higher-order and global continuities, we design two simple algorithms to capture the complex fracture patterns (e.g. sawtooth, and curved crack growth) common in materials with strongly anisotropic surface energy via the multi-phase-field and high-order phase-field frameworks. A staggered operator-split solver is used where both the balance of linear momentum and the phase field governing equations are formulated in the periodic domain. The unit phase field of the initial failure region is prescribed by the penalty method to alleviate the sharp material contrast between the initial failure region and the base material. The discrete frequency vectors are generalized to estimate the second and fourth order gradients such that the Gibbs effect near shape interfaces or jump conditions can be suppressed. Furthermore, a preconditioner is adopted to improve the convergence rate of the iterative linear solver. Three numerical experiments are used to systematically compare the performance of the FFT-based method in the multi-phase-field and high-order phase-field frameworks.

42 ENGINEERING↗

Eigenvector Continuation with Subspace Learning

A common challenge faced in quantum physics is finding the extremal eigenvalues and eigenvectors of a Hamiltonian matrix in a vector space so large that linear algebra operations on general vectors are not possible. There are numerous efficient methods developed for this task, but they generally fail when some control parameter in the Hamiltonian matrix exceeds some threshold value. In this Letter we present a new technique called eigenvector continuation that can extend the reach of these methods. The key insight is that while an eigenvector resides in a linear space with enormous dimensions, the eigenvector trajectory generated by smooth changes of the Hamiltonian matrix is well approximated by a very low-dimensional manifold. We prove this statement using analytic function theory and propose an algorithm to solve for the extremal eigenvectors. We benchmark the method using several examples from quantum many-body theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗

SU-C-BRA-05: Delineating High-Dose Clinical Target Volumes for Head and Neck Tumors Using Machine Learning Algorithms

Purpose: To develop and test population-based machine learning algorithms for delineating high-dose clinical target volumes (CTVs) in H&N tumors. Automating and standardizing the contouring of CTVs can reduce both physician contouring time and inter-physician variability, which is one of the largest sources of uncertainty in H&N radiotherapy. Methods: Twenty-five node-negative patients treated with definitive radiotherapy were selected (6 right base of tongue, 11 left and 9 right tonsil). All patients had GTV and CTVs manually contoured by an experienced radiation oncologist prior to treatment. This contouring process, which is driven by anatomical, pathological, and patient specific information, typically results in non-uniform margin expansions about the GTV. Therefore, we tested two methods to delineate high-dose CTV given a manually-contoured GTV: (1) regression-support vector machines(SVM) and (2) classification-SVM. These models were trained and tested on each patient group using leave-one-out cross-validation. The volume difference(VD) and Dice similarity coefficient(DSC) between the manual and auto-contoured CTV were calculated to evaluate the results. Distances from GTV-to-CTV were computed about each patient’s GTV and these distances, in addition to distances from GTV to surrounding anatomy in the expansion direction, were utilized in the regression-SVM method. The classification-SVM method used categorical voxel-information (GTV, selected anatomical structures, else) from a 3×3×3cm3 ROI centered about the voxel to classify voxels as CTV. Results: Volumes for the auto-contoured CTVs ranged from 17.1 to 149.1cc and 17.4 to 151.9cc; the average(range) VD between manual and auto-contoured CTV were 0.93 (0.48–1.59) and 1.16(0.48–1.97); while average(range) DSC values were 0.75(0.59–0.88) and 0.74(0.59–0.81) for the regression-SVM and classification-SVM methods, respectively. Conclusion: We developed two novel machine learning methods to delineate high-dose CTV for H&N patients. Both methods showed promising results that hint to a solution to the standardization of the contouring process of clinical target volumes. Varian Medical Systems grant.

60 APPLIED LIFE SCIENCES↗

Identification of topology changes in power grids using phasor measurements

Phasor measurement units (PMUs) are increasingly important for monitoring the state of an electrical power grid and quickly detecting topology changes caused by events such as lines going down or large loads being dropped. Phasors are complex‐valued measurements of voltage and current at various points of generation and consumption. If a line goes down or a load is removed, power flows change throughout the grid according to known physical laws, and the probability distribution of phasor measurements changes accordingly. This paper develops a method to estimate the current topology of a power grid from phasor measurements and considers the design goal of placing PMUs at strategic points in a distribution system to achieve good sensitivity to single‐line outages. From a vector of phasor measurements, probabilities are computed corresponding to the scenario that all power lines are operational and to alternate scenarios in which each line goes down individually. These probabilities are functions of the joint distributions of phasor measurements under each possible scenario, obtained through Monte Carlo simulations with random load profiles. We use log‐spline densities to estimate marginal distributions of phasor measurements and fold these into a multivariate Gaussian copula to capture important correlations. Sensitivity to outages varies according to which line goes down and where PMUs are placed on the grid. A greedy search algorithm is demonstrated for placing PMUs at locations that provide good sensitivity to single‐line outages. Published 2014. This article is a U.S. Government work and is in the public domain in the USA.

Wiel, Scott Vander↗