Method of mean weighted residuals
In applied mathematics, methods of mean weighted residuals (MWR) are methods for solving differential equations of which the solution is assumed to be well approximated by a function of a particular form having a finite set of degrees of freedom that it depends on (for instance if said form is a linear combination of a particular basis function set in which each basis function is multiplied by a corresponding expansion coefficient and i is summed over then the degrees of freedom are the expansion coefficients ) and then any one of a theoretically infinite set of methods of weighted residuals are applied in an attempt to find which precise value each of these degrees of freedom should take in order to minimise in some sense (this 'sense' depends on the precise method used) the residue function (the residue function is explained in detail below).
Notation of this page
It is often very important to firstly sort out notation used before presenting how this method is executed in order to avoid confusion.
- shall be used to denote the solution to the differential equation that the MWR method is being applied to.
- Solving the differential equation mentioned shall be set to equate to setting some function called the "residue function" to zero.
- Every method of mean weighted residuals involves some "test functions" that shall be denoted by .
- The degrees of freedom shall be denoted by .
- If the assumed form of the solution to the differential equation is linear (in the degrees of freedom) then the basis functions used in said form shall be denoted by .
Mathematical statement of method
The method of mean weighted residuals solves by imposing that the degrees of freedom are such that:
is satisfied. Where the inner product is the standard function inner product with respect to some weighting function which is determined usually by the basis function set or arbitrarily according to whichever weighting function is most convenient. For instance when the basis set is just the Chebyshev polynomials of the first kind typically the weighting function is because that's the most convenient because that way inner products can be more easily computed by use of a fast chebyshev transform.
Additionally, all these methods have in common that they enforce boundary conditions by either enforcing that the basis functions (in the case of a linear combination) individual enforce the boundary conditions on the original BVP (This only works if the boundary conditions are homogenous however it is possible to apply it to problems with inhomogenous boundary conditions by letting and substituting this expression into the original differential equation and imposing homogenous boundary conditions to the new solution being sought to find u(x) that is v(x) where L(x) is a function that satisfies the boundary conditions imposed on u that is known.), or by explicitly imposing the boundary by removing n rows to the matrix representing the discretised problem where n refers to the order of the differential equation and substituting them with ones that represent the boundary conditions.
Choice of test functions
The choice of test function, as mentioned earlier, depends on the specific method used (under the general heading of mean weighted residual methods). Here is a list of commonly used specific MWR methods and their corresponding test functions roughly according to their popularity:
- The Galerkin method, which uses the basis functions themselves as test functions or in the more general case of a nonlinear assumed form (where the nonlinearity is in the degrees of freedom) of the solution the Galerkin method uses the test functions:
- The pseudospectral method which uses the Dirac delta functions centered at a set of discrete x points and equates to just setting the residue function to zero at those x points.
- The least-squares method uses the test functions: . This method has the effect of minimising the square of the L2-norm of the residue function (that is ) with respect to the degrees of freedom .
- The method of moments uses the simple set of test functions and is rarely ever implemented when high degrees of accuracy are required because of computational issues associated with inverting the Hilbert matrix.