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

Please help answer this question!
use polynomial fitting to find the formula for the nth term of the sequence (an) >= 0 which starts, 8,7,10,17,28,43,...
List the 4 Chebyshev interpolation nodes in the interval [0, 1] Hence, use the nodes to construct an interpolating polynomial for the function: f(x) = x ln(x + e^x)
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).
Please help with this question!
The solution is using Matlab
Please show step and step and explain
What is the GCD of 0x9 and 0x5 in GF(24)? Express your answer as a single hexadecimal digit. Recall that a single hexadecimal digit represents four binary digits and that the four binary digits represent the four coefficients of a degree-3 polynomial. This problem is asking for the GCD not the extended GCD. That means you do not need to keep track of linear combinations.
Use the bisection method to solve the following nonlinear equation 2x^6 - 5x^4 + 2 = 0 . Starting with the initial interval [0,1]. Approximate the solution with an absolute error of less than or equal to 10-3. Show the corresponding solution and the minimum amount of iterations required. Draw the graph of the function.
Find all solutions for the following pair of simultaneous congruences. 5x = 9 (mod 11) 3x = 8 (mod 13)
USING PYTHON A tridiagonal matrix is one where the only nonzero elements are the ones on the main diagonal (i.e., ai,j where j = i) and the ones immediately above and belowit(i.e.,ai,j wherej=i+1orj=i−1). Write a function that solves a linear system whose coefficient matrix is tridiag- onal. In this case, Gauss elimination can be made much more efficient because most elements are already zero and don’t need to be modified or added. Please show steps and explain.
Let x and y be integers such that x = 3 (mod 10) and y = 5 (mod 10). Find the integer z such that 97x + 3y³ z (mod 10) and 0 ≤ z ≤9.