Hi. I'd like to find the solution closest to zero for sum(abs(f(k, m, n)+g(k, m, n)), n = i .. j) , when a < m, n < b .
Have trouble wrapping my head around how to do that and would appreciate any help.
Even better would be to find a solution where the maximum absolute value of f(k, m, n) + g(k, m, n) is minimized for n = i .. j) and when a < m, n < b , but I'm guessing the sum would be easier, and close enough.
Maybe I'm barking up the wrong tree getting this done with Maple, but I'm hopeful.
Thank you for looking