Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  liczby całkowite
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Approximation of conic sections by weighted Lupaş post-quantum Bézier curves
EN
This paper deals with weighted Lupaş post-quantum Bernstein blending functions and Bézier curves constructed with the help of bases via (p,q) -integers. These blending functions form normalized totally positive bases. Due to the rational nature of weighted Lupaş post-quantum Bézier curves and positive weights, they help in investigating from geometric point of view. Their degree elevation properties and de Casteljau algorithm have been studied. It has been shown that quadratic weighted Lupaş post-quantum Bézier curves can represent conic sections in two-dimensional plane. Graphical analysis has been presented to discuss geometric interpretation of weight and conic section representation by weighted Lupaş post-quantum Bézier curves. This new generalized weighted Lupaş post-quantum Bézier curve provides better approximation and flexibility to a particular control point as well as control polygon due to extra parameter p and q in comparison to classical rational Bézier curves, Lupaş q -Bézier curves and weighted Lupaş q -Bézier curves.
EN
The basic aim of this study is to include nonnegative real parameters to allow for approximation findings of the Stancu variant of Phillips operators. We concentrate on the uniform modulus of smoothness in a simple manner before moving on to the approximation in weighted Korovkin’s space. Our study’s goals and outcomes are to fully develop the uniformly approximated findings of Phillips operators. We determine the order of convergence in terms of Lipschitz maximal function and Peetre’s K-functional. In addition, the Voronovskaja-type theorem is also proved.
3
Content available remote Some Undecidable Statements of Quite Simple Mathematics
EN
There are well known problems which are not decidable: halting problem, provability in PA, being a first order tautology, and others. Since all these problem deal with notions like computability and provability, they are beyond the scope of “usual” mathematics - mathematical analysis, for instance. Here, we will show a bunch of examples of simple undecidable statements of such mathematics.
first rewind previous Strona / 1 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ć.