scholarly journals Distribution of postcritically finite polynomials Ⅱ: Speed of convergence

2017 ◽  
Vol 11 (1) ◽  
pp. 57-98 ◽  
Author(s):  
Thomas Gauthier ◽  
◽  
Gabriel Vigny
Keyword(s):  
Speed Of Convergence ◽  
Postcritically Finite

Factual Power Loss Diminution by Enhanced Frog Leaping Algorithm

2020 ◽  
Vol 3 (2) ◽  
pp. 114-118
Author(s):  
Kanagasabai Lenin
Keyword(s):  
Local Search ◽  
Power Loss ◽  
Reactive Power ◽  
Test System ◽  
Premature Convergence ◽  
Speed Of Convergence ◽  
Real Power ◽  
The Real ◽  
Simulation Results ◽  
Power Problem

This paper proposes Enhanced Frog Leaping Algorithm (EFLA) to solve the optimal reactive power problem. Frog leaping algorithm (FLA) replicates the procedure of frogs passing though the wetland and foraging deeds. Set of virtual frogs alienated into numerous groups known as “memeplexes”. Frog’s position’s turn out to be closer in every memeplex after few optimization runs and certainly, this crisis direct to premature convergence. In the proposed Enhanced Frog Leaping Algorithm (EFLA) the most excellent frog information is used to augment the local search in each memeplex and initiate to the exploration bound acceleration. To advance the speed of convergence two acceleration factors are introduced in the exploration plan formulation. Proposed Enhanced Frog Leaping Algorithm (EFLA) has been tested in standard IEEE 14,300 bus test system and simulation results show the projected algorithm reduced the real power loss considerably.

scholarly journals Fractional Newton–Raphson Method Accelerated with Aitken’s Method

Axioms ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 47
Author(s):  
A. Torres-Hernandez ◽  
F. Brambila-Paz ◽  
U. Iturrarán-Viveros ◽  
R. Caballero-Cruz
Keyword(s):  
Fractional Derivative ◽  
Iterative Methods ◽  
Fractional Integral ◽  
Order Of Convergence ◽  
Fractional Operators ◽  
Speed Of Convergence ◽  
Newton Raphson ◽  
Raphson Method

In the following paper, we present a way to accelerate the speed of convergence of the fractional Newton–Raphson (F N–R) method, which seems to have an order of convergence at least linearly for the case in which the order α of the derivative is different from one. A simplified way of constructing the Riemann–Liouville (R–L) fractional operators, fractional integral and fractional derivative is presented along with examples of its application on different functions. Furthermore, an introduction to Aitken’s method is made and it is explained why it has the ability to accelerate the convergence of the iterative methods, in order to finally present the results that were obtained when implementing Aitken’s method in the F N–R method, where it is shown that F N–R with Aitken’s method converges faster than the simple F N–R.

scholarly journals Wage bargaining as an optimal control problem: a dynamic version of the efficient bargaining model

2021 ◽  
Author(s):  
Marco Guerrazzi
Keyword(s):  
Optimal Control ◽  
Continuous Time ◽  
Bargaining Power ◽  
Wage Bargaining ◽  
Bargaining Model ◽  
Speed Of Convergence ◽  
Wage Setting ◽  
Dynamic Version ◽  
Efficient Bargaining ◽  
Over Time

AbstractIn this paper, I develop a dynamic version of the efficient bargaining model grounded on optimal control in which a firm and a union bargain over the wage in a continuous-time environment under the supervision of an infinitely lived mediator. Overturning the findings achieved by means of a companion right-to-manage framework, I demonstrate that when employment is assumed to adjust itself with some attrition in the direction of the contract curve implied by the preferences of the two bargainers, increases in the bargaining power of the firm (union) accelerate (delay) the speed of convergence towards the stationary solution. In addition, confirming the reversal of the results obtained when employment moves over time towards the firm’s labour demand, I show that the dynamic negotiation of wages tends to penalize unionized workers and favour the firm with respect to the bargaining outcomes retrieved with a similar static wage-setting model.

scholarly journals On the speed of convergence of Newton’s method for complex polynomials

2015 ◽  
Vol 85 (298) ◽  
pp. 693-705 ◽  
Author(s):  
Todor Bilarev ◽  
Magnus Aspenberg ◽  
Dierk Schleicher
Keyword(s):  
Newton’S Method ◽  
Newton's Method ◽  
Speed Of Convergence ◽  
Complex Polynomials

scholarly journals Improving Computational Efficiency in Crowded Task Allocation Games with Coupled Constraints

2019 ◽  
Vol 9 (10) ◽  
pp. 2117
Author(s):  
Ming Chong Lim ◽  
Han-Lim Choi
Keyword(s):  
Task Allocation ◽  
Random Sampling ◽  
Scheduling Algorithm ◽  
Stochastic Algorithm ◽  
Speed Of Convergence ◽  
Temporal Dependence ◽  
Real World Applications ◽  
Coupled Constraints ◽  
Multi Agent ◽  
Feasible Solutions

Multi-agent task allocation is a well-studied field with many proven algorithms. In real-world applications, many tasks have complicated coupled relationships that affect the feasibility of some algorithms. In this paper, we leverage on the properties of potential games and introduce a scheduling algorithm to provide feasible solutions in allocation scenarios with complicated spatial and temporal dependence. Additionally, we propose the use of random sampling in a Distributed Stochastic Algorithm to enhance speed of convergence. We demonstrate the feasibility of such an approach in a simulated disaster relief operation and show that feasibly good results can be obtained when the confirmation and sample size requirements are properly selected.

Study on Tabu Search Algorithm for Multi-Cargo Loading Problem

2012 ◽  
Vol 178-181 ◽  
pp. 1802-1805
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Initial Solution ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Search Efficiency ◽  
Speed Of Convergence ◽  
Neighborhood Structure ◽  
Loading Problem

The paper is focused on the Multi-cargo Loading Problem (MCLP). Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the construct initial solution to construct neighborhood structure. For the operation, 1-move and 2-opt were applied, it can also fasten the speed of convergence, and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples.

Salary Cap, Organizational Gap, and Catch-up in the Performance of NBA Teams: A Two-Stage DEA Model Under Heterogeneity

2021 ◽  
pp. 152700252110222
Author(s):  
Nikos Chatzistamoulou ◽  
Kounetas Kostas ◽  
Antonakis Theodor
Keyword(s):  
Policy Implementation ◽  
Convergence Analysis ◽  
Organizational Structures ◽  
National Basketball Association ◽  
Speed Of Convergence ◽  
Two Stage ◽  
Different Types ◽  
Catch Up ◽  
Overall Efficiency ◽  
Salary Cap

This paper evaluates National Basketball Association teams performance using a two-stage approach under a metafrontier framework. Our approach decomposes overall efficiency into salary-cap and on-court efficiency. Organizational gaps between different organizational structures are calculated as well. The introduction of the salary cap as an important element for a competitive market preventing monopoly formation allows the examination of the effects on different types of performance. Findings reveal that teams experience increased performance while organizational gaps decline. Moreover, a [Formula: see text] and [Formula: see text] convergence analysis reveals convergence patterns. Finally, the catch-up index denotes that the speed of convergence increases, especially after the salary cap policy implementation.

Sign in / Sign up

Export Citation Format

Share Document