.png){kind=icon}
.png){kind=icon}
Return
Fast SVD Computations for Synchrophasor Algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2015.2412679.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many singular value decomposition (SVD) problems in power system computations require only a few largest singular values of a large-scale matrix for the analysis. This letter introduces two fast SVD approaches recently developed in other domains to power systems for speeding up phasor measurement unit (PMU) based online applications. The first method is a randomized SVD algorithm that accelerates computation by introducing a low-rank approximation of a given matrix through randomness. The second method is the augmented Lanczos bidiagonalization, an iterative Krylov subspace technique that computes sequences of projections of a given matrix onto low-dimensional subspaces. Both approaches are illustrated on SVD evaluation within an ambient oscillation monitoring algorithm, namely stochastic subspace identification (SSI).
Keywords:
Large-scale computations
power system oscillations
singular value decomposition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
