3 ms·
That just says that the algorithmic behavior is unchanged under this list of implementation choices, not that it converges faster. And I repeat the dumb questi
by ajross 7y ago
That just says that the algorithmic behavior is unchanged under this list of implementation choices, not that it converges faster. And I repeat the dumb question: these haven't been typical complaints about the kind of boring solvers we've been using for decades, so why do we care?
- rumanator 7y ago> these haven't been typical complaints about the kind of boring solvers we've been using for decades This statement is patently false. The "boring solvers" are computationally expensive, to the point that some applications, such as structural optimization, are practically impossible to employ. We're talking about models which might take hours to run a single simulation. Not to mention the fact that the computational cost of running high resolution models typically grows exponentially with regards to refinement level. Boring old solvers were adequate to provide approximate solutions without having to resort to precalculated tables, but times moved on and so did the tech applications.
- ajross 7y agoSo... can you rephrase that into an answer explaining why this is (was) on the front page? It's not a significant advance as I see it, but I'm willing to be educated. Again, the abstract does not appear to claim a performance benefit, so I'd love it if you could explain where that's coming from.