Re:Benchmarks for Blaze, A high-performance C++ math library
by math_and_stuff on Tuesday August 25, 2015 @03:20PM
(#10118883)
Can't scale in a weak, strong, or asymptotic complexity sense? And for what sorts of problems (I assume you're thinking of 2D and 3D PDEs discretized with local basis functions)?
[ Parent
| on HN ]
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.