The aim of this paper is to discuss a nonlinear approximation problem relevant to the approximation of data by radial-basis-function neural networks. The approximation is based on superpositions of translated Gaussians. The method used enables us to give explicit approximations and error bounds. New connections between this problem and sampling theory are exposed, but the method used departs ra...

EEorts to develop sinc domain decomposition methods for second-order two-point boundary-value problems have been successful, thus warranting further development of these methods. A logical rst step is to thoroughly investigate the extension of these methods to Poisson's equation posed on a rectangle. The Sinc-Galerkin and sinc-collocation methods are, for appropriate weight choices, identical f...

In this paper an alternative analysis in the time domain is described and the results of the interpolation process are presented by means of functions that are based on the rule of conditional mathematical expectation and the covariance function. A comparison between the interpolation error caused by low order filters and the classic sinc(t) truncated function is also presented. When fewer samp...

Abstract An efficient direct domain decomposition method is developed coupled with Poly-Sinc approximation over complex geometry. We solve 2D Poisson equations in L-Shaped geometry. The spatial domains of interest are decomposed into several non-overlapping rectangular subdomains. In each sub-domain, a Poly-Sinc collocation scheme is used to approximate the solution of the governing equation. S...

The aim of this paper is to present a new numerical method for solving the Bagley-Torvik equation. This equation has an important role in fractional calculus. The fractional derivatives are described based on the Caputo sense. Some properties of the sinc functions required for our subsequent development are given and are utilized to reduce the computation of solution of the Bagley-Torvik equati...

Contents Abstract Sinc approximation methods excel for problems whose solutions may have singularities, or innnite domains, or boundary layers. This article summarizes results obtained to date, on Sinc numerical methods of computation. Sinc methods provide procedures for function approximation over bounded or unbounded regions, encompassing interpolation, approximation of derivatives, approxima...

A number of problems in image reconstruction and image processing can be addressed, in principle, using the sinc kernel. Since the sinc kernel decays slowly, however, it is generally avoided in favor of some more local but less precise choice. In this paper, we describe the fast sinc transform, an algorithm which computes the convolution of arbitrarily spaced data with the sinc kernel in O.N lo...

We developed a program code of configuration interaction singles (CIS) based on a numerical grid method. We used Kohn-Sham (KS) as well as Hartree-Fock (HF) orbitals as a reference configuration and Lagrange-sinc functions as a basis set. Our calculations show that KS-CIS is more cost-effective and more accurate than HF-CIS. The former is due to the fact that the non-local HF exchange potential...

Chebfun is an established software system for computing with functions of a real variable, but its capabilities for handling functions with singularities are limited. Here an analogous system is described based on sinc function expansions instead of Chebyshev series. This experiment sheds light on the strengths and weaknesses of sinc function techniques. It also serves as a review of some of th...