Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Dyakonov E. G., Minimizatsiya vychislitelnoi raboty. Asimptoticheski optimalnye algoritmy dlya ellipticheskikh zadach, Nauka, M., 1989 | MR
[2] Brezzi F., Fortin M., Mixed and hybrid finite element methods, Springer, New York, 1991 | MR | Zbl
[3] Errou K., Gurvits L., Udzava X., Issledovaniya po lineinomu i nelineinomu programmirovaniyu, Izd-vo inostr. lit., M., 1962
[4] Temam R., Uravneniya Nave–Stoksa. Teoriya i chislennyi analiz, Mir, M., 1981 | MR | Zbl
[5] Queck W., “The convergence factor of preconditioned algorithms of the Arrow–Hurwicz type”, SIAM J. Number. Analys., 26:4 (1989), 1016–1030 | DOI | MR | Zbl
[6] Parlett B., Simmetrichnaya problema sobstvennykh znachenii, Mir, M., 1983 | MR | Zbl
[7] Khorn R., Dzhonson Ch., Matrichnyi analiz, Mir, M., 1989 | MR
[8] Bakhvalov N. S., Zhidkov N. P., Kobelkov G..M., Chislennye metody, Nauka, M., 1987 | MR | Zbl
[9] Samarskii A. A., Nikolaev E. S., Metody resheniya setochnykh uravnenii, Nauka, M., 1978 | MR
[10] Chizhonkov E. V., “O skhodimosti odnogo algoritma dlya resheniya zadachi Stoksa”, Vestn. MGU. Ser. 15. Vychisl. matem. i kibernetika, 1995, no. 2, 12–17 | MR | Zbl