1. (a) Consider the polynomial (x − 1)(x − 2) = x² -3x+2 which has exact roots x = 1 and x = 2. Suppose some numerical algorithm finds approximate roots equal to ✰ = 1.1 and = 1.9. For each root determine the forward error and the relative forward error. Then, for each approximate root, find a perturbed quadratic, that is as close to the original quadratic as possible, such that the approximate root to the original quadratic is the exact root to the perturbed quadratic. For each approximate root, what is the backward error and what is the relative backward error? (b) For each approximate root, draw a diagram like the ones we've seen in the course notes, showing the relationship between the original problem the perturbed problem, the exact root, and the approximate root. Make sure to include the value of the forward error and the backward error in the diagram.

1. (a) Consider the polynomial (x − 1)(x − 2) = x² -3x+2 which has exact roots x = 1 and x = 2. Suppose some numerical algorithm finds approximate roots equal to ✰ = 1.1 and = 1.9. For each root determine the forward error and the relative forward error. Then, for each approximate root, find a perturbed quadratic, that is as close to the original quadratic as possible, such that the approximate root to the original quadratic is the exact root to the perturbed quadratic. For each approximate root, what is the backward error and what is the relative backward error? (b) For each approximate root, draw a diagram like the ones we've seen in the course notes, showing the relationship between the original problem the perturbed problem, the exact root, and the approximate root. Make sure to include the value of the forward error and the backward error in the diagram.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the function f(x) = 1 3x+1 . We approximate f(x) by the Lagrange interpolating polynomial P₂ (x) at the points xo = 1, x₁ = 1.5 and.x₂ = 2. A bound of the theoretical error of this approximation at x = 1.8 is:
use polynomial fitting to find the formula for the nth term of the sequence (an) >= 0 which starts, 8,7,10,17,28,43,...
Determine the real root of f(x)=5x3-5x2+6x-2. Iterate until the estimated error falls equal to or less than 0.0001. Using MOSS method.
H.W:- В. By using the Bisection Method to approximate find the first positive root f(x) = x6 – x – 1, The interval [0,1,2], the ɛ = 0.001
1) Find the 3rd order polynomial that satisfies the data of water for saturation temperature and pressure. By using the predicted polynomial compute the saturation pressure at 65 C. Temp(C) 0 Pre. (kPa) .6108 1.227 2.337 4.241 7.375 12.335 19.92 31.16 47.36 70.11 101.33 10 20 30 40 50 60 70 80 90 100 2) A vapor pressure vs. temperature thermodynamic process has the following data.Write a MATLAB program to calculate the values of constants A and B in following equation. B og( P°) = A- T+ 273.15 Temp (C) | -36.7 | -19.6 -11.5 Pre. (kPa) -2.6 7.6 15.4 26.1 42.2 60.6 80.1 1 5 10 20 40 60 100 200 400 760 3) The experimental velocity of an incompressible fluid in a pipe of radius 1 m is tabulated as below: Second Class \ Lec. 5 47 Computer Programming (II) Dr. Saad Raheem r (m) 0.0 0,1 0,2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1.0 V 1.0 0.99 0.96 0.91| 0.84 0.75 0.64 0.51 0.36 0.19 0.0 Where: r is the distance from the centre of the pipe and u is the velocity of the fluid. Write a MATLAB program to…
4. The following algorithm for approximating roots combines the bisection method with Newton's method and ensures the convergence even in the case where Newton's method fail to converge. Choose an interval [a, b] such that f(a)f(b) ≤ 0. Compute initial approximation xo = (a+b)/2 of the root using the bisection method. For i=1,2,... Compute x₁ using Newton's method and X₁-1. If x₁ [a, b], set x₁ = (a + b)/2 (from bisection). Check for convergence. If f(a) f(xi) ≤0 set b = xi, else set a = xį. (a) Implement this algorithm in a PYTHON function with the following specifications: def findzero (a, b, tol, maxit, f, df) # Input: # a, b = The endpoints of the interval # tol = The required tolerance # maxit = Maximum number of iterations # f, df = The function and its derivative # Output: # star #niter # ierr # # # approximation of root = number of iterations for convergence 0, the method converged 1, df was zero or undefined 2, maximum number of iterations has been reached return xstar, niter,…
1. Assume that a function f is in polynomial time and can be computed in time 0(n) and that g is in polynomial time and can be computed in time 0(n°). Prove that f composed with g, that is f(g(x)), can be computed in time 0(n5).
Given Data: x = [1, 3, 9, 13, 27] and y = [3, 12, 35, 19, 5] Examine the curve fit for a polynomial of degree 1, 2, 3 and 4. You must show all four cases, i.e., find the coefficients of the polynomial for the given data. Find coefficients of a polynomial that best fits the data and find roots of that polynomial only. In your solution explain why you chose the degree of the polynomial you did. Your solution in both Matlab and Excel should show all four cases. What is the predicted y value from your polynomial for x = 3? No user-defined fn required.
Please show step and step and explain
(a) Find an interpolating polynomial of appropriate degree using the Newton's divided-difference method for f(x) = sin(x). Consider the nodes [0,1/2,7].
please show me steps
Using MATLAB, develop a computer program for the finite difference solution with general θ scheme for the 1D consolidation of a uniform layer of soil. Compare the results for θ=0, 0.5, 2/3 and 1.0 for α=0.49 and α=0.51 against the analytical solution of Terzaghi’s equation for T=0.5. Apply the program to both cases of double draining layer and single draining layer.