Mathematician Leibniz found that * can be approximated by 4 4 4 4 1 +... = 4) (-1)*+1, 11 1 3 7 2 * i – 1 i=1 (a) Write a user-defined function to implement the Leibniz approximation for a by taking n as the input argument and using for loop, wheren is the number of the terms you want to keep in your approximation. (b) Compute the errors in the approximation to a when n = 10, 25, 50, 100. The error is %3D calculated as error = approrimation – n.

Mathematician Leibniz found that * can be approximated by 4 4 4 4 1 +... = 4) (-1)+1, 11 1 3 7 2 i – 1 i=1 (a) Write a user-defined function to implement the Leibniz approximation for a by taking n as the input argument and using for loop, wheren is the number of the terms you want to keep in your approximation. (b) Compute the errors in the approximation to a when n = 10, 25, 50, 100. The error is %3D calculated as error = approrimation – n.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter14: Numerical Methods

Section: Chapter Questions

Problem 1PP

See similar textbooks

Similar questions

Write a C++ function that evaluates polynomials an an x n + an-1 xn-1, ... , a2 x2,a1 x1, a0 x0. It should take following inputs:• Value of x.• Highest power n.• Coefficients in descending order an , an-1 , ... , a2 , a1 , a0 (coefficients will nen+1)For instance, if x=4 , n=3 & coefficients are [2,3,1,2], then output should be 182 which isobtained by evaluating the polynomial 2 * 4 3 + 3 * 42 + 1 * 41 + 2 * 40 Function Prototype: double evaluatePolynomial();Example01:******************************************************x = 4p = 3Enter 4 coefficients in descending order of power2312output: 182Example02:******************************************************x = -2.5p = 7Enter 8 coefficients in descending order of power-200-4.60160output: 1032.265625Example03:******************************************************x = -2.5p = 0Enter 1 coefficients in descending order of power7output: 7Example04:******************************************************x = -2.5p = -4output: Error (power…
You suppose If you pass n=2 to your function your 2nd term of Fibonacci series is 1 and (n-1)th= 1" term of Fibonacci series is 0 and (n+1)th= 3rd term of Fibonacci series is 1..
Computer Science Prove that the set M = {x ∈ R: x 2 = 2a3 b , a ∈ N, b ∈ N} is countably infinite. Your solution should either give a bijective function f : N → M or give pseudo-code of a program that prints all the values of such a function, in the following format (in this case you don’t have to define f explicitly, but need to also show the first five lines of output): 0: element of M 1: another element of M 2: yet another element of M
Define a function S : Z+ → Z+ as follows. For each positive integer n, S(n) = the sum of the positive divisors of n. Find S(17)
Suppose n integers between 1 and 366 are presented as input, and youwant to know if there are any duplicates. How would you solve this problem?What is the rate of growth of the function T(n), describing the time it takes foryou to determine if there are duplicates? (Hint: Pick an appropriate n0.)
Write a C++ function that evaluates polynomials an an x^n + an-1 x^n-1, ... , a2 ,x2,a1 x^1, a0 x^0. It should take following inputs: Value of x. Highest power n. Coefficients in descending order an , an-1 , ... , a2 , a1 , a0 (coefficients will nen+1)For instance, if x=4 , n=3 & coefficients are [2,3,1,2], then output should be 182 which isobtained by evaluating the polynomial 2 * 4 3 + 3 * 42 + 1 * 41 + 2 * 40 Function Prototype: double evaluatePolynomial();Example01:******************************************************x = 4p = 3Enter 4 coefficients in descending order of power2312output: 182Example02:******************************************************x = -2.5p = 7Enter 8 coefficients in descending order of power-200-4.60160output: 1032.265625Example03:******************************************************x = -2.5p = 0Enter 1 coefficients in descending order of power7output: 7Example04: ******************************************************x = -2.5p = -4output: Error…
Design an iterative function Collatz(n,k) that computes the k^th number in the hailstone sequence starting at n: Collatz(n,k)= { c(c(c(...c(n)...))) }<----- k iterations
9.If you pass n=2 to your function your 2nd term of Fibonacci series is 1 and (n-1)th= 1" term of Fibonacci series is 0 and (n+1)th= 3rd term of Fibonacci series is 1..
Simplify the complement of the following function: F(A,B,C,D)=(0,2,4,5,8,9,10,11) Your answer: F=((A'B'D)' (BC)'(AB)')' F=((A'BD)'(BC)'(AB)')' F=((A'B'D)'(B'C)'(AB)') F=((A'B'D')' (BC)'(AB)')
1. Given the following data set: X: 0 2 4 6 9 11 12 15 17 19 22 25 Y: 5 6 7 6 9 8 7 10 12 12 15 10 (a) Write a Python program to fit a curve using:  Polynomial function of order 4  Cubic spline fit Plot both the data set and the approximating curve for the polynomial and spline functions. (b) In the Python program, add labels along the x and y axes, and put a title of your choice for each plot.
Write a wrapper function to specialize your function from D.1 to find all of the roots of an arbitrary polynomial that is specified by a single input vector of coefficients on a given interval to a given error tolerance . Recall that a polynomial of degree may be written as . Your function must accept the following inputs in the following order: the vector of coefficients (c) the value for the lower limit of the range (a) the value for the upper limit of the range (b) the desired error tolerance (eps)
Write a pseudocode for an algorithm for finding real roots of equation ax2 + bx + c = 0 for arbitrary real coefficients a, b, and c. (You may assume the availability of the square root function sqrt(x).)?