Geodesic
An efficient algorithm for elliptic problems with large parameters
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 40 (2000) no. 3, pp. 402-415 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2000_40_3_a6,
     author = {K. Yu. Bogach\"ev},
     title = {An efficient algorithm for elliptic problems with large parameters},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {402--415},
     year = {2000},
     volume = {40},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_3_a6/}
}
TY  - JOUR
AU  - K. Yu. Bogachëv
TI  - An efficient algorithm for elliptic problems with large parameters
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2000
SP  - 402
EP  - 415
VL  - 40
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_3_a6/
LA  - ru
ID  - ZVMMF_2000_40_3_a6
ER  - 
%0 Journal Article
%A K. Yu. Bogachëv
%T An efficient algorithm for elliptic problems with large parameters
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2000
%P 402-415
%V 40
%N 3
%U http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_3_a6/
%G ru
%F ZVMMF_2000_40_3_a6
K. Yu. Bogachëv. An efficient algorithm for elliptic problems with large parameters. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 40 (2000) no. 3, pp. 402-415. http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_3_a6/

[1] Kobelkov G. M., O reshenii ellipticheskikh uravnenii s silno menyayuschimisya koeffitsientami, Preprint No 145, OVM AN SSSR, M., 1987 | MR

[2] Kobelkov G. M., “Fictitious domain method and the solution of elliptic equations with highly varying coefficients”, Soviet J. Numer. Analys. and Math. Modelling, 2:6 (1987), 407–418 | DOI | MR

[3] Bakhvalov H. C., Kobelkov G. M., Chizhonkov E. B., Iteratsionnyi metod resheniya ellipticheskikh zadach so skorostyu skhodimosti, ne zavisyaschei ot razbrosa koeffitsientov, Preprint No 190, OVM AN SSSR, M., 1988 | MR

[4] Kobelkov G. M., “On the solution of the boundary value problem for the diffusion equation with highly varying coefficients”, Soviet J. Numer. Analys. and Math. Modelling, 11:6 (1996), 487–496 | DOI | MR

[5] Bakhvalov H. C., “Numerical-asymptotic methods in mechanics of composite materials”, ENUMATH 97, Proc. Sec. European Conf. Numer. Math. and Advanced Applic, World Scient. Publ. Co., Singapore etc., 1998, 3–16 | MR | Zbl

[6] Kuznetsov Yu. A., “Vychislitelnye metody v podprostranstvakh”, Vychisl. protsessy i sistemy, 2, Nauka, M., 1985, 265–350

[7] Abramov N. N., Kucherenko V. V., “Algoritm chislennogo resheniya zadachi Dirikhle”, Dokl. AN SSSR, 305:3 (1989), 521–525 | MR

[8] Bogachev K. Yu., “On algorithm for efficient solving stiff elliptic problems with large parameters”, Rus. J. Numer. Analys. and Math. Modelling, 14:6 (1999), 1–15 | MR

[9] Matsokin A. M., Avtomaticheskaya triangulyatsiya oblastei s gladkoi granitsei dlya resheniya ellipticheskikh uravnenii, Preprint No 15, VTs SO AN SSSR, Novosibirsk, 1975

[10] Bórgers C., Widlund O. B., “On finite element domain imbedding methods”, SIAM J. Numer. Analys., 27:4 (1990), 962–978 | DOI | MR

[11] Widlund O. B., “A triangulation algorithm for fast elliptic solvers based on domain imbedding”, SIAM J. Numer. Analys., 27:5 (1990), 1187–1196 | DOI | MR

[12] Dyakonov E. G., Minimizatsiya vychislitelnoi raboty, Nauka, M., 1989 | MR

[13] Queck W., “The convergence factor of preconditioned algorithms ot the Arrow–Hurwitch type”, SIAM J. Numer. Analys., 26:4 (1989), 1016–1030 | DOI | MR | Zbl

[14] Samarskii A. A., Nikolaev E. C., Metody resheniya setochnykh uravnenii, Nauka, M., 1978 | MR