Search results for "convergence"
showing 10 items of 655 documents
Maximale Konvergenzordnung bei der numerischen Lösung von Anfangswertproblemen mit Splines
1982
In [10] a general procedureV is presented to obtain spline approximations by collocation for the solutions of initial value problems for first order ordinary differential equations. In this paper the attainable order of convergence with respect to the maximum norm is characterized in dependence of the parameters involved inV; in particular the appropriate choice of the collocation points is considered.
A Computational Technique for Solving Singularly Perturbed Delay Partial Differential Equations
2021
Abstract In this work, a matrix method based on Laguerre series to solve singularly perturbed second order delay parabolic convection-diffusion and reaction-diffusion type problems involving boundary and initial conditions is introduced. The approximate solution of the problem is obtained by truncated Laguerre series. Moreover convergence analysis is introduced and stability is explained. Besides, a test case is given and the error analysis is considered by the different norms in order to show the applicability of the method.
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets
2000
We investigate the computational properties of finite binary- and analog-state discrete-time symmetric Hopfield nets. For binary networks, we obtain a simulation of convergent asymmetric networks by symmetric networks with only a linear increase in network size and computation time. Then we analyze the convergence time of Hopfield nets in terms of the length of their bit representations. Here we construct an analog symmetric network whose convergence time exceeds the convergence time of any binary Hopfield net with the same representation length. Further, we prove that the MIN ENERGY problem for analog Hopfield nets is NP-hard and provide a polynomial time approximation algorithm for this p…
Optimal nonlinear damping control of second-order systems
2020
Novel nonlinear damping control is proposed for the second-order systems. The proportional output feedback is combined with the damping term which is quadratic to the output derivative and inverse to the set-point distance. The global stability, passivity property, and convergence time and accuracy are demonstrated. Also the control saturation case is explicitly analyzed. The suggested nonlinear damping is denoted as optimal since requiring no design additional parameters and ensuring a fast convergence, without transient overshoots for a non-saturated and one transient overshoot for a saturated control configuration.
Learning Automata-based Misinformation Mitigation via Hawkes Processes
2021
AbstractMitigating misinformation on social media is an unresolved challenge, particularly because of the complexity of information dissemination. To this end, Multivariate Hawkes Processes (MHP) have become a fundamental tool because they model social network dynamics, which facilitates execution and evaluation of mitigation policies. In this paper, we propose a novel light-weight intervention-based misinformation mitigation framework using decentralized Learning Automata (LA) to control the MHP. Each automaton is associated with a single user and learns to what degree that user should be involved in the mitigation strategy by interacting with a corresponding MHP, and performing a joint ra…
Synthetic Genes for artificial ants. Diversity in ant colony optimization algorithms
2010
Inspired from the fact that the real world ants from within a colony are not clones (although they may look alike, they are different from one another), in this paper, the authors are presenting an adapted ant colony optimisation (ACO) algorithm that incorporates methods and ideas from genetic algorithms (GA). Following the first (introductory) section of the paper is presented the history and the state of the art, beginning with the stigmergy and genetic concepts and ending with the latest ACO algorithm variants as multiagent systems (MAS). The rationale and the approach sections are aiming at presenting the problems with current stigmergy-based algorithms and at proposing a (possible - ye…
A mixed finite element method for the heat flow problem
1981
A semidiscrete finite element scheme for the approximation of the spatial temperature change field is presented. The method yields a better order of convergence than the conventional use of linear elements.
Performance of power control in inter-cell interference coordination for frequency reuse
2010
To mitigate inter-cell interference in 3G evolution systems, a novel inter-cell interference coordination scheme called soft fractional frequency reuse is proposed in this article, which enables to improve the data rate in cell-edge. On this basis, an inter-cell power control is presented for the inter-cell interference coordination, and the inter-cell balanced signal to interference plus noise ratio (SINR) among users is established for power allocation, which enables mitigation of inter-cell interference. Especially, the power control is based on a novel exponential kernel equation at higher convergence speed than the traditional arithmetic kernel equations. Numerical results show that th…
An efficient distributed algorithm for generating and updating multicast trees
2006
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…
REPEATED GAMES WITH PROBABILISTIC HORIZON
2005
Repeated games with probabilistic horizon are defined as those games where players have a common probability structure over the length of the game's repetition, T. In particular, for each t, they assign a probability pt to the event that "the game ends in period t". In this framework we analyze Generalized Prisoners' Dilemma games in both finite stage and differentiable stage games. Our construction shows that it is possible to reach cooperative equilibria under some conditions on the distribution of the discrete random variable T even if the expected length of the game is finite. More precisely, we completely characterize the existence of sub-game perfect cooperative equilibria in finite s…