On the convergence rate of a modified Fourier series
نویسنده
چکیده
The rate of convergence for an orthogonal series that is a minor modification of the Fourier series is proved. This series converges pointwise at a faster rate than the Fourier series for nonperiodic functions. We present the error as an asymptotic expansion, where the lowest term in this expansion is of asymptotic order two. Subtracting out the terms from this expansion allows us to increase the order of convergence, though the terms of this expansion depend on derivatives. Alternatively, we can employ extrapolation methods which achieve higher convergence rates using only the coefficients of the series. We also present a method for the efficient computation of the coefficients in the series.
منابع مشابه
Multivariate modified Fourier series and application to boundary value problems
In this paper we analyse the approximation-theoretic properties of modified Fourier series in Cartesian product domains with coefficients from full and hyperbolic cross index sets. We show that the number of expansion coefficients may be reduced significantly whilst retaining comparable error estimates. In doing so we extend the univariate results of Iserles, Nørsett and S. Olver. We then demon...
متن کاملConvergence acceleration of modified Fourier series in one or more dimensions
Modified Fourier series have recently been introduced as an adjustment of classical Fourier series for the approximation of nonperiodic functions defined on d-variate cubes. Such approximations offer a number of advantages, including uniform convergence. However, like Fourier series, the rate of convergence is typically slow. In this paper we extend Eckhoff’s method to the convergence accelerat...
متن کاملModified frame algorithm and its convergence acceleration by Chebyshev method
The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...
متن کاملSimulation of Singular Fourth- Order Partial Differential Equations Using the Fourier Transform Combined With Variational Iteration Method
In this paper, we present a comparative study between the modified variational iteration method (MVIM) and a hybrid of Fourier transform and variational iteration method (FTVIM). The study outlines the efficiencyand convergence of the two methods. The analysis is illustrated by investigating four singular partial differential equations with variable coefficients. The solution of singular partia...
متن کاملNumerical solution of general nonlinear Fredholm-Volterra integral equations using Chebyshev approximation
A numerical method for solving nonlinear Fredholm-Volterra integral equations of general type is presented. This method is based on replacement of unknown function by truncated series of well known Chebyshev expansion of functions. The quadrature formulas which we use to calculate integral terms have been imated by Fast Fourier Transform (FFT). This is a grate advantage of this method which has...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 78 شماره
صفحات -
تاریخ انتشار 2009