Y
Hacker News
new
|
ask
|
show
|
jobs
by
onalark
3952 days ago
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.