Question: Write a computer program to solve a set of 3 decay equations ( N A N B N C , N C is stable )

Write a computer program to solve a set of 3 decay equations (NANBNC,NC is stable) analytically
and numerically. Use a forward difference approximation (explicit scheme) for the numerical solution.
Your computer program should do the following:
Read input file with the input data:
decay constants:
initial conditions: ,NAO,NBO,NCo
numerical parameters: t,tfinal
Perform the analytical solution of the decay equations for +10%+10%+20%NB(+20%)t12A=1.97h,t12B=9.91h
NAo=100,NBo=o,NCo=o
tfinal=50ht=1htNB(t)t+10%NA(t),NB(t),NC(t)NA(t)+NB(t)+NC(t)t+10%NB1ttNB+20%+-t-10%o.
Write results toan output file that can later be used to plot the results. The output file should
also contain the parameters read from the input file.
Submit a brief report with your results. See separate instructions on the report format. Minimum
content of the report:
Part 1, theory
Show and describe differential equations you are solving (+10%).
Show analytic solution of the differential equations (+10%).
Show complete derivation of numerical solution (+20%).
Show complete derivation for the time of maximum NB(+20%).
Part 2, solution of radioactive decay chain
Half-life:
Initial conditions:
Solution time:
t12A=1.97h,t12B=9.91h
NAo=100,NBo=o,NCo=o
tfinal=50h
For the numerical solution, start with t=1h and keep reducing itby the factor of two until you get a
reliable solution (solution does not change significantly with deceasing t). Show the following results:
Plot numerical NB(t)vs. time for 3 different values oft(coarse, medium, fine), all of them on
the same graph. Add analytical solution on the same graph (+10%).
Plot numerical NA(t),NB(t),NC(t) and NA(t)+NB(t)+NC(t)as a function of time, all on the same
graph, use t that gives reliable solution (+10%).
Using numerical solution, plot time of maximum NBvs.1t for several different t. Use
analytical solution to determine time of maximum NB, add that value to the graph (+20%).
Note: numerical solution with large t might be unstable (e.g., solution oscillates, goes toward +or-,
other unphysical behavior).Do not report such results. Continue reducing t until you get physically
realistic solution (-10%).o.
Perform the numerical solution of the decay equations for o.
Write results toan output file that can later be used to plot the results. The output file should
also contain the parameters read from the input file.
Submit a brief report with your results. See separate instructions on the report format. Minimum
content of the report:
Part 1, theory
Show and describe differential equations you are solving (+10%).
Show analytic solution of the differential equations (+10%).
Show complete derivation of numerical solution (+20%).
Show complete derivation for the time of maximum NB(+20%).
Part 2, solution of radioactive decay chain
Half-life:
Initial conditions:
Solution time:
t12A=1.97h,t12B=9.91h
NAo=100,NBo=o,NCo=o
tfinal=50h
For the numerical solution, start with t=1h and keep reducing itby the factor of two until you get a
reliable solution (solution does not change significantly with deceasing t). Show the following results:
Plot numerical NB(t)vs. time for 3 different values oft(coarse, medium, fine), all of them on
the same graph. Add analytical solution on the same graph (+10%).
Plot numerical NA(t),NB(t),NC(t) and NA(t)+NB(t)+NC(t)as a function of time, all on the same
graph, use t that gives reliable solution (+10%).
Using numerical solution, plot time of maximum NBvs.1t for several different t. Use
analytical solution to determine time of maximum NB, add that value to the graph (+20%).
Note: numerical solution with large t might be unstable (e.g., solution oscillates, goes toward +or-,
other unphysical behavior).Do not report such results. Continue reducing t until you get physically
realistic solution (-10%).
Write a computer program to solve a set of 3

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!