1 - 10 of 17 articles
We consider the vectorial algorithm for finding best polynomial approximationsp ∈P
to a given function ƒ ∈C[a, b], with respect to the norm ‖·‖
, defined by ‖p -ϕ‖
1(p -f)‖∞ + ‖w
2(p - ƒ)‖∞. A bound for the modulus of continuity of the best vectorial approximation operator is given,...
The notion of a random semi-metric space provides an alternate approach to the study of probabilistic metric spaces from the standpoint of random variables instead of distribution functions and permits a new investigation of the triangle inequality. Starting with a probability space (Ω,B,P) and...
Read and print from thousands of top scholarly journals.
Continue with Facebook
Log in with Microsoft
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.