Scribd
Upload
136 views3 pages

ENGR391 Final

This document appears to be for a final exam in numerical methods for engineers. It contains 4 problems assessing skills in [1] solving nonlinear equations, [2] solving systems of linear equations, [3] numerical integration, and [4] solving ordinary differential equations. Students are asked to practice applying numerical techniques like the secant method, LU decomposition, Simpson's rule, and Runge-Kutta integration to sample problems. They are also questioned on relevant numerical analysis concepts and methods.

Uploaded by

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

ENGR391 Final

This document appears to be for a final exam in numerical methods for engineers. It contains 4 problems assessing skills in [1] solving nonlinear equations, [2] solving systems of linear equations, [3] numerical integration, and [4] solving ordinary differential equations. Students are asked to practice applying numerical techniques like the secant method, LU decomposition, Simpson's rule, and Runge-Kutta integration to sample problems. They are also questioned on relevant numerical analysis concepts and methods.

Uploaded by

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

ENGR 391 FINAL EXAM

FACULTY OF ENGINEERING AND COMPUTER SCIENCE


DEPARTMENT OF MECHANICAL ENGINEERING

ENGR-391 NUMERICAL METHODS FOR ENGINEERS

Student’s Name:

I.D.:

Duration 3 hours

PROBLEM 1 [Solving Nonlinear Equations] [20 marks]

1. Practice

Solve the following nonlinear equation using the secant method with x0=0.5 and x1=0.4:

f ( x )  8 sin  x  e  x  1

Use 3 iterations. Check your result and discuss.

2. Theory

- Discuss the difference between bracketing and open methods for root location
- Sketch the bisection and the Newton-Raphson method.

PROBLEM 2 [Solving Systems of Linear Equations] [40 marks]

1. Practice

Solve the following system of linear equations:

8x  4 y  z  11

 2 x  5 y  z  4
2 x  y  6 z  7

1
ENGR 391 FINAL EXAM

a- Using LU decomposition
b- Using Gauss-Seidel method (3 iterations), choose as initial guesses: y=z=0
c- Check your results
d- Compare the two methods

2. Theory

- Show graphically an example of an ill conditioned system


- What is a lower-diagonal matrix?
- When two rows are interchanged in [A], then the determinant of the new matrix is
the same as det[A]?
True / I really do not know / False

PROBLEM 3 [Numerical Integration] [20 marks]

1. Practice

Compute the following integral:

3
I   x 2e x dx
0

Using multi-segment Simpson’s (1/3) rule with four segments (n=4).

2. Theory

- In general, for the same number of segments, Simpson’s rule is less accurate than
the trapezoidal rule?
True / I really do not know / False
- Explain shortly what is the idea behind the Gauss-Quadrature formulas.
- Improper integrals (integrals with at least one limit equal to infinity) can not be
computed with numerical algorithms.
True / I really do not know / False
- To increase the accuracy of the computation of an integral using a quadrature
formula, one has normally to reduce the step-size (increase the number of
segments for a multi-segment version of the quadrature formula). What do you
think about the following statement:
The accuracy of my result is only limited by the computation time, i.e, with a
computer; you will be able to increase the number of segments and to more
accurately predict the value of the integral?
True / I really do not know / False
Explain why (even for I really do not know)?

2
ENGR 391 FINAL EXAM
PROBLEM 4 [Solving Ordinary Differential Equations] [20 marks]

1. Practice

Solve the following ODE:

dy
 yx 2  y y  0  1
dx

Using Runge-Kutta second order method (with Heun’s method), for 0  x  1 and a step
of 0.25.

2. Theory

- Euler’s method can be considered as the first order Runge-Kutta method?


True / I really do not know / False
- What is the difference between a boundary-value problem and an initial- value
problem?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy