Convergence analysis of the triangular-based power flow method for AC distribution grids

<p>This paper addresses the convergence analysis of the triangular-based power flow (PF) method in alternating current radial distribution networks. The PF formulation is made via upper-triangular matrices, which enables finding a general iterative PF formula that does not require admittance matrix calculations. The convergence analysis of this iterative formula is carried out by applying the Banach fixed-point theorem (BFPT), which allows demonstrating that under an adequate voltage profile the triangular-based PF always converges. Numerical validations are made, on the well-known 33 and 69 distribution networks test systems. Gauss-seidel, newton-raphson, and backward/forward PF methods are considered for the sake of comparison. All the simulations are carried out in MATLAB software.</p>

Design and analysis of a faster King-Werner-type derivative free method

We introduce a new faster King-Werner-type derivative-free method for solving nonlinear equations. The local as well as semi-local convergence analysis is presented under weak center Lipschitz and Lipschitz conditions. The convergence order as well as the convergence radii are also provided. The radii are compared to the corresponding ones from similar methods. Numerical examples further validate the theoretical results.

Convergence analysis of two finite element methods for the modified Maxwell's Steklov eigenvalue problem

The modified Maxwell's Steklov eigenvalue problem is a new problem arising from the study of inverse electromagnetic scattering problems. In this paper, we investigate two finite element methods for this problem and perform the convergence analysis. Moreover, the monotonic convergence of the discrete eigenvalues computed by one of the methods is analyzed.

$$\alpha $$-Firmly nonexpansive operators on metric spaces

We extend to p-uniformly convex spaces tools from the analysis of fixed point iterations in linear spaces. This study is restricted to an appropriate generalization of single-valued, pointwise averaged mappings. Our main contribution is establishing a calculus for these mappings in p-uniformly convex spaces, showing in particular how the property is preserved under compositions and convex combinations. This is of central importance to splitting algorithms that are built by such convex combinations and compositions, and reduces the convergence analysis to simply verifying that the individual components have the required regularity pointwise at fixed points of the splitting algorithms. Our convergence analysis differs from what can be found in the previous literature in that the regularity assumptions are only with respect to fixed points. Indeed we show that, if the fixed point mapping is pointwise nonexpansive at all cluster points, then these cluster points are in fact fixed points, and convergence of the sequence follows. Additionally, we provide a quantitative convergence analysis built on the notion of gauge metric subregularity, which we show is necessary for quantifiable convergence estimates. This allows one for the first time to prove convergence of a tremendous variety of splitting algorithms in spaces with curvature bounded from above.

A Forward-Backward-Forward Algorithm for Solving Quasimonotone Variational Inequalities

In this paper, we continue to investigate the convergence analysis of Tseng-type forward-backward-forward algorithms for solving quasimonotone variational inequalities in Hilbert spaces. We use a self-adaptive technique to update the step sizes without prior knowledge of the Lipschitz constant of quasimonotone operators. Furthermore, we weaken the sequential weak continuity of quasimonotone operators to a weaker condition. Under some mild assumptions, we prove that Tseng-type forward-backward-forward algorithm converges weakly to a solution of quasimonotone variational inequalities.