几种Krylov迭代法在潮流计算中的对比  

Comparison of Several Krylov Iterative Methods in Power Flow Calculation

作　　者：郑锦辉[1] 陆达[1] 

机构地区：[1]厦门大学信息科学与技术学院,福建厦门361005

出　　处：《计算机与现代化》2011年第4期4-6,共3页Computer and Modernization

摘　　要：在潮流计算时,绝大部分时间都用在求解大规模稀疏线性方程组Ax=b上。众多文献中运用的迭代法并不统一,它们只注重预处理方法的改进。本文就针对几种流行的Krylov迭代法进行详细介绍,总结特性,并利用实验来分析它们总的FLOPS值和收敛效率。最后,通过评估算法的计算效率,得出一种比较适合潮流计算的Krylov迭代法。While doing power flow calculation,most of running time spends on calculating large-scale sparse linear equations Ax=b.Applied iterative methods aren＇t unified in many documents,which focus only on improving the preconditioning.This paper introduces some kinds of popular Krylov iterative methods in detail,summarizes their characteristics and analyses their FLOPS and the convergence efficiency with experiments.Finally,through evaluating the computational efficiency,the most suitable Krylov iterative method for power flow calculation is be obtained.

关 键 词：CG GMRES BCG QMR 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]