In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
: We prove the computability of Bloch's constant by presenting the first algorithm approximating the constant up to arbitrary precision. Key Words: computability, algorithm, B...
With respect to a wavelet basis, singular integral operators can be well approximated by sparse matrices, and in [Found. Comput. Math., 2 (2002), pp. 203
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...