Main Page | See live article | Alphabetical index

# Spectral method

In applied mathematics, Spectral methods are algorithms to solve certain kinds of partial differential equations numerically using some sort of Fast Fourier Transform.

Partial differential equations (PDEs) describe a wide array of physical processes such has heat conduction and sound propagation. In many such equations, there are underlying "basic waves" that can be used to give efficient algorithms for computing solutions to these PDEs.

In all cases, one is provided with input data (such as a description of the medium and initial condition for a sound propagation experiment) and a specific PDE governing the physical process. One then writes the input data as a superposition of the basic waves of the PDE. In this form, the solution of the PDE is easily calculated.

## A concrete example

Here we presume a basic understanding of basic multivariate calculus and Fourier series. If g(x,y) is a 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π)) then we are interested in finding a function f(x,y) so that

fxx(x,y)+fyy(x,y)=g(x,y) for all x,y

where fxx and fyy denote the second partial derivatives of f in x and y, respectively. This is Laplace's equation, and can be physically interpreted as some sort of heat conduction problem.

If we write f and g in Fourier series:

f=∑aj,kexp(ijx)exp(iky)
g=∑bj,kexp(ijx)exp(iky)

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

∑aj,k(-(j2+k2))exp(ijx)exp(iky)=∑bj,kexp(ijx)exp(iky)

Here, we crashed the differentials through the infinite sums, but a justification is beyond the scope of this article. By the uniqueness theorem for Fourier expansions, we must then equate the Fourier coefficients term by term, giving

(*) aj,k=-bj,k/(j2+k2)

which is an explicit formula for the Fourier coefficients aj,k.

To turn this into an algorithm, only finitely many frequencies are solved for.

### Algorithm

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(nlogn).
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}