<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">dan</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады Национальной академии наук Беларуси</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady of the National Academy of Sciences of Belarus</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1561-8323</issn><issn pub-type="epub">2524-2431</issn><publisher><publisher-name>The Republican Unitary Enterprise Publishing House "Belaruskaya Navuka"</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">dan-260</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>МАТЕМАТИКА</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MATHEMATICS</subject></subj-group></article-categories><title-group><article-title>МОНОТОННЫЕ РАЗНОСТНЫЕ СХЕМЫ ДЛЯ ЛИНЕЙНОГО ПАРАБОЛИЧЕСКОГО УРАВНЕНИЯ С ГРАНИЧНЫМИ УСЛОВИЯМИ СМЕШАННОГО ТИПА</article-title><trans-title-group xml:lang="en"><trans-title>MONOTONE DIFFERENCE SCHEMES FOR LINEAR PARABOLIC EQUATIONS WITH MIXED BOUNDARY CONDITIONS</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>МАТУС</surname><given-names>П. П.</given-names></name><name name-style="western" xml:lang="en"><surname>MATUS</surname><given-names>P. P.</given-names></name></name-alternatives><email xlink:type="simple">matus@im.bas-net.by</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>ТУЕН</surname><given-names>В. Т. К.</given-names></name><name name-style="western" xml:lang="en"><surname>TUYEN</surname><given-names>VO THI KIM</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-2"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>ГАСПАР</surname><given-names>Ф.</given-names></name><name name-style="western" xml:lang="en"><surname>GASPAR</surname><given-names>FRANCISCO</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-3"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Институт математики НАН Беларуси, Минск</institution><country>Belarus</country></aff><aff xml:lang="ru" id="aff-2"><institution>Белорусский государственный университет, Минск</institution><country>Belarus</country></aff><aff xml:lang="ru" id="aff-3"><institution>Университет Сарагосы</institution><country>Spain</country></aff><pub-date pub-type="collection"><year>2014</year></pub-date><pub-date pub-type="epub"><day>10</day><month>06</month><year>2016</year></pub-date><volume>58</volume><issue>5</issue><fpage>18</fpage><lpage>22</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; МАТУС П.П., ТУЕН В., ГАСПАР Ф., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">МАТУС П.П., ТУЕН В., ГАСПАР Ф.</copyright-holder><copyright-holder xml:lang="en">MATUS P.P., TUYEN V., GASPAR F.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://doklady.belnauka.by/jour/article/view/260">https://doklady.belnauka.by/jour/article/view/260</self-uri><abstract><p>Построены монотонные схемы для параболических уравнений со смешанными условиями. Кроме того, для них устанавливается важное следствие принципа максимума, на основании которого можно сделать вывод об устойчивости алгоритма в равномерной норме. В основе конструкции лежит идея использования полуцелых узлов в граничных точках задания краевых условий второго или третьего рода. Полученные результаты обобщаются на построенные аналогичные алгоритмы для одномерных уравнений пороупругости.</p></abstract><trans-abstract xml:lang="en"><p>In this paper, for parabolic equations with mixed boundary conditions monotone schemes are constructed. Moreover we establish an important corollary of the maximum principle for them. On the basis of this corollary one can make a conclusion about the stability of the algorithm in the uniform norm. The idea is to use half-integer nodes at boundary points of the boundary conditions with the second or third order. The obtained results are generalized to construct the similar algorithm for equations of poroelasticity in the one-dimensional case.</p></trans-abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Самарский А. А. Теория разностных схем. М.: Наука, 1977.</mixed-citation><mixed-citation xml:lang="en">Самарский А. А. Теория разностных схем. М.: Наука, 1977.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Самарский А. А., Вабищевич П. Н., Матус П. П. Разностные схемы с операторными множителями. М.: Наука, 1998.</mixed-citation><mixed-citation xml:lang="en">Самарский А. А., Вабищевич П. Н., Матус П. П. Разностные схемы с операторными множителями. М.: Наука, 1998.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Самарский А. А., Мажукин В. И., Малафей Д. А., Матус П. П. // ЖВМ и МФ. 2001. Т. 41, № 3.</mixed-citation><mixed-citation xml:lang="en">Самарский А. А., Мажукин В. И., Малафей Д. А., Матус П. П. // ЖВМ и МФ. 2001. Т. 41, № 3.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Matus P. // Comput. Methods Appl. Math. 2014. Vol. 14, N 3. P. 361–371.</mixed-citation><mixed-citation xml:lang="en">Matus P. // Comput. Methods Appl. Math. 2014. Vol. 14, N 3. P. 361–371.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Naumovich A. Efficient numerical methods for the Biot poroelasticity system in multilayered domains: genehmigte Dissertation, 2007.</mixed-citation><mixed-citation xml:lang="en">Naumovich A. Efficient numerical methods for the Biot poroelasticity system in multilayered domains: genehmigte Dissertation, 2007.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Gaspar F. J., Lisbona F. J., Vabishchevich P. N. // Applied Numerical Mathematics. 2003. Vol. 44. P. 487–506.</mixed-citation><mixed-citation xml:lang="en">Gaspar F. J., Lisbona F. J., Vabishchevich P. N. // Applied Numerical Mathematics. 2003. Vol. 44. P. 487–506.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Matus P., Martsynkevich G. // Comput. Meth. Appl. Math. 2004. Vol. 4, N 3.</mixed-citation><mixed-citation xml:lang="en">Matus P., Martsynkevich G. // Comput. Meth. Appl. Math. 2004. Vol. 4, N 3.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
