基于雅可比矩阵逆预处理的快速潮流计算方法

随着电网规模变大，利用稳定双共轭梯度法（Bi-CGSTAB）求解潮流计算中的修正方程组时，收敛速度会变得很慢。通过寻找合适的预处理矩阵是解决问题的关键。研究了雅可比矩阵预处理方法，针对牛顿法求解潮流过程中雅可比矩阵的变化特性，提出将第一次外迭代的雅可比矩阵逆作为预处理矩阵，并与稳定双共轭梯度法相结合，提高潮流计算的收敛速度。借助InterPSS电力系统仿真软件，对IEEE118、IEEE162、IEEE300和一个欧洲大陆真实电力系统进行仿真计算，验证了在处理大规模电网时，所提方法相对稀疏近似逆预处理具备更好的有效性。     

基于MIC的GaBP并行算法

GaBP(Gaussian Belief Propagation)是一种解线性代数方程组的迭代算法,它是基于递归更新的概率推理算法,具有低复杂性和高并行性.MIC是英特尔的至强融核Xeon Phi的Many Integerated Core架构.它提供数百个同时运行的硬件线程,能充分满足对高并发度的大量需求.本文研究了如何高效地求解大规模稀疏线性方程组的并行算法,通过挖掘GaBP算法特性,优化算法存储结构和加速迭代,同时给出了一种求解大规模稀疏对称线性方程组的基于MIC的GaBP并行算法;并从美国Florida.大学开发的稀疏矩阵库(UFget)中抽取了部分大规模对称稀疏矩阵作为算例进行测试,计算结果表明,在相同精度下,基于MIC的GaBP并行算法相对于GaBP算法具有更显著的高效率.     

一类求解非线性奇异方程组的牛顿改进算法

受一个求解非线性奇异方程组迭代格式的启示,将两种牛顿改进算法推广成一般形式,并将其发展为一类求解具有奇异雅可比矩阵的非线性方程组的牛顿改进算法.首先,描述这类新算法的迭代格式,并导出其收敛阶,该新格式每步迭代仅需计算一次函数值和一次导函数值;然后,对测试函数进行检验,并与牛顿算法及其他奇异牛顿算法进行比较,从而验证该算法的快速收敛性;最后,通过两个实际问题验证所提出算法的有效性.     

一类非线性方程组奇异解的计算方法及其应用

针对一类特殊的非线性方程组雅克比矩阵奇异的问题,提出了一种基于对偶空间的牛顿迭代方法。给出了一个显式的计算对偶空间的公式,在此基础上利用对偶空间作用于原方程组构造新的方程,使扩充后的方程组在近似值点的雅可比矩阵满秩,从而恢复牛顿迭代算法的二次收敛性。实验结果表明,改进后的算法一般迭代3次计算精度就可以达到10^(-15)。所提算法丰富了代数几何中关于理想的对偶空间理论,也为工程应用中的数值计算提供了一种新方法。     

ILU预处理Newton-Krylov方法的潮流计算

由于电力系统修正方程组具有高维、稀疏的特点,本文提出将预处理Krylov子空间方法应用于潮流修正方程组的求解,形成预处理Newton-Krylov的潮流计算方法。结合ILU预处理方法,比较了最常用的3类Newton-Krylov方法求解潮流方程的计算效果。通过对 IEEE30、IEEE118、IEEE300 和3个Poland大规模电力系统进行潮流计算,结果表明：3类Newton-Krylov方法是电力系统潮流计算的有效方法,呈现出良好的收敛特性和计算效率。     

一种用于并行电路仿真器的静态负载平衡算法

模拟电路的仿真问题可以最终归结为对线性代数方程组的求解。利用分块化方法可以降低求解过程中雅可比矩阵的维数,从而有效地降低求解时间。但是在矩阵进行划分之后,如何进行负载平衡,则是最终能否有效提高加速比的重要问题。提出了相应的静态负载平衡算法,并使用具体电路应用进行评价,试验证明该负载平衡算法对提高加速比有很好的效果。     

求解非线性方程组的改进不精确雅可比牛顿法

在分析不精确雅可比牛顿法的基础上,进一步研究了不精确雅可比矩阵在精确解附近奇异的求解方法。利用雅可比矩阵与函数自身,在不增加新的计算量前提下,得到改进的求解非线性方程组的不精确雅可比牛顿算法。数值结果表明,改进后算法与原不精确雅可比牛顿法具有相同的计算效率,而且在使用上更为方便,有效。     

放射形配网潮流计算的一种新的牛顿法

前推回推法是放射形配网潮流计算最基本的算法.通过对前推回推法求解过程的数学演化,导出一种新的牛顿类型的算法及其雅可比矩阵直接分解公式.利用比较原理,间接证明该算法是一种具有超线性收敛性的近似牛顿法.与经典牛顿法相比,该算法无须计算雅可比矩阵、无须三角因子分解等过程,直接由前代/回代或回代/前代过程就能完成;与前推回推法相比,该算法无须特定的节点和支路编号过程.文中以一个实际的中等规模配电系统为例,分析、比较前推回推法、导出的近似牛顿法、经典牛顿法等的收敛性和计算速度,证实上述研究结论.     

基于牛顿-拉夫逊电力系统潮流计算的改进算法

牛顿-拉夫逊法是求解非线性代数方程有效的迭代计算方法,广泛应用于现代电力系统安全分析、故障诊断与控制的潮流计算中。为提高牛顿-拉夫逊潮流计算方法的快速性和收敛精度,本文提出一种改进的牛顿-拉夫逊潮流计算法,并通过IEEE14和IEEE30节点测试系统分析表明与传统方法相比该方法所具有的优点。     

改进牛顿法大规模电力系统潮流计算

电网互联导致电力系统规模不断扩大,对牛顿法进行潮流计算提出了更高的要求。探讨5种改进牛顿法应用到大规模电力系统潮流计算中。经IEEE 300、Poland多个互联的大规模电力系统共6个算例分析表明,算法1和算法2改善了初值范围,同样的迭代次数下,收敛精度较经典牛顿法高,但计算时间较经典的牛顿法并未明显提高;算法3和算法4提高潮流计算的速度和收敛精度。经UCTE 1254病态系统测试,算法3较算法5能高效地处理病态潮流问题,因而更适合于大规模电力系统潮流计算。     

On the convergence of a class of generalized steffensen's iterative procedures and error analysis

We consider a class of generalized Steffensen's methods for solving nonlinear equations without any derivative. We establish successful the existence-convergence theorem of generalized Steffensen's iteration under the Kantorovich-Ostrowski's conditions and present an upper bound, but it is not optimal. These conclusions contain the special case of Steffensen's method [6]. In the mean time, we compare the accurate error bound of Newton's method with error bounds of generalized Steffensen's methods, we show that latter is less than former.     

A computing method-based rearrangement of network protocols to improvise quality factors of FACTS devices and sensors using Newton-Raphson technique

The load flow analysis project was carried out using the Newton-Raphson's iteration technique and a multiobjective method was suggested to minimize power loss, increase bus voltage, reduce operating costs, and controlling the flexible AC transmission system (FACTS) controllers. The key focus is to improvise the load sustainability subjected to controlling of system safety, integrity, and stability margins within specified limits by acquiring optimum place, installation expenses for FACTS controllers. It is important to analyze the benefits and architect the FACTS devices for the power steady state analysis. For effective modeling, the five bus standard is analyzed without the FACTS end devices and with the FACTS controllers. Transient voltage is critical which requires accurate and quick response to avoid the voltage collapse and instability issues. The Newton-Raphson's method of load flow analysis is an iterative method which approximates the set of nonlinear simultaneous load flow equations to a set of linear simultaneous load flow equations using Taylor's series expansion and the terms are limited to first order approximation. The variations in voltage are within 5% for a well designated power system. If it exceeds the specified limit then the performance of equipment will be poor and the life of equipment will reduce. Hence the voltage control is very important to improvise the quality factor of the FACTS controllers and devices in power system. The voltage variations in a bus or node are related to reactive power. If the reactive power is injected to a bus is less than reactive power drawn from the FACTS devices, the voltage instability becomes infinite issue causes damage to the controllers and devices. In a load flow problem, two quantities are specified for each bus and the remaining quantities are obtained by the load flow equation analysis using Newton-Raphson method. This method has been tested for IEEE 30 bus system and then the values are compared and analyzed with MATLAB.     

Extended version with the analysis of dynamic system for iterative refinement of solution

The extended version with the analysis of dynamic system for Wilkinson's iteration improvement of solution is presented in this paper. It turns out that the iteration improvement can be viewed as applying explicit Euler method with step size h=1 to a dynamic system which has a unique globally asymptotically stable equilibrium point, that is, the solution x*=A ^?1 b of linear system Ax=b with non-singular matrix A. As a result, an extended iterative improvement process for solving ill-conditioned linear system of algebraic equations with non-singular coefficients matrix is proposed by following the solution curve of a linear system of ordinary differential equations. We prove the unconditional convergence and derive the roundoff results for the extended iterative refinement process. Several numerical experiments are given to show the effectiveness and competition of the extended iteration refinement in comparison with Wilkinson's.     

Computationally efficient simultaneous policy update algorithm for nonlinear H∞ state feedback control with Galerkin's method

The main bottleneck for the application of H_∞ control theory on practical nonlinear systems is the need to solve the Hamilton–Jacobi–Isaacs (HJI) equation. The HJI equation is a nonlinear partial differential equation (PDE) that has proven to be impossible to solve analytically, even the approximate solution is still difficult to obtain. In this paper, we propose a simultaneous policy update algorithm (SPUA), in which the nonlinear HJI equation is solved by iteratively solving a sequence of Lyapunov function equations that are linear PDEs. By constructing a fixed point equation, the convergence of the SPUA is established rigorously by proving that it is essentially a Newton's iteration method for finding the fixed point. Subsequently, a computationally efficient SPUA (CESPUA) based on Galerkin's method, is developed to solve Lyapunov function equations in each iterative step of SPUA. The CESPUA is simple for implementation because only one iterative loop is included. Through the simulation studies on three examples, the results demonstrate that the proposed CESPUA is valid and efficient. Copyright © 2012 John Wiley & Sons, Ltd.     

Numerical computation of cross‐coupled algebraic Riccati equations related to H2/H∞ control problem for singularly perturbed systems

In this paper, we present a numerical algorithm to the cross‐coupled algebraic Riccati equations(CARE) related to H₂/H_∞ control problems for singularly perturbed systems (SPS) by means of Newton's method. The resulting algorithm can be widely used to solve Nash game problems and robust control problems because the CARE is solvable even if the quadratic term has an indefinite sign. We prove that the resulting iterative algorithm has the property of the quadratic convergence. Using the solution of the CARE, we construct the high‐order approximate H₂/H_∞ controller. Copyright © 2004 John Wiley & Sons, Ltd.     

Some new efficient multipoint iterative methods for solving nonlinear systems of equations

It is attempted to put forward a new multipoint iterative method of sixth-order convergence for approximating solutions of nonlinear systems of equations. It requires the evaluation of two vector-function and two Jacobian matrices per iteration. Furthermore, we use it as a predictor to derive a general multipoint method. Convergence error analysis, estimating computational complexity, numerical implementation and comparisons are given to verify applicability and validity for the proposed methods.     

综合能源热力潮流节点标幺值模型及算法实现

潮流计算是综合能源能量管理的基础,已有的综合能源潮流计算模型,采用电力网络节点模型与热力网络回路模型组合,实时潮流计算过程中,要在网络拓扑形成节点之后,搜索供热网络回路,形成多个独立的最小热力回路,在最小回路模型的基础上,做牛顿法潮流计算;为了方便与电网潮流的节点模型组合,提高综合能源潮流计算的算法效率和收敛性能,我们采用热力网络潮流节点标幺值模型,用热力节点的供水温度、回水温度、供水压力、回水压力作为热力网络状态量,用回水、供水节点净注入流量为零、回水、供水节点节点的注入能量为零作为基础模型,采用变尺度算法解热力潮流非线性方程组,只计算一次雅可比矩阵并求逆,通过递推来实现潮流计算,克服了牛顿法需要多次求导求逆的缺点,避免了搜索实时网络的最小回路,方便与电力网络节点模型联合求解,更适合大规模热-电联合系统中的潮流计算。     

Iterative methods for systems of equations with interval coefficients and linear form

We introduce iterative methods for systems of equations with interval coefficients and linear form by suitable matrix splittings. When compared to the iterative methods for systems amenable to iteration introduced in [1], improved convergence and inclusion properties can be proved under suitable conditions. The method can also be used in the solution of specific nonlinear systems of equations by interval arithmetic methods.