| 摘要: |
| 本文研究了Gauss信念传播算法在具有多个子系统的线性系统中的加速问题.利用深度优先遍历算法来减少Gauss信念传播算法在这一类线性系统中的计算复杂度,得到了DFS-GaBP算法.同时我们获得了DFS-GaBP算法在子系统上的收敛结果.我们的计算结果表明,对比传统算法,DFS-GaBP算法在具有多个子系统的线性系统中表现出更优的性能. |
| 关键词: Gauss信念传播算法 深度优先遍历 子系统 弱连通分量 |
| DOI： |
| 分类号:O241.4 |
| 基金项目:江苏省创新训练计划资助(202410287190Y). |
|
| RESEARCH ON OPTIMIZATION OF GABP ALGORITHM BASED ON DFS |
|
QIU De-zhi, CHEN Si-yuan
|
|
School of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
|
| Abstract: |
| This paper investigates the acceleration of the Gaussian belief propagation (GaBP) algorithm in linear systems with multiple subsystems. By utilizing a depth-first search (DFS) algorithm to reduce the computational complexity of the GaBP algorithm in such linear systems, we obtain the DFS-GaBP algorithm. Meanwhile, we derive convergence results for the DFS-GaBP algorithm on the subsystems. Our computational results demonstrate that, compared to traditional algorithms, the DFS-GaBP algorithm exhibits superior performance in linear systems with multiple subsystems. |
| Key words: gaussian belief propagation depth-first search subsystem weak connected components |
