sweety

5 Reputation

0 Badges

1 years, 10 days

MaplePrimes Activity


These are questions asked by sweety

if S:=V*t then find the filling time for decreasing in velocity ?? distanc2 = 200 mm  decrease velosity 0.58 to 0.06nmm/s find time ?

how to resolve this error... ?? 

hey... can u help me how to solve my problem using the Implicit Crank Nicolson Finite different Method. 1_ques_crank.mw..... problem in variable name A and u .. how to solve this 

 

restart

with(LinearAlgebra):

for i from 0 while i <= N+1 do u[i, 0] := 1 end do:

``

for i while i <= N do A[i, 0] := u[i-1, 0]+u[i+1, 0] end do:

 

for j from 0 while j <= N do A[0, j] := u[1, j]-.1*u[0, j]; A[10, j] := u[9, j]-.1*u[10, j] end do:

 

 

c := Matrix(10, 10, {(1, 1) = 2.1, (1, 2) = -1, (1, 3) = 0, (1, 4) = 0, (1, 5) = 0, (1, 6) = 0, (1, 7) = 0, (1, 8) = 0, (1, 9) = 0, (1, 10) = 0, (2, 1) = -1, (2, 2) = 4, (2, 3) = -1, (2, 4) = 0, (2, 5) = 0, (2, 6) = 0, (2, 7) = 0, (2, 8) = 0, (2, 9) = 0, (2, 10) = 0, (3, 1) = 0, (3, 2) = -1, (3, 3) = 4, (3, 4) = -1, (3, 5) = 0, (3, 6) = 0, (3, 7) = 0, (3, 8) = 0, (3, 9) = 0, (3, 10) = 0, (4, 1) = 0, (4, 2) = 0, (4, 3) = -1, (4, 4) = 4, (4, 5) = -1, (4, 6) = 0, (4, 7) = 0, (4, 8) = 0, (4, 9) = 0, (4, 10) = 0, (5, 1) = 0, (5, 2) = 0, (5, 3) = 0, (5, 4) = -1, (5, 5) = 4, (5, 6) = -1, (5, 7) = 0, (5, 8) = 0, (5, 9) = 0, (5, 10) = 0, (6, 1) = 0, (6, 2) = 0, (6, 3) = 0, (6, 4) = 0, (6, 5) = -1, (6, 6) = 4, (6, 7) = -1, (6, 8) = 0, (6, 9) = 0, (6, 10) = 0, (7, 1) = 0, (7, 2) = 0, (7, 3) = 0, (7, 4) = 0, (7, 5) = 0, (7, 6) = -1, (7, 7) = 4, (7, 8) = -10, (7, 9) = 0, (7, 10) = 0, (8, 1) = 0, (8, 2) = 0, (8, 3) = 0, (8, 4) = 0, (8, 5) = 0, (8, 6) = 0, (8, 7) = -1, (8, 8) = 4, (8, 9) = -1, (8, 10) = 0, (9, 1) = 0, (9, 2) = 0, (9, 3) = 0, (9, 4) = 0, (9, 5) = 0, (9, 6) = 0, (9, 7) = 0, (9, 8) = -1, (9, 9) = 4, (9, 10) = -1, (10, 1) = 0, (10, 2) = 0, (10, 3) = 0, (10, 4) = 0, (10, 5) = 0, (10, 6) = 0, (10, 7) = 0, (10, 8) = 0, (10, 9) = -1, (10, 10) = 4})

C := MatrixInverse(c):

for l from 0 while l <= N+1 do Known[l] := Matrix(N+1, 1, proc (i, j) options operator, arrow; A[i-1, l] end proc) end do:

for l from 0 while l <= N+1 do Known[l+1] := evalm(abs(Typesetting:-delayDotProduct(C, Known[l]))) end do:

``

``

 


 

Download 1_ques_crank.mw

 

 

 

 

Page 1 of 1