Fundamentals of Differential Equations and Boundary Value Problems
7th Edition
ISBN: 9780321977106
Author: Nagle, R. Kent
Publisher: Pearson Education, Limited
expand_more
expand_more
format_list_bulleted
Question
Chapter 5.3, Problem 26E
To determine
To approximate:
The solution to the given initial value problem at
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
4.
Salary (pesos)
f
1001-2000
7
2001-3000
12
3001-4000
10
4001-5000
5001-6000
Compute the following:
a. average weekly salary of the employees
Solution:
Salary (pesos)
Xm
fXm
1001-2000
2001-3000
12
3001-4000
10
4001-5000
5001-6000
5
N= 48
Efxm = _
2. Consider the following LP problem:
max z = 5x1 – x2
s.t.
2x, + x2 = 6
x1 + x2 < 4
x, + 2x2 < 5
X1, X2 2 0
Apply the two phase simplex algorithm to the problem.
Create the phase 1 tableau, and define the entering and leaving variables. You
don't need to iterate
2. A bank operates both a drive-up facility and a walk-up window. On a
randomly selected day, let X = the proportion of time that the drive-up facility
is in use (at least one customer is being served or waiting to be served) and Y
= the proportion of the time that the walk-up window is in use. Then the set
of possible values for (X, Y) is the rectangle
D = {(x, y): 0 ≤ x ≤ 1,0 ≤ y ≤ 1}. Suppose the joint probability density
function of (X, Y) is given by:
fx,y(x,y) = { / (x + y ² )
²²(x + y²) 0≤x≤ 1,0 ≤ y ≤ 1
Otherwise
0
(a) Show that fx,y is legitimate
(b) Find the probability that neither facility is busy more than one-quarter of
the time.
(c) Find fx and fy, the marginal probability density function of X and Y
respectively.
(d) Construct the conditional probability density function of Y given that
X=0.8.
(e) Evaluate the probability that the walk-up facility is busy at most half of the
time given that X=0.8
(f) Calculate the expected proportion of the time that the walk-up facility…
Chapter 5 Solutions
Fundamentals of Differential Equations and Boundary Value Problems
Ch. 5.2 - Let A=D1, B=D+2, C=D2+D2, where D=d/dt. For y=t38,...Ch. 5.2 - Show that the operator (D1)(D+2) is the same as...Ch. 5.2 - In Problems 3-18, use the elimination method to...Ch. 5.2 - In Problems 3-18, use the elimination method to...Ch. 5.2 - In Problems 3-18, use the elimination method to...Ch. 5.2 - In Problems 3-18, use the elimination method to...Ch. 5.2 - In Problems 3-18, use the elimination method to...Ch. 5.2 - In Problems 3-18, use the elimination method to...Ch. 5.2 - In Problems 3-18, use the elimination method to...Ch. 5.2 - In Problems 3-18, use the elimination method to...
Ch. 5.2 - In Problems 3-18, use the elimination method to...Ch. 5.2 - In Problems 3-18, use the elimination method to...Ch. 5.2 - Prob. 14ECh. 5.2 - In Problems 3-18, use the elimination method to...Ch. 5.2 - Prob. 16ECh. 5.2 - Prob. 17ECh. 5.2 - In Problems 3-18, use the elimination method to...Ch. 5.2 - In Problems 19-21, solve the given initial value...Ch. 5.2 - In Problems 19-21, solve the given initial value...Ch. 5.2 - Prob. 21ECh. 5.2 - Prob. 22ECh. 5.2 - Prob. 23ECh. 5.2 - Prob. 24ECh. 5.2 - In Problems 25-28, use the elimination method to...Ch. 5.2 - Prob. 26ECh. 5.2 - Prob. 27ECh. 5.2 - Prob. 28ECh. 5.2 - Prob. 29ECh. 5.2 - Prob. 30ECh. 5.2 - Two large tanks, each holding 100L of liquid, are...Ch. 5.2 - In Problem 31, 3L/min of liquid flowed from tank A...Ch. 5.2 - In Problem 31, assume that no solution flows out...Ch. 5.2 - Feedback System with Pooling Delay. Many physical...Ch. 5.2 - Arms Race. A simplified mathematical model for an...Ch. 5.2 - Let A, B, and C represent three linear...Ch. 5.3 - In Problems 1-7, convert the given initial value...Ch. 5.3 - In Problems 1-7, convert the given initial value...Ch. 5.3 - In Problems 1-7, convert the given initial value...Ch. 5.3 - In Problems 1-7, convert the given initial value...Ch. 5.3 - In Problems 1-7, convert the given initial value...Ch. 5.3 - In Problems 1-7, convert the given initial value...Ch. 5.3 - In Problems 1-7, convert the given initial value...Ch. 5.3 - Prob. 8ECh. 5.3 - In Section 3.6, we discussed the improved Eulers...Ch. 5.3 - In Problems 10-13, use the vectorized Euler method...Ch. 5.3 - In Problems 10-13, use the vectorized Euler method...Ch. 5.3 - In Problems 10-13, use the vectorized Euler method...Ch. 5.3 - In Problems 10-13, use the vectorized Euler method...Ch. 5.3 - Prob. 14ECh. 5.3 - In Problems 14-24, you will need a computer and a...Ch. 5.3 - In Problems 14-24, you will need a computer and a...Ch. 5.3 - Prob. 18ECh. 5.3 - Prob. 19ECh. 5.3 - In Problems 14-24, you will need a computer and a...Ch. 5.3 - Prob. 21ECh. 5.3 - Prob. 22ECh. 5.3 - Prob. 24ECh. 5.3 - Prob. 25ECh. 5.3 - Prob. 26ECh. 5.3 - Prob. 27ECh. 5.3 - Prob. 28ECh. 5.3 - In Problems 25-30, use a software package or the...Ch. 5.3 - Prob. 30ECh. 5.4 - In Problems 1 and 2, verify that the pair x(t),...Ch. 5.4 - In Problems 1 and 2, verify that pair x(t), y(t)...Ch. 5.4 - In Problems 3-6, find the critical point set for...Ch. 5.4 - Prob. 4ECh. 5.4 - In Problems 3-6, find the critical point set for...Ch. 5.4 - In Problems 3-6, find the critical point set for...Ch. 5.4 - In Problems 7-9, solve the related phase plane...Ch. 5.4 - In Problems 7-9, solve the related phase plane...Ch. 5.4 - In Problems 7-9, solve the related phase plane...Ch. 5.4 - Find all the critical points of the system...Ch. 5.4 - In Problems 11-14, solve the related phase plane...Ch. 5.4 - In Problems 11-14, solve the related phase plane...Ch. 5.4 - In Problems 11-14, solve the related phase plane...Ch. 5.4 - In Problems 11-14, solve the related phase plane...Ch. 5.4 - In Problems 15-18, find all critical points for...Ch. 5.4 - In Problems 15-18, find all critical points for...Ch. 5.4 - In Problems 15-18, find all critical points for...Ch. 5.4 - In Problems 15-18, find all critical points for...Ch. 5.4 - In Problems 19-24, convert the given second-order...Ch. 5.4 - In Problems 19-24, convert the given second-order...Ch. 5.4 - Prob. 21ECh. 5.4 - In Problems 19-24, convert the given second-order...Ch. 5.4 - Prob. 23ECh. 5.4 - In Problems 19-24, convert the given second-order...Ch. 5.4 - Prob. 25ECh. 5.4 - Prob. 26ECh. 5.4 - Prob. 27ECh. 5.4 - Prob. 28ECh. 5.4 - A proof of Theorem 1, page 266, is outlined below....Ch. 5.4 - Phase plane analysis provides a quick derivation...Ch. 5.4 - Prob. 32ECh. 5.4 - Prob. 34ECh. 5.4 - Sticky Friction. An alternative for the damping...Ch. 5.4 - Rigid Body Nutation. Eulers equations describe the...Ch. 5.5 - Radioisotopes and Cancer Detection. A radioisotope...Ch. 5.5 - Secretion of Hormones. The secretion of hormones...Ch. 5.5 - Prove that the critical point (8) of the...Ch. 5.5 - Suppose for a certain disease described by the SIR...Ch. 5.5 - Prob. 6ECh. 5.5 - Prob. 7ECh. 5.5 - Prob. 8ECh. 5.5 - Prob. 9ECh. 5.5 - Prove that the infected population I(t) in the SIR...Ch. 5.6 - Two springs and two masses are attached in a...Ch. 5.6 - Determine the equations of motion for the two...Ch. 5.6 - Four springs with the same spring constant and...Ch. 5.6 - Two springs, two masses, and a dashpot are...Ch. 5.6 - Referring to the coupled mass-spring system...Ch. 5.6 - Prob. 7ECh. 5.6 - A double pendulum swinging in a vertical plane...Ch. 5.6 - Prob. 9ECh. 5.6 - Suppose the coupled mass-spring system of Problem...Ch. 5.7 - An RLC series circuit has a voltage source given...Ch. 5.7 - An RLC series circuit has a voltage source given...Ch. 5.7 - Prob. 3ECh. 5.7 - An LC series circuit has a voltage source given by...Ch. 5.7 - An RLC series circuit has a voltage source given...Ch. 5.7 - Show that when the voltage source in (4) is of the...Ch. 5.7 - Prob. 7ECh. 5.7 - Prob. 8ECh. 5.7 - Prob. 9ECh. 5.7 - Prob. 10ECh. 5.7 - In Problems 10-13, find a system of differential...Ch. 5.7 - In Problems 10-13, find a system of differential...Ch. 5.7 - In Problems 10-13, find a system of differential...Ch. 5.8 - A software package that supports the construction...Ch. 5.8 - Prob. 2ECh. 5.8 - A software package that supports the construction...Ch. 5.8 - Prob. 4ECh. 5.8 - Prob. 5ECh. 5.8 - A software package that supports the construction...Ch. 5.8 - Prob. 11ECh. 5.RP - In Problems 1-4, find a general solution x(t),...Ch. 5.RP - In Problems 1-4, find a general solution x(t),...Ch. 5.RP - In Problems 1-4, find a general solution x(t),...Ch. 5.RP - In Problems 1-4, find a general solution x(t),...Ch. 5.RP - Prob. 5RPCh. 5.RP - Prob. 6RPCh. 5.RP - Prob. 7RPCh. 5.RP - Prob. 8RPCh. 5.RP - Prob. 9RPCh. 5.RP - Prob. 10RPCh. 5.RP - Prob. 11RPCh. 5.RP - Prob. 12RPCh. 5.RP - Prob. 13RPCh. 5.RP - Prob. 14RPCh. 5.RP - Prob. 15RPCh. 5.RP - Prob. 16RPCh. 5.RP - Prob. 17RPCh. 5.RP - In the coupled mass-spring system depicted in...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- 2. Suppose that in Example 2.27, 400 units of food A, 500 units of B, and 600 units of C are placed in the test tube each day and the data on daily food consumption by the bacteria (in units per day) are as shown in Table 2.7. How many bacteria of each strain can coexist in the test tube and consume all of the food? Table 2.7 Bacteria Strain I Bacteria Strain II Bacteria Strain III Food A 1 2 0 Food B 2 1 3 Food C 1 1 1arrow_forwardCompute A5 if A = PDP-1. 1 1 1 0 P = 0 -1 4 D = 0 2 -1 0 0 -1 A5 =arrow_forwardSuppose that you have two products, (Product 1 and 2), which can be produced in one of two plants (Plant 1 and 2). The corresponding unit processing times of each product on each plant, and their unit costs are given. Each plant has a minimum working hour limit, as shown in the table below.Decision variables for the problem are defined as x: number of product 1 produced, and y:number of product 2 produced. Formulated the problem as an LP minimizing total cost and solve it by graphical method. Explicitly show the isocost lines, the intersection of the costraints and the optimal solution on the graph. Then, according to your graph, answer the following questions.(a) What is the shadow price of the Constraint 1(Plant 1 Constraint)? Compute and show on graph.(b) What is the shadow price of the Constraint 2(Plant2 Constraint)? Compute and show on graph.(c) What is the reduced cost of x? (How much should the objective function coefficient of x reduced from 6 for it to become nonzero in the…arrow_forward
- Compare the LP relaxations of the three integer optimization problems: (Problem 1) max 14*x1 + 8*x2 + 6*x3 + 6*x4s.t. 28*x1 + 15*x2 + 13*x3 + 12*x4 <= 39x1, x2, x3, x4 \in {0,1} (Problem 2) max 14*x1 + 8*x2 + 6*x3 + 6*x4s.t. 2*x1 + x2 + x3 + x4 <= 2x1, x2, x3, x4 \in {0,1} (Problem 3) max 14*x1 + 8*x2 + 6*x3 + 6*x4s.t. x2 + x3 + x4 <= 2x1 + x2 <= 1x1 + x3 <= 1x1 + x4 <= 1x1, x2, x3, x4 \in {0,1} Among these three problems, the LP relaxation of which problem can offer a solution whose objective value is closer to the optimal value of the corresponding integer optimization? A) Problem 2 B) Problem 1 C) Problem 3arrow_forwardBy employing the Adams Fourth-Order Predictor-Corrector algorithm with the step size h=0.2, find the numerical solution of the following problem at t=0.4 0 ≤ t ≤ 1, y' = t² - 2e-2t y(0) = 1, "arrow_forwardSuppose that each year, 80% of residents living in state A stay in state A, while 20% of them move to state B. Also, 70% of the residents living in state B stay in state B, while 30% of them move to state A. Further, assume at t = 0 years, there are 2 million residents living in state A and 5 million residents living in state B, and let xn and yYn represent the populations (in millions) of the states A and B, respectively, at time t = n years. Given that (:) - (: )() Xn a b Yn d 5 find the value of the number h.arrow_forward
- Consider the following three optimization problems: (Problem 1) max 14*x1 + 8*x2 + 6*x3 + 6*x4 s.t. 28*x1 + 15*x2 + 13*x3 + 12*x4 <= 39 x1, x2, x3, x4 \in {0,1} (Problem 2) max 14*x1 + 8*x2 + 6*x3 + 6*x4 s.t. 2*x1 + x2 + x3 + x4 <= 2 x1, x2, x3, x4 \in {0,1} (Problem 3) max 14*x1 + 8*x2 + 6*x3 + 6*x4 s.t. x2 + x3 + x4 <= 2 x1 + x2 <= 1 x1 + x3 <= 1 x1 + x4 <= 1 x1, x2, x3, x4 \in {0,1} Which of the following statements is true? Feasible region of Problem (1) is strictly larger than the feasible region of Problem (2). Feasible region of Problem (2) is strictly larger than the feasible regions of Problem s (1) and (3).…arrow_forwardFigure attached below. 1. A bin of 5 transistors is known to contain 2 that are defective. The transistors are to be tested, one at atime, until the defective ones are identified. Denote by X the number of tests made until the first defectis identified and by Y the number of additional tests until the second defect is identified.(a) Find g(x|y) and draw a figure like Figure 4.3-1(b), depicting the conditional pmfs fory = 1,2,3,and 4.(b) Find h(y|x) and draw a figure like Figure 4.3-1(c), depicting the conditional pmfs forx = 1,2,3,and 4.(c) Find E [X|Y = 2] and Var (X|Y = 2)arrow_forward2. Use the algorithm for Euler's method to determine approximations to the solution to the initial value problem y' = 3x²(y + 2), 0≤x≤ 1, y(0) = 1 h = 0.2 And compare these with the exact values given by y(x) = 3ex² - 2arrow_forward
- Q4. The temperature distribution in a thin rod of 1 m length can be described by the following unsteady state one-dimensional heat equation; ƏT = 0.02 at with the following initial and boundary conditions: Initial condition: T(x, 0) = 100x for all x at t=0 Boundary conditions: T(0, t > 0) = 50; T(1, t > 0) = 100 Apply the Crank Nicolson Algorithm in EXCEL platform and find the temperature distribution after 1 min. (Data : Ax = 0.2 m and At = 0.5 min) %3Darrow_forwardThere are 100,000 students, staff, and faculty with an account at ASU, and when the virus was discovered, there were already 1000 accounts infected and 2000 accounts recovered from the virus. We can formulate the problem as a standard SIR model. The model has a time step size of one hour. From the data of the first hours of the virus spreading through the system we know that α is 0.00001 and that it takes half a day for a computer to be recovered (the average time it takes for people to upload and execute a virus destruction program). (Please use google sheets) a: What is the value of R0? b: How many accounts need to be vaccinated to avoid an epidemic (users need to install a patch on their computer)?arrow_forwardProblem 3. Let f(r) be the piecewise linear function on [1,1] that consists of four line segments connecting the points (-1,-1) and (-0.5, 1); (-0.5, 1) and (0, -1); (0, -1) and (0.5, 1); (0.5,1) and (1,-1). Write a code that computes the barycentric Lagrange form of the interpolating polynomial pn (x) of degree n for n+ 1 Chebyshev nodes. The code should produce pictures similar to Fig. 5.1 in Berrut et al for your piecewise function f(x). Submit your pictures for p20 (x), and p100 (x). Exercise 6.9 (Lyche and Merrien) and the paper by Berrut et al are useful. Problem 4. Add a few lines to your code in Problem 3 to compute the numer- ical error of approximation: en = max f(x) - pn (x). One way to do it is to introduce a very fine uniform grid {t}, where m is very large. Then max f(x) pn(x) max f(k) - Pn (Tk)|. -1551 1≤k≤m .... Submit a table that has two columns: n, en, for n = 2', l = 1,. will have seven rows. 7. The table Problem 5. Based on the table in Problem 4, decide on…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
UG/ linear equation in linear algebra; Author: The Gate Academy;https://www.youtube.com/watch?v=aN5ezoOXX5A;License: Standard YouTube License, CC-BY
System of Linear Equations-I; Author: IIT Roorkee July 2018;https://www.youtube.com/watch?v=HOXWRNuH3BE;License: Standard YouTube License, CC-BY