[Octave-bug-tracker] [bug #60818] delaunayn - 2D code path vectorization doesn't match nD algorithm

[Markus Mützel]

Follow-up Comment #45, bug #60818 (project octave):

To reduce the memory footprint, could we split the LU factorization into
multiple sub-sets and solve those separately using a loop?
I'd guess that would come at a performance penalty. But it might still be
faster than the Laplace expansion if the subsets can be reasonably large.

    _______________________________________________________

Reply to this item at:

  <https://savannah.gnu.org/bugs/?60818>

_______________________________________________
  Message sent via Savannah
  https://savannah.gnu.org/