Here we presume an understanding of basic multivariate calculus and Fourier series. If g ( x , y ) {\displaystyle g(x,y)} is a known, complex-valued function of two real variables, and g is periodic in x and y (that is, g ( x , y ) = g ( x + 2 π , y ) = g ( x , y + 2 π ) {\displaystyle g(x,y)=g(x+2\pi ,y)=g(x,y+2\pi )} ) then we are interested in finding a function f(x,y) so that
where the expression on the left denotes the second partial derivatives of f in x and y, respectively. This is the Poisson equation, and can be physically interpreted as some sort of heat conduction problem, or a problem in potential theory, among other possibilities.
If we write f and g in Fourier series:
and substitute into the differential equation, we obtain this equation:
We have exchanged partial differentiation with an infinite sum, which is legitimate if we assume for instance that f has a continuous second derivative. By the uniqueness theorem for Fourier expansions, we must then equate the Fourier coefficients term by term, giving
which is an explicit formula for the Fourier coefficients aj,k.
With periodic boundary conditions, the Poisson equation possesses a solution only if b0,0 = 0. Therefore, we can freely choose a0,0 which will be equal to the mean of the resolution. This corresponds to choosing the integration constant.
To turn this into an algorithm, only finitely many frequencies are solved for. This introduces an error which can be shown to be proportional to h n {\displaystyle h^{n}} , where h := 1 / n {\displaystyle h:=1/n} and n {\displaystyle n} is the highest frequency treated.
Since we're only interested in a finite window of frequencies (of size n, say) this can be done using a fast Fourier transform algorithm. Therefore, globally the algorithm runs in time O(n log n).
We wish to solve the forced, transient, nonlinear Burgers' equation using a spectral approach.
Given u ( x , 0 ) {\displaystyle u(x,0)} on the periodic domain x ∈ [ 0 , 2 π ) {\displaystyle x\in \left[0,2\pi \right)} , find u ∈ U {\displaystyle u\in {\mathcal {U}}} such that
where ρ is the viscosity coefficient. In weak conservative form this becomes
where following inner product notation. Integrating by parts and using periodicity grants
To apply the Fourier–Galerkin method, choose both
and
where u ^ k ( t ) := 1 2 π ⟨ u ( x , t ) , e i k x ⟩ {\displaystyle {\hat {u}}_{k}(t):={\frac {1}{2\pi }}\langle u(x,t),e^{ikx}\rangle } . This reduces the problem to finding u ∈ U N {\displaystyle u\in {\mathcal {U}}^{N}} such that
Using the orthogonality relation ⟨ e i l x , e i k x ⟩ = 2 π δ l k {\displaystyle \langle e^{ilx},e^{ikx}\rangle =2\pi \delta _{lk}} where δ l k {\displaystyle \delta _{lk}} is the Kronecker delta, we simplify the above three terms for each k {\displaystyle k} to see
Assemble the three terms for each k {\displaystyle k} to obtain
Dividing through by 2 π {\displaystyle 2\pi } , we finally arrive at
With Fourier transformed initial conditions u ^ k ( 0 ) {\displaystyle {\hat {u}}_{k}(0)} and forcing f ^ k ( t ) {\displaystyle {\hat {f}}_{k}(t)} , this coupled system of ordinary differential equations may be integrated in time (using, e.g., a Runge Kutta technique) to find a solution. The nonlinear term is a convolution, and there are several transform-based techniques for evaluating it efficiently. See the references by Boyd and Canuto et al. for more details.
One can show that if g {\displaystyle g} is infinitely differentiable, then the numerical algorithm using Fast Fourier Transforms will converge faster than any polynomial in the grid size h. That is, for any n>0, there is a C n < ∞ {\displaystyle C_{n}<\infty } such that the error is less than C n h n {\displaystyle C_{n}h^{n}} for all sufficiently small values of h {\displaystyle h} . We say that the spectral method is of order n {\displaystyle n} , for every n>0.
Because a spectral element method is a finite element method of very high order, there is a similarity in the convergence properties. However, whereas the spectral method is based on the eigendecomposition of the particular boundary value problem, the finite element method does not use that information and works for arbitrary elliptic boundary value problems.
pp 235, Spectral Methods: evolution to complex geometries and applications to fluid dynamics, By Canuto, Hussaini, Quarteroni and Zang, Springer, 2007. https://books.google.com/books?id=7COgEw5_EBQC ↩
Muradova, Aliki D. (2008). "The spectral method and numerical continuation algorithm for the von Kármán problem with postbuckling behaviour of solutions". Adv Comput Math. 29 (2): 179–206, 2008. doi:10.1007/s10444-007-9050-7. hdl:1885/56758. S2CID 46564029. /wiki/Doi_(identifier) ↩
Muradova, Aliki D. (2015). "A time spectral method for solving the nonlinear dynamic equations of a rectangular elastic plate". Journal of Engineering Mathematics. 92: 83–101, 2015. doi:10.1007/s10665-014-9752-z. /wiki/Doi_(identifier) ↩