@article{ZVMMF_1994_34_8_a0,
author = {V. O. Belash and N. Ya. Mar'yashkin},
title = {The solution of linear algebraic systems by polynomial iterative},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {1123--1132},
year = {1994},
volume = {34},
number = {8},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_8_a0/}
}
TY - JOUR AU - V. O. Belash AU - N. Ya. Mar'yashkin TI - The solution of linear algebraic systems by polynomial iterative JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 1994 SP - 1123 EP - 1132 VL - 34 IS - 8 UR - http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_8_a0/ LA - ru ID - ZVMMF_1994_34_8_a0 ER -
V. O. Belash; N. Ya. Mar'yashkin. The solution of linear algebraic systems by polynomial iterative. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 34 (1994) no. 8, pp. 1123-1132. http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_8_a0/
[1] Lebedev V. I., “Ob iteratsionnykh metodakh resheniya operatornykh uravnenii so spektrom, lezhaschim na neskolkikh otrezkakh”, Zh. vychisl. matem. i matem. fiz., 9.:6 (1969), 1247–1252 | Zbl
[2] Marchuk G. I., Lebedev V. I., Chislennye metody v teorii perenosa neitronov, Atomizdat, M., 1971 | MR | Zbl
[3] Lebedev V. I., “Iteratsionnye metody resheniya lineinykh operatornykh uravnenii i mnogochleny, naimenee otklonyayuschiesya ot nulya”, Matem. analiz i smezhnye voprosy matem., Tr. in-ta matem. SO AN SSSR, Nauka, Novosibirsk, 1978, 89–108
[4] Farkova N. A., “Primenenie mnogochlenov Fabera k resheniyu sistem lineinykh uravnenii”, Zh. vychisl. matem. i matem. fiz., 28:11 (1988), 1634–1648 | MR
[5] Saad Y., “Iterative solution of indefinite symmetric linear systems by methods using orthogonal polynomials over two disjoint intervals”, SIAM J. Numer. Analys., 20:4 (1983), 784–814 | DOI | MR
[6] Smolarski D. C., Saylor P. E., “An optimum iterative method for solving and linear system with a square matrix”, BIT, 28 (1988), 163–178 | DOI | MR | Zbl
[7] Saad Y., Schultz M. H., “GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear system”, SIAM J. Sci. Statist. Comput., 7:3 (1986), 856–869 | DOI | MR | Zbl
[8] Saad Y., “Least square polynomials in the complex plane and their use for solving nonsymmetric linear systems”, SIAM. J. Numer. Analys., 24:1 (1987), 155–169 | DOI | MR | Zbl
[9] Manteuffel T. A., “Adaptive procedure for estimation of parameters for the nonsymmetric Tchebychev iteration”, Numer. Math., 31 (1978), 183–208 | DOI | MR | Zbl
[10] Nodera T., Takahasi H., “Preconditioned conjugate gradient algorithms for nonsymmetric matrix”, Scient. Comput., North-Holland, N. Y. etc., 1983, 173–180 | MR
[11] Lebedev V. I., Finogenov S. A., “Ob odnom algoritme vybora parametrov v chebyshevskikh tsiklicheskikh metodakh”, Vses. sovesch. “Vychisl. metody lineinoi algebry” (Novosibirsk, 1972), 21–27 | Zbl
[12] Belash V. O., Maryashkin N. Ya., Paket programm SLAURM. Reshenie sistem s razrezhennymi matritsami, VTs AN SSSR, M., 1989
[13] Belash V. O., Maryashkin N. Ya., “Reshenie lineinykh sistem iteratsionnymi metodami v podprostranstvakh Krylova”, Vopr. kibernetiki. Prikl. programmnoe obespechenie i modelirovanie supersistem, M., 1991, 61–70 | MR
[14] Kheigeman L., Yang D., Prikladnye iteratsionnye metody, Mir, M., 1986 | MR
[15] Wasserstrom E., McKenna J., “The potential due to a charged metallic strip on a semiconductor surface”, Bell System. Techn. J., 49:5 (1970), 853–877
[16] Maryashkin H. Ya., Reshenie nelineinykh ellipticheskikh kraevykh zadach metodom konechnykh elementov, VTs AN SSSR, M., 1988
[17] Sloan S. W., “A fast algorithm for constructing Delauney triangulations in the plane”, Advances Ens. Software, 9:1 (1987), 34–55 | DOI | Zbl
[18] Miller J. J. H., “On a Petrov–Galerkin method for the electrical and thermal behaviour of semiconductors in devices two dimension”, Math. Comput. in Simulations, 29:5 (1987), 367–372 | DOI | MR