Linear positive operators constructed by using Beta-type bases

Abstract

Starting from a discrete linear approximation process that has the ability to turn polynomials into polynomials of the same degree, we introduce an integral generalization by using Beta-type bases.

Some properties of this new sequence of operators are investigated in unweighted and weighted spaces of functions defined on unbounded interval. In our construction particular cases are outlined.

Authors

Octavian Agratini
Babeş-Bolyai University, Faculty of Mathematics and Computer Science, Cluj-Napoca, Romania
Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy, Cluj-Napoca, Romania

Keywords

Korovkin theorem; modulus of smoothness; weighted space; rate of convergence

References

See the expanding block below.

Paper coordinates

O. Agratini, Linear positive operators constructed by using Beta-type bases, Hacettepe Journal of Mathematics & Statistics,  49 (2020) no. 3, pp. 1030-1038, doi: 10.15672/hujms.549015

PDF

About this paper

Journal

Hacettepe Journal of Mathematics & Statistics

Publisher Name

Hacettepe Üniversitesi

Print ISSN

2651-477X

Online ISSN

2651-477X

Google Scholar Profile

soon

Paper (preprint) in HTML form

/*====================================================================== Core CSS for LaTeXML documents converted to (X)HTML */ /* Generic Page layout */ .ltx_page_header, .ltx_page_footer { font-size:0.8em; } .ltx_page_header *[rel~="prev"], .ltx_page_footer *[rel~="prev"] { float:left; } .ltx_page_header *[rel~="up"], .ltx_page_footer *[rel~="up"] { display:block; text-align:center; } .ltx_page_header *[rel~="next"], .ltx_page_footer *[rel~="next"] { float:right; } /* What was I trying for here; need more selective rule! .ltx_page_header .ltx_ref, .ltx_page_footer .ltx_ref { margin:0 1em; } */ .ltx_page_header li { padding:0.1em 0.2em 0.1em 1em;} /* Main content */ .ltx_page_content { clear:both; } .ltx_page_header { border-bottom:1px solid; margin-bottom:5px; } .ltx_page_footer { clear:both; border-top:1px solid; margin-top:5px; } .ltx_page_header:after, .ltx_page_footer:after, .ltx_page_content:after { content:"."; display:block; height:0; clear:both; visibility:hidden; } .ltx_page_footer:before { content:"."; display:block; height:0; clear:both; visibility:hidden; } .ltx_page_logo { font-size:80%; margin-top: 5px; clear:both; float:right; } .ltx_page_logo a { font-variant: small-caps; } .ltx_page_logo img { vertical-align:-3px; } /* if shown */ .ltx_page_navbar li { white-space:nowrap; display:block; overflow:hidden; } /* If ref got turned into span, it's "this section"*/ .ltx_page_navbar li span.ltx_ref { white-space:normal; overflow:visible; } /* Ought to be easily removable/overridable? */ .ltx_pagination.ltx_role_newpage { height:2em; } /*====================================================================== Document Structure; Titles & Frontmatter */ /* undo bold here to remove the browser's native h# styling, at let all other styles override it (with more specific rules)*/ .ltx_title { font-size:100%; font-weight:normal; } /* Hack to simulate run-in! put class="ltx_runin" on a title or tag for it to run-into the following text. */ .ltx_runin { display:inline; } .ltx_runin:after { content:" "; } .ltx_runin + .ltx_para, .ltx_runin + .ltx_para p, .ltx_runin + p { display:inline; } .ltx_outdent { margin-left: -2em; } /* .ltx_chapter_title, etc should be in ltx-article.css etc. */ .ltx_page_main { margin:0px; padding:1em 3em 1em 2em; } .ltx_tocentry { list-style-type:none; } /* support for common author block layouts.*/ /* add class ltx_authors_1line to get authors in single line with pop-up affiliation, etc. */ .ltx_authors_1line .ltx_creator, .ltx_authors_1line .ltx_author_before, .ltx_authors_1line .ltx_author_after { display:inline;} .ltx_authors_1line .ltx_author_notes { display:inline-block; } .ltx_authors_1line .ltx_author_notes:before { content:"*"; color:blue;} .ltx_authors_1line .ltx_author_notes span { display:none; } .ltx_authors_1line .ltx_author_notes:hover span { display:block; position:absolute; z-index:10; background:white; text-align:left; border: 1px solid black; border-radius: 0 5px 5px 5px; box-shadow: 5px 5px 10px gray; } /* add class=ltx_authors_multiline to get authors & affliations on separate lines*/ .ltx_authors_multiline .ltx_creator, .ltx_authors_multiline .ltx_author_before, .ltx_authors_multiline .ltx_author_after, .ltx_authors_multiline .ltx_author_notes, .ltx_authors_multiline .ltx_author_notes .ltx_contact { display:block; } /*====================================================================== Para level */ .ltx_float { margin: 1ex 3em 1ex 3em; } td.ltx_subfigure, td.ltx_subtable, td.ltx_subfloat { width:50%; } /* theorems, figure, tables, floats captions.. */ /*====================================================================== Blocks, Lists, Floats */ .ltx_p, .ltx_quote, .ltx_block, .ltx_para { display: block; } /* alignment within blocks */ .ltx_align_left { text-align:left; } .ltx_align_right { text-align:right; } .ltx_align_center { text-align:center; } .ltx_align_justify { text-align:justify; } .ltx_align_top { vertical-align:top; } .ltx_align_bottom { vertical-align:bottom; } .ltx_align_middle { vertical-align:middle; } .ltx_align_baseline { vertical-align:baseline; } .ltx_align_floatleft { float:left; } .ltx_align_floatright { float:right; } .ltx_td.ltx_align_left, .ltx_th.ltx_align_left, .ltx_td.ltx_align_right, .ltx_th.ltx_align_right, .ltx_td.ltx_align_center, .ltx_th.ltx_align_center { white-space:nowrap; } .ltx_td.ltx_align_left.ltx_wrap, .ltx_th.ltx_align_left.ltx_wrap, .ltx_td.ltx_align_right.ltx_wrap, .ltx_th.ltx_align_right.ltx_wrap, .ltx_td.ltx_align_center.ltx_wrap, .ltx_th.ltx_align_center.ltx_wrap, .ltx_td.ltx_align_justify, .ltx_th.ltx_align_justify { white-space:normal; } .ltx_tabular .ltx_tabular { width:100%; } .ltx_inline-block { display:inline-block; } /* equations in non-aligned mode (not normally used) */ .ltx_eqn_div { display:block; width:95%; text-align:center; } /* equations in aligned mode (aligning tags, etc as well as equations) */ .ltx_eqn_table { display:table; width:100%; border-collapse:collapse; } .ltx_eqn_row { display:table-row; } .ltx_eqn_cell { display:table-cell; width:auto; } /* Padding between column pairs in ams align */ table.ltx_eqn_align tr.ltx_equation td.ltx_align_left + td.ltx_align_right, table.ltx_eqn_align tr.ltx_equation td.ltx_align_left + td.ltx_align_center, table.ltx_eqn_align tr.ltx_equation td.ltx_align_center + td.ltx_align_right, table.ltx_eqn_align tr.ltx_equation td.ltx_align_center + td.ltx_align_center { padding-left:3em; } table.ltx_eqn_eqnarray tr.ltx_eqn_lefteqn + tr td.ltx_align_right { min-width:2em; } .ltx_eqn_eqno { max-width:0em; overflow:visible; white-space: nowrap; } .ltx_eqn_eqno.ltx_align_right .ltx_tag { float:right; } .ltx_eqn_center_padleft, .ltx_eqn_center_padright { width:50%; min-width:2em;} .ltx_eqn_left_padleft, .ltx_eqn_right_padright { min-width:2em; } .ltx_eqn_left_padright, .ltx_eqn_right_padleft { width:100%; } /* Various lists */ .ltx_itemize, .ltx_enumerate, .ltx_description { display:block; } .ltx_itemize .ltx_item, .ltx_enumerate .ltx_item { display: list-item; } /* Position the tag to look like a normal item bullet. */ li.ltx_item > .ltx_tag { display:inline-block; margin-left:-1.5em; min-width:1.5em; text-align:right; } .ltx_item .ltx_tag + .ltx_para, .ltx_item .ltx_tag + .ltx_para .ltx_p { display:inline; } /* NOTE: Need to try harder to get runin appearance? */ dl.ltx_description dt { margin-right:0.5em; float:left; font-weight:bold; font-size:95%; } dl.ltx_description dd { margin-left:5em; } dl.ltx_description dl.ltx_description dd { margin-left:3em; } /* Theorems */ .ltx_theorem {margin:1em 0em 1em 0em; } .ltx_title_theorem { font-size:100%; } /* Bibliographies */ .ltx_bibliography dt { margin-right:0.5em; float:left; } .ltx_bibliography dd { margin-left:3em; } /*.ltx_biblist { list-style-type:none; }*/ .ltx_bibitem { list-style-type:none; } .ltx_bibitem .ltx_tag { font-weight:bold; margin-left:-2em; width:3em; } /*.bibitem-tag + div { display:inline; }*/ .ltx_bib_title { font-style:italic; } .ltx_bib_article .bib-title { font-style:normal !important; } .ltx_bib_journal { font-style:italic; } .ltx_bib_volume { font-weight:bold; } /* Indices */ .ltx_indexlist li { list-style-type:none; } .ltx_indexlist { margin-left:1em; padding-left:1em;} /* Listings */ .ltx_listing { display:block; margin: 1ex 3em 1ex 0em; overflow-x:auto; text-align: left; } .ltx_float .ltx_listing { margin: 0; } .ltx_listingline { white-space:nowrap; min-height:1em; } .ltx_lst_numbers_left .ltx_listingline .ltx_tag { background-color:transparent; margin-left:-3em; width:2.5em; position:absolute; text-align:right; } .ltx_lst_numbers_right .ltx_listingline .ltx_tag { background-color:transparent; width:2.5em; position:absolute; right:3em; text-align:right; } /* position:absolute; left:0em; max-width:0em; text-align:right; } */ .ltx_parbox {text-indent:0em; } /* NOTE that it is CRITICAL to put position:relative outside & absolute inside!! I wish I understood why! Outer box establishes resulting size, neutralizes any outer positioning, etc; inner establishes position of stuff to be rotated */ .ltx_transformed_outer { position:relative; bottom:0pt;left:0pt; overflow:visible; } .ltx_transformed_inner { display:block; position:absolute;bottom:0pt;left:0pt; } .ltx_transformed_inner > .ltx_p {text-indent:0em; margin:0; padding:0; } /* If simulating a table (html5), try to get rowspan to work...sorta? */ span.ltx_rowspan { position:absolute; top:0; bottom:0; } /* by default, p doesn't indent */ .ltx_p { text-indent:0em; white-space:normal; } /* explicit control of indentation (on ltx_para) */ .ltx_indent > .ltx_p:first-child { text-indent:2em!important; } .ltx_noindent > .ltx_p:first-child { text-indent:0em!important; } /*====================================================================== Columns */ .ltx_page_column1 { width:44%; float:left; } /* IE uses % of wrong container*/ .ltx_page_column2 { width:44%; float:right; } .ltx_page_columns > .ltx_page_column1 { width:48%; float:left; } .ltx_page_columns > .ltx_page_column2 { width:48%; float:right; } .ltx_page_columns:after { content:"."; display:block; height:0; clear:both; visibility:hidden; } /*====================================================================== Borders and such */ .ltx_tabular { display:inline-table; border-collapse:collapse; } .ltx_tabular.ltx_centering { display:table; } .ltx_thead, .ltx_tfoot, .ltx_tbody { display:table-row-group; } .ltx_tr { display:table-row; } .ltx_td, .ltx_th { display:table-cell; } .ltx_framed { border:1px solid black;} .ltx_tabular .ltx_td, .ltx_tabular .ltx_th { padding:0.1em 0.5em; } /* regular lines */ .ltx_border_t { border-top:1px solid black; } .ltx_border_r { border-right:1px solid black; } .ltx_border_b { border-bottom:1px solid black; } .ltx_border_l { border-left:1px solid black; } /* double lines */ .ltx_border_tt { border-top:3px double black; } .ltx_border_rr { border-right:3px double black; } .ltx_border_bb { border-bottom:3px double black; } .ltx_border_ll { border-left:3px double black; } /* Light lines */ .ltx_border_T { border-top:1px solid gray; } .ltx_border_R { border-right:1px solid gray; } .ltx_border_B { border-bottom:1px solid gray; } .ltx_border_L { border-left:1px solid gray; } /* Framing */ .ltx_framed_rectangle { border-style:solid; border-width:1px; } .ltx_framed_top { border-top-style:solid; border-top-width:1px; } .ltx_framed_left { border-left-style:solid; border-left-width:1px; } .ltx_framed_right { border-right-style:solid; border-right-width:1px; } .ltx_framed_bottom, .ltx_framed_underline { border-bottom-style:solid; border-bottom-width:1px; } .ltx_framed_topbottom { border-top-style:solid; border-top-width:1px; border-bottom-style:solid; border-bottom-width:1px; } .ltx_framed_leftright { border-left-style:solid; border-left-width:1px; border-right-style:solid; border-right-width:1px; } /*====================================================================== Misc */ /* .ltx_verbatim*/ .ltx_verbatim { text-align:left; } /*====================================================================== Meta stuff, footnotes */ .ltx_note_content { display:none; } /*right:5%; */ .ltx_note_content { max-width: 70%; font-size:90%; left:15%; text-align:left; background-color: white; padding: 0.5em 1em 0.5em 1.5em; border: 1px solid black; border-radius: 0 5px 5px 5px; box-shadow: 5px 5px 10px gray; } .ltx_note_mark { color:blue; } .ltx_note_type { font-weight: bold; } .ltx_note { display:inline-block; text-indent:0; } /* So we establish containing block */ .ltx_note_content .ltx_note_mark { position:absolute; left:0.2em; top:-0.1em; } .ltx_note:hover .ltx_note_content, .ltx_note .ltx_note_content:hover { display:block; position:absolute; z-index:10; } .ltx_ERROR { color:red; } .ltx_rdf { display:none; } .ltx_missing { color:red;} .ltx_nounicode { color:red; } /*====================================================================== SVG (pgf/tikz ?) basics */ /* Stuff appearing in svg:foreignObject */ .ltx_svg_fog foreignObject { margin:0; padding:0; overflow:visible; } .ltx_svg_fog foreignObject > p { margin:0; padding:0; display:block; } /*.ltx_svg_fog foreignObject > p { margin:0; padding:0; display:block; white-space:nowrap; }*/ /*====================================================================== Low-level Basics */ /* Note that LaTeX(ML)'s font model doesn't map quite exactly to CSS's */ /* Font Families => font-family */ .ltx_font_serif { font-family: serif; } .ltx_font_sansserif { font-family: sans-serif; } .ltx_font_typewriter { font-family: monospace; } /* dingbats should be converted to unicode? */ /* Math font families handled within math: script, symbol, fraktur, blackboard ? */ /* Font Series => font-weight */ .ltx_font_bold { font-weight: bold; } .ltx_font_medium { font-weight: normal; } /* Font Shapes => font-style or font-variant */ .ltx_font_italic { font-style: italic; font-variant:normal; } .ltx_font_upright { font-style: normal; font-variant:normal; } .ltx_font_slanted { font-style: oblique; font-variant:normal; } .ltx_font_smallcaps { font-variant: small-caps; font-style:normal; } .ltx_font_oldstyle { font-variant: oldstyle-nums; /* experimental css3 ? Doesn't seem to work!*/ font-style:normal; -moz-font-feature-settings: "onum"; -ms-font-feature-settings: "onum"; -webkit-font-feature-settings: "onum"; font-variant-numeric: oldstyle-nums; } .ltx_font_mathcaligraphic { font-family: "Lucida Calligraphy", "Zapf Chancery","URW Chancery L"; } /* .ltx_font_mathscript { ? } */ cite { font-style: normal; } .ltx_red { color:red; } /*.ltx_centering { text-align:center; margin:auto; }*/ /*.ltx_inline-block.ltx_centering,*/ /* Hmm.... is this right in general? */ .ltx_centering { display:block; margin:auto; text-align:center; } /* Dubious stuff */ .ltx_hflipped { display:inline-block; -moz-transform: scaleX(-1); -o-transform: scaleX(-1); -webkit-transform: scaleX(-1); transform: scaleX(-1); filter: FlipH; -ms-fliter: "FlipH"; } .ltx_vflipped { display:inline-block; -moz-transform: scaleY(-1); -o-transform: scaleY(-1); -webkit-transform: scaleY(-1); transform: scaleY(-1); filter: FlipV; -ms-fliter: "FlipV"; } /* .ltx_phantom handled in xslt */ /* A somewhat amsart-like style */ .ltx_title_document { text-transform:uppercase; font-size: 150%; text-align:center; } .ltx_title_section { font-family:serif; font-weight:normal; font-variant:small-caps; font-size: 120%; text-align:center; } .ltx_authors { text-align:center; } .ltx_author_before,.ltx_author_after, .ltx_role_author .ltx_personname { text-transform:uppercase; } .ltx_abstract { margin-bottom:1em; } .ltx_title_abstract { font-family:serif; font-weight:normal; font-variant:small-caps;} .ltx_title_keywords, .ltx_title_classification { display:inline; font-size:100%; font-weight:normal; font-style:italic; } .ltx_role_dedicatory { font-size:100%; font-style:italic; text-align:center; margin:1em;} .ltx_figure .ltx_tag, .ltx_table .ltx_tag { font-family:serif; font-variant:small-caps;} .ltx_title_subsection, .ltx_title_subsubsection { font-family:serif; font-weight:bold;} .ltx_title_subsection:after, .ltx_title_subsubsection:after, .ltx_title_paragraph:after { content:"."; } /* abstract, subsection, subsubsection and paragraph titles are runin */ .ltx_abstract .ltx_title, .ltx_abstract .ltx_title + .ltx_p { display:inline; } .ltx_subsection .ltx_title, .ltx_subsection .ltx_title + .ltx_para, .ltx_subsection .ltx_title + .ltx_para > .ltx_p { display:inline; } .ltx_subsubsection .ltx_title, .ltx_subsubsection .ltx_title + .ltx_para, .ltx_subsubsection .ltx_title + .ltx_para > .ltx_p { display:inline; } .ltx_paragraph .ltx_title, .ltx_paragraph .ltx_title + .ltx_para, .ltx_paragraph .ltx_title + .ltx_para > .ltx_p { display:inline; } .ltx_title +.ltx_para > .ltx_p {text-indent:2em; } .ltx_itemize, .ltx_enumerate, .ltx_description { margin-left: clamp(1em, 3%, 2em); } .ltx_title_document { font-size:170%; text-align:center; margin:0.5em 0 0.5em 0; } .ltx_authors, .ltx_role_author { text-align:center; margin:0.5em 0 0.5em 0; } .ltx_role_author .ltx_personname { font-size: 120%; } .ltx_date { text-align:center; font-size: 120%; margin:0.5em 0 0.5em 0; } .ltx_subtitle { text-align:center; font-size: 120%; padding-left:0.2em; margin-left:-0.5em; } .ltx_title_abstract { text-align:center; font-size: 100%; font-weight:bold; } .ltx_abstract { margin-left:4em; margin-right:4em; } .ltx_title_acknowledgements, .ltx_title_keywords, .ltx_title_classification { text-align:left; font-size: 100%; font-weight:bold; margin:0.5 0 0 0; } .ltx_appendix, .ltx_section, .ltx_subsection, .ltx_subsubsection { margin-top:1.5em; } .ltx_paragraph, .ltx_subparagraph { margin-top:1.0em; } .ltx_title_appendix, .ltx_title_section, .ltx_title_bibliography { font-size:140%; font-weight:bold; margin-bottom:1em; } .ltx_title_subsection { font-size:120%; font-weight:bold; margin-bottom:1em; } .ltx_title_subsubsection { font-size:100%; font-weight:bold; margin-bottom:1em; } /* Paragraph & Subparagraph titles should be runin! */ .ltx_title_paragraph { font-size:100%; font-weight:bold; display:inline; margin-right:1em; } .ltx_paragraph .ltx_title, .ltx_paragraph .ltx_title + .ltx_para, .ltx_paragraph .ltx_title + .ltx_para > .ltx_p { display:inline; } .ltx_title_subparagraph { font-size:100%; font-weight:bold; display:inline; margin-left:2em; margin-right:1em; } .ltx_subparagraph .ltx_title, .ltx_subparagraph .ltx_title + .ltx_para, .ltx_subparagraph .ltx_title + .ltx_para > .ltx_p { display:inline; } .ltx_figure { text-align:center; margin:auto; margin:0.5em; } .ltx_table { text-align:center; margin:auto; margin:0.5em; } /* experimental: flex model, to center short captions, justify long ones */ .ltx_table, .ltx_figure { display:flex; flex-direction:column; align-items:center; } .ltx_table .ltx_caption, .ltx_figure .ltx_caption { text-align:justify; } /* first p in para gets indented */ .ltx_para > .ltx_p:first-child { text-indent:2em; } /* except the initial in a section */ section > .ltx_title +.ltx_para > .ltx_p, section > .ltx_title +.ltx_date +.ltx_para > .ltx_p {text-indent:0em; } .ltx_title_abstract + .ltx_p {text-indent:2em; } .ltx_itemize, .ltx_enumerate { margin-left:1em; } .ltx_theorem { margin-top:0.5em; margin-bottom:0.5em; } .ltx_theorem .ltx_title { margin-bottom:0.1em; } .ltx_theorem .ltx_title + .ltx_para, .ltx_theorem .ltx_title + .ltx_para .ltx_p, .ltx_theorem .ltx_title + .ltx_p { margin-top:0em; } Linear positive operators constructed by using Beta-type bases

Linear positive operators constructed
by using Beta-type bases

Octavian Agratini Babeş-Bolyai University
Faculty of Mathematics and Computer Science
Str. Kogălniceanu, 1
400084 Cluj-Napoca, Romania
and
Tiberiu Popoviciu Institute of Numerical Analysis,
Romanian Academy,
Str. Fântânele, 57, 400320 Cluj-Napoca, Romania
agratini@math.ubbcluj.ro
Abstract.

Starting from a discrete linear approximation process that has the ability to turn polynomials into polynomials of the same degree, we introduce an integral generalization by using Beta-type bases. Some properties of this new sequence of operators are investigated in unweighted and weighted spaces of functions defined on unbounded interval. In our construction particular cases are outlined.

Keywords and phrases: Korovkin theorem, modulus of smoothness, weighted space, rate of convergence.

Mathematics Subject Classification: 41A36, 41A25.

1. Introduction

An old area of mathematical research called Approximation Theory has a great potential for applications to a wide variety of issues. The study of the linear methods of approximation, which are given by sequences of linear and positive operators, has become a firmly rooted part of the domain mentioned above.

The starting point of this note is a general positive approximation process of discrete type and expressed by series. The functions that are approximated are defined on unbounded intervals. Since a linear substitution maps the interior of such intervals onto (0,∞) or ℝ, we will choose the benchmark interval I=[0,∞)=ℝ+, as it accumulates the problems caused by a finite endpoint and by the unboundedness of the other endpoint. Also, this class uses equidistant network of the form Δn=(k⁢λn)n≥1, where (λn)n≥1 is a strictly decreasing positive sequence of real numbers with the property

limn→∞λn=0. (1)

The operators we are referring to are designed as follows

(Ln⁢f)⁢(x)=∑k=0∞ak⁢(λn;x)⁢f⁢(k⁢λn),n∈ℕ,x∈ℝ+, (2)

where ak⁢(λn;⋅)∈ℝ+ℝ+ is continuous function for each (n,k)∈ℕ×ℕ0. Here ℕ0={0}∪ℕ and f belongs to a function space, say 𝒮⁢(ℝ+), for which the right-hand side of relation (2) is well defined.

Using a Beta functions base, we introduce and explore an integral generalization of the operators defined by (2). The construction of the new class is present in the next section. Their approximation properties such as convergence towards identity operator and the rate of convergence are investigated in different function spaces.

2. The operators

Set ej the monomial of j-th degree, e0⁢(x)=1 and ej⁢(x)=xj, j≥1. Let Πj∗ be the set of all algebraic polynomials of degree j, j∈ℕ0. Regarding Ln, n∈ℕ, operators we assume Π:=⋃j≥0Πj∗⊂𝒮⁢(ℝ+),

Ln⁢e0=e0⁢ and ⁢Ln⁢ej∈Πj∗,j∈ℕ. (3)

Due to the linearity of Ln, the above conditions imply that these operators preserve the constants and map polynomials into polynomials of the same degree. Throughout the paper, based on relations (3), we consider the following representations of the polynomials Ln⁢ej

(Ln⁢ej)⁢(x)=∑i=0jαi,j⁢(n)⁢xi,αj,j⁢(n)≠0,x∈ℝ+⁢ and ⁢j∈ℕ. (4)

Since we are working on the assumption that the sequence (Ln)n≥1 is an approximation process, this will involve at least the pointwise convergence of (Ln⁢ej)n≥1 to ej for each j∈ℕ, in other words,

limn→∞αi,j⁢(n)=δi,j, 0≤i≤j⁢ and ⁢j∈ℕ, (5)

where δi,j is Kronecker symbol.

Our requirements in (3) are not very restrictive. Many classical operators enjoy these properties. For instance:

i) Szász-Mirakjan operators satisfy (3), according to Micchelli’s result [11, p. 71].

ii) Baskakov operators fulfill (3), see Sikkema [12, p. 335].

iii) Mastroianni operators [10] representing a generalization of Baskakov approximation process. For comparison, [1, pages 344, 350] may be consulted. Relations (3) can easily be deduced from the cited works.

In all the above examples λn=1/n, n≥1, takes place.

iv) Bernstein-Chlodovsky operators introduced by Chlodovsky [2] can be found in [9, p. 36] or in [1, pages 347, 351]. In this case λn=bn/n, where (bn)n≥1 is a sequence of strictly positive real numbers such that limn→∞bn=∞ and (1) holds. Also, in this case, the requirements (3) are obviously satisfied. We propose to study the following integral variant of Ln, n≥1, operators, while meeting the assumption (3).

(Dn⁢f)⁢(x)=a0⁢(λn;x)⁢f⁢(0)+∑k=1∞ak⁢(λn;x)B⁢(n+1,k)⁢∫0∞f⁢(n⁢λn⁢t)⁢tk−1(1+t)n+k+1⁢𝑑t, (6)

x∈ℝ+ and B stands for Beta function,

B⁢(p,q)=∫0∞tp−1⁢(1+t)−(p+q)⁢𝑑t,(p,q)∈ℝ+∗×ℝ+∗.

In the above f∈ℱ⁢(ℝ+), the space of all real valued functions defined on ℝ+ with the property that the series from the right hand side of relation (6) is convergent. We infer that f must be a Lebesgue measurable function on ℝ+.

Clearly, Dn, n∈ℕ, are linear and positive operators. Moreover,

(Dn⁢e0)⁢(x)=(Ln⁢e0)⁢(x)=1,x∈ℝ+,n≥1, (7)

see (3).

Using relation (2), by a straightforward calculation, we obtain the following identities

(Dn⁢e1)⁢(x)=(Ln⁢e1)⁢(x),x∈ℝ+,n≥1, (8)
(Dn⁢e2)⁢(x)=nn−1⁢(Ln⁢e2)⁢(x)+n⁢λnn−1⁢(Ln⁢e1)⁢(x),x∈ℝ+,n≥2. (9)

Currently, in approximation by linear positive operators, particular attention is paid to those which reproduce affine functions, property implied by the relations Ln⁢ej=ej, j∈{0,1}. From (7) and (8) we notice that if Ln operators have this property, also Dn operators enjoy it.

We specify that particular cases of operators described by formula (6) have been investigated by various authors. To illustrate this, we present two examples.

Starting from Jain operators [6] defined as follows

(Pn[β]⁢f)⁢(x)=e−n⁢x+n⁢x⁢∑k=1∞(n⁢x+k⁢β)k−1k!⁢e−(n⁢x+k⁢β)⁢f⁢(kn),x≥0, (10)

where the parameter β∈[0,1), in [13] an integral version with Beta bases functions has been investigated. If in (10) we choose β=0, Pn[0], n∈ℕ, turn into well known Szász-Mirakjan operators. An integral extension of Pn[0] operators following the model shown in (7), was achieved in [5].

The second example is taken from the recent paper [7]. Acar and Kumar introduced and studied the following generalization of Baskakov-Durrmeyer operators in the sense of D.D. Stancu

(Ln,aα,β⁢f)⁢(x)=∑k=1∞Wn,ka⁢(x)B⁢(k,n)⁢∫0∞tk−1(1+t)n+k⁢f⁢(n⁢t+αn+β)⁢𝑑t+Wn,0a⁢(x)⁢f⁢(αn+β),

where

Wn,ka⁢(x)=e−a⁢x1+x⁢Pk⁢(n,a)k!⁢xk(1+x)n+k,Pk⁢(n,a)=∑i=0k(ki)⁢(n)i⁢ak−i,

0≤α≤β, a>0 and (n)i is the Pochammer symbol given by (n)0=1, (n)i=n⁢(n+1)⁢…⁢(n+i−1) for i∈ℕ.

At this point we introduce the j-th central moment of Dn operators, n≥j∈ℕ, i.e.,

ℳj⁢(Dn;x)=(Dn⁢φxj)⁢(x), where ⁢φx⁢(t)=t−x,(t,x)∈ℝ+×ℝ+.

Examining identities (7)-(9) and taking into account (4), we get the first two central moments

ℳj⁢(Dn;x)=∑l=0jβl,j⁢(n)⁢xj,x≥0,n≥2,j∈{1,2},

where

β0,1⁢(n)=α0,1⁢(n),β1,1⁢(n)=α1,1⁢(n)−1, (11)
{β0,2⁢(n)=nn−1⁢(α0,2⁢(n)+λn⁢α0,1⁢(n)),β1,2⁢(n)=nn−1⁢(α1,2⁢(n)+λn⁢α1,1⁢(n))−2⁢α0,1⁢(n),β2,2⁢(n)=nn−1⁢α2,2⁢(n)−2⁢α1,1⁢(n)+1. (12)

Considering the notation c⁢(n)=max0≤l≤2⁡|βl,2⁢(n)|, n≥2, we can write

ℳ2⁢(Dn;x)≤c⁢(n)⁢(1+x+x2),x≥0. (13)

Taking in view (1) and (5), limn→∞c⁢(n)=0 takes place.

3. Approximation properties

Our goal is to show how the approximation properties are transferred from Ln to Dn, n∈ℕ, operators. As usual, B⁢(ℝ+) and C⁢(ℝ+) stand for bounded, respectively continuous real valued functions defined on ℝ+. Set CB⁢(ℝ+)=B⁢(ℝ+)∩C⁢(ℝ+) which is endowed with the norm of the uniform convergence (sup-norm) denoted by ∥⋅∥∞.

Remark 1. Clearly, CB⁢(ℝ+)⊂ℱ⁢(ℝ+). Since (7) takes place, for any function f∈CB⁢(ℝ+) we deduce ‖Dn⁢f‖∞≤‖f‖∞, in other words, the operators Dn, n∈ℕ, are non-expansive.

We investigate the summation integral operators in functions spaces characterized by the polynomial weight ρ⁢(x)=1+x2, x≥0. We indicate the following notations used throughout the paper.

Bρ(ℝ+)={f:ℝ+→ℝ∣|f(x)|≤Mfρ(x),x≥0},

where Mf is a constant depending only on f. Bρ⁢(ℝ+) is a normed space with respect to the norm ∥⋅∥ρ,

‖f‖ρ=supx≥0|f⁢(x)|ρ⁢(x).

Further, we denote by Cρ⁢(ℝ+), Cρ∗⁢(ℝ+) the following subspaces of Bρ⁢(ℝ+)

Cρ⁢(ℝ+)={f∈Bρ⁢(ℝ+):f⁢ is continuous on ⁢ℝ+},
Cρ∗⁢(ℝ+)={f∈Cρ⁢(ℝ+):limx→∞f⁢(x)ρ⁢(x)⁢ exists and is finite},

respectively.

Theorem 1. Let Ln, n∈ℕ, be defined by (2) such that conditions (3)-(5) are fulfilled. For any compact K⊂ℝ+, the operators Dn defined by (6) possess the property

limn→∞‖Dn⁢f−f‖K=0,f∈Cρ∗⁢(ℝ+), (14)

where, for a function h, ‖h‖K=supt∈K|h⁢(t)|.

Proof. We consider the lattice homomorphism TK:C⁢(ℝ)→C⁢(K) defined by TK⁢(f)=f|K. Relations (7), (8), (9) and the requirements formulated in the hypothesis of the theorem ensure the identities

limn→∞TK⁢(Dn⁢ej)=TK⁢(ej),j∈{0,1,2},

uniformly on K. Since Cρ∗⁢(ℝ+) is isomorphic to C⁢(K) and {e0,e1,e2} is a Korovkin set in Cρ∗⁢(ℝ+), the universal Korovkin-type criterion, see [1, Theorem 4.1.4(vi)] implies

(Dn⁢f)⁢(x)→f⁢(x)⁢ uniformly on ⁢K⁢ as ⁢n→∞.

Consequently, the proof of (14) is completed. □

We recall the notion of modulus of smoothness associated to a function f∈C⁢(ℝ+) on the compact interval [0,a], a>0 fixed. Denoting by ω⁢(f;⋅)[0,a], it is defined as follows

ω(f;δ)[0,a]=sup{|f(t)−f(x)|:|t−x|≤δ,(t,x)∈[0,a]×[0,a]},

where δ≥0. As we can see, ω gives the maximum oscillation of f in any interval of length not exceeding δ.

Among the properties of ω⁢(f;⋅)[0,a] we recall the following

ω⁢(f;|t−x|)[0,a]≤(1+(t−x)2δ2)⁢ω⁢(f;δ)[0,a],δ>0, (15)

and (t,x)∈[0,a]×[0,a], see, e.g., [8].

Using this modulus we establish the rate of convergence of the sequence (Dn⁢f)n≥1 in a specific case, as shown in the following

Theorem 2. Let Ln, n∈ℕ, be defined by (2) such that conditions (3)-(5) are fulfilled. For any compact [0,b], b>0 fixed, the operators Dn, n≥2, defined by (6) verify the following inequality

|(Dn⁢f)⁢(x)−f⁢(x)|≤Mf,b⁢δn2⁢(x)+2⁢ω⁢(f;δn⁢(x))[0,b+1],x∈[0,b], (16)

where f∈Cρ⁢(ℝ+), Mf,b is a constant depending on f and b, and

δn⁢(x)=c⁢(n)⁢(x2+x+1). (17)

Proof. Let x∈[0,b] arbitrarily fixed. Let t belong to ℝ+.

If t≤b+1, then |t−x|≤b+1. With the help of (15) we can write

|f⁢(t)−f⁢(x)| ≤sup|u−v|≤|t−x||f⁢(u)−f⁢(v)|=ω⁢(f;|t−x|)[0,b+1]
≤(1+(t−x)2δ2)⁢ω⁢(f;δ)[0,b+1],δ>0. (18)

If t>b+1, then t−x>1. Since f∈Cρ⁢(ℝ+), we get

|f⁢(t)−f⁢(x)| ≤Mf⁢(2+x2+t2)
=Mf⁢((2+2⁢x2)+2⁢x⁢(t−x)+(t−x)2)
≤Mf⁢((2+2⁢x2)⁢(t−x)2+2⁢x⁢(t−x)2+(t−x)2)
≤Mf⁢(supx∈[0,b](3+2⁢x2+2⁢x))⁢(t−x)2
=Mf,b⁢(t−x)2, (19)

where Mf,b is a constant depending only on f and b.

Combining (3) and (3), we obtain

|f⁢(t)−f⁢(x)|≤Mf,b⁢(t−x)2+(1+(t−x)2δ2)⁢ω⁢(f,δ)[0,b+1],δ>0. (20)

Since Dn is linear positive operator, it is monotone. Identity Dn⁢e0=e0 and inequalities (20), (13) allow us to write successively

|(Dn⁢f)⁢(x)−f⁢(x)| =|Dn⁢(f−f⁢(x);x)|≤Dn⁢(|f−f⁢(x)|;x)
≤Dn⁢(Mf,b⁢φx2+(e0+φx2δ2)⁢ω⁢(f;δ)[0,b+1];x)
≤Mf,b⁢c⁢(n)⁢(x2+x+1)⁢(1+c⁢(n)⁢(x2+x+1)δ2)⁢ω⁢(f;δ)[0,b+1].

Choosing δ=δn⁢(x), see (17), we arrive at (16) and the proof is ended. □

In the following we will denote by C a positive constant which occurs different values in different relations, its main characteristic being that it does not depend on n.

Due to (5), all sequences from relation (12), (bi,j⁢(n))n≥1, 0≤i≤j≤2, are bounded with respect to n. Consequently, 0≤Ln⁢ρ≤C⁢ρ. This relation and the definition of Dn operators imply 0≤Dn⁢ρ≤C⁢ρ. Taking into account the result established in [3, Eq. (4)], the previous inequality represents the necessary and sufficient condition which allows us to draw the following

Remark 2. Each operator Dn maps Cρ⁢(ℝ+) into Bρ⁢(ℝ+) and

‖Dn‖Cρ⁢(ℝ+)→Bρ⁢(ℝ+)=‖Dn⁢ρ‖ρ.

Theorem 3. Let Ln, n∈ℕ, be defined by (2) such that conditions (3)-(5) are fulfilled. The operators Dn, n≥2, defined by (6) satisfy the following property

limn→∞‖Dn⁢f−f‖ρ=0 (21)

for every function f∈Cρ∗⁢(ℝ+).

Proof. Considering the statement drawn in Remark 2, we will apply a result set by Gadjiev [3, Theorem 2]. According to this result, in order to obtain (21), it is sufficient to prove the following relations

limn→∞‖Dn⁢e1k−e1k‖ρ=0,k=0,1,2. (22)

We were based on the fact that in our case ρ=e0+e12.

Due to (7), for k=0 identity (22) is evident.

Using (8) and (11), we can write

‖Dn⁢e1−e1‖ρ =supx≥0|(Ln⁢e1)⁢(x)−x|1+x2=supx≥0|α0,1⁢(n)+(α1,1⁢(n)−1)⁢x|1+x2
≤|α0,1⁢(n)|+|α1,1⁢(n)−1|.

In view of (5), for k=1 relation (22) holds.

Then, by calling (9) and (12), we have

‖Dn⁢e2−e2‖ρ=supx≥0|nn−1⁢(α0,2⁢(n)+α1,2⁢(n)⁢x+α2,2⁢(n)⁢x2)+n⁢λnn−1⁢(α0,1⁢(n)+α1,1⁢(n)⁢x)−x2|1+x2
≤|nn−1⁢α2,2⁢(n)−1|+nn−1⁢|α1,2⁢(n)+λn⁢α1,1⁢(n)|+nn−1⁢|α0,2⁢(n)+λn⁢α1,1⁢(n)|.

Relations (1) and (5) guarantee the veracity of the identity (22) in the case k=2. Thus, the limit from (21) is completely proved. □

Since (1+x2)1+γ≥ρ⁢(x), (x,γ)∈ℝ+×ℝ+∗, from Theorem 3 we enunciate

Remark 3. For any f∈Cρ∗⁢(ℝ+) and γ>0,

limn→∞supx≥0|(Dn⁢f)⁢(x)−f⁢(x)|(1+x2)1+γ=0

takes place. In the particular case of Baskakov-Durrmeyer-Stancu type operators, the above relation was included in [7, Theorem 3.4].

Finally we present an estimate of error of approximation by using a more general weight ρ and a suitable modulus. Keeping the same notation, from this moment, we consider the weight ρ given by

ρ⁢(x)=1+a⁢x+b⁢x2,x≥0, (23)

where a≥1 and b>0. Since ρ⁢(0)=1 and infx≥0ρ′⁢(x)≥1, in accordance with [4], we can use the weighted modulus Ωρ⁢(f;⋅) defined by

Ωρ⁢(f;δ)=supx,t∈ℝ+|ρ⁢(t)−ρ⁢(x)|≤δ|f⁢(t)−f⁢(x)|(|ρ⁢(t)−ρ⁢(x)|+1)⁢ρ⁢(x),δ>0, (24)

for each f∈Cρ⁢(ℝ+).

Among the properties of this modulus proved by Gadjiev and Aral [4, Lemmas 4,5] we recall

limδ→0Ωρ⁢(f;δ)=0, (25)
|f⁢(t)−f⁢(x)|≤2⁢ρ⁢(x)⁢(1+δ)2⁢(1+(ρ⁢(t)−ρ⁢(x))2δ2)⁢Ωρ⁢(f;δ), (26)

for each f∈Cρ∗⁢(ℝ+) and δ>0.

Regarding the weight ρ, from (23) we deduce

ekρ≤1,k∈{1,2}, and ⁢ekρ2≤1,k∈{1,2,3,4}. (27)

Dn⁢ej, j≤4, are polynomials with coefficients expressed in terms of (αi,j)0≤i≤j, j≤4, subject to conditions (5). We assume that ρ2∈ℱ⁢(ℝ+). These facts combined with (27) allow us to establish the relations

‖Dn⁢ρ−ρ‖ρ≤μ1⁢(n),‖Dn⁢ρ2−ρ2‖ρ2≤μ2⁢(n), (28)

for n≥4, where

limn→∞μk⁢(n)=0,k∈{1,2}. (29)

Theorem 4. Let Ln, n∈ℕ, be defined by (2) such that conditions (3)-(5) are fulfilled. The operators Dn, n≥4, defined by (6) satisfy the following property

‖Dn⁢f−f‖ρ3≤4⁢(1+δn∗)2⁢Ωρ⁢(f;δn∗),f∈Cρ∗⁢(ℝ+),

where ρ is given at (23), Ωρ is defined at (24) and

δn∗=μ2⁢(n)+2⁢μ1⁢(n), (30)

in accordance with (28).

Proof. Like how we reasoned Remark 2, we deduce that Dn is a mapping from Cρ⁢(ℝ+) into Bρ⁢(ℝ+) and also a mapping from Cρ2⁢(ℝ+) into Bρ2⁢(ℝ+). By using relations (26) and (7) we obtain the following estimate

|(Dn⁢f)⁢(x)−f⁢(x)|ρ⁢(x)≤4⁢(1+δ)2⁢δ−2⁢Dn⁢((ρ−ρ⁢(x))2;x)⁢Ωρ⁢(f;δ), (31)

where f∈Cρ∗⁢(ℝ+). Further, we can write

Dn⁢((ρ−ρ⁢(x))2;x)≤|(Dn⁢ρ2)⁢(x)−ρ2⁢(x)|+2⁢ρ⁢(x)⁢|(Dn⁢ρ)⁢(x)−ρ⁢(x)|.

Using the inequalities from (28), for n≥4 and x≥0, we have

Dn⁢((ρ−ρ⁢(x))2;x)≤(μ2⁢(n)+2⁢μ1⁢(n))⁢ρ2⁢(x).

Returning at (31) and choosing δ:=δn∗, see (30), the conclusion of the theorem is fully motivated. □

Remark 4. In view of (29) and (25), the above theorem implies

limn→∞‖Dn⁢f−f‖ρ3=0,f∈Cρ∗⁢(ℝ+).

References

  • [1] Altomare, F., Campiti, M., Korovkin-type Approximatiomn Theory and its Applications, de Gruyter Series Studies in Mathematics, Vol. 17, Walter de Gruyter & Co., Berlin, New York, 1994.
  • [2] Chlodovsky, I., Sur le développement des fonctions définies dans un interval infini en séries de polynômes de N.S. Bernstein, Compositio Math., 4(1937), 380-393.
  • [3] Gadjiev, A.D., Theorems of Korovkin type, Mat. Zametki, 20(1976), No. 5, 781-786 (in Russian); Mathematical Notes, 20(1976), No. 5, 995-998 (English translation).
  • [4] Gadjiev, A.D., Aral, D., The estimates of approximation by using a new type of weighted modulus of continuity, Computers and Mathematics with Applications, 54(2007), 127-135.
  • [5] Gupta, V., Noor, M.A., Convergence of derivatives for certain mixed Szász-Beta operators, J. Math. Anal. Appl., 321(2006), 1-9.
  • [6] Jain, G.C., Approximation of functions by a new class of linear operators, Journal of the Australian Mathematical Society, 13(3)(1972), 271-276.
  • [7] Kumar, A.S., Acar, T., Approximation by generalized Baskakov-Durrmeyer-Stancu type operators, Rend. Circ. Mat. Palermo, Series 2, 65(2016), Issue 3, 411-424.
  • [8] Lorentz, G.G., Approximation of functions, Holt, Rinehart and Winston, Inc., New York, 1966.
  • [9] Lorentz, G.G., Bernstein Polynomials, 2nd Ed., Chelsea Publ. Comp., New York, NY, 1986.
  • [10] Mastroianni, G., Su un operatore lineare e positivo, Rend. Acc. Sc. Fis. Mat., Napoli, 46(1979), 161-176.
  • [11] Micchelli, C.A., Saturation classes and iterates of operators, Dissertation, Stanford, 1969.
  • [12] Sikkema, P.C., On some linear positive operators, Indag. Math., 32(1970), 327-337.
  • [13] Tarabie, S., On Jain-Beta linear operators, Applied Mathematics & Information Sciences, 6(2012), No. 2, 213-216.

[1] T. Acar, A.M. Acu and N. Manav, Approximation of functions by genuine BernsteinDurrmeyer type operators, J. Math. Ineq. 12 (4), 975–987, 2018.
[2] F. Altomare and M. Campiti, Korovkin-type Approximation Theory and its Applications, de Gruyter Series Studies in Mathematics, Vol. 17, Walter de Gruyter & Co., Berlin, New York, 1994.
[3] I. Chlodovsky, Sur le développement des fonctions définies dans un interval infini en séries de polynômes de N.S. Bernstein, Compositio Math. 4, 380–393, 1937.
[4] A.D. Gadjiev, Theorems of Korovkin type, Mat. Zametki, 20 (5), 781–786 (in Russian), 1976; Mathematical Notes, 20 (5), 995-998 (English translation), 1976.
[5] A.D. Gadjiev and A. Aral, The estimates of approximation by using a new type of weighted modulus of continuity, Comput. Math. Appl. 54, 127–135, 2007.
[6] A.D. Gadjiev and C. Orhan, Some approximation theorems via statistical convergence, Rocky Mountain J. Math. 32, 129–138, 2002.
[7] V. Gupta and M.A. Noor, Convergence of derivatives for certain mixed Szász-Beta operators, J. Math. Anal. Appl. 321, 1–9, 2006.
[8] G.C. Jain, Approximation of functions by a new class of linear operators, J. Aust. Math. Soc. 13 (3), 271–276, 1972.
[9] A.S. Kumar and T. Acar, Approximation by generalized Baskakov-Durrmeyer-Stancu type operators, Rend. Circ. Mat. Palermo, Series 2, 65 (3), 411–424, 2016.
[10] G.G. Lorentz, Approximation of functions, Holt, Rinehart and Winston, Inc., New York, 1966.
[11] G.G. Lorentz, Bernstein Polynomials, 2nd Ed., Chelsea Publ. Comp., New York, NY, 1986.
[12] G. Mastroianni, Su un operatore lineare e positivo, Rend. Acc. Sc. Fis. Mat. Napoli, 46, 161,-176, 1979.
[13] C.A. Micchelli, Saturation classes and iterates of operators, Dissertation, Stanford, 1969.
[14] M. Mursaleen and M. Nasiruzzaman, Approximation of modified Jakimovski-LeviatanBeta type operators, Constr. Math. Anal. 1 (2), 88–98, 2018.
[15] P.C. Sikkema, On some linear positive operators, Indag. Math. 32, 327–337, 1970.
[16] S. Tarabie, On Jain-Beta linear operators, Appl. Math. Inform. Sci. 6 (2), 213–216, 2012.

2020

Related Posts