Lecture9 - Engineering Analysis ENG 3420 Fall 2009 Dan C....

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 2 Lecture 9 Lecture 9 Last time: Approximations Finding the roots of the equation f(x)=0 Structured programming File creation and file access Relational operators Project1 Today: Bracketing vs Open Methods for finding the roots of the equation f(x) = 0 ; Convergence vs Divergence Open methods for finding the roots of the equation f(x) = 0 Simple Fixed-Point Iteration Newton-Raphson Secant Next Time Optimization
Background image of page 2
3 Numerical methods Direct methods attempt to solve a numerical problem by a finite sequence of operations. In absence of round off errors deliver an exact solution ; e.g., solving a linear system Ax = b by Gaussian elimination. Iterative methods attempt to solve a numerical problem (for example, finding the root of an equation or system of equations) by finding successive approximations to the solution starting from an initial guess. The stopping criteria: the relative error is smaller than a pre-specified value. When used The only alternative for non-linear systems of equations; Often useful even for linear problems involving a large number of variables where direct methods would be prohibitively expensive or impossible. Convergence of a numerical methods if successive approximations lead to increasingly smaller relative error. Opposite to divergent. ε a = x i + 1 - x i x i + 1 100%
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 Iterative methods for finding the roots Bracketing methods Open methods : require only a single starting value or two starting values that do not necessarily bracket a root. may diverge as the computation progresses, but when they do converge, they usually do so much faster than bracketing methods.
Background image of page 4
Bracketing vs Open; Convergence vs Divergence a) Bracketing method start with an interval. Open method
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/17/2012 for the course EGN 3420 taught by Professor Staff during the Spring '08 term at University of Central Florida.

Page1 / 15

Lecture9 - Engineering Analysis ENG 3420 Fall 2009 Dan C....

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online