

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Main points of this past exam are: System of Linear Equations, Obtaining Roots of Equation, Bisection Methods, False-Position Methods, Fixed-Point Method, Gaussian Elimination, Lagrange Interpolation, Newton’s Interpolating Polynomial
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!
Instructions Examiners: Dr. T. Creedon Answer any four questions. Mr. P. Anthony All questions carry equal marks. Prof. P. O’Donoghue
Q1. (a) Describe any two of the following methods for obtaining roots of an equation:
(i) Bisection
(ii) False-Position (iii)Newton (8 marks)
(b) Write a Fortran program for locating single roots using one of the methods in part (a).
(8 marks)
(c) Describe the Fixed-Point method for obtaining roots of an equation.
Show that if g and g 'are continuous in an interval about the root and | g '( ) | x < 1 for
all x in this interval and x 0 is chosen in this interval, then the Fixed-Point method will
converge to the root. (9 marks)
Q2. (a) Describe Gaussian Elimination for solving a system of linear equations.
(9 marks) (b) Outline the general structure of a program for solving systems of linear
equations using Gaussian Elimination. (8 marks) (c) Describe the main pitfalls in using Gaussian Elimination and list some
techniques for improving the solution. (8 marks)
Q3. (a) Describe Lagrange interpolation referring to a general formula for Pn ( x ).
(5 marks) (b) Given the data
Calculate (^) f (3.0)using a Lagrange interpolating polynomial of degree 3. (7 marks)
(c) Outline the general structure of a program for implementing Lagrange
interpolation. (5 marks)
(d) Given the data in the table below, approximate f (3)using a 3 rd^ degree Newton-
Gregory interpolating polynomial. Estimate the error in your approximation.
(8 marks)
Q4. (a) State the formula for Newton’s interpolating polynomial Pn ( x )of
(b) Given the data in the table below, approximate f (3)using a 3rd^ degree divided difference polynomial. Estimate the error in your approximation.
x f^ ( ) x 3.2 22. 2.7 17. 1.0 14. 4.8 38. 5.6 51.
(9 marks) (c) Outline the general structure of a program to implement Newton’s
interpolating polynomial. (8 marks)
x 3.2 2.7 1.0 4. f ( x ) 22.0 17.8 14.2 38.
x 1.0 2.1 4.2 5.1 6. f ( x ) 10.1 20.3 43.1 52.2 61.