<?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-2022-2-92-103</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1648</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 Some Estimate for the Norm of an Interpolation Projector</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-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>2022</year></pub-date><pub-date pub-type="epub"><day>17</day><month>06</month><year>2022</year></pub-date><volume>29</volume><issue>2</issue><fpage>92</fpage><lpage>103</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Невский М.В., 2022</copyright-statement><copyright-year>2022</copyright-year><copyright-holder xml:lang="ru">Невский М.В.</copyright-holder><copyright-holder xml:lang="en">Nevskii M.V.</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/1648">https://www.mais-journal.ru/jour/article/view/1648</self-uri><abstract><p>Пусть $Q_n=[0,1]^n$ - единичный куб в ${\mathbb R}^n$, $C(Q_n)$ - пространство непрерывных функций $f:Q_n\to{\mathbb R}$ с нормой $\|f\|_{C(Q_n)}:=\max_{x\in Q_n}|f(x)|.$ Через $\Pi_1\left({\mathbb R}^n\right)$ обозначим совокупность многочленов от $n$ переменных степени $\leq 1$, т. е. линейных функций на ${\mathbb R}^n$. Интерполяционный проектор $P:C(Q_n)\to \Pi_1({\mathbb R}^n)$ с узлами $x^{(j)}\in Q_n$ определяется равенствами $Pf\left(x^{(j)}\right)= f\left(x^{(j)}\right)$, $j=1,$ $\ldots,$ $ n+1$. Пусть $\|P\|_{Q_n}$ - норма $P$ как оператора из $C(Q_n)$ в $C(Q_n)$. Если $n+1$ - число Адамара, то существует невырожденный правильный симплекс, вершины которого находятся в вершинах куба $Q_n.$ В статье обсуждаются различные подходы к получению оценок вида $||P||_{Q_n}$ $\leq$ $c\sqrt{n}$ для нормы соответствующего интерполяционного проектора.</p></abstract><trans-abstract xml:lang="en"><p>Let $Q_n=[0,1]^n$ be the unit cube in ${\mathbb R}^n$ and let $C(Q_n)$ be a space of continuous functions $f:Q_n\to{\mathbb R}$ with the norm $\|f\|_{C(Q_n)}:=\max_{x\in Q_n}|f(x)|.$ By $\Pi_1\left({\mathbb R}^n\right)$ denote a set of polynomials in $n$ variables of degree $\leq 1$, i. e., a set of linear functions on ${\mathbb R}^n$. The interpolation projector $P:C(Q_n)\to \Pi_1({\mathbb R}^n)$ with the nodes $x^{(j)}\in Q_n$ is defined by the equalities $Pf\left(x^{(j)}\right)= f\left(x^{(j)}\right)$, $j=1,$ $\ldots,$ $ n+1$. Let $\|P\|_{Q_n}$ be the norm of $P$ as an operator from $C(Q_n)$ to $C(Q_n)$. If $n+1$ is an Hadamard number, then there exists a non-degenerate regular simplex having the vertices at vertices of $Q_n$. We discuss some approaches to get inequalities of the form $||P||_{Q_n}\leq c\sqrt{n}$ for the norm of the corresponding projector $P$.</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>Hadamard matrix</kwd><kwd>regular simplex</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">M. V. Nevskii, Geometricheskie Ocenki v Polinomial’noj Interpolyacii. Yaroslavl: P. G. Demidov Yaroslavl State University, 2012, p. 218, in Russian.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, Geometricheskie Ocenki v Polinomial’noj Interpolyacii. Yaroslavl: P. G. Demidov Yaroslavl State University, 2012, p. 218, in Russian.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">M. Hall Jr., Combinatorial Theory. Mass., Toronto, London: Blaisdall Publishing Company, 1967.</mixed-citation><mixed-citation xml:lang="en">M. Hall Jr., Combinatorial Theory. Mass., Toronto, London: Blaisdall Publishing Company, 1967.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">K. J. Horadam, Hadamard Matrices and Their Applications. Princeton: Princeton University Press, 2007.</mixed-citation><mixed-citation xml:lang="en">K. J. Horadam, Hadamard Matrices and Their Applications. Princeton: Princeton University Press, 2007.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">P. K. Manjhi and M. K. Rama, “Some new examples of circulant partial Hadamard matrices of type - H (k × n)”, Advances and Applications in Mathematical Sciences, vol. 21, no. 5, pp. 2559-2564, 2022.</mixed-citation><mixed-citation xml:lang="en">P. K. Manjhi and M. K. Rama, “Some new examples of circulant partial Hadamard matrices of type - H (k × n)”, Advances and Applications in Mathematical Sciences, vol. 21, no. 5, pp. 2559-2564, 2022.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">M. Hudelson, V. Klee, and D. Larman, “Largest j-simplices in d-cubes: some relatives of the Hadamard maximum determinant problem”, Linear Algebra and its applications, vol. 241-243, pp. 519-598, 1996.</mixed-citation><mixed-citation xml:lang="en">M. Hudelson, V. Klee, and D. Larman, “Largest j-simplices in d-cubes: some relatives of the Hadamard maximum determinant problem”, Linear Algebra and its applications, vol. 241-243, pp. 519-598, 1996.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii, “Minimal projectors and largest simplices”, Modeling and Analysis of Information Systems, vol. 14, no. 1, pp. 3-10, 2007. On Some Estimate for the Norm of an Interpolation Projector</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, “Minimal projectors and largest simplices”, Modeling and Analysis of Information Systems, vol. 14, no. 1, pp. 3-10, 2007. On Some Estimate for the Norm of an Interpolation Projector</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">J. Hadamard, “Re´solution d’une question relative aux de´terminants”, Bull. Sciences Math. (2), vol. 17, pp. 240-246, 1893.</mixed-citation><mixed-citation xml:lang="en">J. Hadamard, “Re´solution d’une question relative aux de´terminants”, Bull. Sciences Math. (2), vol. 17, pp. 240-246, 1893.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">G. Barba, “Intorno al. teorema di Hadamard sui determinanti a valore massimo”, Glornale Mat. Battaglini (3), vol. 71, pp. 70-86, 1933.</mixed-citation><mixed-citation xml:lang="en">G. Barba, “Intorno al. teorema di Hadamard sui determinanti a valore massimo”, Glornale Mat. Battaglini (3), vol. 71, pp. 70-86, 1933.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii, “Estimates for the minimal norm of a projector in linear interpolation over the vertices of an n-dimensional cube”, Modeling and Analysis of Information Systems, vol. 10, no. 1, pp. 9-19, 2003.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii, “Estimates for the minimal norm of a projector in linear interpolation over the vertices of an n-dimensional cube”, Modeling and Analysis of Information Systems, vol. 10, no. 1, pp. 9-19, 2003.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</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="cit11"><label>11</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. doi: 10.18255/ 1818-1015-2018-3-291-311.</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. doi: 10.18255/ 1818-1015-2018-3-291-311.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">I. S. Kudryavcev, E. A. Ozerova, and A. Y. Ukhalov, “Novye ocenki dlya norm minimal’nyh proektorov”, in Sovremennye Problemy Matematiki i Informatiki, vol. 17, in Russian, Yaroslavl: P. G. Demidov Yaroslavl State University, 2017, pp. 74-81.</mixed-citation><mixed-citation xml:lang="en">I. S. Kudryavcev, E. A. Ozerova, and A. Y. Ukhalov, “Novye ocenki dlya norm minimal’nyh proektorov”, in Sovremennye Problemy Matematiki i Informatiki, vol. 17, in Russian, Yaroslavl: P. G. Demidov Yaroslavl State University, 2017, pp. 74-81.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">L. Fejes To´t, Regular Figures. New York: Macmillan/Pergamon, 1964.</mixed-citation><mixed-citation xml:lang="en">L. Fejes To´t, Regular Figures. New York: Macmillan/Pergamon, 1964.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">D. Slepian, “The content of some extreme simplices”, Pacific J. Math, vol. 31, pp. 795-808, 1969.</mixed-citation><mixed-citation xml:lang="en">D. Slepian, “The content of some extreme simplices”, Pacific J. Math, vol. 31, pp. 795-808, 1969.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">D. Vandev, “A minimal volume ellipsoid around a simplex”, C. R. Acad. Bulg. Sci., vol. 45, no. 6, pp. 37-40, 1992.</mixed-citation><mixed-citation xml:lang="en">D. Vandev, “A minimal volume ellipsoid around a simplex”, C. R. Acad. Bulg. Sci., vol. 45, no. 6, pp. 37-40, 1992.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">M. V. Nevskii and A. Y. Ukhalov, “Linear interpolation on a Euclidean ball in lRn”, Modeling and Analysis of Information Systems, vol. 26, no. 2, pp. 279-296, 2019. doi: 10.18255/1818-1015-2019-2-279-296.</mixed-citation><mixed-citation xml:lang="en">M. V. Nevskii and A. Y. Ukhalov, “Linear interpolation on a Euclidean ball in lRn”, Modeling and Analysis of Information Systems, vol. 26, no. 2, pp. 279-296, 2019. doi: 10.18255/1818-1015-2019-2-279-296.</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>
