<?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">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2023-3-246-257</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1802</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>Discrete Mathematics in Relation to Computer Science</subject></subj-group></article-categories><title-group><article-title>О геометрическом подходе к оцениванию  интерполяционных проекторов</article-title><trans-title-group xml:lang="en"><trans-title>On a geometric approach to the estimation of interpolation projectors</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-6392-7618</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Невский</surname><given-names>Михаил Викторович</given-names></name><name name-style="western" xml:lang="en"><surname>Nevskii</surname><given-names>Mikhail V.</given-names></name></name-alternatives><email xlink:type="simple">mnevsk55@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-6551-5118</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Ухалов</surname><given-names>Алексей Юрьевич</given-names></name><name name-style="western" xml:lang="en"><surname>Ukhalov</surname><given-names>Alexey Y.</given-names></name></name-alternatives><email xlink:type="simple">alex-uhalov@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Ярославский государственный университет им. П.Г. Демидова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>P.G. Demidov Yaroslavl State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>17</day><month>09</month><year>2023</year></pub-date><volume>30</volume><issue>3</issue><fpage>246</fpage><lpage>257</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Невский М.В., Ухалов А.Ю., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Невский М.В., Ухалов А.Ю.</copyright-holder><copyright-holder xml:lang="en">Nevskii M.V., Ukhalov A.Y.</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://www.mais-journal.ru/jour/article/view/1802">https://www.mais-journal.ru/jour/article/view/1802</self-uri><abstract><p>Пусть $\Omega$ — замкнутое ограниченное подмножество ${\mathbb R}^n,$ $S$ — $n$-мерный невырожденный симплекс, $\xi(\Omega;S):=\min$ {$\sigma\geqslant 1: \Omega\subset \sigma S$}. Здесь $\sigma S$ есть результат гомотетии $S$ относительно центра тяжести с коэффициентом $\sigma$. Пусть $d\geqslant n+1,$ $\varphi_1(x),\ldots,\varphi_d(x)$ — линейно независимые мономы от $n$ переменных, причём $\varphi_1(x)\equiv 1,$ $\varphi_2(x)=x_1, \ldots, \varphi_{n+1}(x)=x_n.$ Положим $\Pi:=\text{lin}(\varphi_1,\ldots,\varphi_d).$ Интерполяционный проектор $P: C(\Omega)\to \Pi$ по набору узлов $x^{(1)},\ldots, x^{(d)} \in \Omega$ определяется с помощью равенств $Pf\left(x^{(j)}\right)=f\left(x^{(j)}\right).$ Обозначим через $\|P\|_{\Omega}$ норму $P$ как оператора из $C(\Omega)$ в $C(\Omega)$ . Рассмотрим отображение $T:{\mathbb R}^n\to {\mathbb R}^{d-1}$, имеющее вид $T(x):=(\varphi_2(x),\ldots,\varphi_d(x)). $ Справедливы неравенства $ \frac{1}{2}\left(1+\frac{1}{d-1}\right)\left(\|P\|_{\Omega}-1\right)+1 \leqslant \xi(T(\Omega);S)\leqslant \frac{d}{2}\left(\|P\|_{\Omega}-1\right)+1, $ где $S$ — $(d-1)$-мерный симплекс с вершинами $T\left(x^{(j)}\right).$ В статье это и другие соотношения обсуждаются для полиномиальной интерполяции функций, непрерывных на отрезке. Приводятся некоторые результаты численного анализа. </p></abstract><trans-abstract xml:lang="en"><p>Suppose $\Omega$ is a closed bounded subset of ${\mathbb R}^n,$ $S$ is an $n$-dimensional non-degenerate simplex, $\xi(\Omega;S):=$ min {$\sigma\geqslant 1: \Omega\subset \sigma S$}. Here $\sigma S$ is the result of homothety of $S$ with respect to the center of gravity with coefficient $\sigma$. Let $d\geqslant n+1,$ $\varphi_1(x),\ldots,\varphi_d(x)$ be linearly independent monomials in $n$ variables, and $\varphi_1(x)\equiv 1,$ $\varphi_2(x)=x_1,\ \ldots, \varphi_{n+1}(x)=x_n.$ Put $\Pi:=$lin$(\varphi_1,\ldots,\varphi_d).$ The interpolation projector $P: C(\Omega)\to \Pi$ with a set of nodes $x^{(1)},\ldots, x^{(d)} \in \Omega$ is defined by equalities $Pf\left(x^{(j)}\right)=f\left(x^{(j)}\right).$ Denote by $\|P\|_{\Omega}$ the norm of $P$ as an operator from $C(\Omega)$ to $C(\Omega)$ . Consider the mapping $T:{\mathbb R}^n\to {\mathbb R}^{d-1}$ of the form $T(x):=(\varphi_2(x),\ldots,\varphi_d(x)). $ We have $ \frac{1}{2}\left(1+\frac{1}{d-1}\right)\left(\|P\|_{\Omega}-1\right)+1 \leqslant \xi(T(\Omega);S)\leqslant \frac{d}{2}\left(\|P\|_{\Omega}-1\right)+1, $ where $S$ is a $(d-1)$-dimensional simplex with vertices $T\left(x^{(j)}\right).$ We discuss this and other relations for polynomial interpolation of functions continuous on a segment. Some results of numerical analysis are presented.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>полиномиальная интерполяция</kwd><kwd>проектор</kwd><kwd>норма</kwd><kwd>коэффициент поглощения</kwd><kwd>оценивание</kwd></kwd-group><kwd-group xml:lang="en"><kwd>polynomial interpolation</kwd><kwd>projector</kwd><kwd>norm</kwd><kwd>absorption coefficient</kwd><kwd>esimation</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii, Geometricheskie Ocenki v Polinomial'noj Interpolyacii. P. G. Demidov Yaroslavl State University, 2012.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, Geometricheskie Ocenki v Polinomial'noj Interpolyacii. P. G. Demidov Yaroslavl State University, 2012.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii, “Inequalities for the norms of interpolation projectors,” Modeling and Analysis of Information Systems, vol. 15, no. 3, pp. 28–37, 2008.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, “Inequalities for the norms of interpolation projectors,” Modeling and Analysis of Information Systems, vol. 15, no. 3, pp. 28–37, 2008.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii, “On a certain relation for the minimal norm of an interpolation projector,” Modeling and Analysis of Information Systems, vol. 16, no. 1, pp. 24–43, 2009.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, “On a certain relation for the minimal norm of an interpolation projector,” Modeling and Analysis of Information Systems, vol. 16, no. 1, pp. 24–43, 2009.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii and A. Y. Ukhalov, “Linear interpolation on a Euclidean ball in $mathbb R^n$,” Modeling and Analysis of Information Systems, vol. 26, no. 2, pp. 279–296, 2019.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii and A. Y. Ukhalov, “Linear interpolation on a Euclidean ball in $mathbb R^n$,” Modeling and Analysis of Information Systems, vol. 26, no. 2, pp. 279–296, 2019.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii and A. Y. Ukhalov, “On optimal interpolation by linear functions on an $n$-dimensional cube,” Modeling and Analysis of Information Systems, vol. 25, no. 3, pp. 291–311, 2018.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii and A. Y. Ukhalov, “On optimal interpolation by linear functions on an $n$-dimensional cube,” Modeling and Analysis of Information Systems, vol. 25, no. 3, pp. 291–311, 2018.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">A. Ukhalov, “Supplementary materials for the article "On a geometric approach to the estimation of interpolation projectors,’” Mendeley Data, V1, 2023, doi: 10.17632/snh5m99yxr.1.</mixed-citation><mixed-citation xml:lang="en">A. Ukhalov, “Supplementary materials for the article "On a geometric approach to the estimation of interpolation projectors,’” Mendeley Data, V1, 2023, doi: 10.17632/snh5m99yxr.1.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">P. Wellin, Essentials of Programming in Mathematica. Cambridge University Press, 2016.</mixed-citation><mixed-citation xml:lang="en">P. Wellin, Essentials of Programming in Mathematica. Cambridge University Press, 2016.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">S. Mangano, Mathematica Cookbook: Building Blocks for Science, Engineering, Finance, Music, and More. O'Reilly Media Inc., 2010.</mixed-citation><mixed-citation xml:lang="en">S. Mangano, Mathematica Cookbook: Building Blocks for Science, Engineering, Finance, Music, and More. O'Reilly Media Inc., 2010.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">S. Wolfram, An Elementary Introduction to the Wolfram Language. Wolfram Media, Inc., 2017.</mixed-citation><mixed-citation xml:lang="en">S. Wolfram, An Elementary Introduction to the Wolfram Language. Wolfram Media, Inc., 2017.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">D. E. King, “Dlib-ml: A Machine Learning Toolkit,” Journal of Machine Learning Research, vol. 10, pp. 1755–1758, 2009.</mixed-citation><mixed-citation xml:lang="en">D. E. King, “Dlib-ml: A Machine Learning Toolkit,” Journal of Machine Learning Research, vol. 10, pp. 1755–1758, 2009.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">N. S. Bogomolova, “Kvadratichnaya interpolyaciya i zadacha o pogloshchenii treugol'nikom parabolicheskogo sektora,” in Put' v Nauku. Matematika. Tezisy Dokladov Vserossijskoy Molodezhnoi Konferencii, 2022, pp. 39–41.</mixed-citation><mixed-citation xml:lang="en">N. S. Bogomolova, “Kvadratichnaya interpolyaciya i zadacha o pogloshchenii treugol'nikom parabolicheskogo sektora,” in Put' v Nauku. Matematika. Tezisy Dokladov Vserossijskoy Molodezhnoi Konferencii, 2022, pp. 39–41.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">S. Pashkovskij, Vychislitel'nye Primeneniya Mnogochlenov i Ryadov Chebysheva. Nauka, 1983.</mixed-citation><mixed-citation xml:lang="en">S. Pashkovskij, Vychislitel'nye Primeneniya Mnogochlenov i Ryadov Chebysheva. Nauka, 1983.</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>
