I can find the best-fit polynomial function for the array, y = ax^2 + bx + c (where y = voltage output and x = incident temperature), and if I have arrays of data at flat fields captured at known T0, ...

Algorithmic complexity, a cornerstone of theoretical computer science, examines the intrinsic resource requirements of computational problems and the limits of what can be efficiently computed. Within ...

Mathematics of Computation, Vol. 34, No. 150 (Apr., 1980), pp. 441-463 (23 pages) Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are ...

Abstract: Embedded applications use more and more sophisticated computations. These computations can integrate the composition of elementary functions which have to be approximated. In the context of ...

Abstract: This paper investigates the robust stability of continuous-time, time-invariant linear uncertain systems in polytopic domains. Robust stability is checked by constructing a quadratic ...

The conditional variance function in a heteroscedastic, nonparametric regression model is estimated by linear smoothing of squared residuals. Attention is focused on local polynomial smoothers. Both ...

This function is a polynomial in two dimensions, with terms up to degree 5. It is nonlinear, and it is smooth despite being complex, which is common for computer ...