We derive simple Chebyshev polynomial approximations for the density function and cumulative distribution function of the Chernoff distribution. They provide 6 significant figure accuracy with extreme efficiency.

where x(t) ∈ D ⊂ Rp and f (x) ∈ R is an unknown function but assumed to be bounded function in x. When the structure of the uncertainty is unknown, function approximation is usually employed to estimate the unknown function. In recent years, neural networks have gained a lot of attention in function approximation theory in connection with adaptive control. Multi-layer neural networks have the c...

We define what it means for a function on ω1 to be a collapsing function for λ and show that if there exists a collapsing function for (21), then there is no precipitous ideal on ω1. We show that a collapsing function for ω2 can be added by forcing. We define what it means to be a weakly ω1-Erdös cardinal and show that in L[E], there is a collapsing function for λ iff λ is less than the least w...

The Clenshaw Curtis method for numerical integration is extended to semiinfinite ([_0, 30] and infinite [-0% oc] intervals. The common framework for both these extensions and for integration on a finite interval is to (1) map the integration domain to tc[0, z], (2) compute a Fourier sine or cosine approximation to the transformd integrand via interpolation, and (3) integrate the approximation. ...

This paper is concerned with a formal linearization problem for a general class of nonlinear time-varying dynamic systems. To a given system, a linearization function is made up of Chebyshev polynomials about its state variables. The nonlinear time-varying system is transformed into a linear time-varying system in terms of the linearization function using Chebyshev interpolation to state variab...

The mathematical theory of closed form functions for calculating LSFs on the basis of generating functions is presented. Exploiting recurrence relationships in the series expansion of Chebyshev polynomials of the first kind makes it possible to bootstrap iterative LSF-search from a set of characteristic polynomial zeros. The theoretical analysis is based on decomposition of sequences into symme...

Keywords: Set-valued mapping Chebyshev center Uniformly convex Locally uniformly convex Chebyshev fixed point a b s t r a c t The existence of a continuous Chebyshev selection for a Hausdorff continuous set-valued mapping is studied in a Banach space with some uniform convexity. As applications, some existence results of Chebyshev fixed point for condensing set-valued mappings are given, and th...

This article describes a fast direct solver (i.e., not iterative) for partial hierarchically semiseparable systems. This solver requires a storage of O(N logN) and has a computational complexity of O(N logN) arithmetic operations. The numerical benchmarks presented illustrate the method in the context of interpolation using radial basis functions. The key ingredients behind this fast solver are...

A common practice for computing an elementary transcendental function nowadays has two phases: reductions of input arguments to fall into a tiny interval and polynomial approximations for the function within the interval. Typically the interval is made tiny enough so that one won’t have to go for polynomials of very high degrees for accurate approximations. Often approximating polynomials as su...