Displaying similar documents to “Numerical analysis of coupling for a kinetic equation”

Some results on convergence acceleration for the E-algorithm

A. Fdil (1997)

Applicationes Mathematicae

Similarity:

Some new results on convergence acceleration for the E-algorithm which is a general extrapolation method are obtained. A technique for avoiding numerical instability is proposed. Some applications are given. Theoretical results are illustrated by numerical experiments

Convergence acceleration by the E + p -algorithm

A. Fdil (1998)

Applicationes Mathematicae

Similarity:

A new algorithm which generalizes the E-algorithm is presented. It is called the E + p -algorithm. Some results on convergence acceleration for the E + p -algorithm are proved. Some applications are given.

Multi-agent network flows that solve linear complementarity problems

Shu Liang, Xianlin Zeng (2018)

Kybernetika

Similarity:

In this paper, we consider linear complementarity problems with positive definite matrices through a multi-agent network. We propose a distributed continuous-time algorithm and show its correctness and convergence. Moreover, with the help of Kalman-Yakubovich-Popov lemma and Lyapunov function, we prove its asymptotic convergence. We also present an alternative distributed algorithm in terms of an ordinary differential equation. Finally, we illustrate the effectiveness of our method by...

The classic differential evolution algorithm and its convergence properties

Roman Knobloch, Jaroslav Mlýnek, Radek Srb (2017)

Applications of Mathematics

Similarity:

Differential evolution algorithms represent an up to date and efficient way of solving complicated optimization tasks. In this article we concentrate on the ability of the differential evolution algorithms to attain the global minimum of the cost function. We demonstrate that although often declared as a global optimizer the classic differential evolution algorithm does not in general guarantee the convergence to the global minimum. To improve this weakness we design a simple modification...

A modified algorithm for the strict feasibility problem

D. Benterki, B. Merikhi (2010)

RAIRO - Operations Research

Similarity:

In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.