Timeline for NIntegrate extremely piecewised functions
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 27, 2013 at 7:34 | comment | added | P. Fonseca | That's it. I'm able to say that there's no peack that last shorter than 10 seconds (or that they are very rare, and it is not a problem to miss them), and that I can live with a precision of 0,1 seconds. Implement what you have described with do loops is not hard. Do you have an idea for a functional implementation, or a practical compiled implementation (where the q function is not included in the compiled function, or if it is included, it is a result of some automatic meta programming with memorisation. | |
| Jul 26, 2013 at 18:38 | history | answered | Andrew Moylan | CC BY-SA 3.0 |