Timeline for Bound on smallest entry of inverse matrix
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 1, 2014 at 23:12 | vote | accept | user47575 | ||
| Feb 28, 2014 at 13:10 | comment | added | Felix Goldberg | @PerAlexandersson The exact evaluation problem is indeed hard; but bounds may be easier to obtain :) | |
| Feb 28, 2014 at 12:52 | comment | added | Per Alexandersson | @FelixGoldberg: Oh, it is not easy; this is just an illustration on that the problem is as hard as computing determinants. | |
| Feb 27, 2014 at 23:12 | comment | added | Felix Goldberg | @PerAlexandersson But how usable are these bounds? Evaluating the determinants is all too often a formidable task in itself. | |
| Feb 27, 2014 at 23:06 | answer | added | Felix Goldberg | timeline score: 2 | |
| Feb 27, 2014 at 22:13 | answer | added | Gerry Myerson | timeline score: 0 | |
| Feb 27, 2014 at 16:07 | comment | added | Per Alexandersson | You get bounds from Cramers rule quite directly: en.wikipedia.org/wiki/Cramer%27s_rule The smallest entry is the smallest possible value in the adjugate matrix, divided by the determinant of the original matrix. | |
| Feb 27, 2014 at 15:59 | review | First posts | |||
| Feb 27, 2014 at 16:01 | |||||
| Feb 27, 2014 at 15:43 | history | asked | user47575 | CC BY-SA 3.0 |