Timeline for Difficult integral by parallel programming
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 30, 2017 at 2:34 | comment | added | Anita Maheshwari | If I want to do double inumeric integration w.r.t. n from 0 to infinity how can I do for Gn. | |
| Jul 24, 2017 at 8:39 | comment | added | Rom38 | You can try the ParallelDo instead of For but you need to share the previously defined function before this to make it available for parallel kernels. So, set the SharedVariables and try, but remember that parallelization will consume the memory a lot. | |
| Jul 24, 2017 at 7:15 | comment | added | Anita Maheshwari | Can I do this code in parallel programming in mathematica to reduce time?? | |
| Jun 16, 2017 at 4:43 | comment | added | Anita Maheshwari | I tried this but in my desktop this is not making much difference. | |
| Jun 13, 2017 at 20:15 | comment | added | robson denke | Also, changing the NIntegration method to Method -> {"GlobalAdaptive", "MaxErrorIncreases" -> 10000, Method -> "GaussKronrodRule", "SymbolicProcessing" -> 0}, MaxRecursion -> 20, PrecisionGoal -> 5, AccuracyGoal -> 5, helps to decrease the evaluation time. | |
| Jun 13, 2017 at 20:13 | comment | added | robson denke | The main responsible for the large evaluation time of the code when one sets the summation limit to infinity seems to be the slow convergence rate of Bessel partial waves infinite sum. In order to accelerate the convergence rate one can implement methods in NSum[] command like WynnEpsilon. In this thesis calhoun.nps.edu/bitstream/handle/10945/26069/… there is a long discussion about the application of a Levin transform to accelerate the convergence rate of this Mie scattering problem. | |
| Jun 13, 2017 at 12:03 | comment | added | Anita Maheshwari | okay. Thank you | |
| Jun 12, 2017 at 10:58 | comment | added | robson denke | Probably yes, the evaluation time can be reduced by adjusting the integration strategy. The LocalAdaptive strategy takes a long time in the process since secctionates the interval in a certain number of partitions. Maybe another approach can work better and faster than this one. You can take a look at the documentation. johnboccio.com/MathematicaTutorials/…. I'll try some more adjustments and post the results too soon as possible. | |
| Jun 12, 2017 at 3:47 | comment | added | Anita Maheshwari | is there any way to reduce timing in summing over 1 to infinity??Here we add it for 1 to 10 but extending it to 20 is also taking long timing. | |
| Jun 11, 2017 at 0:16 | comment | added | robson denke | @AnitaMaheshwari I've edited the answer above and inserted the ListLinePlot part. | |
| Jun 11, 2017 at 0:10 | history | edited | robson denke | CC BY-SA 3.0 | added 865 characters in body |
| Jun 9, 2017 at 21:10 | comment | added | Anita Maheshwari | How did you got this plot?? | |
| Jun 9, 2017 at 18:29 | comment | added | Anita Maheshwari | Thank you so much for your great effort. Can I use a loop for n summation because I have to sum it over n=1 to infinity. | |
| Jun 8, 2017 at 17:13 | history | answered | robson denke | CC BY-SA 3.0 |