Let y′′+p(x) y′+q(x) y=0y''+p(x)\,y'+q(x)\,y=0 be a second-order linear homogeneous equation. A point x0x_0 is an ordinary point of the equation if pp and qq are analytic at x0x_0 and a singular point otherwise. Near an ordinary point every solution is analytic and is found as a power series with unknown coefficients,

y(x)=∑n=0∞an(x−x0)n,y(x)=\sum_{n=0}^{\infty}a_n\left(x-x_0\right)^n,

by differentiating term by term, substituting into the equation and equating the coefficient of each power of x−x0x-x_0 to zero, which gives a recurrence relation that determines a2,a3,…a_2,a_3,\ldots from the free coefficients a0=y(x0)a_0=y\left(x_0\right) and a1=y′(x0).a_1=y'\left(x_0\right). The radius of convergence of the series is at least the distance from x0x_0 to the nearest singular point of the equation in the complex plane. For example, the Airy equation y′′−x y=0y''-x\,y=0 has only ordinary points and the recurrence (n+2)(n+1)an+2=an−1,\left(n+2\right)\left(n+1\right)a_{n+2}=a_{n-1}, whose solutions converge on all of R.\mathbb{R}.

A singular point x0x_0 is a regular singular point if (x−x0)p(x)\left(x-x_0\right)p(x) and (x−x0)2q(x)\left(x-x_0\right)^2q(x) are analytic at x0,x_0, and an irregular singular point otherwise. Near a regular singular point the Frobenius method seeks solutions of the form

y(x)=(x−x0)r∑n=0∞an(x−x0)n,a0≠0,y(x)=\left(x-x_0\right)^r\sum_{n=0}^{\infty}a_n\left(x-x_0\right)^n,\qquad a_0\neq 0,

where the exponent rr is a root of the indicial equation r(r−1)+p0r+q0=0r\left(r-1\right)+p_0r+q_0=0 with p0=lim⁡x→x0(x−x0)p(x)p_0=\lim_{x\rightarrow x_0}\left(x-x_0\right)p(x) and q0=lim⁡x→x0(x−x0)2q(x).q_0=\lim_{x\rightarrow x_0}\left(x-x_0\right)^2q(x). The larger root always gives a solution of this form; if the roots differ by an integer the second solution may contain a term log⁡e(x−x0)\log_e\left(x-x_0\right) times the first. Bessel’s equation x2y′′+x y′+(x2−ν2)y=0x^2y''+x\,y'+\left(x^2-\nu^2\right)y=0 has a regular singular point at 00 with indicial roots ±ν,\pm\nu, and Legendre’s equation (1−x2)y′′−2x y′+ℓ(ℓ+1)y=0\left(1-x^2\right)y''-2x\,y'+\ell\left(\ell+1\right)y=0 has regular singular points at ±1\pm 1 and, when ℓ∈N,\ell\in\mathbb{N}, a polynomial solution of degree ℓ,\ell, the Legendre polynomial Pℓ.P_\ell.

Let f:[0,∞)→Rf:\left[0,\infty\right)\rightarrow\mathbb{R} be integrable on every bounded interval and of exponential order, meaning that there exist M,a≥0M,a\geq 0 with ∣f(t)∣≤M eat\lvert f(t)\rvert\leq M\,e^{at} for all t≥0.t\geq 0. The Laplace transform of ff is the function of ss given by the improper integral

L{f}(s)=F(s):=∫0∞e−stf(t) dt,\mathcal{L}\left\{f\right\}(s)=F(s):=\int_0^{\infty}e^{-st}f(t)\,dt,

which converges absolutely for s>as>a by comparison with ∫0∞M e−(s−a)t dt.\int_0^{\infty}M\,e^{-\left(s-a\right)t}\,dt. The transform is linear and Lerch’s theorem states that two continuous functions with the same transform are equal, so ff is the inverse Laplace transform L−1{F}\mathcal{L}^{-1}\left\{F\right\} of F.F. Some common transforms, valid for ss larger than the stated constant, are:

L{1}=1s,L{tn}=n!sn+1,L{eat}=1s−a\mathcal{L}\left\{1\right\}=\frac{1}{s},\qquad\mathcal{L}\left\{t^n\right\}=\frac{n!}{s^{n+1}},\qquad\mathcal{L}\left\{e^{at}\right\}=\frac{1}{s-a} L{cos⁡ωt}=ss2+ω2,L{sin⁡ωt}=ωs2+ω2.\mathcal{L}\left\{\cos\omega t\right\}=\frac{s}{s^2+\omega^2},\qquad\mathcal{L}\left\{\sin\omega t\right\}=\frac{\omega}{s^2+\omega^2}.

Let ff be C1C^1 with ff and f′f' of exponential order. Integration by parts gives the derivative rule, which turns differentiation into multiplication by ss and builds in the initial values,

L{f′}(s)=s F(s)−f(0),L{f′′}(s)=s2F(s)−s f(0)−f′(0),\mathcal{L}\left\{f'\right\}(s)=s\,F(s)-f(0),\qquad\mathcal{L}\left\{f''\right\}(s)=s^2F(s)-s\,f(0)-f'(0),

and in general L{f(n)}(s)=snF(s)−∑k=0n−1sn−1−kf(k)(0).\mathcal{L}\left\{f^{(n)}\right\}(s)=s^nF(s)-\sum_{k=0}^{n-1}s^{n-1-k}f^{(k)}(0). Let a≥0a\geq 0 and HH be the Heaviside step function, which is 00 for t<0t<0 and 11 for t≥0.t\geq 0. The shift theorems state that multiplying ff by an exponential shifts its transform and that delaying ff multiplies its transform by an exponential.

L{eatf(t)}(s)=F(s−a),L{H(t−a)f(t−a)}(s)=e−asF(s)\mathcal{L}\left\{e^{at}f(t)\right\}(s)=F\left(s-a\right),\qquad\mathcal{L}\left\{H\left(t-a\right)f\left(t-a\right)\right\}(s)=e^{-as}F(s)

Also L{t f(t)}=−F′(s)\mathcal{L}\left\{t\,f(t)\right\}=-F'(s) and L{∫0tf(τ) dτ}=F(s)s.\mathcal{L}\left\{\int_0^tf(\tau)\,d\tau\right\}=\frac{F(s)}{s}. The convolution of ff and gg on [0,∞)\left[0,\infty\right) is

(f∗g)(t):=∫0tf(τ) g(t−τ)dτ,\left(f*g\right)(t):=\int_0^tf(\tau)\,g\left(t-\tau\right)d\tau,

which is commutative, associative and bilinear, and the convolution theorem states that the transform of a convolution is the product of the transforms, L{f∗g}=F G.\mathcal{L}\left\{f*g\right\}=F\,G.

An initial value problem for a linear equation with constant coefficients is solved by transforming both sides, which by the derivative rule gives an algebraic equation for Y=L{y},Y=\mathcal{L}\left\{y\right\}, solving for YY and inverting, usually by partial fractions and the table of transforms. For a y′′+b y′+c y=g(t)a\,y''+b\,y'+c\,y=g(t) with y(0)=y′(0)=0y(0)=y'(0)=0 this gives

Y(s)=G(s)a s2+b s+c,Y(s)=\frac{G(s)}{a\,s^2+b\,s+c},

where 1a s2+b s+c\frac{1}{a\,s^2+b\,s+c} is the transfer function of the equation and its inverse transform hh is the impulse response, so that y=h∗gy=h*g by the convolution theorem; this is variation of parameters for constant coefficients. The method handles discontinuous forcing through the Heaviside function and impulsive forcing through the Dirac delta δ,\delta, which is not a function but the limit of unit-area pulses of shrinking width, defined by ∫−∞∞δ(t−a)f(t) dt=f(a)\int_{-\infty}^{\infty}\delta\left(t-a\right)f(t)\,dt=f(a) for continuous f,f, so that L{δ(t−a)}=e−as\mathcal{L}\left\{\delta\left(t-a\right)\right\}=e^{-as} and the response to δ\delta is h.h.

Let f:R→Rf:\mathbb{R}\rightarrow\mathbb{R} be periodic with period 2π2\pi and Riemann integrable on [−π,π].\left[-\pi,\pi\right]. The functions 1,cos⁡nx,sin⁡nx1,\cos nx,\sin nx for n∈Nn\in\mathbb{N} are orthogonal with respect to the inner product ⟨f,g⟩:=∫−ππf(x) g(x) dx,\langle f,g\rangle:=\int_{-\pi}^{\pi}f(x)\,g(x)\,dx, with ⟨cos⁡nx,cos⁡nx⟩=⟨sin⁡nx,sin⁡nx⟩=π\langle\cos nx,\cos nx\rangle=\langle\sin nx,\sin nx\rangle=\pi for n≥1n\geq 1 and ⟨1,1⟩=2π.\langle 1,1\rangle=2\pi. The Fourier coefficients of ff are its inner products with these functions, normalised,

an:=1π∫−ππf(x)cos⁡nx dx,bn:=1π∫−ππf(x)sin⁡nx dx,a_n:=\frac{1}{\pi}\int_{-\pi}^{\pi}f(x)\cos nx\,dx,\qquad b_n:=\frac{1}{\pi}\int_{-\pi}^{\pi}f(x)\sin nx\,dx,

and the Fourier series of ff is the series of functions with these coefficients, whose partial sums SNS_N are trigonometric polynomials.

f(x)∼a02+∑n=1∞(ancos⁡nx+bnsin⁡nx)f(x)\sim\frac{a_0}{2}+\sum_{n=1}^{\infty}\left(a_n\cos nx+b_n\sin nx\right)

By Euler’s formula the series is equally ∑n=−∞∞cneinx\sum_{n=-\infty}^{\infty}c_ne^{inx} with complex Fourier coefficients cn:=12π∫−ππf(x) e−inx dx,c_n:=\frac{1}{2\pi}\int_{-\pi}^{\pi}f(x)\,e^{-inx}\,dx, so that c±n=12(an∓ibn).c_{\pm n}=\frac{1}{2}\left(a_n\mp ib_n\right). For a function of period 2L2L the same formulae hold with xx replaced by πxL\frac{\pi x}{L} and integrals over [−L,L]\left[-L,L\right] divided by LL in place of π.\pi. If ff is even then bn=0b_n=0 and the series is a cosine series; if ff is odd then an=0a_n=0 and it is a sine series. A function on [0,L]\left[0,L\right] is expanded in a cosine or sine series by extending it to an even or odd function of period 2L.2L.

By orthogonality, the partial sum SNS_N is the trigonometric polynomial of degree NN closest to ff in the norm ∥f∥2:=⟨f,f⟩,\lVert f\rVert_2:=\sqrt{\langle f,f\rangle}, since ∥f−T∥22=∥f−SN∥22+∥SN−T∥22\lVert f-T\rVert_2^2=\lVert f-S_N\rVert_2^2+\lVert S_N-T\rVert_2^2 for every trigonometric polynomial TT of degree N,N, and Bessel’s inequality a022+∑n=1N(an2+bn2)≤1π∥f∥22\frac{a_0^2}{2}+\sum_{n=1}^{N}\left(a_n^2+b_n^2\right)\leq\frac{1}{\pi}\lVert f\rVert_2^2 follows. The Fourier series converges in mean square to f,f, meaning that ∥f−SN∥2→0,\lVert f-S_N\rVert_2\rightarrow 0, so Bessel’s inequality becomes Parseval’s identity.

1π∫−ππf(x)2 dx=a022+∑n=1∞(an2+bn2)\frac{1}{\pi}\int_{-\pi}^{\pi}f(x)^2\,dx=\frac{a_0^2}{2}+\sum_{n=1}^{\infty}\left(a_n^2+b_n^2\right)

In particular the Riemann–Lebesgue lemma holds: an,bn→0a_n,b_n\rightarrow 0 as n→∞.n\rightarrow\infty. Mean-square convergence is the density of the trigonometric polynomials in the continuous periodic functions, from the Stone–Weierstrass theorem, extended to integrable functions.

Pointwise convergence requires more regularity. The one-sided limits of ff at xx are the limits lim⁡t→x−f(t)\lim_{t\rightarrow x^-}f(t) and lim⁡t→x+f(t)\lim_{t\rightarrow x^+}f(t) of ff restricted to t<xt<x and to t>xt>x respectively. A function is piecewise C1C^1 on [−π,π]\left[-\pi,\pi\right] if it and its derivative are continuous except at finitely many points, at each of which both have one-sided limits. The Dirichlet convergence theorem states that if ff is piecewise C1C^1 then its Fourier series converges at every xx to the average of the one-sided limits of f,f,

lim⁡N→∞SN(x)=12(lim⁡t→x−f(t)+lim⁡t→x+f(t)),\lim_{N\rightarrow\infty}S_N(x)=\frac{1}{2}\left(\lim_{t\rightarrow x^-}f(t)+\lim_{t\rightarrow x^+}f(t)\right),

which is f(x)f(x) wherever ff is continuous, and that the convergence is uniform on every closed interval on which ff is continuous. If ff is continuous and piecewise C1C^1 the convergence is uniform on R\mathbb{R} and the series may be differentiated term by term wherever f′f' is itself piecewise C1,C^1, while the series of any piecewise C1C^1 function may be integrated term by term. Near a jump the partial sums overshoot the limit by about 9%9\% of the jump however large NN is, the Gibbs phenomenon, which is why convergence is not uniform there. The smoother ff is, the faster its coefficients decay: if f∈Ckf\in C^k is periodic then an,bna_n,b_n decay faster than n−k.n^{-k}. For example, the odd function equal to xx on (−π,π)\left(-\pi,\pi\right) has bn=2(−1)n+1n,b_n=\frac{2\left(-1\right)^{n+1}}{n}, and Parseval’s identity gives ∑n=1∞1n2=π26.\sum_{n=1}^{\infty}\frac{1}{n^2}=\frac{\pi^2}{6}.