[Octave-bug-tracker] [bug #62468] quadgk.m should be able to do array-valued integration

[Nicholas Jankowski]

Follow-up Comment #10, bug #62468 (project octave):

thanks for the complex analysis reminder. it's been a decade or so since i had
any reason to use it and wasn't thinking about what I was actually doing with
the waypoints. :)

confirming your last waypoint examples below: 


>> quadgk(@(x) 1./x, -1+i,1+i, 'waypoints', [-1-.5i,1-.5i])
ans =
  -0.0000 + 4.7124i

>> quadgk(@(x) 1./x, -1+i,1+i, 'waypoints', [1-.5i,-1-.5i])
ans =
  -0.0000 - 7.8540i



i personally can't think of any reason without look at the code why we would
need a<b always. maybe it simplifies the underlying algorithm? even if so, why
not just swap a and b and sort the waypoints accordingly rather than
recursively call quadgk and run through all the overhead twice. 


    _______________________________________________________

Reply to this item at:

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

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