Content deleted Content added
Citation bot (talk | contribs) Add: bibcode, pmid. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Matrices (mathematics) | #UCB_Category 87/234 |
ws |
||
Line 23:
The authors show that
taking <math>|J| \approx k /\varepsilon^4</math> and <math>|I| \approx k / \varepsilon^2</math> where <math>0 \le \varepsilon</math>, the algorithm achieves Frobenius error bound <math>\|A - CUR\|_F \le \|A - A_k\|_F + \varepsilon \|A\|_F</math>, where <math>A_k</math> is the optimal rank ''k'' approximation.
==See also==
| |||