Content deleted Content added
m more minimal set of test function fix |
m discretization step fixage |
||
Line 87:
=== First discretization step ===
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>={
(**) ψ(''u<sub>n</sub>'',''e<sub>j</sub>'')=∫<sub>T</sub>''g' '
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 (*)
| |||