Tricki
a repository of mathematical know-how
Add article
Navigate
Tags
Search
Forums
Help
Top level
›
Different kinds of Tricki article
›
Front pages for different areas of mathematics
›
Analysis front page
›
Numerical analysis front page
View
Edit
Revisions
Numerical solution of partial differential equations
Title:
*
Area of mathematics:
*
A comma-separated list of areas of mathematics to which this article applies. Use ">" to tag in a subcategory. Example: Analysis > Harmonic analysis, Combinatorics
Keywords:
A comma-separated list of keywords associated with this article. Example: free group
Used in:
A comma-separated list of examples of where this technique is used. Example: Cauchy-Schwarz inequality
Parent articles:
Order
-1
0
1
-1
0
1
Body:
[QUICK DESCRIPTION] Partial differential equations are considerably more complex to solve than ordinary differential equations, and there are a substantial number of special techniques developed to handle them. All involve some sort of "grid" that subdivides space into small packets. The different ways in which the packets are used gives the different methods. [PREREQUISITES] Multivariate calculus, basic numerical analysis. [EXAMPLE|Galerkin] The most common (especially from a mathematical point of view) is the Galerkin method. The basic idea is that we set up the weak formulation of the partial differential equation. For a (linear) operator equation $Ax=b$, where $A:X\to X^*$ is an operator ($X^*$ is the dual space to $X$), we take a basis of a finite dimensional subspace $\phi_1,\,\phi_2,\,\ldots,\,\phi_N$, with $X_N={\mathrm{span}}\{\phi_1,\,\phi_2,\,\ldots,\,\phi_N\}$. Then we choose $x=\sum_{i=1}^N x_i\phi_i\in X_N$ where [maths] \langle \phi_i,\,Ax\rangle = \langle \phi_i,\,b\rangle [/maths] for $i=1,\,2,\,\ldots,\,N$. If $A$ is an elliptic partial differential operator, then the linear system generated by the Galerkin method is positive definite, and the linear system can be solved. This method is also related to the Rayleigh-Ritz method, and the more general Petrov-Galerkin method. The Galerkin method is commonly known as the finite element method (FEM), at least under common choices of the basis functions. [EXAMPLE|Finite difference] [GENERAL DISCUSSION]
This is a stub
A stub is an article that is not sufficiently complete to be interesting.
Notifications
File attachments
Changes made to the attachments are not permanent until you save this post. The first "listed" file will be included in RSS feeds.
Attach new file:
Images are larger than
640x480
will be resized. The maximum upload size is
1 MB
. Only files with the following extensions may be uploaded:
jpg jpeg gif png svg
.
Revision information
Log message:
An explanation of the additions or updates being made to help other authors understand your motivations.
Search this site:
Recent articles
View a list of all articles.
Littlewood-Paley heuristic for derivative
Geometric view of Hölder's inequality
Diagonal arguments
Finding an interval for rational numbers with a high denominator
Try to prove a stronger result
Use self-similarity to get a limit from an inferior or superior limit.
Prove a consequence first
Active forum topics
Plenty of LaTeX errors
Tutorial
A different kind of article?
Countable but impredicative
Tricki Papers
more
Recent comments
I don't think this statement
choice of the field
Incorrect Image
Article classification
Higher dimensional analogues
more