In this paper we study a method for the approximation by a monotone smooth function of a discrete set of observations. By this method it is possible to obtain a completely automatic program. We show that the solution is monotone with probability tending to one and by the test examples that it is sufficient in the practical case
Bozzini, M., Paracelli, C. (1993). An algorithm for constrained smoothing functions. Algorithms for approximation, III (Oxford, 1992). NUMERICAL ALGORITHMS, 5(7), 341-351 [10.1007/BF02109195].
An algorithm for constrained smoothing functions. Algorithms for approximation, III (Oxford, 1992)
BOZZINI, MARIA TUGOMIRA;
1993
Abstract
In this paper we study a method for the approximation by a monotone smooth function of a discrete set of observations. By this method it is possible to obtain a completely automatic program. We show that the solution is monotone with probability tending to one and by the test examples that it is sufficient in the practical case
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
