Re:Benchmarks for Blaze, A high-performance C++ math library
by onalark on Tuesday August 25, 2015 @04:40PM
(#10119279)
Yes, I'm thinking of discretizations of elliptic 2D/3D PDEs. They don't scale in the weak or strong sense, and they can't hold O(n log n) asymptotic complexity due to fill-in from Cholesky/LU-style factorizations.
[ Parent
| on HN ]
There are no comments on this comment yet.