Finite Element Algorithm

A Finite Element Algorithm is an approximation algorithm that can find an approximate solution to a Partial Differential Equation Task.

• AKA: Finite Element Method, Finite Element Analysis, FEM.
  • ...
• Example(s):
  • Runge–Kutta Method?
• See: Basis Function, Partial Differential Equation, Euler's Algorithm, Gradient Descent Algorithm, Mechanical Analysis, List of Runge–Kutta Methods, Numerical Analysis, Temporal Discretization, Ordinary Differential Equation, Numerical Ordinary Differential Equations, Domain of a Function, Poset, Boundary Value Problem, Partial Differential Equations, Variational Methods, Calculus of Variations.

References

2016

• (Wikipedia, 2016) ⇒ http://en.wikipedia.org/wiki/Finite_element_method Retrieved:2016年1月11日.
  • In mathematics, the finite element method (FEM) is a numerical technique for finding approximate solutions to boundary value problems for partial differential equations. It uses subdivision of a whole problem domain into simpler parts, called finite elements, and variational methods from the calculus of variations to solve the problem by minimizing an associated error function. Analogous to the idea that connecting many tiny straight lines can approximate a larger circle, FEM encompasses methods for connecting many simple element equations over many small subdomains, named finite elements, to approximate a more complex equation over a larger domain.

• Concept