An elementary proof of the inverse theorem for Bernstein polynomials. (Short Communication).
Linear approximation processes in locally convex spaces. I. Semigroups of operators and saturation. (Short Communication).
An elementary proof of the inverse theorem for Bernstein polynomials.
Inverse theorems for Favard operators in polynomial weight spaces
The article contains no abstract
Saturation for Farvard operators in weighted function spaces
Automatic run-time choice for simulation length in mimesis
Automatic run-time choice for simulation length in mimesis
This paper presents an algorithm which prevents a simulation user from choosing a simulation length. This choice is always tricky and often leads to CPU-time waste, not to mention user-time waste. Too often, simulation users forget to compute confidence intervals: they only guess a simulation length and ignore the confidence on the simulation results. Those who do compute them generally try several lengths (and thus run several simulations) so as to obtain small enough confidence intervals. The...
Page 1