Related papers: Numerical Differentiation of Functions of Two Vari…
We study boundary values of harmonic functions in spaces of quasianalytic functionals and spaces of ultradistributions of non-quasianalytic type. As an application, we provide a new approach to H\"ormander's support theorem for…
For an arbitrary given span of high-dimensional multivariate Chebyshev polynomials, an approach to construct spatial discretizations is presented, i.e., the construction of a sampling set that allows for the unique reconstruction of each…
In this work we present a method, based on the use of Bernstein polynomials, for the numerical resolution of some boundary values problems. The computations have not need of particular approximations of derivatives, such as finite…
We present a computationally efficient algorithm for stable numerical differentiation from noisy, uniformly-sampled data on a bounded interval. The method combines multi-interval Fourier extension approximations with an adaptive domain…
We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the…
We have presented some practical consequences on the molecular-dynamics simulations arising from the numerical algorithm published recently in paper Int. J. Mod. Phys. C 16, 413 (2005). The algorithm is not a finite-difference method and…
In this paper we demonstrate that a well known linear inequality method developed for rational Chebyshev approximation is equivalent to the application of the bisection method used in quasiconvex optimisation. Although this correspondence…
In a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we show that functions of bounded variation (BV functions) can be approximated in the strict sense and pointwise uniformly by special…
In the present paper, a new subclass of analytic and bi-univalent functions by means of Chebyshev polynomials is introduced. Certain coefficient bounds for functions belong to this subclass are obtained. Furthermore, the Fekete-Szego…
This work characterizes the structure of third and forth order WENO weights by deducing data bounded condition on third order polynomial approximations. Using these conditions, non-linear weights are defined for third and fourth order data…
Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…
The theory of Chebyshev approximation has been extensively studied. In most cases, the optimality conditions are based on the notion of alternance or alternating sequence (that is, maximal deviation points with alternating deviation signs).…
We present randomized algorithms based on block Krylov space method for estimating the trace and log-determinant of Hermitian positive semi-definite matrices. Using the properties of Chebyshev polynomial and Gaussian random matrix, we…
In this paper, we develop a general theory of truncated inverse binomial sampling. In this theory, the fixed-size sampling and inverse binomial sampling are accommodated as special cases. In particular, the classical Chernoff-Hoeffding…
An algorithm for integration of polynomial functions with variable weight is considered. It provides extension of the Gaussian integration, with appropriate scaling of the abscissas and weights. Method is a good alternative to usually…
In this letter, we present a fast and well-conditioned spectral method based on the Chebyshev polynomials for computing the continuous part of the nonlinear Fourier spectrum. The algorithm achieves a complexity of $O(N_{\text{iter.}}N\log…
Iterative methods for the simultaneous determination of all roots of an equation are dis-cussed. The multiplicities of the roots are assumed to be known in advance. The methods are proved to have a cubical rate of convergence. Numerical…
This paper studies the data-driven balanced truncation (BT) method for second-order systems based on the measurements in the frequency domain. The basic idea is to approximate Gramians used the numerical quadrature rules, and establish the…
The aim of the present work is to introduce a method based on Chebyshev polynomials for the numerical solution of a system of Cauchy type singular integral equations of the first kind on a finite segment. Moreover, an estimation error is…
Chebyshev expansion coefficients can be computed efficiently by using the FFT, and for smooth functions the resulting approximation is close to optimal, with computations that are numerically stable. Given sufficiently accurate function…