Scribd
Upload
4 views2 pages

MTH603 Assignment1 All Solutions

The document provides solutions to five mathematical problems involving conversions and root-finding methods. It includes the binary conversion of 0.6875, and approximations of roots using the bisection method, Regula Falsi method, Newton–Raphson method, and Secant method. Each solution details the steps taken and the approximate roots found after one iteration.

Uploaded by

zilla7744shah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views2 pages

MTH603 Assignment1 All Solutions

The document provides solutions to five mathematical problems involving conversions and root-finding methods. It includes the binary conversion of 0.6875, and approximations of roots using the bisection method, Regula Falsi method, Newton–Raphson method, and Secant method. Each solution details the steps taken and the approximate roots found after one iteration.

Uploaded by

zilla7744shah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

MTH603 - Assignment 1 Solutions

Question 1:
Convert the decimal number 0.6875 into its binary equivalent.
Solution:

To convert a decimal fraction to binary:


Multiply the decimal fraction by 2. Record the whole number part (0 or 1). Then repeat the
process with the fractional part of the result until it becomes 0 or you reach sufficient
precision.

Steps:
1. 0.6875 × 2 = 1.375 → Whole part: 1
2. 0.375 × 2 = 0.75 → Whole part: 0
3. 0.75 × 2 = 1.5 → Whole part: 1
4. 0.5 × 2 = 1.0 → Whole part: 1

Binary equivalent of 0.6875 = (0.1011)₂

Question 2:
Determine an approximate root of the equation x^3 + 2x - 5 = 0 in the
interval [1, 2] using one iteration of the bisection method.
Solution:

Let f(x) = x^3 + 2x - 5


Check endpoints:
f(1) = -2, f(2) = 7 → sign change, root lies between 1 and 2

Midpoint m = (1 + 2)/2 = 1.5


f(1.5) = 1.375 → root lies between 1 and 1.5

Approximate root after one iteration: 1.5


Question 3:
Use the Regula Falsi method to compute one iteration approximation to
the root of x^2 - 4 = 0, taking x0 = 1.5 and x1 = 3.5.
Solution:

Let f(x) = x^2 - 4


f(1.5) = -1.75, f(3.5) = 8.25

x2 = 3.5 - (8.25 * (1.5 - 3.5)) / (-1.75 - 8.25)


= 3.5 - (-16.5 / -10) = 3.5 - 1.65 = 1.85

Approximate root after one iteration: 1.8500

Question 4:
Use one iteration of the Newton–Raphson method to approximate the
root of x^2 - 6 = 0, starting with x0 = 2.5.
Solution:

Let f(x) = x^2 - 6, f'(x) = 2x


f(2.5) = 0.25, f'(2.5) = 5

x1 = 2.5 - (0.25 / 5) = 2.5 - 0.05 = 2.45

Approximate root after one iteration: 2.4500

Question 5:
Perform one iteration of the Secant method to approximate a root of x^2
- 5 = 0 using x0 = 2 and x1 = 3.
Solution:

Let f(x) = x^2 - 5


f(2) = -1, f(3) = 4

x2 = 3 - 4 * (3 - 2) / (4 - (-1)) = 3 - 4 * (1 / 5) = 3 - 0.8 = 2.2

Approximate root after one iteration: 2.2000

You might also like