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

[anonymous]

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

Could we work out which line is causing the memory issue. I visually cannot
see why it is so high. I thought the line with logical may be making a full
array but calling logical on a sparse array keeps it sparse.

The reason for 

(nd - 1) * nt

is the same reason as (the above the number of rows or columns of the matrix)

max (size (A))

in the rank check. I set up the test by working out which rows are causing the
matrix to be singular rather than working from a geometry perspective. It is
normally done using singular value decomposition or a permuted QR
factorization so I am probably stretching the applicability of the check with
a LU decomposition. Feel free to change the check to what you think is better.

    _______________________________________________________

Reply to this item at:

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

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