To calculate: The concentration of each reactant as the function of distance by using the finite difference approach, and apply centred finite-difference approximations with

Answer to Problem 15P
Solution:
The concentration of each reactant as the function of distance is,
The below plot shows the distance versus reactant.
Explanation of Solution
Given Information:
The series of first order, liquid phase reactions is,
The second order ODEs by using the steady-state mass balance.
Here,
Refer to the Prob 28.14, the Danckwerts boundary conditions is,
Here,
Formula used:
The finite divided difference formula is,
Calculation:
Recall the ordinary differential equations,
Substitute the finite divided difference formula in the above differential equations.
Substitute
Solve further,
Now solve for inlet node
Here use the second order version from the Table 19.3 for the interior nodes,
Can be solved for,
Substitute
Solve for the outer node
The similar equations can be written for the other nodes, because the condition does not include reaction rates Substitute all the parameter gives,
Rearrange the all equations in matrix form for each reactant separately, because the reactions are in series.
Write for the reactant A.
Write the following code in MATLAB.
-
The output is,
Write the all the above equations in matrix form for the reactant B.
Write the following code in MATLAB.
-
The output is,
Write the all the above equations in matrix form for the reactant C.
Write the following code in MATLAB.
-
The output is,
The reaction is in series, thus the system for each reactant is,
The below plot shows the distance versus reactant.
Want to see more full solutions like this?
Chapter 28 Solutions
Numerical Methods For Engineers, 7 Ed
- At a Noodles & Company restaurant, the probability that a customer will order a nonalcoholic beverage is 0.49. Find the probability that in a sample of 13 customers, at least 7 will order a nonalcoholic beveragearrow_forward10. In the general single period market model with = {W1, W2, W3}, one risky asset, S, and a money market account, we have So = 4 for the risky asset. Moreover, the effective rate of interest on the money market account is 5% and at time t = 1 we have W1 W2 W3 S₁ 100 50 40 21 21 21 (a) Calculate all risk-neutral probability measures for this model. [4 Marks] (b) State if the model is arbitrage-free. Give a brief reason for your answer. [2 Marks] (c) A large bank has designed an investment product with payoff X at time t = 1. Given W₁ W2 W3 X 0 1 1.5 show that X is an attainable contingent claim. [4 marks]arrow_forwardadded 2 imagesarrow_forward
- A movie studio wishes to determine the relationship between the revenue generated from the streaming of comedies and the revenue generated from the theatrical release of such movies. The studio has the following bivariate data from a sample of fifteen comedies released over the past five years. These data give the revenue x from theatrical release (in millions of dollars) and the revenue y from streaming (in millions of dollars) for each of the fifteen movies. The data are displayed in the Figure 1 scatter plot. Theater revenue, x Streaming revenue, y (in millions of (in millions of dollars) dollars) 13.2 10.3 62.6 10.4 20.8 5.1 36.7 13.3 44.6 7.2 65.9 10.3 49.4 15.7 31.5 4.5 14.6 2.5 26.0 8.8 28.1 11.5 26.1 7.7 28.2 2.8 60.7 16.4 6.7 1.9 Streaming revenue (in millions of dollars) 18+ 16+ 14 12+ xx 10+ 8+ 6+ 2- 0 10 20 30 40 50 60 70 Theater revenue (in millions of dollars) Figure 1 Send data to calculator Send data to Excel The least-squares regression line for these data has a slope…arrow_forwardhelp on this, results givenarrow_forwarda) Suppose that we are carrying out the 1-phase simplex algorithm on a linear program in standard inequality form (with 3 variables and 4 constraints) and suppose that we have reached a point where we have obtained the following tableau. Apply one more pivot operation, indicating the highlighted row and column and the row operations you carry out. What can you conclude from your updated tableau? x1 x2 x3 81 82 83 84 81 -2 0 1 1 0 0 0 3 82 3 0 -2 0 1 2 0 6 12 1 1 -3 0 0 1 0 2 84 -3 0 2 0 0 -1 1 4 -2 -2 0 11 0 0-4 0 -8arrow_forward
- b) Solve the following linear program using the 2-phase simplex algorithm. You should give the initial tableau, and each further tableau produced during the execution of the algorithm. If the program has an optimal solution, give this solution and state its objective value. If it does not have an optimal solution, say why. maximize ₁ - 2x2+x34x4 subject to 2x1+x22x3x41, 5x1 + x2-x3-×4 ≤ −1, 2x1+x2-x3-34 2, 1, 2, 3, 40.arrow_forward9. An elementary single period market model contains a risk-free asset with interest rate r = 5% and a risky asset S which has price 30 at time t = 0 and will have either price 10 or 60 at time t = 1. Find a replicating strategy for a contingent claim with payoff h(S₁) = max(20 - S₁, 0) + max(S₁ — 50, 0). Total [8 Marks]arrow_forward8. An elementary single period market model has a risky asset with price So = 20 at the beginning and a money market account with interest rate r = 0.04 compounded only once at the end of the investment period. = = In market model A, S₁ 10 with 15% probability and S₁ 21 with 85% probability. In market model B, S₁ = 25 with 10% probability and S₁ = 30 with 90% probability. For each market model A, B, determine if the model is arbitrage-free. If not, construct an arbitrage. Total [9 Marks]arrow_forward
- b) Solve the following linear program using the 2-phase simplex algorithm. You should give the initial tableau, and each further tableau produced during the execution of the algorithm. If the program has an optimal solution, give this solution and state its objective value. If it does not have an optimal solution, say why. maximize ₁ - 2x2+x34x4 subject to 2x1+x22x3x41, 5x1 + x2-x3-×4 ≤ −1, 2x1+x2-x3-34 2, 1, 2, 3, 40.arrow_forwardSuppose we have a linear program in standard equation form maximize cTx subject to Ax = b. x ≥ 0. and suppose u, v, and w are all optimal solutions to this linear program. (a) Prove that zu+v+w is an optimal solution. (b) If you try to adapt your proof from part (a) to prove that that u+v+w is an optimal solution, say exactly which part(s) of the proof go wrong. (c) If you try to adapt your proof from part (a) to prove that u+v-w is an optimal solution, say exactly which part(s) of the proof go wrong.arrow_forwarda) Suppose that we are carrying out the 1-phase simplex algorithm on a linear program in standard inequality form (with 3 variables and 4 constraints) and suppose that we have reached a point where we have obtained the following tableau. Apply one more pivot operation, indicating the highlighted row and column and the row operations you carry out. What can you conclude from your updated tableau? x1 x2 x3 81 82 83 84 81 -2 0 1 1 0 0 0 3 82 3 0 -2 0 1 2 0 6 12 1 1 -3 0 0 1 0 2 84 -3 0 2 0 0 -1 1 4 -2 -2 0 11 0 0-4 0 -8arrow_forward
- Advanced Engineering MathematicsAdvanced MathISBN:9780470458365Author:Erwin KreyszigPublisher:Wiley, John & Sons, IncorporatedNumerical Methods for EngineersAdvanced MathISBN:9780073397924Author:Steven C. Chapra Dr., Raymond P. CanalePublisher:McGraw-Hill EducationIntroductory Mathematics for Engineering Applicat...Advanced MathISBN:9781118141809Author:Nathan KlingbeilPublisher:WILEY
- Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,





