AbstractFor the given data (wi,xi,yi), i=1,…,M, we consider the problem of existence of the best discrete approximation in lp norm (1≤p<∞) by reciprocals of real polynomials. For this problem, the existence of best approximations is not always guaranteed. In this paper, we give a condition on data which is necessary and sufficient for the existence of the best approximation in lp norm. This condition is theoretical in nature. We apply it to obtain several other existence theorems very useful in practice. Some illustrative examples are also included
A saturation theorem and an asymptotic theorem are proved for an optimal, discrete, positive algebra...
AbstractThis paper gives the answer to a problem of Rivlin in L1 approximation in the case when n = ...
For a polynomial P mapping the integers into the integers, define an averaging operator ANf(x):=1N∑k...
AbstractFor the given data (wi,xi,yi), i=1,…,M, we consider the problem of existence of the best dis...
We consider the problem of choice of norms in discrete approximation. First, we describe properties ...
AbstractIn this paper we excavate the foundations of best-approximation theory with the tools of Bis...
AbstractWe list and discuss published programs for best approximation of functions by linear and non...
AbstractIn approximating an arbitrary point of Rn from a fixed subspace, it is known that the net of...
AbstractIt is well known that the best discrete linear Lp approximation converges to a special best ...
Polynomials, trigonometric polynomials, and rational functions are widely used for the discrete appr...
AbstractConditions are given which guarantee the existence of a best approximation by generalized ra...
AbstractA complete theory of best uniform approximation to positive functions decaying to zero on [0...
AbstractIt is shown that the convergence of several standard algorithms for the construction of a be...
AbstractThe linear inequality method is an algorithm for discrete Chebyshev approximation by general...
Thesis (M.A.)--Boston UniversityPLEASE NOTE: Boston University Libraries did not receive an Authoriz...
A saturation theorem and an asymptotic theorem are proved for an optimal, discrete, positive algebra...
AbstractThis paper gives the answer to a problem of Rivlin in L1 approximation in the case when n = ...
For a polynomial P mapping the integers into the integers, define an averaging operator ANf(x):=1N∑k...
AbstractFor the given data (wi,xi,yi), i=1,…,M, we consider the problem of existence of the best dis...
We consider the problem of choice of norms in discrete approximation. First, we describe properties ...
AbstractIn this paper we excavate the foundations of best-approximation theory with the tools of Bis...
AbstractWe list and discuss published programs for best approximation of functions by linear and non...
AbstractIn approximating an arbitrary point of Rn from a fixed subspace, it is known that the net of...
AbstractIt is well known that the best discrete linear Lp approximation converges to a special best ...
Polynomials, trigonometric polynomials, and rational functions are widely used for the discrete appr...
AbstractConditions are given which guarantee the existence of a best approximation by generalized ra...
AbstractA complete theory of best uniform approximation to positive functions decaying to zero on [0...
AbstractIt is shown that the convergence of several standard algorithms for the construction of a be...
AbstractThe linear inequality method is an algorithm for discrete Chebyshev approximation by general...
Thesis (M.A.)--Boston UniversityPLEASE NOTE: Boston University Libraries did not receive an Authoriz...
A saturation theorem and an asymptotic theorem are proved for an optimal, discrete, positive algebra...
AbstractThis paper gives the answer to a problem of Rivlin in L1 approximation in the case when n = ...
For a polynomial P mapping the integers into the integers, define an averaging operator ANf(x):=1N∑k...