MaplePrimes - answers and comments on Question, Approximate with Euler method

homework?(!)

Doug Meade — Tue, 20 Nov 2012 03:28:10 Z

It sounds as though you are asking us to do your homework. I am not about to comply with your request. I will suggest that you spend some time looking for information about Maple's numerical solution to differential equations. There is lots of information about this. I believe you'll quickly find something that gives you what you need - once you update the command for your specific problem.

Good luck!

Doug

---------------------------------------------------------------------
Douglas B. Meade  <><
Math, USC, Columbia, SC 29208  E-mail: mailto:meade@math.sc.edu
Phone:  (803) 777-6183         URL:    http://www.math.sc.edu

Hint

Kitonum — Wed, 21 Nov 2012 11:52:32 Z

We will use "a prime" sign instead "a dot" sign. Your second-order equation with the initial conditions x''+2 x'+3 x=4 t, x(0)=1, x'(0)=2, can be written as a system of first-order equations {x'=y, y'=-3 x-2 y+4 t, x(0)=1, y(0)=2} . Then solve this system by Euler method just as one first-order equation.

this is not a homework, i have done it before

rovandam_r_n_2 — Tue, 20 Nov 2012 03:37:24 Z

this is not a homework, i have done it before with another problem but i can not do it with this the one that i did is

x0 := 1; v0 := 5; t0 := 0; tf := .6; h := .2; printf("Euler Method with time step h = %a over the interval t = %a to %a seconds.\n", h, t0, tf); NumOfSteps := (tf-t0)/h; xn := x0; vn := v0; tn := t0; printf("(x%a,v%a,t%a) = (%a,%a,%a)\n", 0, 0, 0, xn, vn, tn); for k to NumOfSteps do xnplus1 := xn+vn*h; vnplus1 := vn+(10*tn-10*vn-5*xn)*h; tnplus1 := tn+h; xn := xnplus1; vn := vnplus1; tn := tnplus1; printf("(x%a,v%a,t%a) = (%a,%a,%a)\n", k, k, k, xn, vn, tn) end do