Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Chizhonkov E. V., Relaksatsionnye metody resheniya sedlovykh zadach, IVM RAN, M., 2002
[2] Marchuk G. I., Lebedev V. I., Chislennye metody v teorii perenosa neitronov, Atomizdat, M., 1981 | MR
[3] Dyakonov E. G., “O nekotorykh klassakh sedlovykh gradientnykh metodov”, Vychisl. protsessy i sistemy, 5 (1987), 101–115 | MR
[4] Bank R. E., Welfert B. D., Yserentant H., “A class of iterative methods for solving saddle point problems”, Numer. Math., 56 (1990), 645–666 | DOI | MR | Zbl
[5] Vassilevski P. S., Lazarov R. D., “Preconditioning mixed finite element saddle-point elliptic problems”, Numer. Linear Algebra Appl., 1 (1994), 1–20 | DOI | MR
[6] Braess D., Sarazin R., “An efficient smoother for the Stokes problem”, Appl. Numer. Math., 23 (1997), 3–19 | DOI | MR | Zbl
[7] Zulehner W., “Analysis of iterative methods for saddle point problems: a unified approach”, Math. Comput., 71:238 (2002), 479–505 | MR | Zbl
[8] Gorelova M. B., Chizhonkov E. V., “O reshenii sedlovykh zadach metodami s modelnymi sedlovymi operatorami na verkhnem sloe”, Izv. vuzov. Matematika, 2003, no. 8, 19–27 | MR | Zbl
[9] Bychenkov Yu. V., “Optimizatsiya predobuslovlennykh metodov dlya sedlovykh zadach”, Dokl. RAN, 384:4 (2002), 439–441 | MR | Zbl
[10] Chizhonkov E. V., “Ob uskorenii skhodimosti metoda Lantsosha dlya zadach s sedlovoi tochkoi”, Zh. vychisl. matem. i matem. fiz., 42:4 (2002), 504–513 | MR | Zbl