Sinc numerical methods

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

C(f,h)(x)=\sum_{k=-\infty}^\infty f(kh) \, \textrm{sinc} \left(\dfrac{x}{h}-k \right)

where the step size h>0 and where the sinc function is defined by

\textrm{sinc}(x)=\frac{\sin(\pi x)}{\pi x}

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:

 C_{M,N}(f,h)(x)  = \displaystyle \sum_{k=-M}^{N} f(kh) \, \textrm{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 O\left(e^{-\frac{k n}{\ln n}}\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

References

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


This article is issued from Wikipedia - version of the Friday, September 04, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.