Introduction to Numerical Computing and Secant Method, Exercises of Computer Numerical Control

The lecture notes for the first week of the Numerical Computing course at Indus University. It covers mathematical preliminaries, error analysis, and types of error. The document also introduces the Secant Method, which is an alternative to Newton's approach for approximating roots. The method involves using a linear function based on interpolation, known as a secant line. The formula for the secant line is provided in the document.

Typology: Exercises

2021/2022

Available from 07/04/2022

muhammad-burhan-zamaan
muhammad-burhan-zamaan 🇵🇰

1 document

1 / 10

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
NUMERICAL COMPUTING
Lecture 01
Dr. Muhammad Younus
Week-01
Introduction Numerical Computing
Mathematical preliminaries and Error Analysis
Types of Error
Faculty of Computing & Information Technology, Indus University
Group Members:
1. Rao Muhammad
Noman
2. Wardah Wakeel
pf3
pf4
pf5
pf8
pf9
pfa

Partial preview of the text

Download Introduction to Numerical Computing and Secant Method and more Exercises Computer Numerical Control in PDF only on Docsity!

NUMERICAL COMPUTING

Lecture 01

Dr. Muhammad Younus

Week-

Introduction Numerical Computing

Mathematical preliminaries and Error Analysis

Types of Error

Faculty of Computing & Information Technology, Indus University

Group Members:

  1. Rao Muhammad Noman
  2. Wardah Wakeel

Course Name: Numerical Computing 2

  • (^) Teacher
  • (^) Represented By
  • (^) Semester
  • (^) Credit Hours
    • (^) Dr. Muhammad Younus
    • (^) Muhammad Mudassir
    • (^) Muhammad Owais
    • (^) Spring 2022
    • (^03)

Faculty of Computing & Information Technology, Indus University

Secant Method

Lecture

Dr. Muhammad Younus

Week-

Presented by: Muhammad Owais Qadri(519-2020) Muhammad Muddasir (174-2020)

Secant Method

 (^) The tangent line to the curve of y = f(x) with the point of tangency (x 0 , f(x 0 ) was used in Newton’s approach. The graph of the tangent line about x = α is essentially the same as the graph of y = f(x) when x 0 ≈ α. The root of the tangent line was used to approximate α.  (^) Consider employing an approximating line based on ‘ interpolation’. Let’s pretend we have two root estimations of root α, say, x 0 and x 1. Then, we have a linear function  (^) q(x) = a 0 + a 1 x  (^) using q(x 0 ) = f (x 0 ), q(x 1 ) = f (x 1 ).  (^) This line is also known as a secant line. Its formula is as follows:

CONT…

Secant Method Steps

 (^) The secant method procedures are given below using equation (1).  (^) Step 1: Initialization  (^) x 0 and x 1 of α are taken as initial guesses.  (^) Step 2: Iteration  (^) In the case of n = 1, 2, 3, …,  (^) until a specific criterion for termination has been met (i.e., The desired accuracy of the answer or the maximum number of iterations has been attained).

CONT…

 (^) Therefore, f(x 2 ) = – 0.  (^) Performing the second approximation, ,  (^) x 3 = x 2 – [( x 1 – x 2 ) / (f(x 1 ) – f(x 2 ))]f(x 2 )  (^) =(- 0.234375) – [(1 – 0.25)/(-3 – (- 0.234375))](- 0.234375)  (^) = 0.  (^) Hence, f(x 3 ) = 0.  (^) Stay tuned to BYJU’S – The Learning App for more Maths-related articles and videos that help you grasp the concepts quickly.