View source for Spectral method

'''Spectral methods''' are a class of techniques used in [[Applied mathematics|applied mathematics]] and scientific computing to numerically solve certain [[Differential equation|differential equation]]s. The idea is to write the solution of the differential equation as a sum of certain "[[Basis function|basis function]]s" (for example, as a [[Fourier series]] which is a sum of [[Physics:Sine wave|sinusoid]]s) and then to choose the coefficients in the sum in order to satisfy the differential equation as well as possible.

Spectral methods and [[Finite element method|finite element method]]s are closely related and built on the same ideas; the main difference between them is that spectral methods use basis functions that are generally nonzero over the whole domain, while finite element methods use basis functions that are nonzero only on small subdomains (compact support). Consequently, spectral methods connect variables ''globally'' while finite elements do so ''locally''. Partially for this reason, spectral methods have excellent error properties, with the so-called "exponential convergence" being the fastest possible, when the solution is smooth. However, there are no known three-dimensional single domain spectral shock capturing results (shock waves are not smooth).<ref name="CHQZ">[https://books.google.com/books?id=7COgEw5_EBQC pp 235, Spectral Methods]: evolution to complex geometries and applications to fluid dynamics, By Canuto, Hussaini, Quarteroni and Zang, Springer, 2007.</ref> In the finite element community, a method where the degree of the elements is very high or increases as the grid parameter ''h'' increases is sometimes called a [[Spectral element method|spectral element method]].

Spectral methods can be used to solve differential equations (PDEs, ODEs, eigenvalue, etc) and [[Optimization problem|optimization problem]]s. When applying spectral methods to time-dependent PDEs, the solution is typically written as a sum of basis functions with time-dependent coefficients; substituting this in the PDE yields a system of ODEs in the coefficients which can be solved using any [[Numerical methods for ordinary differential equations|numerical method for ODEs]]. Eigenvalue problems for ODEs are similarly converted to matrix eigenvalue problems {{Citation needed|date=August 2013}}.

Spectral methods were developed in a long series of papers by [[Biography:Steven Orszag|Steven Orszag]] starting in 1969 including, but not limited to, Fourier series methods for periodic geometry problems, polynomial spectral methods for finite and unbounded geometry problems, pseudospectral methods for highly nonlinear problems, and spectral iteration methods for fast solution of steady-state problems. The implementation of the spectral method is normally accomplished either with [[Collocation method|collocation]] or a [[Galerkin method|Galerkin]] or a Tau approach . For very small problems, the spectral method is unique in that solutions may be written out symbolically, yielding a practical alternative to series solutions for differential equations.

Spectral methods can be computationally less expensive and easier to implement than finite element methods; they shine best when high accuracy is sought in simple domains with smooth solutions. However, because of their global nature, the matrices associated with step computation are dense and computational efficiency will quickly suffer when there are many degrees of freedom (with some exceptions, for example if matrix applications can be written as [[Fourier transform]]s). For larger problems and nonsmooth solutions, finite elements will generally work better due to sparse matrices and better modelling of discontinuities and sharp bends.

==Examples of spectral methods==

===A concrete, linear example===

Here we presume an understanding of basic multivariate [[Calculus|calculus]] and [[Fourier series]]. If <math>g(x,y)</math> is a known, complex-valued function of two real variables, and g is periodic in x and y (that is, <math>g(x,y)=g(x+2\pi,y)=g(x,y+2\pi)</math>) then we are interested in finding a function ''f''(''x'',''y'') so that

:<math>\left(\frac{\partial^2}{\partial x^2}+\frac{\partial^2}{\partial y^2}\right)f(x,y)=g(x,y)\quad \text{for all } x,y</math>
<!--math>f_{xx}(x,y)+f_{yy}(x,y)=g(x,y)\quad \text{for all} x,y</math-->

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:

:<math>\begin{align}
f&=:\sum a_{j,k}e^{i(jx+ky)}, \\[5mu]
g&=:\sum b_{j,k}e^{i(jx+ky)},
\end{align}</math>

and substitute into the differential equation, we obtain this equation:

:<math>\sum -a_{j,k}(j^2+k^2)e^{i(jx+ky)}=\sum b_{j,k}e^{i(jx+ky)}.</math>

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

{{NumBlk|:| <math>a_{j,k}=-\frac{b_{j,k}}{j^2+k^2}</math>|{{EquationRef|<nowiki>*</nowiki>}}}}

which is an explicit formula for the Fourier coefficients ''a''<sub>''j'',''k''</sub>.

With periodic boundary conditions, the Poisson equation possesses a solution only if ''b''<sub>0,0</sub> = 0. Therefore, we can freely choose ''a''<sub>0,0</sub> 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 <math>h^n</math>, where <math>h := 1/n</math> and <math>n</math> is the highest frequency treated.

==== Algorithm ====

# Compute the Fourier transform (''b<sub>j,k</sub>'') of ''g''.
# Compute the Fourier transform (''a<sub>j,k</sub>'') of ''f'' via the formula ({{EquationNote|*}}).
# Compute ''f'' by taking an inverse Fourier transform of (''a<sub>j,k</sub>'').

Since we're only interested in a finite window of frequencies (of size ''n'', say) this can be done using a [[Fast Fourier transform|fast Fourier transform]] algorithm. Therefore, globally the algorithm runs in {{nowrap|time ''O''(''n'' log ''n'').}}

===Nonlinear example===

We wish to solve the forced, transient, nonlinear [[Burgers' equation]] using a spectral approach.

Given <math>u(x,0)</math> on the periodic domain
<math>x\in\left[0,2\pi\right)</math>, find <math>u \in \mathcal{U}</math> such that
:<math>\partial_{t} u + u \partial_{x} u = \rho \partial_{xx} u + f \quad \forall x\in\left[0,2\pi\right), \forall t>0</math>
where &rho; is the [[Physics:Viscosity|viscosity]] coefficient. In weak conservative form this becomes
:<math>\left\langle \partial_{t} u , v \right\rangle = \Bigl\langle  \partial_x \left(-\tfrac12 u^2 + \rho \partial_{x} u\right) , v \Bigr\rangle + \left\langle f, v \right\rangle \quad \forall v\in \mathcal{V}, \forall t>0</math>
where  following [[Inner product space|inner product]] notation. [[Integration by parts|Integrating by parts]] and using periodicity grants
:<math>\langle \partial_{t} u , v \rangle = \left\langle   \tfrac12 u^2 - \rho \partial_{x} u  ,  \partial_x v\right\rangle+\left\langle f, v \right\rangle \quad \forall v\in \mathcal{V}, \forall t>0.</math>

To apply the Fourier–[[Galerkin method]], choose both
:<math>\mathcal{U}^N := \biggl\{ u : u(x,t)=\sum_{k=-N/2}^{N/2-1} \hat{u}_{k}(t) e^{i k x}\biggr\}</math>
and
:<math>\mathcal{V}^N :=\operatorname{span}\left\{ e^{i k x} : k\in -\tfrac12 N,\dots,\tfrac12N - 1\right\}</math>
where <math>\hat{u}_k(t):=\frac{1}{2\pi}\langle u(x,t), e^{i k x} \rangle</math>. This reduces the problem to finding <math>u\in\mathcal{U}^N</math> such that
:<math>\langle \partial_{t} u , e^{i k x} \rangle = \left\langle  \tfrac12 u^2 - \rho \partial_{x} u  ,  \partial_x e^{i k x}  \right\rangle + \left\langle f, e^{i k x} \right\rangle \quad \forall k\in \left\{ -\tfrac12N,\dots,\tfrac12N-1 \right\}, \forall t>0.</math>

Using the [[Orthogonality|orthogonality]] relation <math>\langle e^{i l x}, e^{i k x} \rangle = 2 \pi \delta_{lk}</math> where <math>\delta_{lk}</math> is the [[Kronecker delta]], we simplify the above three terms for each <math>k</math> to see
:<math>
\begin{align}
\left\langle \partial_{t} u , e^{i k x}\right\rangle &= \biggl\langle     \partial_{t} \sum_{l} \hat{u}_{l} e^{i l x}     ,      e^{i k x} \biggr\rangle  = \biggl\langle    \sum_{l} \partial_{t} \hat{u}_{l} e^{i l x}    ,     e^{i k x} \biggr\rangle = 2 \pi \partial_t \hat{u}_k,
\\
\left\langle f , e^{i k x} \right\rangle &= \biggl\langle    \sum_{l} \hat{f}_{l} e^{i l x}    ,     e^{i k x}\biggr\rangle= 2 \pi \hat{f}_k, \text{ and}
\\
\left\langle
  \tfrac12 u^2 - \rho \partial_{x} u
  ,
  \partial_x e^{i k x}
\right\rangle
&=
\biggl\langle
    \tfrac12
    \Bigl(\sum_{p} \hat{u}_p e^{i p x}\Bigr)
    \Bigl(\sum_{q} \hat{u}_q e^{i q x}\Bigr)
    - \rho \partial_x \sum_{l} \hat{u}_l e^{i l x}
    ,
    \partial_x e^{i k x}
\biggr\rangle
\\
&=
\biggl\langle
    \tfrac12
    \sum_{p} \sum_{q} \hat{u}_p \hat{u}_q e^{i \left(p+q\right) x}
    ,
    i k e^{i k x}
\biggr\rangle
-
\biggl\langle
    \rho i \sum_{l} l \hat{u}_l e^{i l x}
    ,
    i k e^{i k x}
\biggr\rangle
\\
&=
-\tfrac12 i k
\biggl\langle
    \sum_{p} \sum_{q} \hat{u}_p \hat{u}_q e^{i \left(p+q\right) x}
    ,
    e^{i k x}
\biggr\rangle
- \rho k
\biggl\langle
    \sum_{l} l \hat{u}_l e^{i l x}
    ,
    e^{i k x}
\biggr\rangle
\\
&=
- i \pi k \sum_{p+q=k} \hat{u}_p \hat{u}_q - 2\pi\rho{}k^2\hat{u}_k.
\end{align}
</math>

Assemble the three terms for each <math>k</math> to obtain
:<math>
2 \pi \partial_t \hat{u}_k
=
- i \pi k \sum_{p+q=k} \hat{u}_p \hat{u}_q 
- 2\pi\rho{}k^2\hat{u}_k
+ 2 \pi \hat{f}_k
\quad k\in\left\{ -\tfrac12N,\dots,\tfrac12N-1 \right\}, \forall t>0.
</math>
Dividing through by <math>2\pi</math>, we finally arrive at
:<math>
\partial_t \hat{u}_k
=
- \frac{i k}{2} \sum_{p+q=k} \hat{u}_p \hat{u}_q 
- \rho{}k^2\hat{u}_k
+ \hat{f}_k
\quad k\in\left\{ -\tfrac12N,\dots,\tfrac12N-1 \right\}, \forall t>0.
</math>
With Fourier transformed initial conditions <math>\hat{u}_{k}(0)</math> and forcing <math>\hat{f}_{k}(t)</math>, 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|convolution]], and there are several transform-based techniques for evaluating it efficiently. See the references by Boyd and Canuto et al. for more details.

== A relationship with the spectral element method ==

One can show that if <math>g</math> 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 <math>C_n<\infty</math> such that the error is less than <math>C_nh^n</math> for all sufficiently small values of <math>h</math>. We say that the spectral method is of order <math>n</math>, for every n>0.

Because a [[Spectral element method|spectral element method]] is a [[Finite element method|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 problem|elliptic boundary value problem]]s.

== See also ==
* [[Finite element method]]
* [[Earth:Gaussian grid|Gaussian grid]]
* [[Pseudo-spectral method]]
* [[Spectral element method]]
* [[Galerkin method]]
* [[Collocation method]]

== References ==
{{Reflist}}
* Bengt Fornberg (1996) ''A Practical Guide to Pseudospectral Methods.'' Cambridge University Press, Cambridge, UK
* [http://www-personal.umich.edu/~jpboyd/BOOK_Spectral2000.html Chebyshev and Fourier Spectral Methods] by John P. Boyd.
* Canuto C., [[Biography:M. Yousuff Hussaini|Hussaini M. Y.]], Quarteroni A., and Zang T.A. (2006) ''Spectral Methods. Fundamentals in Single Domains.'' Springer-Verlag, Berlin Heidelberg
* Javier de Frutos, Julia Novo (2000): [https://epubs.siam.org/doi/10.1137/S0036142999351984 A Spectral Element Method for the Navier–Stokes Equations with Improved Accuracy]
* [http://cdm.unimo.it/home/matematica/funaro.daniele/bube.htm Polynomial Approximation of Differential Equations], by Daniele Funaro, Lecture Notes in Physics, Volume 8, Springer-Verlag, Heidelberg 1992
* D. Gottlieb and S. Orzag (1977) "Numerical Analysis of Spectral Methods : Theory and Applications", SIAM, Philadelphia, PA
* J. Hesthaven, S. Gottlieb and D. Gottlieb (2007) "Spectral methods for time-dependent problems", Cambridge UP, Cambridge, UK
* Steven A. Orszag (1969) ''Numerical Methods for the Simulation of Turbulence'', Phys. Fluids Supp. II, 12, 250–257
*{{Cite book | last1=Press | first1=WH | last2=Teukolsky | first2=SA | last3=Vetterling | first3=WT | last4=Flannery | first4=BP | year=2007 | title=Numerical Recipes: The Art of Scientific Computing | edition=3rd | publisher=Cambridge University Press |  location=New York | isbn=978-0-521-88068-8 | chapter=Section 20.7. Spectral Methods | chapter-url=http://apps.nrbook.com/empanel/index.html#pg=1083}}
* Jie Shen, Tao Tang and Li-Lian Wang (2011) "Spectral Methods: Algorithms, Analysis and Applications" (Springer Series in Computational Mathematics, V. 41, Springer), {{ISBN|354071040X}}
* Lloyd N. Trefethen (2000) ''Spectral Methods in MATLAB.'' SIAM, Philadelphia, PA

{{Numerical PDE}}
{{Functional analysis}}
{{SpectralTheory}}

{{DEFAULTSORT:Spectral Method}}
[[Category:Numerical analysis]]
[[Category:Numerical differential equations]]

{{Sourceattribution|Spectral method}}