A form of this was conjectured by Gauss about 1800, [Chebyshev 1848/52] and [Chebyshev 1850/52] made notable progress with essentially elementary methods. The landmark paper Riemann 1859] made clear the intimate connection between prime numbers and the behavior of ζ(s) as a function of a complex variable. The theorem was proven independently by [Hadamard 1896] and [de la Vallée Poussin 1896] by...

We show that Chebyshev Polynomials are a practical representation of computable functions on the computable reals. The paper presents error estimates for common operations and demonstrates that Chebyshev Polynomial methods would be more efficient than Taylor Series methods for evaluation of transcendental functions. Keywords—Approximation Theory, Chebyshev Polynomial, Computable Functions, Comp...

BACKGROUND Magnetic particle imaging (MPI) is a new tomographic imaging technique capable of imaging magnetic tracer material at high temporal and spatial resolution. Image reconstruction requires solving a system of linear equations, which is characterized by a "system function" that establishes the relation between spatial tracer position and frequency response. This paper for the first time ...

In Euclidean spaces, the geometric notions of nearest-points map, farthestpoints map, Chebyshev set, Klee set, and Chebyshev center are well known and well understood. Since early works going back to the 1930s, tremendous theoretical progress has been made, mostly by extending classical results from Euclidean space to Banach space settings. In all these results, the distance between points is i...

Abstract We present numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the Chebyshev polynomial of order N (El-gendi’s method). The solutions are exact at these points, apart from round-off computer errors and the convergen...

We gave a short review of several results which are related to the role of splines (cardinal, centered or interpolating) in numerical integration. Results deal with the problem of approximate computation of the integrals with spline as a weight function, but also with the problem of approximate computation of the integrals without weight function. Besides, we presented an algorithm for calculat...

‎In this paper‎, ‎we present a new modification of Chebyshev-Halley‎ ‎method‎, ‎free from second derivatives‎, ‎to solve nonlinear equations‎. ‎The convergence analysis shows that our modification is third-order‎ ‎convergent‎. ‎Every iteration of this method requires one function and‎ ‎two first derivative evaluations‎. ‎So‎, ‎its efficiency index is‎ ‎$3^{1/3}=1.442$ that is better than that o...

The aim of this work is to find numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the Chebyshev polynomial of order N . The solutions are exact at these points, apart from round-off computer errors and the convergence of o...

Obtain at least three different magnitude approximations that satisfy the following specifications: Figure 1 Four different approximations (Butterworth, Chebyshev, Elliptic and Inverse Chebyshev) were obtained for the given specifications using the CAD software FIESTA2. First, the transfer function and main performance plots will be shown for each of the approximations and then, a comparison be...

We detail the implementation of basic operations on multivariate Chebyshev approximations. In most cases, they can be derived directly from well known properties of univariate Chebyshev polynomials. Besides addition, subtraction and multiplication, we discuss integration, indefinite di↵erentiation, indefinite integration and interpolation. The latter three, can be written as matrix-vector produ...