Email:
[email protected]
Login
Register
English
Deutsch
Español
Français
Português
Home
Add new document
Sign In
Create An Account
On the degree of approximation by step functions
HOME
On the degree of approximation by step functions
On the degree of approximation by step functions
JOURNAL OF APPROXIMATION THEORY 12, 435-436 (19%) Note n the Degree of Approximation by 0. SHISHA Department of Mathematics, University of Rhod...
Download PDF
91KB Sizes
3 Downloads
84 Views
Report
Recommend Documents
Degree of simultaneous approximation of bivariate functions by Gordon operators
Note on the asymptotic degree of approximation of functions in C1[0,1] by Bernstein polynomials
On the degree of approximation to periodic functions by a trigonometric spline convolution operator
On the approximation of the step function by some sigmoid functions
On the degree of approximation by extended Hermite-Fejér operators
On the degree of approximation by extended Hermite-Fejér operators
On the degree of approximation by certain linear positive operators
On approximation of functions by exponential sums
The order of magnitude of unbounded functions and their degree of approximation by piecewise interpolating polynomials
Degree of approximation of functions in the Hölder metric by Borel's means
Approximation of analytic functions by Laguerre functions
Approximation of meromorphic functions by rational functions
PDF Reader
Full Text
JOURNAL
OF APPROXIMATION
THEORY
12,
435-436 (19%)
Note n the Degree of Approximation
by
0. SHISHA Department of Mathematics, University of Rhode Island, Kingston, Rhode Island 02881
Let --oo
j =
THEOREM. Given a real function f on (a, b), and 01> 0, a tzecessaryand suj$cient condition for f to satisfy in (a, b) a Lips&z condition of order cy.is thatfor n = 1, 2,... there exists an s, E S, such that
C being a constant. Necessity is immediate: Suppose / f(y) -f(x): < L( y - x>” wherever a < x < y -c b. For n = 1, 2,... let s,(x) be, throughout each In,j,j= 1,2 ,..., ~1,the value offat the midpoint of I,,j so that, througbo~~ that interval, 1f(x) - S,(X)\ < L[(b - a)/(2n)y. Thus (1) holds for n = 1,2,... with C = L[(b - a)/2]“. The main point oft his note is the use of the following argument, employed in [l] and [2], to show sufficiency. Let a < x < y < b. Let IZ,,be the largest positive integer n for which [x, y] lies in some In,j ) 1 < j < IZ.Then y - x > (b - a)/(6no). For otherwise, if, say, [x, y] C In0,j0, 1 < j, < ~1~ , then [x, y] would lie either in one of the two (open) halves of InO,j,or in its (open) middle third; in each of these casesthe maxima&y of N* is contradicted. By (l), I f( Y>- fW
= IU( Y>- sy#(YN + bno(xl - fcal < 2C/n,” < 2C[6/(b - a)j@( y - x-p*
Remarks. 1. Observe that if a real functionf satisfiesin (a, b) a Lipsehitz condition of order a~(> 0), then it satisfiesit in [a, b], with appropriate values 435 Copyright All rights
0 1974 by Academic Press, Inc. of reproduction in any form reserved.
436
0. SHISHA
f(a),f(b). 2. Iffis a real function on (a, b), and if for y1= 1, 2,... there exists an s, E S, satisfying (1) with 01> 1, then by the Theorem, fmust be constant in (a, b). The above Theorem is given, under the explicit assumption that f is continuous in [a, b], in the mimeographed notes [3]. Also, the Theorem is essentially the casek = 0 of Theorem 1 of [4].
REFERENCES 1. 0. SHISHA,A characterization of functions having Zygmund’s property, J. Approximation Theory 9 (1973), 39.5-397. 2. 0. SHISHA,Characterization of smoothness properties of functions by means of their degree of approximation by splines, J. Approximation Theory 12 (1974), 365-371. 3. J. P. KAHANE, “Teoria Constructiva de Functiones” (mimeographed), Universidad de Buenos Aires, Departamento de Matematicas, 1961. 4. F. RICHARDS,On the saturation class for spline functions, Proc. Amer. Math. Sot. 33 (1972), 471-476.
×
Report "On the degree of approximation by step functions"
Your name
Email
Reason
-Select Reason-
Pornographic
Defamatory
Illegal/Unlawful
Spam
Other Terms Of Service Violation
File a copyright complaint
Description
Our partners will collect data and use cookies for ad personalization and measurement.
Learn how we and our ad partner Google, collect and use data
.
Agree & close