1) blocked Gauss Elimination algorithm
高斯消去法的分块算法
1.
The paper analyzes the parallel algorithm design schemes for a new architecture of supernodes,discusses different methods of data distribution and task partition in detail,gives an example,namely the blocked Gauss Elimination algorithm,and points out how to develop parallel algorithms for supernodes based on the existing shared and distributed algorithms.
本文分析了超节点这一新型体系结构上的算法设计方法 ,并具体讨论了超节点上的数据分配和任务划分 ,最后举出一个实例—高斯消去法的分块算法 ,提出了如何在现有共享算法和分布算法的基础上 ,开发超节点上的并行算法。
2) Gaussian elimination algorithm
高斯消去算法
3) block elimination algorithm
块消去算法
1.
The solution of the bordered linear systems required in Newton’s method to solve the minimally extended system was realized by block elimination algorithm,thus sparsity of Jacobian matrix of power flow equations could be fully exploited to enhance calculation efficiency.
在牛顿迭代求解极小扩张系统的过程中,采用块消去算法求解加边矩阵方程,充分利用潮流雅可比矩阵稀疏的特点来提高计算效率。
4) gaussian elimination
高斯消去法
5) Gauss elimination method
高斯消去法
1.
Taking the uncertainty of injected node active power into account, interval linear equations are solved with interval Gauss elimination method in the proposed algorithm.
该算法考虑了节点注入有功功率的不确定性,采用区间高斯消去法求解区间线性方程组,得到母线电压相角和支路有功功率的上下限,即区间潮流方程的区间解。
2.
With the polar coordinates and the objective function of minimal generation cost, this algorithm deals with constraint conditions by slack variables, establishes the Lagrange Function with primal variables and dual ones and solves the correction equation of Newton Method with Gauss Elimination Method.
该算法采用极坐标形式表达,以发电总费用最小为目标函数,利用松弛变量处理不等式约束条件,使用原对偶变量建立拉格朗日函数,根据KKT最优条件,通过列选高斯消去法求解牛顿法中的修正方程式。
6) Gaussian elimination parallel algorithm
高斯消去并行算法
补充资料：高斯消去法
见消元法。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条