4 ms·
When solving a linear system, x and b only have one column. So unless the algorithm is general enough to not have that limitation, it won't be applicable to gen
by FartyMcFarter 6y ago
When solving a linear system, x and b only have one column. So unless the algorithm is general enough to not have that limitation, it won't be applicable to general matrix multiplication.
- rightbyte 6y ago> When solving a linear system, x and b only have one column Isn't it linear for whatever amount of columns?
- conjectures 6y agoThe extension to matrix-matrix is trivial, since a matrix is just a concatenation of columns.
- FartyMcFarter 6y agoA matrix is a concatenation of columns yes, but how does that help us multiply matrices by using a sparse linear-system solver? Perhaps it's trivial but I don't see it.