Unconventional analogs of single-parametric method of iterational aggregation


  • I.I. Demkiv Lviv Polytechnic National University, 12 Bandera str., 79013, Lviv, Ukraine
  • M.I. Kopach Vasyl Stefanyk Precarpathian National University, 57 Shevchenka str., 76018, Ivano-Frankivsk, Ukraine
  • A.F. Obshta Lviv Polytechnic National University, 12 Bandera str., 79013, Lviv, Ukraine
  • B.A. Shuvar Lviv Polytechnic National University, 12 Bandera str., 79013, Lviv, Ukraine


aggregating functional, decomposition, iterative aggregation
Published online: 2018-12-31


When we solve practical problems that arise, for example, in mathematical economics, in the theory of Markov processes, it is often necessary to use the decomposition of operator equations using methods of iterative aggregation. In the studies of these methods for the linear equation $x=Ax+b$ the most frequent are the conditions of positiveness of the operator $A$, constant $b$ and the aggregation functions, and also the implementation of the inequality $\rho(A) <1$ for the spectral radius $\rho(A)$ of the operator $A$.

In this article for an approximate solution of a system composed of the equation $x = Ax + b$ represented in the form $ x = A_1x + A_2x + b, $ where $ b \in E, $ $ E $ is a Banach space, $ A_1, A_2 $ are linear continuous operators that act from $ E $ to $ E $ and the auxiliary equation $ y = \lambda y - (\varphi, A_2x) - (\varphi, b) $ with a real variable $ y $, where $ (\varphi, x) $ is the value of the linear functional $ \varphi \in E ^ * $ on the elements $ x \in E $, $ E^* $ is conjugation with space $ E $, an iterative process is constructed and investigated \begin{equation*} \begin{split} x^{(n+1)}&=Ax^{(n)}+b+\frac{\sum\limits_{i=1}^{m}A^i_1x^{(n)}}{(\varphi, x^{(n)})\sum\limits_{i=0}^{m}\lambda^i}(y^{(n)}-y^{(n+1)}) \quad (m<\infty),\\ y^{(n+1)}&=\lambda y^{(n+1)}-(\varphi,A_2x^{(n)})-(\varphi,b). \end{split} \end{equation*}

The conditions are established under which the sequences $ {x ^ {(n)}}, {y ^ {(n)}}$, constructed with the help of these formulas, converge to $ x ^ *, y ^ * $ as a component of solving the system constructed from equations $ x = A_1 x + A_2 x + b $ and the equation $ y = \lambda y - (\varphi, A_2 x) - (\varphi, b) $ not slower than the rate of convergence of the geometric progression with the denominator less than $1$. In this case, it is required that the operator $ A $ be a compressive and constant by sign, and that the space $ E $ is semi-ordered. The application of the proposed algorithm to systems of linear algebraic equations is also shown.

Article metrics
How to Cite
Demkiv, I.; Kopach, M.; Obshta, A.; Shuvar, B. Unconventional Analogs of Single-Parametric Method of Iterational Aggregation. Carpathian Math. Publ. 2018, 10, 296-302.

Most read articles by the same author(s)

1 2 > >>