Timeline for Fast matrix-vector product for structured matrices
Current License: CC BY-SA 3.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S Jul 26, 2016 at 18:50 | history | suggested | alext87 | CC BY-SA 3.0 |
Making the matrix sizes precise.
|
Jul 26, 2016 at 18:29 | review | Suggested edits | |||
S Jul 26, 2016 at 18:50 | |||||
Jul 26, 2016 at 18:26 | comment | added | alext87 | The following link discusses fast matrix-vector products for Toeplitz-like, Vandermonde-like, Cauchy, and Hankel matrices: netlib.org/utk/people/JackDongarra/etemplates/node384.html. This, however, does not answer your main question. | |
Jul 26, 2016 at 16:20 | comment | added | Federico Poloni | The article you linked to is about $O(n^2)$ algorithms for Gaussian elimination, not about quasilinear matrix-vector product. | |
Jul 26, 2016 at 16:19 | review | First posts | |||
Jul 26, 2016 at 17:47 | |||||
Jul 26, 2016 at 16:12 | history | asked | Diego Ruiz | CC BY-SA 3.0 |