Timeline for Convergence of iterative algorithm.
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 7, 2010 at 10:05 | comment | added | Tomek Tarczynski | Yesterday I've been trying to prove modified version of this algorithm. Instead of doing this steps consecutive for $x_{1}, x_{2} ,..$ I was always doing them for $x_{i}$ with highest asbolute value of $D_{i}$ (the convergance is even faster in this case). From the empirical point of view I may say that after doing step for $x_{i}$ sum of 'new' $D_{i}$ might be higher than the provious one, I was checking it when k=2. | |
| Feb 6, 2010 at 14:28 | comment | added | fedja | It is actually nonsense when $k > 2$, but when $k=2$ and each variable occurs in at least 2 products, what I said is correct (with minor modifications), so I'll keep it here. Let's try to understand the k=2 case fully first. | |
| Feb 6, 2010 at 9:23 | comment | added | Tomek Tarczynski | I'm still analysing your answer, but I can definietly say that it's for something - all variables has economical interpretation. | |
| Feb 6, 2010 at 4:33 | history | answered | fedja | CC BY-SA 2.5 |