Numerical Analysis
Numerical Analysis
10th Edition
ISBN: 9781305253667
Author: Richard L. Burden, J. Douglas Faires, Annette M. Burden
Publisher: Cengage Learning
bartleby

Videos

Textbook Question
Book Icon
Chapter 3.1, Problem 8ES

The data for Exercise 6 were generated using the following functions. Use the error formula to find a bound for the error and compare the bound to the actual error for the cases n = 1 and n = 2.

  1. a. f (x) = e2x
  2. b. f (x) = x4x3 + x2x + 1
  3. c. f (x) = x2 cos x − 3x
  4. d. f (x) = ln(ex + 2)

6. Use appropriate Lagrange interpolating polynomials of degrees one, two, and three to approximate each of the following:

  1. a. f(0.43) if f(0) = 1, f (0.25) = 1.64872, f(0.5) = 2.71828, f(0.75) = 4.48169
  2. b. f(0) if f(−0.5) = 1.93750, f(−0.25) = 1.33203, f(0.25) = 0.800781, f(0.5) = 0.687500
  3. c. f(0.18) if f (0.1) = −0.29004986, f (0.2) = −0.56079734, f (0.3) = −0.81401972, f (0.4) = −1.0526302
  4. d. f (0.25) if f (−1) = 0.86199480, f (−0.5) = 0.95802009, f (0) = 1.0986123, f (0.5) = 1.2943767
Blurred answer
Students have asked these similar questions
When a tennis player serves, he gets two chances to serve in bounds. If he fails to do so twice, he loses the point. If he attempts to serve an ace, he serves in bounds with probability 3/8.If he serves a lob, he serves in bounds with probability 7/8. If he serves an ace in bounds, he wins the point with probability 2/3. With an in-bounds lob, he wins the point with probability 1/3. If the cost is '+1' for each point lost and '-1' for each point won, the problem is to determine the optimal serving strategy to minimize the (long-run)expected average cost per point. (Hint: Let state 0 denote point over,two serves to go on next point; and let state 1 denote one serve left. (1). Formulate this problem as a Markov decision process by identifying the states and decisions and then finding the Cik. (2). Draw the corresponding state action diagram. (3). List all possible (stationary deterministic) policies. (4). For each policy, find the transition matrix and write an expression for the…
During each time period, a potential customer arrives at a restaurant with probability 1/2. If there are already two people at the restaurant (including the one being served), the potential customer leaves the restaurant immediately and never returns. However, if there is one person or less, he enters the restaurant and becomes an actual customer. The manager has two types of service configurations available. At the beginning of each period, a decision must be made on which configuration to use. If she uses her "slow" configuration at a cost of $3 and any customers are present during the period, one customer will be served and leave with probability 3/5. If she uses her "fast" configuration at a cost of $9 and any customers are present during the period, one customer will be served and leave with probability 4/5. The probability of more than one customer arriving or more than one customer being served in a period is zero. A profit of $50 is earned when a customer is served. The manager…
Every Saturday night a man plays poker at his home with the same group of friends. If he provides refreshments for the group (at an expected cost of $14) on any given Saturday night, the group will begin the following Saturday night in a good mood with probability 7/8 and in a bad mood with probability 1/8. However, if he fail to provide refreshments, the group will begin the following Saturday night in a good mood with probability 1/8 and in a bad mood with probability 7/8 regardless of their mood this Saturday. Furthermore, if the group begins the night in a bad mood and then he fails to provide refreshments, the group will gang up on him so that he incurs expected poker losses of $75. Under other circumstances he averages no gain or loss on his poker play. The man wishes to find the policy regarding when to provide refreshments that will minimize his (long-run) expected average cost per week. (1). Formulate this problem as a Markov decision process by identifying the states and…

Chapter 3 Solutions

Numerical Analysis

Ch. 3.1 - It is suspected that the high amounts of tannin in...Ch. 3.1 - Prob. 21ESCh. 3.1 - Prove Taylors Theorem 1.14 by following the...Ch. 3.1 - Prob. 1DQCh. 3.1 - If we decide to increase the degree of the...Ch. 3.2 - Let P3(x) be the interpolating polynomial for the...Ch. 3.2 - Nevilles method is used to approximate f(0.4),...Ch. 3.2 - Nevilles method is used to approximate f(0.5),...Ch. 3.2 - Suppose xj = j, for j = 0, 1, 2, 3, and it is...Ch. 3.2 - Nevilles Algorithm is used to approximate f(0)...Ch. 3.2 - Prob. 11ESCh. 3.2 - Prob. 13ESCh. 3.2 - Can Nevilles method be used to obtain the...Ch. 3.3 - Use Eq. (3.10) or Algorithm 3.2 to construct...Ch. 3.3 - Use Eq. (3.10) or Algorithm 3.2 to construct...Ch. 3.3 - Use the Newton forward-difference formula to...Ch. 3.3 - Use the Newton forward-difference formula to...Ch. 3.3 - Use the Newton backward-difference formula to...Ch. 3.3 - Use the Newton backward-difference formula to...Ch. 3.3 - a. Use Algorithm 3.2 to construct the...Ch. 3.3 - a. Use Algorithm 3.2 to construct the...Ch. 3.3 - a. Approximate f(0.05) using the following data...Ch. 3.3 - The following data are given for a polynomial P(x)...Ch. 3.3 - The following data are given for a polynomial P(x)...Ch. 3.3 - The Newton forward-difference formula is used to...Ch. 3.3 - Prob. 14ESCh. 3.3 - Prob. 16ESCh. 3.3 - Prob. 17ESCh. 3.3 - Show that the polynomial interpolating the...Ch. 3.3 - Prob. 20ESCh. 3.3 - Prob. 21ESCh. 3.3 - Prob. 22ESCh. 3.3 - Prob. 23ESCh. 3.3 - Compare and contrast the various...Ch. 3.3 - Is it easier to add a new data pair using...Ch. 3.3 - Prob. 3DQCh. 3.4 - Use Theorem 3.9 or Algorithm 3.3 to construct an...Ch. 3.4 - Use Theorem 3.9 or Algorithm 3.3 to construct an...Ch. 3.4 - The data in Exercise 1 were generated using the...Ch. 3.4 - The data in Exercise 2 were generated using the...Ch. 3.4 - Let f (x) = 3xex e2x. a. Approximate f (1.03) by...Ch. 3.4 - The following table lists data for the function...Ch. 3.4 - a. Show that H2n + 1 (x) is the unique polynomial...Ch. 3.4 - Prob. 1DQCh. 3.4 - Prob. 2DQCh. 3.4 - Prob. 3DQCh. 3.5 - Determine the natural cubic spline S that...Ch. 3.5 - Determine the clamped cubic spline s that...Ch. 3.5 - Construct the natural cubic spline for the...Ch. 3.5 - Construct the natural cubic spline for the...Ch. 3.5 - The data in Exercise 3 were generated using the...Ch. 3.5 - Prob. 6ESCh. 3.5 - Prob. 8ESCh. 3.5 - Prob. 11ESCh. 3.5 - Prob. 12ESCh. 3.5 - Prob. 13ESCh. 3.5 - Prob. 14ESCh. 3.5 - Given the partition x0 = 0, x1 = 0.05, and x2 =...Ch. 3.5 - Prob. 16ESCh. 3.5 - Prob. 21ESCh. 3.5 - Prob. 22ESCh. 3.5 - Prob. 23ESCh. 3.5 - It is suspected that the high amounts of tannin in...Ch. 3.5 - Prob. 29ESCh. 3.5 - Prob. 30ESCh. 3.5 - Prob. 31ESCh. 3.5 - Prob. 32ESCh. 3.5 - Let f C2[a, b] and let the nodes a = x0 x1 xn...Ch. 3.5 - Prob. 34ESCh. 3.5 - Prob. 35ESCh. 3.6 - Let (x0, y0) = (0,0) and (x1, y1) = (5, 2) be the...Ch. 3.6 - Prob. 2ESCh. 3.6 - Prob. 5ESCh. 3.6 - Prob. 1DQ

Additional Math Textbook Solutions

Find more solutions based on key concepts
Knowledge Booster
Background pattern image
Math
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
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
College Algebra
Algebra
ISBN:9781938168383
Author:Jay Abramson
Publisher:OpenStax
Text book image
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
Text book image
Mathematics For Machine Technology
Advanced Math
ISBN:9781337798310
Author:Peterson, John.
Publisher:Cengage Learning,
Text book image
Trigonometry (MindTap Course List)
Trigonometry
ISBN:9781337278461
Author:Ron Larson
Publisher:Cengage Learning
03a: Numerical Differentiation Review; Author: Jaisohn Kim;https://www.youtube.com/watch?v=IMYsqbV4CEg;License: Standard YouTube License, CC-BY