Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 21

Liczba wyników na stronie
first rewind previous Strona / 2 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 2 next fast forward last
1
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

On approximation with nodes

100%
XX
CONTENTS Introduction 1. Approximation with nodes............................................................................................. 3 2. Characteristic property of the optimal polynomial......................................................... 4 3. Notation......................................................................................................................... 5 CHAPTER I. Limit properties of approximation with nodes 4. Statement of the problem.............................................................................................. 7 6. Qualitative results.......................................................................................................... 8 6. Quantitative results...................................................................................................... 11 7. The case of two nodes................................................................................................. 23 CHAPTER II. System of optimal polynomials 8. Necessary and sufficient conditions in approximation without nodes.......................... 38 9. Corollaries.................................................................................................................... 46 10. Necessary and sufficient conditions in approximation with nodes............................. 52 References....................................................................................................................... 62
EN
CONTENTS Introduction..................................................................................................................................................................................... 3 CHAPTER I. Basic properties of the best polynomials 1. Existence, uniqueness and the characteristic properties of the best polynomials............................................................................... 6 2. The direct application of the theorem concerning the (n, F)-points to computing the best polynomials. The Chebyshev polynomials....... 15 3. The characteristic properties of pairs of successive best polynomials........................................................................................................................... 26 CHAPTER II. Estimation of error of the beet approximation 4. Basic theorems................................................................................................................................................................................................. 33 5. Vallée Poussin type estimations................................................................... 38 6. Estimation of the error of the best approximation for functions which are differentiable several times........................................ 53 7. Estimation of the (n + 1)-st error of the best approximation based upon the knowledge of the n-th best polynomial................... 57 8. The relation between the error of the best approximation and the interval of approximation.................................................. 65 CHAPTER III. The distribution of (n)-points in the interval of approximation 9. The estimates dependent upon the value of the ratio $ε_{n + 1}(ξ)ε_n(ξ)$....................................................................................... 70 10. Auxiliary theorems..................................................................... 84 11. The estimates dependent upon the properties of the derivatives of the function ξ. General theorems....................................... 92 12. The estimates dependent upon the properties of the derivatives of the function ξ. The choice of function γp............................. 111 CHAPTER IV. Methods of computing well-approximating and best polynomials 13. Well-approximating polynomials................................................................................................................................................................ 121 14. Approximation of families of functions. The Zolotarev polynomials................................................................................................. 140 15. The theory of the method of Remez................................................................................................................................................... 156 16. Other methods of computing the best polynomials................................................................................................................................ 169 References..................................................................................................................................................... 175
6
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Nowe metody tablicowania funkcji

94%
17
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Schematy blokowe programów

42%
18
Content available remote

Evaluation of the Fermi-Dirac integral of half-integer order

42%
19
Content available remote

Sur l'approximation uniforme avec des noeuds

36%
20
Content available remote

On the Weierstrass approximation theorem

30%
first rewind previous Strona / 2 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.