An effective means to approximate an analytic, nonperiodic function on a bounded interval is by using a Fourier series on a larger domain. When constructed appropriately, this so-called Fourier extension is known to converge geometrically fast in the truncation parameter. Unfortunately, computing a Fourier extension requires solving an ill-conditioned linear system, and hence one might expect such rapid convergence to be destroyed when carrying out computations in finite precision. The purpose of this paper is to show that this is not the case. Specifically, we show that Fourier extensions are actually numerically stable when implemented in finite arithmetic, and achieve a convergence rate that is at least superalgebraic. Thus, in this instance, ill-conditioning of the linear system does not prohibit a good approximation.In the second part of this paper we consider the issue of computing Fourier extensions from equispaced data. A result of Platte, Trefethen & Kuijlaars states that no method for this problem can be both numerically stable and exponentially convergent. We explain how Fourier extensions relate to this theoretical barrier, and demonstrate that they are particularly well suited for this problem: namely, they obtain at least superalgebraic convergence in a numerically stable manner. arXiv:1206.4111v3 [math.NA] 12 May 2013 2. The condition number κ(F N ) of the exact continuous FE mapping is exponentially large in N . The condition number of the exact discrete FE mapping satisfies κ(F N ) = 1 for all N (see §3.4).
Cox and Matthews [S.M. Cox, P.C. Matthews, Exponential time differencing for stiff systems, J. Comput. Phys. 176 (2002) 430-455] developed a class of Exponential Time Differencing Runge-Kutta schemes (ETDRK) for nonlinear parabolic equations; Kassam and Trefethen [A.K. Kassam, Ll. N. Trefethen, Fourth-order time stepping for stiff pdes, SIAM J. Sci. Comput. 26 (2005) 1214-1233] have shown that these schemes can suffer from numerical instability and they proposed a modified form of the fourth-order (ETDRK4) scheme. They use complex contour integration to implement these schemes in a way that avoids inaccuracies when inverting matrix polynomials, but this approach creates new difficulties in choosing and evaluating the contour for larger problems. Neither treatment addresses problems with nonsmooth data, where spurious oscillations can swamp the numerical approximations if one does not treat the problem carefully. Such problems with irregular initial data or mismatched initial and boundary conditions are important in various applications, including computational chemistry and financial engineering. We introduce a new version of the fourth-order Cox-Matthews, Kassam-Trefethen ETDRK4 scheme designed to eliminate the remaining computational difficulties. This new scheme utilizes an exponential time differencing Runge-Kutta ETDRK scheme using a diagonal Padé approximation of matrix exponential functions, while to deal with the problem of nonsmooth data we use several steps of an ETDRK scheme using a sub-diagonal Padé formula. The new algorithm improves computational efficiency with respect to evaluation of the high degree polynomial functions of matrices, having an advantage of splitting the matrix polynomial inversion problem into a sum of linear problems that can be solved in parallel. In this approach it is only required that several backward Euler linear problems be solved, in serial or parallel. Numerical experiments are described to support the new scheme.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.