The polynomial of degree n which is the best approximation of the sinc function on the interval 0, π/2 with the square norm is considered. By using Lagrange's method of multipliers, we construct the polynomial explicitly. This method is also generalized to the continuous function on the closed interval a, b. Numerical examples are given to show the effectiveness.

In this paper, a central discontinuous Galerkin method is proposed to solve for the viscosity solutions of Hamilton-Jacobi equations. Central discontinuous Galerkin methods were originally introduced for hyperbolic conservation laws. They combine the central scheme and the discontinuous Galerkin method and therefore carry many features of both methods. Since Hamilton-Jacobi equations in general...

In this paper, we consider sampling in a reproducing kernel subspace of L. We introduce a pre-reconstruction operator associated with a sampling scheme and propose a Galerkin reconstruction in general Banach space setting. We show that the proposed Galerkin method provides a quasi-optimal approximation, and the corresponding Galerkin equations could be solved by an iterative approximation-proje...

In a recent paper [3], Y. Cao and Y. Xu established the Galerkin method for weakly singular Fredholm integral equations that preserves the singularity of the solution. Their Galerkin method provides a numerical solution that is a linear combination of a certain class of basis functions which includes elements that reflect the singularity of the solution. The purpose of this paper is to extend t...

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...

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...

This article is a response to E. Heit and B. K. Hayes’s (2005) comment on the target article “Induction and Categorization in Young Children: A Similarity-Based Model” (V. M. Sloutsky & A. V. Fisher, 2004a). The response discusses points of agreement and disagreement with Heit and Hayes; phenomena predicted by similarity, induction, naming, and categorization (SINC); and relationships between S...