arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1508.02489cs.CEmath.STstat.TH
收藏

基于低秩稀疏张量恢复的概率潮流计算

Probabilistic Power Flow Computation via Low-Rank and Sparse Tensor Recovery

Zheng Zhang, Hung Dinh Nguyen, Konstantin Turitsyn, Luca Daniel

摘要:

提出了一种求解概率潮流问题的张量恢复法。我们的方法产生一个高维和稀疏的广义多项式混沌展开,提供有用的统计信息。结果还可以加快电力系统中的其他基本例程(例如,随机规划、操作和控制)。我们的方法不是在所有正交点模拟潮流方程,而是只模拟样本的极小子集。我们提出了一个模型,利用底层的低秩和稀疏结构的高维仿真数据阵列,使我们的技术适用于电力系统的许多随机参数。我们还提出了一个数值方法来解决由此产生的非线性优化问题。我们的算法在MATLAB中实现,并在MATPOWER $5.1$的几个基准测试进行了验证。精确的结果得到电力系统的$50$独立的随机参数,与加速因子高达$9\times 10^{20}$。

英文摘要:

This paper presents a tensor-recovery method to solve probabilistic power flow problems. Our approach generates a high-dimensional and sparse generalized polynomial-chaos expansion that provides useful statistical information. The result can also speed up other essential routines in power systems (e.g., stochastic planning, operations and controls). Instead of simulating a power flow equation at all quadrature points, our approach only simulates an extremely small subset of samples. We suggest a model to exploit the underlying low-rank and sparse structure of high-dimensional simulation data arrays, making our technique applicable to power systems with many random parameters. We also present a numerical method to solve the resulting nonlinear optimization problem. Our algorithm is implemented in MATLAB and is verified by several benchmarks in MATPOWER $5.1$. Accurate results are obtained for power systems with up to $50$ independent random parameters, with a speedup factor up to $9\times 10^{20}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑