Two near minimax norms for polynomial approximation are presented. They are designed for approximation of both a function and its first derivative uniformly by polynomials over a given finite interval ...
The FD= and FDHESSIAN= options specify the use of finite difference approximations of the derivatives. The FD= option specifies that all derivatives are approximated using function evaluations, and ...
Dynamic systems involving convolution integrals with decaying kernels, of which fractionally damped systems form a special case, are non-local in time and hence infinite dimensional. Straightforward ...
Function approximation, a central theme in numerical analysis and applied mathematics, seeks to represent complex functions through simpler or more computationally tractable forms. In this context, ...
Numerical optimization of a numerically integrated function is a difficult task, and the computation of the objective function and its derivatives can lead to arithmetic exceptions and overflows. A ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results