I've read that Strassen's algorithm, and fast matrix multiplication algorithms in general, accumulate too much numerical errors to be useful with single precisi

I've read that Strassen's algorithm, and fast matrix multiplication algorithms in general, accumulate too much numerical errors to be useful with single precision (f32) floats. That's why they were not in use before year 2000. With f64 it's better, and in the past 20 years there's been research on how to augment the fast algorithms to decrease the numerical errors. But those extra steps also make the fast algorithms slower. I don't know what the current situation is.