- Type
- Midterm past paper
- Course
- MTH603 Numerical Analysis
- Size
- PDF 1.4 MB
- Updated
- 23 Oct 2026
You get 3 free files a day on the website. Add the Chrome extensionSign in with the extension for 30 a day.
Preview text
Text from pages 1, 2, 3 of 73. Download the file for all 73 pages.
FAQ updated version.(These must be read once because some very basic definition and question are being answered)
- Glossary updated version.(These must be read once because some very basic terms are being explained which you even might not found in the book) (Done)
Disclaimer: There might be some human errors, if you find please let me know at
pak.nchd , duplication of data may be possible but at least possible level.
----:Table of Content:----
Table of Content
FILE VERSION UPDATE: (DATED: 23-MAY-2011) ...................................................................................................................... 1
TABLE OF CONTENT ..................................................................................................................................................................... 2
ERROR ................................................................................................................................................................................. 7
Method of Iterations .......................................................................................................................................................... 14
Graeffe’s Root Square Method ........................................................................................................................................... 21 LINEAR EQUATIONS ..................................................................................................................................................................... 21 Gaussian Elimination Method............................................................................................................................................. 21 Guass-Jordan Elimination Method ...................................................................................................................................... 24 Jacobi’s Iterative Method ................................................................................................................................................... 25 Gauss-Seidel Iteration Method ........................................................................................................................................... 26
Matrix Inversion ................................................................................................................................................................. 29 EIGEN VALUE PROBLEMS .............................................................................................................................................................. 29 Power Method ................................................................................................................................................................... 29 Jacobi’s Method ................................................................................................................................................................. 32 INTERPOLATION .......................................................................................................................................................................... 36 Forward Differences ........................................................................................................................................................... 36 Backward Differences......................................................................................................................................................... 39 Divided Differences ............................................................................................................................................................ 41 By Newton’s Forward Difference Formula ........................................................................................................................... 45 b) By Lagrange’s Formula .................................................................................................................................................. 46 Langrange’s Interpolation .................................................................................................................................................. 47 Differentiation Using Difference Operators ......................................................................................................................... 47 NUMERICAL INTEGRATION ............................................................................................................................................................ 48 Trapezoidal Rule ................................................................................................................................................................ 48 Simpson’s 1/3 and 3/8 rules ............................................................................................................................................... 48
Taylor Series Method ......................................................................................................................................................... 48 Euler Method ..................................................................................................................................................................... 48 Runge-Kutta Method.......................................................................................................................................................... 48 Milne’s Predictor Corrector Method.................................................................................................................................... 48 Adam Moultan’s Predictor Corrector Method ..................................................................................................................... 48 FAQ UPDATED VERSION. ................................................................................................................................................ 48
QUESTION:
WHAT IS BRACKETING METHOD? ............................................................................................................ 48
QUESTION:
WHAT IS AN OPEN METHOD? ................................................................................................................... 48
QUESTION:
EXPLAIN MULLER’S METHOD BRIEFLY. ................................................................................................... 48
QUESTION:
EXPLAIN THE DIFFERENCE BETWEEN THE LINEAR AND NON-LINEAR EQUATIONS. ............................... 48 QUESTION: EXPLAIN WHICH VALUE IS TO BE CHOOSED AS X0 IN N-R METHOD. .................................................... 49
QUESTION:
DEFINE ITERATIVE METHOD OF SOLVING LINEAR EQUATIONS WITH TWO EXAMPLES. ......................... 49 QUESTION: DEFINE PIVOTING...................................................................................................................................... 49
QUESTION:
WRITE THE TWO STEPS OF SOLVING THE LINEAR EQUATIONS USING GAUSSIAN ELIMINATION METHOD.
QUESTION:
DESCRIBE GAUSS-JORDAN ELIMINATION METHOD BRIEFLY.................................................................. 49
QUESTION:
DESCRIBE BRIEFLY CROUT’S REDUCTION METHOD. .............................................................................. 49
QUESTION:
DESCRIBE BRIEFLY THE JACOBI’S METHOD OF SOLVING LINEAR EQUATIONS. .................................... 49 QUESTION: WHAT IS THE DIFFERENCE BETWEEN JACOBI’S METHOD AND GAUSS SEIDAL METHOD?................... 49 QUESTION: WHAT IS THE BASIC IDEA OF RELAXATION METHOD? ........................................................................... 49
QUESTION:
HOW THE FAST CONVERGENCE IN THE RELAXATION METHOD IS ACHIEVED? ...................................... 50 QUESTION: WHICH MATRIX WILL HAVE AN INVERSE? ............................................................................................... 50
QUESTION:
WHAT ARE THE POPULAR METHODS AVAILABLE FOR FINDING THE INVERSE OF A MATRIX? .............. 50 QUESTION: EXPLAIN GAUSSIAN ELIMINATION METHOD FOR FINDING THE INVERSE OF A MATRIX. ...................... 50 QUESTION:
QUESTION:
WHAT IS THE METHOD FOR FINDING THE EIGEN VALUE OF THE LEAST MAGNITUDE OF THE MATRIX
[A]?
QUESTION:
WHAT IS INTERPOLATION? ....................................................................................................................... 50
QUESTION:
WHAT IS EXTRAPOLATION? ...................................................................................................................... 50
QUESTION:
WHAT HAPPENS WHEN SHIFT OPERATOR E OPERATES ON THE FUNCTION. .......................................... 50 QUESTION: WHAT IS THE BASIC CONDITION FOR THE DATA TO APPLY NEWTON’S INTERPOLATION METHODS? .. 50 QUESTION: WHEN IS THE NEWTON’S FORWARD DIFFERENCE INTERPOLATION FORMULA USED? .......................... 51 QUESTION: WHEN IS THE NEWTON’S FORWARD DIFFERENCE INTERPOLATION FORMULA USED? .......................... 51 QUESTION: WHEN THE NEWTON’S BACKWARD DIFFERENCE INTERPOLATION FORMULA IS USED?........................ 51 QUESTION:
IF THE VALUES OF THE INDEPENDENT VARIABLE ARE NOT EQUALLY SPACED THEN WHICH FORMULA
SHOULD BE USED FOR INTERPOLATION? ........................................................................................................................... 51
QUESTION:
TO USE NEWTON’S DIVIDED DIFFERENCE INTERPOLATION FORMULA, WHAT SHOULD THE VALUES OF
INDEPENDENT VARIABLES BE? ........................................................................................................................................... 51
QUESTION:
WHICH DIFFERENCE FORMULA IS SYMMETRIC FUNCTION OF ITS ARGUMENTS? .................................. 51 QUESTION:
IS THE INTERPOLATING POLYNOMIAL FOUND BY LAGRANGE’S AND NEWTON’S DIVIDED DIFFERENCE
FORMULAE IS SAME? ........................................................................................................................................................... 51
QUESTION:
WHICH FORMULA INVOLVES LESS NUMBER OF ARITHMETIC OPERATIONS? NEWTON OR LAGRANGE’S? 51
QUESTION:
WHEN DO WE NEED NUMERICAL METHODS FOR DIFFERENTIATION AND INTEGRATION? ................... 51 QUESTION: IF THE VALUE OF THE INDEPENDENT VARIABLE AT WHICH THE DERIVATIVE IS TO BE FOUND APPEARS AT THE BEGINNING OF THE TABLE OF VALUES, THEN WHICH FORMULA SHOULD BE USED? ......................................... 52 QUESTION: WHY WE NEED TO USE RICHARDSON’S EXTRAPOLATION METHOD? ..................................... 52
QUESTION:
TO APPLY SIMPSON’S 1/3 RULE, WHAT SHOULD THE NUMBER OF INTERVALS BE? ............................ 52 QUESTION: TO APPLY SIMPSON’S 3/8 RULE, WHAT SHOULD THE NUMBER OF INTERVALS BE? ............................ 52 QUESTION:
Related MTH603 files
All MTH603 files →- MTH603 Midterm Past Papers by Junaid Midterm PDF 1.9 MB
- MTH603 Midterm Past Paper Midterm DOCX 245 KB
- MTH603 Midterm Current Paper 2022 Midterm PDF 119 KB
- MTH603 Midterm Quiz Preparation Fall 2021 by Sir Afzal Midterm PDF 8.5 MB
- MTH603 Official Handouts Official handout PDF 8.8 MB Free
- MTH603 Quiz 1 Solution by Nabeela Wali Quiz DOCX 95 KB
Get more out of VUBuddy, for free
- Unlimited downloads
- The explanation behind every MCQ answer
- Study offline on slow data
- 30 downloads a day instead of 3
- Sign in and buy Pro Semester here
One Pro Semester membership works in both the extension and the app.