Exercise 1.3 : Approximation of functionsThe function(1) =can be approximated by the series()~1+x+パ++as long as x] < 1. We would like to explore how many terms are needed to make the difference between f(x) and this seriesapproximation smaller than a given tolerance.For example, for an error of 1x 10- and x=0 only one term from the series is needed, while for x=1/2= 21-(1/2)and1.1.1+ラt *- 1.937522so n=5 terms is enough for an error of 1 x 10" and x1/2(a) Write a functionvoid numberofTerms (double x, double error, int n)that will for any value of x less then 1 in magnitude compare the series to the exact function and determine the minimumnumber of terms needed to make their difference less than a specified error. Make sure you protect your functionagainst bad inputs using control structures.(b) Write a driver program that tests the function numberofTerms written in 1.3(a). The report should contain the following sections:1. list of files: list of each file contained in your submission.2. usage: This section should explain how to use your program.3. implementation: this section should provide a brief description of each of your program organizationand its implementation.4. Bugs: This section should mention any known bugs. If you are unaware of any bugs, simpleplace "NONE" under this heading.

Code: #include <stdio.h>#include <math.h> double fx(double x){ // function to compute…

Exercise 1.3 : Approximation of functions The function can be approximated by the series )=1+x+デ++ as long as x<1. We would like to explore how many terms are needed to make the difference between f(x) and this series approximation smaller than a given tolerance. For example, for an error of 1x 10- and x=0 only one term from the series is needed, while for x= 1/2 = 2 1-(1/2) and 1 1 1+えttt son=5 terms is enough for an error of I x 10- and x 1/2 - 1.9375 (a) Write a function void numberofTerms (double x, double error, int n)

Exercise 1.3 : Approximation of functions The function can be approximated by the series )=1+x+デ++ as long as x<1. We would like to explore how many terms are needed to make the difference between f(x) and this series approximation smaller than a given tolerance. For example, for an error of 1x 10- and x=0 only one term from the series is needed, while for x= 1/2 = 2 1-(1/2) and 1 1 1+えttt son=5 terms is enough for an error of I x 10- and x 1/2 - 1.9375 (a) Write a function void numberofTerms (double x, double error, int n)

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.7: Do While Loops

Problem 6E: (Numerical analysis) Here’s a challenging problem for those who know a little calculus. The...

See similar textbooks

Similar questions

Show that the function F(x,y,z) = xy + xz + yz will have a value of 1 if there are at least 2 variables x,y and z which have a value of 1. (using a table)
2. Generate truth table for the following functions:(a) F(X,Y,Z)=∑(1,3,6,7)(b) F(X,Y,Z)=π(1,3,4)(c) F(W,X,Y,Z)=∑(1,4,7,10,12,15)(d) F(W,X,Y,Z)=π(2,3,4,7,10,11,12,13)
Minimize the following boolean function- F(A, B, C, D) = {m(0, 1, 3, 5, 7, 8, 9, 11, 13, 15)
3. (a) Consider the following algorithm. Input: Integers n and a such that n 20 and a > 1. (1) If 0
1. Apply Bisection method to find the root (only one root) of the function: f(x) = 8sin(x) + 8cos(x) fromthe bracket -10 to 10.0. Use only 10 iterations and give the value of the rootSample answer is given below:
1. Consider the following functions of n. (1) (2) (3) (4) (5) (6) (7) (8) (9) fi(n) = n, if n = 2.k for k = 0, 1, 2,... = n², otherwise. f2(n) = n, if n = 3.k for k= 0, 1, 2,... = n², otherwise. f3(n) = log n. Answer the following questions and prove your answ Yes or No. Yes or No. Yes or No. Yes or No. Yes or No. Yes or No. Yes or No. Yes or No. Yes or No. fi(n) = 2(f₂(n)), f2(n) = Q(fi(n)), fi(n) = 0 (f₂(n)), f₂(n) = 0 (fi(n)), fi(n) = O(n), f₂(n) = O(n²), f3(n) = O(√n), f3(n) = O(fi(n)), 22n = 0(2¹), swer for each one.
f(x) = x3 – 3x – 4 Consider the function on the interval [2,2.5].When the tolerence value is 10-5 and maximum number of iterations is 100, find the number of iterations that MATLAB made to get last approximation of the root by using MATLAB function file of Bisection method. Your answer: O 14 O 15 17 O 16
simplify the following boolean function ?
[7] Simplify the following Boolean function F, together with the don't-care conditions d, and then express the simplified function in sum-of-minterms form: (d) F(A, B, C, D) = E(1,3,8, 10, 15) and d(A,B,C,D) = E(0, 2,9) IUW Y .. [9] Simplify the following functions, and implement them with two-level NOR gate circuits: (b) F(w,x,y, z) = E(1,2, 13, 14) [10] (a) Implement the following function using NAND gates with a fan in of 2. F = (ab + d') (ac + b) + (ac +b)d (b) Simplify the above function and implement using NAND gates with a fan in of 2. [11] Determine the value of F in a standard form: y Z' F y'
Computer Science f(x)= Sin(x) – x 3 + C Where C = Max [0.15, (69/100)] x20, (x is in radian). Apply the false position method three iterations to find the root of the function (Decide the starting values of Xl and Xu yourself)
Computer Science Please help solve this problem by writing a code in PYTHON language. Thank you! Write a function for the Gauss-Seidel method. Test the function by solving the equations Äx = 6 where [3 -1 1] A = 3 6 2 [3 3 7 and b = 0 4 Use two different values of the relaxation parameter w. Show that you obtain approximately the same answer, and explain which value of w obtained the solution more efficiently.
. Obtain the canonical SOP form of the following functions: (i) y(A,B) = A+B (ii) f (A,B,C) = A+BC