CORR
2006
Springer
13 years 4 months ago
2006
Springer
In [12] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be...