Problem-solving recipes
A step-by-step procedure for every problem type this course teaches — what to do first, what to do next, and how to tell which case you're in.
What are you being asked to do?
Start with what you're actually being asked to produce.
Readiness review — classify a function's symmetry, find the fundamental period of a sum, test an improper integral for convergence, project one vector onto another, or find a matrix's eigenvalues and diagonalizability: whichever prerequisite skill the problem is actually testing.
Given two functions on an interval, need their inner product, or a single norm — the inner-product and norm recipes below; need all three of L^1, L^2, and L^\infty side by side instead, or a parallelogram-law check on which norm actually comes from an inner product — the function-space-geometry recipes further down.
A periodic function, need its Fourier series — the real-form coefficient recipe, or the complex-form recipe if c_n is what's asked for (a genuinely different computation, not just a rewrite of the real form).
Given a function and an orthogonal family, need the best approximation — the orthogonal-projection-onto-a-family recipe.
A Fourier series near a jump, need to know whether it can converge uniformly — the uniform-convergence test; need an actual ringing-free approximation through that jump instead of just a yes/no verdict — the Cesàro/Fejér mean.
A frequency-domain filter, need to classify its type or build its mask — the filter recipe.
A sampled frequency, need every alias it could be mistaken for — the aliasing recipe.
A function, need to know if it's an eigenfunction of d/dt, or a forced linear ODE, need its frequency-domain steady state — the two operator-viewpoint recipes.
Readiness
Periodic functions and orthogonality
Compute a norm of a function on an interval
Use when: you're given a function and an interval and asked for \|f\|_1, \|f\|_2, or \|f\|_\infty
Goal: a single nonnegative number measuring the function's size, by the specific rule the requested norm uses
Norms and "energy" of a function
The L^2 energy norm, built from the inner product above.
The Fourier series
Compute the complex Fourier coefficients c_n
Use when: you have a periodic function and need c_n for its complex-exponential series f(t)=\sum_{n=-\infty}^{\infty} c_ne^{in\omega_0t}
Goal: explicit values or a formula for every c_n, with n ranging over all integers
The complex form of the Fourier series
A genuinely different computation from the real form above, not a rewrite of it.
Convergence of Fourier series
Compute a Cesàro (Fejér) mean of a Fourier partial sum
Use when: you need a Fourier approximation that converges uniformly through a jump, with no Gibbs ringing, and can accept averaging across several partial sums instead of relying on a single one
Goal: the tapered trigonometric polynomial \sigma_N(t), ringing-free near any jump, built entirely from the same coefficients an ordinary partial sum already uses
Cesàro (Fejér) averaging as a fix for non-uniform convergence
A ringing-free approximation traded against slower convergence away from a jump — not a strict upgrade over the uniform-convergence test above.
Fourier series as function-space geometry
Compute the L¹, L², and L∞ norms of a function
Use when: you have an explicit, possibly piecewise, formula for f on an interval and need one or more of its three norms
Goal: exact values for \lVert f\rVert_1, \lVert f\rVert_2, and \lVert f\rVert_\infty, computed directly from f's formula
The L1, L2, and L∞ norms compared
All three of L^1, L^2, L^\infty side by side, distinct from the single L^2 energy norm above.