Convergence of an asynchronous iterative algorithm

@article{Gubareni_2009,
   url = {http://amcm.pcz.pl/get.php?article=2009_2/art_07.pdf},
   year = 2009,
   publisher = {The Publishing Office of Czestochowa University of Technology},
   volume = {8},
   number = {2},
   pages = {47--57},
   author = {Nadiya Gubareni},
   title = {Convergence of an asynchronous iterative algorithm},
   journal = {Scientific Research of the Institute of Mathematics and Computer Science}
}

TY  - JOUR
DO  - 
UR  - http://amcm.pcz.pl/get.php?article=2009_2/art_07.pdf
TI  - Convergence of an asynchronous iterative algorithm
T2  - Scientific Research of the Institute of Mathematics and Computer Science
JA  - Sci Res Inst Math Comput Sci
AU  - Gubareni, Nadiya
PY  - 2009
PB  - The Publishing Office of Czestochowa University of Technology
SP  - 47
EP  - 57
IS  - 2
VL  - 8
SN  - 1731-5417
ER  - 

Gubareni, N. (2009). Convergence of an asynchronous iterative algorithm. Scientific Research of the Institute of Mathematics and Computer Science, 8(2), 47-57.

Gubareni, N., 2009. Convergence of an asynchronous iterative algorithm. Scientific Research of the Institute of Mathematics and Computer Science, 8(2), pp.47-57. Available at: http://amcm.pcz.pl/get.php?article=2009_2/art_07.pdf

[1]N. Gubareni, "Convergence of an asynchronous iterative algorithm," Scientific Research of the Institute of Mathematics and Computer Science, vol. 8, no. 2, pp. 47-57, 2009.

Gubareni, Nadiya. "Convergence of an asynchronous iterative algorithm." Scientific Research of the Institute of Mathematics and Computer Science 8.2 (2009): 47-57. CrossRef. Web.

1. Gubareni N. Convergence of an asynchronous iterative algorithm. Scientific Research of the Institute of Mathematics and Computer Science. The Publishing Office of Czestochowa University of Technology; 2009;8(2):47-57. Available from: http://amcm.pcz.pl/get.php?article=2009_2/art_07.pdf

Gubareni, Nadiya. "Convergence of an asynchronous iterative algorithm." Scientific Research of the Institute of Mathematics and Computer Science 8, no. 2 (2009): 47-57.