Let y′′+p(x)y′+q(x)y=0 be a second-order linear homogeneous equation. A point x0 is an ordinary point of the equation if p and q are analytic at x0 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,
by differentiating term by term, substituting into the equation and equating the coefficient of each power of x−x0 to zero, which gives a recurrence relation that determines a2,a3,… from the free coefficients a0=y(x0) and a1=y′(x0). The radius of convergence of the series is at least the distance from x0 to the nearest singular point of the equation in the complex plane. For example, the Airy equationy′′−xy=0 has only ordinary points and the recurrence (n+2)(n+1)an+2=an−1, whose solutions converge on all of R.
A singular point x0 is a regular singular point if (x−x0)p(x) and (x−x0)2q(x) are analytic at x0, and an irregular singular point otherwise. Near a regular singular point the Frobenius method seeks solutions of the form
y(x)=(x−x0)rn=0∑∞an(x−x0)n,a0=0,
where the exponent r is a root of the indicial equationr(r−1)+p0r+q0=0 with p0=limx→x0(x−x0)p(x) and q0=limx→x0(x−x0)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 loge(x−x0) times the first. Bessel’s equationx2y′′+xy′+(x2−ν2)y=0 has a regular singular point at 0 with indicial roots ±ν, and Legendre’s equation(1−x2)y′′−2xy′+ℓ(ℓ+1)y=0 has regular singular points at ±1 and, when ℓ∈N, a polynomial solution of degree ℓ, the Legendre polynomialPℓ.
Let f:[0,∞)→R be integrable on every bounded interval and of exponential order, meaning that there exist M,a≥0 with ∣f(t)∣≤Meat for all t≥0. The Laplace transform of f is the function of s given by the improper integral
L{f}(s)=F(s):=∫0∞e−stf(t)dt,
which converges absolutely for s>a by comparison with ∫0∞Me−(s−a)tdt. The transform is linear and Lerch’s theorem states that two continuous functions with the same transform are equal, so f is the inverse Laplace transformL−1{F} of F. Some common transforms, valid for s larger than the stated constant, are:
Let f be C1 with f and f′ of exponential order. Integration by parts gives the derivative rule, which turns differentiation into multiplication by s and builds in the initial values,
L{f′}(s)=sF(s)−f(0),L{f′′}(s)=s2F(s)−sf(0)−f′(0),
and in general L{f(n)}(s)=snF(s)−∑k=0n−1sn−1−kf(k)(0). Let a≥0 and H be the Heaviside step function, which is 0 for t<0 and 1 for t≥0. The shift theorems state that multiplying f by an exponential shifts its transform and that delaying f multiplies its transform by an exponential.
L{eatf(t)}(s)=F(s−a),L{H(t−a)f(t−a)}(s)=e−asF(s)
Also L{tf(t)}=−F′(s) and L{∫0tf(τ)dτ}=sF(s). The convolution of f and g on [0,∞) is
(f∗g)(t):=∫0tf(τ)g(t−τ)dτ,
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}=FG.
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}, solving for Y and inverting, usually by partial fractions and the table of transforms. For ay′′+by′+cy=g(t) with y(0)=y′(0)=0 this gives
Y(s)=as2+bs+cG(s),
where as2+bs+c1 is the transfer function of the equation and its inverse transform h is the impulse response, so that y=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δ, which is not a function but the limit of unit-area pulses of shrinking width, defined by ∫−∞∞δ(t−a)f(t)dt=f(a) for continuous f, so that L{δ(t−a)}=e−as and the response to δ is h.
Let f:R→R be periodic with period 2π and Riemann integrable on [−π,π]. The functions 1,cosnx,sinnx for n∈N are orthogonal with respect to the inner product ⟨f,g⟩:=∫−ππf(x)g(x)dx, with ⟨cosnx,cosnx⟩=⟨sinnx,sinnx⟩=π for n≥1 and ⟨1,1⟩=2π. The Fourier coefficients of f are its inner products with these functions, normalised,
and the Fourier series of f is the series of functions with these coefficients, whose partial sums SN are trigonometric polynomials.
f(x)∼2a0+n=1∑∞(ancosnx+bnsinnx)
By Euler’s formula the series is equally ∑n=−∞∞cneinx with complex Fourier coefficientscn:=2π1∫−ππf(x)e−inxdx, so that c±n=21(an∓ibn). For a function of period 2L the same formulae hold with x replaced by Lπx and integrals over [−L,L] divided by L in place of π. If f is even then bn=0 and the series is a cosine series; if f is odd then an=0 and it is a sine series. A function on [0,L] is expanded in a cosine or sine series by extending it to an even or odd function of period 2L.
By orthogonality, the partial sum SN is the trigonometric polynomial of degree N closest to f in the norm ∥f∥2:=⟨f,f⟩, since ∥f−T∥22=∥f−SN∥22+∥SN−T∥22 for every trigonometric polynomial T of degree N, and Bessel’s inequality2a02+∑n=1N(an2+bn2)≤π1∥f∥22 follows. The Fourier series converges in mean square to f, meaning that ∥f−SN∥2→0, so Bessel’s inequality becomes Parseval’s identity.
π1∫−ππf(x)2dx=2a02+n=1∑∞(an2+bn2)
In particular the Riemann–Lebesgue lemma holds: an,bn→0 as n→∞. 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 f at x are the limits limt→x−f(t) and limt→x+f(t) of f restricted to t<x and to t>x respectively. A function is piecewise C1 on [−π,π] 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 f is piecewise C1 then its Fourier series converges at every x to the average of the one-sided limits of f,
N→∞limSN(x)=21(t→x−limf(t)+t→x+limf(t)),
which is f(x) wherever f is continuous, and that the convergence is uniform on every closed interval on which f is continuous. If f is continuous and piecewise C1 the convergence is uniform on R and the series may be differentiated term by term wherever f′ is itself piecewise C1, while the series of any piecewise C1 function may be integrated term by term. Near a jump the partial sums overshoot the limit by about 9% of the jump however large N is, the Gibbs phenomenon, which is why convergence is not uniform there. The smoother f is, the faster its coefficients decay: if f∈Ck is periodic then an,bn decay faster than n−k. For example, the odd function equal to x on (−π,π) has bn=n2(−1)n+1, and Parseval’s identity gives ∑n=1∞n21=6π2.