- Practice · 6 marks
Compare weighted residual methods
Short answer
MWR sets ∫ Wᵢ R dΩ=0. Point collocation uses Dirac delta weights (R=0 at chosen points). Subdomain uses unit weight over subregions. Least squares minimises ∫R² dΩ (weights ∂R/∂aᵢ). Galerkin uses trial functions as weights, yielding symmetric matrices for self-adjoint problems; it is the basis of most FEM formulations.
Explain the method of weighted residuals. Differentiate between point collocation, subdomain, least squares and Galerkin methods.
Method of weighted residuals (MWR)
For a differential equation on a domain , an approximate solution does not satisfy the equation exactly, leaving a residual
The MWR makes the residual small by forcing a weighted integral to be zero:
This gives equations for the unknowns . The choice of the weight function defines the method.
Comparison
| Method | Weight function | Condition imposed |
|---|---|---|
| Point collocation | Dirac delta, | at chosen points |
| Subdomain | in subdomain , elsewhere | over each subregion |
| Least squares | Minimises | |
| Galerkin | (same as trial function) |
Remarks
- Collocation is simplest but depends on the choice of points.
- Least squares always gives a symmetric matrix but needs higher-order derivatives, so the algebra is heavy.
- Galerkin gives a symmetric matrix for self-adjoint problems and equals the Ritz method when a functional exists. It is the basis of most finite element formulations.
- All the methods become exact if the residual is zero everywhere.
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Galerkin and collocation solution of an ODE · Finite Element Method, chapter 4
- Least squares fit for calibration data · Metrology, chapter 2
- Least squares: y = ax + b + c/x · Numerical Method, chapter 4
- Least squares significance, normal equations · Numerical Method, chapter 4
- Quadratic least squares fit · Numerical Method, chapter 4