Geodesic
A domain partitioning algorithm without subdomain overlap for solving parabolic equations
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 32 (1992) no. 11, pp. 1744-1755 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1992_32_11_a5,
     author = {Yu. M. Laevsky},
     title = {A domain partitioning algorithm without subdomain overlap for solving parabolic equations},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1744--1755},
     year = {1992},
     volume = {32},
     number = {11},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_11_a5/}
}
TY  - JOUR
AU  - Yu. M. Laevsky
TI  - A domain partitioning algorithm without subdomain overlap for solving parabolic equations
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1992
SP  - 1744
EP  - 1755
VL  - 32
IS  - 11
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_11_a5/
LA  - ru
ID  - ZVMMF_1992_32_11_a5
ER  - 
%0 Journal Article
%A Yu. M. Laevsky
%T A domain partitioning algorithm without subdomain overlap for solving parabolic equations
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1992
%P 1744-1755
%V 32
%N 11
%U http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_11_a5/
%G ru
%F ZVMMF_1992_32_11_a5
Yu. M. Laevsky. A domain partitioning algorithm without subdomain overlap for solving parabolic equations. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 32 (1992) no. 11, pp. 1744-1755. http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_11_a5/

[1] Laevskii Yu. M., “Metody razbieniya oblasti pri reshenii dvumernykh parabolicheskikh uravnenii”, Variatsionno-raznostnye metody v zadachakh chisl. analiza, VTs SO AN SSSR, Novosibirsk, 1987, 112–128

[2] Vabischevich P. N., “Raznostnye skhemy dekompozitsii raschetnoi oblasti pri reshenii nestatsionarnykh zadach”, Zh. vychisl. matem. i matem. fiz., 29:12 (1989), 1822–1829

[3] Dryja M., Substructuring methods for parabolic problems, Techn. Rept. 529, N. Y. Univ. Comput. Sci. Dept., N. Y., 1990

[4] Laevsky Yu. M., “Quadratic elements in splitting methods”, Sovjet J. Numer. Analys. and Math. Modelling, 5:2 (1990), 157–172 | DOI | MR | Zbl

[5] Kuznetsov Yu. A., “New algoritms for approximate realization of implicit difference schemes”, Sovjet J. Numer. Analys. and Math. Modelling, 3:2 (1988), 99–114 | DOI | MR | Zbl

[6] Samarskii A. A., Vvedenie v teoriyu raznostnykh skhem, Nauka, M., 1971 | MR | Zbl

[7] Marchuk G. I., Metody vychislitelnoi matematiki, Nauka, M., 1977 | MR | Zbl

[8] Matsokin A. M., Nepomnyaschikh S. V., “Primenenie okaimleniya pri reshenii sistem setochnykh uravnenii”, Vychisl. algoritmy v zadachakh matem. fiz., VTs SO AN SSSR, Novosibirsk, 1983, 99–109

[9] Nepomnyaschikh S. V., O setochnykh teoremakh o sledakh, normirovkakh sledov i ikh obraschenii, Preprint No 930, VTs SO AN SSSR, Novosibirsk, 1991

[10] Syarle F., Metod konechnykh elementov dlya ellipticheskikh zadach, Mir, M., 1980 | MR

[11] Laevskii Yu. M., Kontsentriruyuschie operatory v metode konechnykh elementov, 1, Preprint No 907, VTs SO AN SSSR, Novosibirsk, 1990

[12] Besov O. V., Ilin V. P., Nikolskii S. M., Integralnye predstavleniya funktsii i teoremy vlozheniya, Nauka, M., 1975 | MR | Zbl