<?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-2019-2-279-296</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1218</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>Computing Methodologies and Applications</subject></subj-group></article-categories><title-group><article-title>Линейная интерполяция на евклидовом шаре в Rⁿ</article-title><trans-title-group xml:lang="en"><trans-title>Linear Interpolation on a Euclidean Ball in Rⁿ</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><bio xml:lang="ru"><p>Доктор физ.-мат. наук, доцент.</p><p>Ул. Советская, 14, Ярославль, 150003</p></bio><bio xml:lang="en"><p>Doctor of Science.</p><p>Sovetskaya str., 14, Yaroslavl, 150003</p></bio><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 Yu.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Кандидат физико-математических наук.</p><p>Ул. Советская, 14, Ярославль, 150003</p></bio><bio xml:lang="en"><p>PhD.</p><p> </p><p>Sovetskaya str., 14, Yaroslavl, 150003</p></bio><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>2019</year></pub-date><pub-date pub-type="epub"><day>28</day><month>06</month><year>2019</year></pub-date><volume>26</volume><issue>2</issue><fpage>279</fpage><lpage>296</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Невский М.В., Ухалов А.Ю., 2019</copyright-statement><copyright-year>2019</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/1218">https://www.mais-journal.ru/jour/article/view/1218</self-uri><abstract><p>Пусть \(x^{(0)}\in{\mathbb R}^n, R&gt;0\). Через \(B=B(x^{(0)};R)\) обозначим евклидов шар в \({\mathbb R}^n\), задаваемый неравенством \(\|x-x^{(0)}\|\leq R\), \(\|x\|:=\left(\sum_{i=1}^n x_i^2\right)^{1/2}\). Положим \(B_n:=B(0,1)\). Под \(C(B)\) будем понимать пространство непрерывных функций \(f:B\to{\mathbb R}\) с нормой \(\|f\|_{C(B)}:=\max_{x\in B}|f(x)|,\) под \(\Pi_1\left({\mathbb R}^n\right)\) - совокупность многочленов от \(n\) переменных степени \(\leq 1\), то есть линейных функций на \({\mathbb R}^n\). Пусть \(x^{(1)}, \ldots, x^{(n+1)}\) - вершины \(n\) - мерного невырожденного симплекса \(S\subset B\). Интерполяционный проектор \(P:C(B)\to \Pi_1({\mathbb R}^n)\), соответствующий \(S\), определяется равенствами \(Pf\left(x^{(j)}\right)= %f_j:=f\left(x^{(j)}\right).\) Через \(\|P\|_B\) обозначим норму \(P\) как оператора из \(C(B)\) в \(C(B)\). Определим \(\theta_n(B)\) как минимальную величину \(\|P\|_B\) при условии \(x^{(j)}\in B\). В статье получена формула для вычисления \(\|P\|_B\) через \(x^{(0)}\), \(R\) и коэффициенты базисных многочленов Лагранжа, соответствующих \(S.\) Более подробно исследован случай, когда \(S\) - правильный симплекс, вписанный в \(B_n\). Доказано, что в этой ситуации справедливо равенство \(\|P\|_{B_n}=\max\{\psi(a),\psi(a+1)\},\) где \(\psi(t)=\frac{2\sqrt{n}}{n+1}\bigl(t(n+1-t)\bigr)^{1/2}+\bigl|1-\frac{2t}{n+1}\bigr|)\) \((0\leq t\leq n+1)\), целое \(a\) имеет вид \(a=\bigl\lfloor\frac{n+1}{2}-\frac{\sqrt{n+1}}{2}\bigr\rfloor.\) Для такого проектора \(\sqrt{n}\leq\|P\|_{B_n}\leq\sqrt{n+1}\), причём равенство \(\|P\|_{B_n}=\sqrt{n+1}\) имеет место тогда и только тогда, когда число \(\sqrt{n+1}\) является целым. Приводятся точные значения \(\theta_n(B_n)\) для \(1\leq n\leq 4\). Даются результаты компьютерных вычислений, дополняющие теоретический анализ. Обсуждаются некоторые другие вопросы, связанные с интерполяцией на евклидовом шаре, в том числе открытые.</p></abstract><trans-abstract xml:lang="en"><p>For \(x^{(0)}\in{\mathbb R}^n, R&gt;0\), by \(B=B(x^{(0)};R)\) we denote a Euclidean ball in \({\mathbb R}^n\) given by the inequality \(\|x-x^{(0)}\|\leq R\), \(\|x\|:=\left(\sum_{i=1}^n x_i^2\right)^{1/2}\). Put \(B_n:=B(0,1)\). We mean by \(C(B)\) the space of continuous functions \(f:B\to{\mathbb R}\) with the norm \(\|f\|_{C(B)}:=\max_{x\in B}|f(x)|\) and by \(\Pi_1\left({\mathbb R}^n\right)\) the set of polynomials in \(n\) variables of degree \(\leq 1\), i.e. linear functions on \({\mathbb R}^n\). Let \(x^{(1)}, \ldots, x^{(n+1)}\) be the vertices of \(n\)-dimensional nondegenerate simplex \(S\subset B\). The interpolation projector \(P:C(B)\to \Pi_1({\mathbb R}^n)\) corresponding to \(S\) is defined by the equalities \(Pf\left(x^{(j)}\right)=%f_j:=f\left(x^{(j)}\right).\) Denote by \(\|P\|_B\) the norm of \(P\) as an operator from \(C(B)\) into \(C(B)\). Let us define \(\theta_n(B)\) as minimal value of \(\|P\|\) under the condition \(x^{(j)}\in B\). In the paper, we obtain the formula to compute \(\|P\|_B\) making use of \(x^{(0)}\), \(R\), and coefficients of basic Lagrange polynomials of \(S\). In more details we study the case when \(S\) is a regular simplex inscribed into \(B_n\). In this situation, we prove that \(\|P\|_{B_n}=\max\{\psi(a),\psi(a+1)\},\) where \(\psi(t)=\frac{2\sqrt{n}}{n+1}\bigl(t(n+1-t)\bigr)^{1/2}+\bigl|1-\frac{2t}{n+1}\bigr|\) \((0\leq t\leq n+1)\) and integer \(a\) has the form \(a=\bigl\lfloor\frac{n+1}{2}-\frac{\sqrt{n+1}}{2}\bigr\rfloor.\) For this projector, \(\sqrt{n}\leq\|P\|_{B_n}\leq\sqrt{n+1}\). The equality \(\|P\|_{B_n}=\sqrt{n+1}\) takes place if and only if \(\sqrt{n+1}\) is an integer number. We give the precise values of \(\theta_n(B_n)\) for \(1\leq n\leq 4\). To supplement theoretical results we present computational data. We also discuss some other questions concerning interpolation on a Euclidean ball.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>n-мерный симплекс</kwd><kwd>n-мерный шар</kwd><kwd>линейная интерполяция</kwd><kwd>проектор</kwd><kwd>норма</kwd></kwd-group><kwd-group xml:lang="en"><kwd>n-dimensional simplex</kwd><kwd>n-dimensional ball</kwd><kwd>linear interpolation</kwd><kwd>projector</kwd><kwd>norm</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">Невский М. В., “Неравенства для норм интерполяционных проекторов”, Модел. и анализ информ. систем, 15:3 (2008), 28-37.</mixed-citation><mixed-citation xml:lang="en">Nevskij M. V., “Inequalities for the norms of interpolating projections”, Modeling and Analysis of Information Systems, 15:3 (2008), 28-37, (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Невский М. В., “Об одном соотношении для минимальной нормы интерполяционного проектора”, Модел. и анализ информ. систем, 16:1 (2009), 24-43.</mixed-citation><mixed-citation xml:lang="en">Nevskij M.V., “On a certain relation for the minimal norm of an interpolational projection”, Modeling and Analysis of Information Systems, 16:1 (2009), 24-43, (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Невский М.В., “Об одном свойстве та-мерного симплекса”, Матем. заметки, 87:4 (2010), 580-593.</mixed-citation><mixed-citation xml:lang="en">English transl.: Nevskii M.V., “On a property of та-dimensional simplices”, Math. Notes, 87:4 (2010), 543-555.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Невский М. В., Геометрические оценки в полиномиальной интерполяции, Ярославль: Ярославский государственный университет им. П. Г. Демидова, 2012.</mixed-citation><mixed-citation xml:lang="en">Nevskii M.V., Geometricheskie ocenki v polinomialnoy interpolyacii, Yaroslavl: P. G. Demidov Yaroslavl State University, 2012, (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Невский М. В., Ухалов А. Ю., “Новые оценки числовых величин, связанных с симплексом”, Модел. и анализ информ. систем, 24:1 (2017), 94-110.</mixed-citation><mixed-citation xml:lang="en">Nevskii M.V., Ukhalov A. Yu., “New estimates of numerical values related to a simplex”, Modeling and Analysis of Information Systems, 24:1 (2017), 94-110, (in Russian).; English transl.: Nevskii M. V., Ukhalov A. Yu., “New estimates of numerical values related to a simplex”, Aut. Control Comp. Sci., 51:7 (2017), 770-782.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Невский М.В., Ухалов А.Ю., “Об оптимальной интерполяции линейными функциями на та-мерном кубе”, Модел. и анализ информ. систем, 25:3 (2018), 291-311</mixed-citation><mixed-citation xml:lang="en">Nevskii M. V., Ukhalov A. Yu., “On optimal interpolation by linear functions on an та-dimensional cube”, Modeling and Analysis of Information Systems, 25:3 (2018), 291-311, (in Russian).; English transl.: Nevskii M. V., Ukhalov A. Yu., “On optimal interpolation by linear functions on та-dimensional cube”, Aut. Control Comp. Sci., 52:7 (2018), 828842.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Невский М.В., “О некоторых задачах для симплекса и шара в R””, Модел. и анализ информ. систем, 25:6 (2018), 680-691.</mixed-citation><mixed-citation xml:lang="en">Nevskii M. V., “On some problems for a simplex and a ball in Rra”, Modeling and Analysis of Information Systems, 25:6 (2018), 680-691, (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Сегё Г., Ортогональные многочлены, Москва: Физматгиз, 1962.</mixed-citation><mixed-citation xml:lang="en">SzegO G., Orthogonal polynomials, New York: American Mathematical Society, 1959, (in English).</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Суетин П.К., Классические ортогональные многочлены, Москва: Наука, 1979.</mixed-citation><mixed-citation xml:lang="en">Suetin P. K., Klassicheskie ortogonalnye mnogochleny, Moskva: Nauka, 1979, in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Холл M., Комбинаторика, Москва: Мир, 1970.</mixed-citation><mixed-citation xml:lang="en">Hall M., Jr, Combinatorial theory, Blaisdall publishing company, Waltham (Massachusets) - Toronto - London, 1967, (in English).</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Hedayat A., Wallis W.D., “Hadamard matrices and their applications”, The Annals of Statistics, 6:6 (1978), 1184-1238.</mixed-citation><mixed-citation xml:lang="en">Hedayat A., Wallis W.D., “Hadamard matrices and their applications”, The Annals of Statistics, 6:6 (1978), 1184-1238.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Horadam K.J., Hadamard matrices and their applications, Princeton University Press, 2007.</mixed-citation><mixed-citation xml:lang="en">Horadam K.J., Hadamard matrices and their applications, Princeton University Press, 2007.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Hudelson M., Klee V., Larman D., “Largest j-simplices in d-cubes: some relatives of the Hadamard maximum determinant problem”, Linear Algebra Appl., 241 (1996), 519-598.</mixed-citation><mixed-citation xml:lang="en">Hudelson M., Klee V., Larman D., “Largest j-simplices in d-cubes: some relatives of the Hadamard maximum determinant problem”, Linear Algebra Appl., 241 (1996), 519-598.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Nevskii M., Ukhalov A., “Perfect simplices in R5”, Beitrage zur Algebra und Geometrie / Contributions to Algebra and Geometry, 59:3 (2018), 501-521.</mixed-citation><mixed-citation xml:lang="en">Nevskii M., Ukhalov A., “Perfect simplices in R5”, Beitrage zur Algebra und Geometrie / Contributions to Algebra and Geometry, 59:3 (2018), 501-521.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Wellin P., Essentials of programming in Mathematica, Cambridge University Press, 2016.</mixed-citation><mixed-citation xml:lang="en">Wellin P., Essentials of programming in Mathematica, Cambridge University Press, 2016.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Wolfram S., An elementary introduction to the Wolfram Language, Wolfram Media, Inc., 2017.</mixed-citation><mixed-citation xml:lang="en">Wolfram S., An elementary introduction to the Wolfram Language, Wolfram Media, Inc., 2017.</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>
