Explanation Algorithm used: To ﬁnd a solution to f ( x ) = 0 given the continuous function f on the interval [ a , b ] , where f ( a ) and f ( b ) have opposite signs: INPUT endpoints a, b ; tolerance TOL ; maximum number of iterations N 0 . OUTPUT approximate solution p or message of failure. Step 1: Set i = 1 ; F A = f ( a ) . Step 2: While i ≤ N 0 do Steps 3–6. Step 3: Set p = a + ( b − a ) 2 ; ( Compute p i .) F P = f ( p ) Step 4: If F P = 0 or ( b − a ) 2 < T O L then OUTPUT ( p ); ( Procedure completed successfully .) STOP. Step 5: Set i = i + 1 . Step 6 If F A ⋅ F P > 0 then set a = p ;( Compute a i , b i .) F A = F P else set b = p .( FA is unchanged .) Step 7 OUTPUT (‘Method failed after N 0 iterations, N 0 =’, N 0 ); ( The procedure was unsuccessful .) STOP. Theorem used: Suppose that f ∈ C [ a , b ] and f ( a ) ⋅ f ( b ) < 0 . The Bisection method generates a sequence { p n } n = 1 ∞ approximating a zero p of f with | p n − p | ≤ b − a 2 n , n ≥ 1 . Calculation: Given that the function is f ( x ) = x 4 + x − 4 on the interval [ 1 , 4 ] . Find the functional value of the end points as follows. f ( 1 ) = 1 4 + 1 − 4 = − 2 f ( 4 ) = 4 4 + 4 − 4 = 64 Since the values having opposite sign, the above theorem and algorithm can be applied. By the above theorem, | p n − p | ≤ b − a 2 n ≤ 10 − 3 . 4 − 1 2 n ≤ 10 − 3 1 , 000 ( 3 ) ≤ 2 n 3 , 000 ≤ 2 n n ≥ 12 Thus, the solution of the given function accurate to 10 − 4 is obtained in 14 iterations

10th Edition

ISBN: 9781305253667

Author: Richard L. Burden, J. Douglas Faires, Annette M. Burden

Publisher: Cengage Learning

See similar textbooks

Concept explainers

Optimization

Optimization comes from the same root as "optimal". "Optimal" means the highest. When you do the optimization process, that is when you are "making it best" to maximize everything and to achieve optimal results, a set of parameters is the base for the se…

Integration

Integration means to sum the things. In mathematics, it is the branch of Calculus which is used to find the area under the curve. The operation subtraction is the inverse of addition, division is the inverse of multiplication. In the same way, integratio…

Application of Integration

In mathematics, the process of integration is used to compute complex area related problems. With the application of integration, solving area related problems, whether they are a curve, or a curve between lines, can be done easily.

Volume

In mathematics, we describe the term volume as a quantity that can express the total space that an object occupies at any point in time. Usually, volumes can only be calculated for 3-dimensional objects. By 3-dimensional or 3D objects, we mean objects th…

Area

Area refers to the amount of space a figure encloses and the number of square units that cover a shape. It is two-dimensional and is measured in square units.

Videos

Question

Chapter 2.1, Problem 18ES

To determine

The bound for the number of iterations and the solution accurate to 10−3.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 2.1, Problem 17ES

Chapter 2.1, Problem 19ES

Students have asked these similar questions

a is done please show b

solve part a on paper

solve on paper

Chapter 2 Solutions

Numerical Analysis

Ch. 2.1 - Use the Bisection method to find p3 for f(x)=xcosx...Ch. 2.1 - Let f(x) = 3(x +1)(x 12)(x 1) = 0. Use the...Ch. 2.1 - Use the Bisection method to find solutions...Ch. 2.1 - Use the Bisection method to find solutions...Ch. 2.1 - Use the Bisection method to find solutions...Ch. 2.1 - Prob. 7ES Ch. 2.1 - Prob. 8ES Ch. 2.1 - Prob. 9ES Ch. 2.1 - Prob. 10ES Ch. 2.1 - Prob. 11ES

Ch. 2.1 - Let f(x) = (x + 2)(x + 1)x(x 1)3(x 2). To which...Ch. 2.1 - Find an approximation to 253 correct to within 104...Ch. 2.1 - Find an approximation to 3 correct to within 104...Ch. 2.1 - A trough of length L has a cross section in the...Ch. 2.1 - Use Theorem 2.1 to find a bound for the number of...Ch. 2.1 - Prob. 18ES Ch. 2.1 - Prob. 19ES Ch. 2.1 - Let f(x) = (x 1)10, p = 1, and pn = 1 + 1/n. Show...Ch. 2.1 - The function defined by f(x) = sin x has zeros at...Ch. 2.1 - Prob. 1DQ Ch. 2.1 - Prob. 2DQ Ch. 2.1 - Is the Bisection method sensitive to the starting...Ch. 2.2 - Use algebraic manipulation to show that each of...Ch. 2.2 - a. Perform four iterations, if possible, on each...Ch. 2.2 - Let f(x) = x3 2x + 1. To solve f(x) = 0, the...Ch. 2.2 - Let f(x) = x4 + 3x2 2. To solve f(x) = 0, the...Ch. 2.2 - The following four methods are proposed to compute...Ch. 2.2 - Prob. 6ES Ch. 2.2 - Prob. 7ES Ch. 2.2 - Prob. 8ES Ch. 2.2 - Use Theorem 2.3 to show that g(x) = + 0.5...Ch. 2.2 - Use Theorem 2.3 to show that g(x) = 2x has a...Ch. 2.2 - Use a fixed-point iteration method to find an...Ch. 2.2 - Use a fixed-point iteration method to determine a...Ch. 2.2 - Use a fixed-point iteration method to determine a...Ch. 2.2 - Prob. 20ES Ch. 2.2 - Prob. 21ES Ch. 2.2 - a. Show that Theorem 2.3 is true if the inequality...Ch. 2.2 - a. Use Theorem 2.4 to show that the sequence...Ch. 2.2 - Prob. 24ES Ch. 2.2 - Prob. 25ES Ch. 2.2 - Suppose that g is continuously differentiable on...Ch. 2.3 - Let f(x) = x2 6 and p0 = 1. Use Newtons method to...Ch. 2.3 - Let f(x) = x3 cos x and p0 = 1. Use Newtons...Ch. 2.3 - Let f(x) = x2 6. With p0 = 3 and p1 = 2, find p3....Ch. 2.3 - Let f(x) = x3 cos x. With p0 = 1 and p1 = 0, find...Ch. 2.3 - Prob. 11ES Ch. 2.3 - Prob. 12ES Ch. 2.3 - The fourth-degree polynomial...Ch. 2.3 - Prob. 14ES Ch. 2.3 - Prob. 15ES Ch. 2.3 - Prob. 16ES Ch. 2.3 - Prob. 22ES Ch. 2.3 - Prob. 23ES Ch. 2.3 - Prob. 24ES Ch. 2.3 - Prob. 25ES Ch. 2.3 - Prob. 27ES Ch. 2.3 - A drug administered to a patient produces a...Ch. 2.3 - Prob. 30ES Ch. 2.3 - Prob. 32ES Ch. 2.3 - Prob. 1DQ Ch. 2.3 - Prob. 2DQ Ch. 2.3 - Prob. 3DQ Ch. 2.3 - Prob. 4DQ Ch. 2.4 - Prob. 6ES Ch. 2.4 - a. Show that for any positive integer k, the...Ch. 2.4 - Prob. 8ES Ch. 2.4 - a. Construct a sequence that converges to 0 of...Ch. 2.4 - Prob. 10ES Ch. 2.4 - Prob. 11ES Ch. 2.4 - Prob. 12ES Ch. 2.4 - Prob. 13ES Ch. 2.4 - Prob. 14ES Ch. 2.4 - Prob. 1DQ Ch. 2.4 - Prob. 2DQ Ch. 2.4 - Prob. 4DQ Ch. 2.5 - Let g(x) = cos(x 1) and p0(0) = 2. Use...Ch. 2.5 - Prob. 4ES Ch. 2.5 - Prob. 5ES Ch. 2.5 - Prob. 6ES Ch. 2.5 - Use Steffensens method to find, to an accuracy of...Ch. 2.5 - Prob. 8ES Ch. 2.5 - Prob. 9ES Ch. 2.5 - Use Steffensens method with p0 = 3 to compute an...Ch. 2.5 - Use Steffensens method to approximate the...Ch. 2.5 - Prob. 12ES Ch. 2.5 - Prob. 13ES Ch. 2.5 - Prob. 14ES

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.

The bound for the number of iterations and the solution accurate to 10 − 3 .

Solution Summary: The author explains the bound for the number of iterations and the solution accurate to 10-3.

Concept explainers

Videos

The bound for the number of iterations and the solution accurate to 10−3.

Want to see the full answer?

Chapter 2 Solutions