Content deleted Content added
No edit summary Tags: Mobile edit Mobile web edit Advanced mobile edit |
m →Greedy algorithm: ch "stop criterium" → "stopping criterion" |
||
Line 26:
=== Greedy algorithm ===
The solution is sought by applying a [[greedy algorithm]], usually the [[fixed point algorithm]], to the [[weak formulation]] of the problem. For each iteration ''i'' of the algorithm, a ''mode'' of the solution is computed. Each mode consists of a set of numerical values of the functional products '''X<sub>1</sub>'''(''x''<sub>1</sub>), ..., '''X<sub>d</sub>'''(''x''<sub>d</sub>), which ''enrich'' the approximation of the solution. Due to the greedy nature of the algorithm, the term 'enrich' is used rather than 'improve', since some modes may actually worsen the approach. The number of computed modes required to obtain an approximation of the solution below a certain error threshold depends on the
== Features ==
| |||