Timeline for Efficient approximation of a matrix and its inverse
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 30, 2010 at 18:01 | comment | added | Iddo Tzameret | Yes, David is right. (lhf would be right too, if the orthogonalization algorithm (of e.g., Gram-Schmidt) would end up with a matrix in which the entries are polynomially-bounded by the entries in the original matrix. I can't see why this should be true though.) | |
| Jun 30, 2010 at 17:45 | comment | added | David E Speyer | But your approximation may not be orthogonal, so its inverse may require a lot of bits to store. | |
| Jun 30, 2010 at 17:39 | history | answered | lhf | CC BY-SA 2.5 |