Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00.

Slides:



Advertisements
Similar presentations
Numerical Solution of Linear Equations
Advertisements

Linear Systems of Equations
SOLVING SYSTEMS OF LINEAR EQUATIONS. Overview A matrix consists of a rectangular array of elements represented by a single symbol (example: [A]). An individual.
Rayan Alsemmeri Amseena Mansoor. LINEAR SYSTEMS Jacobi method is used to solve linear systems of the form Ax=b, where A is the square and invertible.
Special Matrices and Gauss-Siedel
Some useful linear algebra. Linearly independent vectors span(V): span of vector space V is all linear combinations of vectors v i, i.e.
1 Systems of Linear Equations Iterative Methods. 2 B. Iterative Methods 1.Jacobi method and Gauss Seidel 2.Relaxation method for iterative methods.
1 Systems of Linear Equations Iterative Methods. 2 B. Direct Methods 1.Jacobi method and Gauss Seidel 2.Relaxation method for iterative methods.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 19 Solution of Linear System of Equations - Iterative Methods.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 14 Elimination Methods.
Special Matrices and Gauss-Siedel
Systems of Non-Linear Equations
Iterative Methods for Solving Linear Systems of Equations ( part of the course given for the 2 nd grade at BGU, ME )
PETE 603 Lecture Session #28 Tuesday, 7/27/ Direct/Iterative Methods Iterative methods (systems of linear equations) –Computer time increases.
Arithmetic Operations on Matrices. 1. Definition of Matrix 2. Column, Row and Square Matrix 3. Addition and Subtraction of Matrices 4. Multiplying Row.
CE 311 K - Introduction to Computer Methods Daene C. McKinney
Using Matrices to Solve a System of Equations. Multiplicative Identity Matrix The product of a square matrix A and its identity matrix I, on the left.
Chapter 8 Objectives Understanding matrix notation.
Computer Engineering Majors Authors: Autar Kaw
ITERATIVE TECHNIQUES FOR SOLVING NON-LINEAR SYSTEMS (AND LINEAR SYSTEMS)
Engineering Analysis ENG 3420 Fall 2009
ECON 1150 Matrix Operations Special Matrices
1 Iterative Solution Methods Starts with an initial approximation for the solution vector (x 0 ) At each iteration updates the x vector by using the sytem.
Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00.
10/17/ Gauss-Siedel Method Industrial Engineering Majors Authors: Autar Kaw
Objectives Determine whether a matrix has an inverse.
1. Inverse of A 2. Inverse of a 2x2 Matrix 3. Matrix With No Inverse 4. Solving a Matrix Equation 1.
Chapter 3 Solution of Algebraic Equations 1 ChE 401: Computational Techniques for Chemical Engineers Fall 2009/2010 DRAFT SLIDES.
10/26/ Gauss-Siedel Method Civil Engineering Majors Authors: Autar Kaw Transforming.
Lecture 7 - Systems of Equations CVEN 302 June 17, 2002.
Chapter 5 MATRIX ALGEBRA: DETEMINANT, REVERSE, EIGENVALUES.
Elliptic PDEs and the Finite Difference Method
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 3- Chapter 12 Iterative Methods.
Linear Systems – Iterative methods
Circuits Theory Examples Newton-Raphson Method. Formula for one-dimensional case: Series of successive solutions: If the iteration process is converged,
Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00.
Part 3 Chapter 12 Iterative Methods
TH EDITION LIAL HORNSBY SCHNEIDER COLLEGE ALGEBRA.
GUIDED PRACTICE for Example – – 2 12 – 4 – 6 A = Use a graphing calculator to find the inverse of the matrix A. Check the result by showing.
2/26/ Gauss-Siedel Method Electrical Engineering Majors Authors: Autar Kaw
Linear Systems Numerical Methods. 2 Jacobi Iterative Method Choose an initial guess (i.e. all zeros) and Iterate until the equality is satisfied. No guarantee.
3/6/ Gauss-Siedel Method Major: All Engineering Majors Author: دکتر ابوالفضل رنجبر نوعی
3.8B Solving Systems using Matrix Equations and Inverses.
Algebra Review. Systems of Equations Review: Substitution Linear Combination 2 Methods to Solve:
Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00.
1 Gauss-Seidel Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis Applied Numerical Method for Engineers Chapter 11.
ROOTS OF EQUATIONS. Graphical Methods A simple method for obtaining the estimate of the root of the equation f(x)=0 is to make a plot of the function.
College Algebra Chapter 6 Matrices and Determinants and Applications
MTH108 Business Math I Lecture 20.
12-4: Matrix Methods for Square Systems
Iterative Solution Methods
Part 3 Chapter 12 Iterative Methods
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
ECE 3301 General Electrical Engineering
Numerical Analysis Lecture12.
Iterative Methods Good for sparse matrices Jacobi Iteration
Warm Up 3x + 5y = 25 4x + 7y = 34 Find the value of x and y so that both equations are true.
Some useful linear algebra
Metode Eliminasi Pertemuan – 4, 5, 6 Mata Kuliah : Analisis Numerik
Engineering Analysis ENG 3420 Fall 2009
Systems of Linear Equations in Engineering
Simultaneous Equations
Solving Systems of non-linear Equations
Numerical Analysis Lecture13.
6.5 Taylor Series Linearization
Matrices.
Engineering Analysis ENG 3420 Fall 2009
Matrices.
Numerical Analysis Lecture11.
Linear Algebra Lecture 16.
Presentation transcript:

Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00

22 Lecture 19 Last time: Midterm: solutions and discussions Today: Today  The inverse of a matrix  Iterative methods for solving sytems of linear equations Gauss-Siedel Jacobi Next Time  Relaxation  Non-linear systems

The inverse of a square If [A] is a square matrix, there is another matrix [A] -1, called the inverse of [A], for which [A][A] -1 =[A] -1 [A]=[I] The inverse can be computed in a column by column fashion by generating solutions with unit vectors as the right-hand-side constants:

Canonical base of an n-dimensional vector space 100…… …… ……000 ……………. 000…… …… …….001

The response of a linear system The response of a linear system to some stimuli can be found using the matrix inverse.

Gauss-Seidel Method The Gauss-Seidel method is the most commonly used iterative method for solving linear algebraic equations [A]{x}={b}. The method solves each equation in a system for a particular variable, and then uses that value in later equations to solve later variables. For a 3x3 system with nonzero elements along the diagonal, for example, the j th iteration values are found from the j-1 th iteration using:

Jacobi Iteration The Jacobi iteration is similar to the Gauss-Seidel method, except the j-1th information is used to update all variables in the jth iteration: a) Gauss-Seidel b) Jacobi

Convergence The convergence of an iterative method can be calculated by determining the relative percent change of each element in {x}. For example, for the i th element in the j th iteration, The method is ended when all elements have converged to a set tolerance.

Diagonal Dominance The Gauss-Seidel method may diverge, but if the system is diagonally dominant, it will definitely converge. Diagonal dominance means:

Relaxation To enhance convergence, an iterative program can introduce relaxation where the value at a particular iteration is made up of a combination of the old value and the newly calculated value: where is a weighting factor that is assigned a value between 0 and 2.  0< <1: underrelaxation  =1: no relaxation  1< ≤2: overrelaxation

Nonlinear Systems Nonlinear systems can also be solved using the same strategy as the Gauss-Seidel method - solve each system for one of the unknowns and update each unknown using information from the previous iteration. This is called successive substitution.

Newton-Raphson Nonlinear systems may also be solved using the Newton-Raphson method for multiple variables. For a two-variable system, the Taylor series approximation and resulting Newton-Raphson equations are: