Approximation of Functions on a Square by Interpolation Polynomials at Vertices and Few Fourier Coefficients

For a bivariate function on a square, in general, its Fourier coefficients decay slowly, so one cannot reconstruct it by few Fourier coefficients. In this paper we will develop a new approximation scheme to overcome the weakness of Fourier approximation. In detail, we will use Lagrange interpolation...

Full description

Saved in:
Bibliographic Details
Main Author: Zhihua Zhang
Format: Article
Language:English
Published: Wiley 2017-01-01
Series:Journal of Function Spaces
Online Access:http://dx.doi.org/10.1155/2017/9376505
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For a bivariate function on a square, in general, its Fourier coefficients decay slowly, so one cannot reconstruct it by few Fourier coefficients. In this paper we will develop a new approximation scheme to overcome the weakness of Fourier approximation. In detail, we will use Lagrange interpolation and linear interpolation on the boundary of the square to derive a new approximation scheme such that we can use the values of the target function at vertices of the square and few Fourier coefficients to reconstruct the target function with very small error.
ISSN:2314-8896
2314-8888