Výsledky vyhledávání - approximation by polynomials with integer coefficients

  1. 1

    Uniform approximation by polynomials with integer coefficients Autor Lipnicki, Artur

    ISSN: 1232-9274
    Vydáno: AGH Univeristy of Science and Technology Press 2016
    “…]\) with real coefficients, such that \(P^{(k)}(0)/k!\) and \(P^{(k)}(1)/k!\) are integers for \(k=0,\dots,r-1\). It is proved that there is a polynomial…”
    Získat plný text
    Journal Article
  2. 2

    Geometric properties of the lattice of polynomials with integer coefficients Autor Lipnicki, Artur, mieta ski, Marek J.

    ISSN: 1232-9274
    Vydáno: AGH Univeristy of Science and Technology Press 01.01.2024
    “…This paper is related to the classic but still being examined issue of approximation of functions by polynomials with integer coefficients. Let \(r\), \(n…”
    Získat plný text
    Journal Article
  3. 3

    Uniform Approximation by Polynomials with Integer Coefficients via the Bernstein Lattice Autor Güntürk, C Sinan, Li, Weilin

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 17.11.2023
    Vydáno v arXiv.org (17.11.2023)
    “… \(\mathbb{Z}[X]\) of polynomials with integer coefficients, when considered as a set of functions on \([0,1]\), is dense in \(\mathscr{C}_\mathbb{Z}([0,1…”
    Získat plný text
    Paper
  4. 4

    Best approximation of constants by polynomials with integer coefficients Autor Trigub, R., Volchkov, V.

    ISSN: 0021-9045
    Vydáno: Elsevier Inc 01.08.2025
    Vydáno v Journal of approximation theory (01.08.2025)
    “…What is best approximation of a non-integer number λ∈R by polynomials qn of degree at most n with integer coefficients on the segment [a,b]⊂(0,1…”
    Získat plný text
    Journal Article
  5. 5

    ON APPROXIMATION OF CONSTANTS BY POLYNOMIALS WITH INTEGER COEFFICIENTS Autor Trigub, R. M.

    ISSN: 1072-3374, 1573-8795
    Vydáno: Cham Springer International Publishing 01.10.2022
    “…In this paper, the exact rate of decrease of best approximations of non-integer numbers by polynomials with integer coefficients is established…”
    Získat plný text
    Journal Article
  6. 6

    Polynomial Function Approximations With Leading Integer Coefficients for Efficient Encrypted Implementations Autor Teichrib, Dieter, Adamek, Janis, Binfet, Philipp, Darup, Moritz Schulze

    ISSN: 2169-3536, 2169-3536
    Vydáno: Piscataway IEEE 2025
    Vydáno v IEEE access (2025)
    “… Specifically, we show that enforcing a leading integer coefficient enables the use of polynomials of one degree higher than all existing…”
    Získat plný text
    Journal Article
  7. 7

    On the best approximation of non-integer constants by polynomials with integer coefficients Autor Trigub, Roald M.

    ISSN: 1072-3374, 1573-8795
    Vydáno: Cham Springer International Publishing 02.08.2023
    “…The exact decrease rate of the best approximations of non-integer numbers by polynomials with integer coefficients of growing degrees is found on a disk in the complex plane, a cube in ℝ d , and a ball in ℝ d…”
    Získat plný text
    Journal Article
  8. 8

    Approximation with One-Bit Polynomials in Bernstein Form Autor Güntürk, C. Sinan, Li, Weilin

    ISSN: 0176-4276, 1432-0940
    Vydáno: New York Springer US 01.04.2023
    Vydáno v Constructive approximation (01.04.2023)
    “…We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order…”
    Získat plný text
    Journal Article
  9. 9

    Polynomials with integer coefficients and Chebyshev polynomials Autor Trigub, Roal′d M.

    ISSN: 1072-3374, 1573-8795
    Vydáno: New York Springer US 02.05.2017
    “…The paper is devoted to the popularization of one of the topics at the border between analysis and number theory that is related to polynomial with integer…”
    Získat plný text
    Journal Article
  10. 10

    Polynomials with integer coefficients and their zeros Autor Pritsker, Igor E.

    ISSN: 1072-3374, 1573-8795
    Vydáno: Boston Springer US 11.06.2012
    “… We also discuss interesting applications to the approximation by polynomials with integer coefficients, and to the growth of coefficients for polynomials with roots located in prescribed sets…”
    Získat plný text
    Journal Article
  11. 11

    Simultaneous approximation by Bernstein polynomials with integer coefficients Autor Draganov, Borislav R

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 07.05.2018
    Vydáno v arXiv.org (07.05.2018)
    “…We prove that several forms of the Bernstein polynomials with integer coefficients possess the property of simultaneous approximation, that is, they approximate not only the function but also its derivatives…”
    Získat plný text
    Paper
  12. 12

    Converse estimates for the simultaneous approximation by Bernstein polynomials with integer coefficients Autor Draganov, Borislav R

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 10.02.2020
    Vydáno v arXiv.org (10.02.2020)
    “…We prove a weak converse estimate for the simultaneous approximation by several forms of the Bernstein polynomials with integer coefficients…”
    Získat plný text
    Paper
  13. 13

    On the best approximation of constants by polynomials with integer coefficients Autor Trigub, R M

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 27.12.2019
    Vydáno v arXiv.org (27.12.2019)
    “…In this paper, exact rate of decrease of best approximations of non-integer numbers by polynomials with integer coefficients of the growing exponentials…”
    Získat plný text
    Paper
  14. 14
  15. 15

    Polynomials with integer coefficients and their zeros Autor Pritsker, Igor E

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 23.07.2013
    Vydáno v arXiv.org (23.07.2013)
    “… We also discuss interesting applications to approximation by polynomials with integer coefficients, and to the growth of coefficients for polynomials with roots located in prescribed sets…”
    Získat plný text
    Paper
  16. 16

    Vertical Shift and Simultaneous Diophantine Approximation on Polynomial Curves Autor Adiceam, Faustin

    ISSN: 0013-0915, 1464-3839
    Vydáno: Cambridge, UK Cambridge University Press 01.02.2015
    “… is larger than the degree of P(X). This provides the first results related to the computation of the Hausdorff dimension of the set of well-approximable points lying on a curve that is not defined by a polynomial with integer coefficients…”
    Získat plný text
    Journal Article
  17. 17

    Chebyshev Polynomials and Integer Coefficients Autor Trigub, R. M.

    ISSN: 0001-4346, 1067-9073, 1573-8876
    Vydáno: Moscow Pleiades Publishing 01.01.2019
    Vydáno v Mathematical Notes (01.01.2019)
    “… for nonzero polynomials with integer coefficients of arbitrary degree…”
    Získat plný text
    Journal Article
  18. 18

    Minimizing Coefficients Wordlength for Piecewise-Polynomial Hardware Function Evaluation With Exact or Faithful Rounding Autor De Caro, Davide, Napoli, Ettore, Esposito, Darjn, Castellano, Gerardo, Petra, Nicola, Strollo, Antonio G. M.

    ISSN: 1549-8328, 1558-0806
    Vydáno: New York IEEE 01.05.2017
    “… The proposed technique, using Integer Linear Programming (ILP), optimizes the polynomial coefficients taking into account all error components simultaneously…”
    Získat plný text
    Journal Article
  19. 19

    Approximation with one-bit polynomials in Bernstein form Autor Güntürk, C Sinan, Li, Weilin

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 06.12.2022
    Vydáno v arXiv.org (06.12.2022)
    “…We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order…”
    Získat plný text
    Paper
  20. 20

    Searching worst cases of a one-variable function using lattice reduction Autor Stehle, D., Lefevre, V., Zimmermann, P.

    ISSN: 0018-9340, 1557-9956
    Vydáno: New York IEEE 01.03.2005
    Vydáno v IEEE transactions on computers (01.03.2005)
    “… Then, we show that this second problem can be solved efficiently by extending Coppersmith's work on the integer small value problem - for polynomials with integer coefficients - using lattice reduction…”
    Získat plný text
    Journal Article