Sinc numerical methods explained

In numerical analysis and applied mathematics, sinc numerical methods are numerical techniques[1] for finding approximate solutions of partial differential equations and integral equations based on the translates of sinc function and Cardinal function C(f,h) which is an expansion of f defined by

infty
C(f,h)(x)=\sum
k=-infty

f(kh)rm{sinc}\left(\dfrac{x}{h}-k\right)

where the step size h>0 and where the sinc function is defined by
rm{sinc}(x)=\sin(\pix)
\pix
Sinc approximation methods excel for problems whose solutions may have singularities, or infinite domains, or boundary layers.

The truncated Sinc expansion of f is defined by the following series:

CM,N(f,h)(x)=\displaystyle

N
\sum
k=-M

f(kh)rm{sinc}\left(\dfrac{x}{h}-k\right)

.

Sinc numerical methods cover

Indeed, Sinc are ubiquitous for approximating every operation of calculus

In the standard setup of the sinc numerical methods, the errors (in big O notation) are known to be

O\left(e-c\sqrt{n

}\right) with some c>0, where n is the number of nodes or bases used in the methods. However, Sugihara[2] has recently found that the errors in the Sinc numerical methods based on double exponential transformation are
-kn
lnn
O\left(e

\right)

with some k>0, in a setup that is also meaningful both theoretically and practically and are found to be best possible in a certain mathematical sense.

Reading

Notes and References

  1. Stenger . F. . 10.1016/S0377-0427(00)00348-4 . Summary of sinc numerical methods . Journal of Computational and Applied Mathematics . 121 . 379–420 . 2000 . free .
  2. Sugihara . M. . Matsuo . T. . 10.1016/j.cam.2003.09.016 . Recent developments of the Sinc numerical methods . Journal of Computational and Applied Mathematics . 164-165 . 673 . 2004 . free .