48sx Numerical Integration Question « Next Oldest | Next Newest »

 ▼ svisvanatha Member Posts: 112 Threads: 9 Joined: Jan 2011 03-09-2011, 04:05 PM I am performing a numerical integration of a function f(x)=g(x)*h(x) over an interval [a,b]. In other words, "integral (f(x)*dx)". I am also interested in plotting the integral's result as a function of the distance along the interval [a,b]. The algorithm that the calculator uses to perform the integration must calculate the integral at a fixed number of intermediate points along [a,b]. So, my question is whether that information is available to the user when using the built-in numerical integration routine? I can do what I want by performing a summation of the integral's value over a fixed number of divisions over the interval [a,b]. However, I thought that these intermediate values may be available and accessible. Any thoughts? Edited: 9 Mar 2011, 4:08 p.m. ▼ Namir Posting Freak Posts: 2,247 Threads: 200 Joined: Jun 2005 03-09-2011, 04:55 PM If I am reading you correctly, you want to plot the the area from a to b, varying the value of b from a until you hit bmax: ```For b = a to bmax area = area under f(x) curve between [a,b] plot value for area on a graph showing area vs b Next ``` Yes? No? Namir Edited: 9 Mar 2011, 4:58 p.m. ▼ svisvanatha Member Posts: 112 Threads: 9 Joined: Jan 2011 03-09-2011, 06:19 PM Yes, that is correct. The issue becomes one of speed, since the built-in numerical integration function divides the interval into a finite number of strips, calculates the area of that strip for a given ordinate, and adds that to the total sum. With your method, there is alot of computational overlap between successive iterations. I came up with a similar method, but it basically mimics the built-in routine. I was hoping that the intermediate values for iterations of the numerical solver are available in some manner, but seems like wishful thinking. Thanks! ▼ Crawl Senior Member Posts: 306 Threads: 3 Joined: Sep 2009 03-09-2011, 07:00 PM It seems like it would be easier to do with a program. Supposing that the distance between pixels is dx, you'd want to integrate f(x) between x and dx for each coordinate x, and add the result to variable that keeps the total. Since the limits are so close, for most functions I'd imagine the integral would converge quickly. ▼ svisvanatha Member Posts: 112 Threads: 9 Joined: Jan 2011 03-10-2011, 06:38 AM OK, so I divided the interval into a number of sub-intervals. For each sub-interval, I used the built-in numerical integration routine. I increment an area variable by that amount, and also store the total area and upper limit of the current interval as a 2 column row within a matrix. At the end, I have the total area as well as the area as a function of the distance along the interval (a,b). Thanks for the replies!

 Possibly Related Threads... Thread Author Replies Views Last Post Integration question and "RPN" mode comment Craig Thomas 16 4,895 12-05-2013, 02:32 AM Last Post: Nick_S HP Prime numerical restrictions? Alasdair McAndrew 4 1,456 11-16-2013, 05:32 PM Last Post: Alasdair McAndrew HP Prime numerical precision in CAS and HOME Javier Goizueta 5 1,815 11-16-2013, 03:51 AM Last Post: Paul Dale WP34s integration trapped in infinite loop Bernd Grubert 25 5,710 10-17-2013, 08:50 AM Last Post: Dieter HP Prime integration Richard Berler 1 1,000 10-06-2013, 10:52 PM Last Post: Helge Gabert [HP-Prime] AMBIGUITY between Numerical Calculation (HOME) and Numerical/Symbolic Calculation (CAS mode) CompSystems 2 1,190 08-18-2013, 07:06 PM Last Post: CompSystems OT: My brain is failing me again. Help with numerical / mechanical problem required. Harald 4 1,480 07-01-2013, 10:31 AM Last Post: Harald integration on 39gII emulator Wes Loewer 29 5,588 06-07-2013, 05:58 PM Last Post: Chris Smith The HP Graphers 48SX - 50G Jedidiah Smith 11 2,558 04-08-2013, 08:35 PM Last Post: gene wright WP-34S Integration Richard Berler 15 3,012 03-08-2013, 02:29 AM Last Post: Walter B

Forum Jump: