Finite element method: Difference between revisions

Content deleted Content added
m discretization step fixage
m discretization step fixage, again.
Line 89:
In order to turn this process into an algorithm that can be run on actual hardware, one chooses a finite subset of E. Now we have F=F<sub>''n''</sub>={e<sub>1</sub>,e<sub>2</sub>,...,e<sub>n</sub>} a finite set, F a subset of E, and we wish to solve the problem
 
(**) &psi;(''u<sub>n</sub>'',''e<sub>j</sub>'')=&int;<sub>T</sub>''gu<sub>n</sub>' ''&middot;''e'<sub>j</sub>'' for every ''e<sub>j</sub>'' in F<sub>''n''</sub>
 
with the goal that, as ''n'' increases to infinity (and F<sub>''n''</sub> increases to E), the solutions ''u<sub>n</sub>'' should converge to the solution ''u'' of (*)