Solution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method

Similar documents
Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

1 GSW Iterative Techniques for y = Ax

Summary with Examples for Root finding Methods -Bisection -Newton Raphson -Secant

Difference Equations

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES

Relaxation Methods for Iterative Solution to Linear Systems of Equations

A new Approach for Solving Linear Ordinary Differential Equations

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b

A MODIFIED METHOD FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

Lecture 21: Numerical methods for pricing American type derivatives

MAE140 - Linear Circuits - Fall 13 Midterm, October 31

Chapter 12. Ordinary Differential Equation Boundary Value (BV) Problems

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

Vector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

PHYS 705: Classical Mechanics. Calculus of Variations II

THE VIBRATIONS OF MOLECULES II THE CARBON DIOXIDE MOLECULE Student Instructions

1 Matrix representations of canonical matrices

ME 501A Seminar in Engineering Analysis Page 1

y i x P vap 10 A T SOLUTION TO HOMEWORK #7 #Problem

Inexact Newton Methods for Inverse Eigenvalue Problems

36.1 Why is it important to be able to find roots to systems of equations? Up to this point, we have discussed how to find the solution to

A Hybrid Variational Iteration Method for Blasius Equation

Chapter Newton s Method

2.3 Nilpotent endomorphisms

Complex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)

6.3.7 Example with Runga Kutta 4 th order method

Modelli Clamfim Equazione del Calore Lezione ottobre 2014

OPTIMISATION. Introduction Single Variable Unconstrained Optimisation Multivariable Unconstrained Optimisation Linear Programming

SUMMARY OF STOICHIOMETRIC RELATIONS AND MEASURE OF REACTIONS' PROGRESS AND COMPOSITION FOR MULTIPLE REACTIONS

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13

The Fundamental Theorem of Algebra. Objective To use the Fundamental Theorem of Algebra to solve polynomial equations with complex solutions

An Algorithm to Solve the Inverse Kinematics Problem of a Robotic Manipulator Based on Rotation Vectors

INDETERMINATE STRUCTURES METHOD OF CONSISTENT DEFORMATIONS (FORCE METHOD)

PHYS 705: Classical Mechanics. Hamilton-Jacobi Equation

Erratum: A Generalized Path Integral Control Approach to Reinforcement Learning

15-381: Artificial Intelligence. Regression and cross validation

Lecture Notes on Linear Regression

12. The Hamilton-Jacobi Equation Michael Fowler

for Linear Systems With Strictly Diagonally Dominant Matrix

Errors for Linear Systems

Iterative General Dynamic Model for Serial-Link Manipulators

One-sided finite-difference approximations suitable for use with Richardson extrapolation

Be true to your work, your word, and your friend.

ELE B7 Power Systems Engineering. Power Flow- Introduction

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis

Analytical Chemistry Calibration Curve Handout

Grid Generation around a Cylinder by Complex Potential Functions

Lecture 2 Solution of Nonlinear Equations ( Root Finding Problems )

Chapter 3 Differentiation and Integration

1. Statement of the problem

PHYS 705: Classical Mechanics. Canonical Transformation II

Module 9. Lecture 6. Duality in Assignment Problems

2 Finite difference basics

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

Formulas for the Determinant

MAE140 - Linear Circuits - Fall 10 Midterm, October 28

APPENDIX 2 FITTING A STRAIGHT LINE TO OBSERVATIONS

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

Physics 4B. A positive value is obtained, so the current is counterclockwise around the circuit.

( ) [ ( k) ( k) ( x) ( ) ( ) ( ) [ ] ξ [ ] [ ] [ ] ( )( ) i ( ) ( )( ) 2! ( ) = ( ) 3 Interpolation. Polynomial Approximation.

Structure and Drive Paul A. Jensen Copyright July 20, 2003

CHAPTER 4d. ROOTS OF EQUATIONS

( ) 1/ 2. ( P SO2 )( P O2 ) 1/ 2.

Applied Stochastic Processes

Improvement in Estimating the Population Mean Using Exponential Estimator in Simple Random Sampling

Common loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule:

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

CHAPTER 7 CONSTRAINED OPTIMIZATION 2: SQP AND GRG

Unit 5: Quadratic Equations & Functions

Homework Notes Week 7

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:

: Numerical Analysis Topic 2: Solution of Nonlinear Equations Lectures 5-11:

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

International Mathematical Olympiad. Preliminary Selection Contest 2012 Hong Kong. Outline of Solutions

WINTER 2017 EXAMINATION

= z 20 z n. (k 20) + 4 z k = 4

Physics 114 Exam 2 Fall 2014 Solutions. Name:

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

LECTURE 9 CANONICAL CORRELATION ANALYSIS

Anouncements. Multigrid Solvers. Multigrid Solvers. Multigrid Solvers. Multigrid Solvers. Multigrid Solvers

Formal solvers of the RT equation

Assignment 4 Solutions

Foundations of Arithmetic

Suggested solutions for the exam in SF2863 Systems Engineering. June 12,

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

and problem sheet 2

Physics 443, Solutions to PS 7

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

What is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.

A PROCEDURE FOR SIMULATING THE NONLINEAR CONDUCTION HEAT TRANSFER IN A BODY WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY.

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

Publication 2006/01. Transport Equations in Incompressible. Lars Davidson

Finite Difference Method

Section 8.3 Polar Form of Complex Numbers

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

FE REVIEW OPERATIONAL AMPLIFIERS (OP-AMPS)( ) 8/25/2010

Transcription:

Soluton of Lnear System of Equatons and Matr Inverson Gauss Sedel Iteraton Method It s another well-known teratve method for solvng a system of lnear equatons of the form a + a22 + + ann = b a2 + a222 + + a2nn = b 2 an + an22+ + annn = b n In Jacob s method, the (r + )th appromaton to the above system s gven by Equatons ) b a2 ( r) a n ( r) = 2 n a a a ) b2 a2 ( r) a2n ( r) 2 = n a22 a22 a 22 a ) bn an ( r) nn ( ) ( r) n = n ann ann a nn ( r ) Here we can observe that no element of + ( ) replaces r entrely for the net cycle of computaton. ( r ) In Gauss-Sedel method, the correspondng elements of + replaces those of ( r ) as soon as they become avalable. Hence, t s called the method of successve dsplacements. For llustraton consder a + a22 + + ann = b a2 + a222 + + a2nn = b 2 an + an22+ + annn = b n In Gauss-Sedel teraton, the (r + )th appromaton or teraton s computed from: ) b a2 ( r) a n ( r) = 2 n a a a ) b2 a2 ) a2n ( r) 2 = n a22 a22 a 22 a ) bn an ) nn ( ) ) n = n ann ann a nn Thus, the general procedure can be wrtten n the followng compact form Copyrght Vrtual Unversty of Pakstan

b a a n ) j ) j ( r) = j j a j= a j= + a for all,2,..., = n and r =, 2,... To descrbe system n the frst equaton, we substtute the r-th appromaton nto the rght-hand sde and denote the result by ( r + ). In the second equaton, we substtute ) ( r) ( r) ( r ) (,,..., n ) and denote the result by + 2 ) ) ( r) ( r) In the thrd equaton, we substtute (, 2, 4,..., n ) and denote the result by ( r ) +, and so on. Ths process s contnued tll we arrve at the desred result. For llustraton, we consder the followng eample : Note The dfference between jacob s method and gauss Sedel method s that n jacob s method the appromaton calculated are used n the net teraton for net appromaton but n Gauss-sedel method the new appromaton calculated s nstantly replaced by the prevous one. Eample Fnd the soluton of the followng system of equatons usng Gauss-Sedel method and perform the frst fve teratons: 4 2 = 2 + 42 4 = 2 + 4 4 = + 4 = 2 4 Soluton The gven system of equatons can be rewrtten as = 0.5 + 0.252 + 0.25 2 = 0.5 + 0.25+ 0.25 4 = 0.25 + 0.25+ 0.254 4 = 0.25 + 0.252 + 0.25 Takng 2 = = 4 = 0 on the rght-hand sde of the frst equaton of the system, we get () = 0.5. Takng = 4 = 0 and the current value of, we get from the 2nd equaton of the system () 2 = 0.5 + (0.25)(0.5) + 0 = 0.625 Further, we take 4 = 0 and the current value of the system we obtan from the thrd equaton of () = + + 0.25 (0.25)(0.5) 0 = 0.75 Copyrght Vrtual Unversty of Pakstan 2

Now, usng the current values of 2 and the fourth equaton of system gves () 4 = 0.25 + (0.25)(0.625) + (0.25)(0.75) = 0.5 The Gauss-Sedel teratons for the gven set of equatons can be wrtten as ) ( r) ( r) = 0.5 + 0.252 + 0.25 ) ) ( r) 2 = 0.5 + 0.25 + 0.254 ) ) ( r) = 0.25 + 0.25 + 0.254 ) ) ) 4 = 0.25 + 0.252 + 0.25 Now, by Gauss-Sedel procedure, the 2nd and subsequent appromatons can be obtaned and the sequence of the frst fve appromatons are tabulated as below: Varables Iteraton number r 2 4 0.5 0.625 0.75 0.5 2 0.75 0.825 0.5625 0.5975 0.8475 0.8598 0.6098 0.679 4 0.8679 0.870 0.620 0.6205 5 0.8705 0.87402 0.62402 0.6245 Eample Solve the system by Gauss-Sedel teratve method 8 y+ 2z = 20 4+ y z = 6+ y+ 2z (Perform only four teratons) Soluton Consder the gven system as Copyrght Vrtual Unversty of Pakstan

8 y+ 2z = 20 4+ y z = 6+ y+ 2z the system s dagonally do mn ant = [ 20 + y 2 z] 8 y = [ 4 + z] z = [ 5 6 y] 2 we start wth an ntal apromaton = y = z = 0 0 0 0 substtutng these frst teraton = [ 20 + (0) 2(0) ] = 2.5 8 y = [ 4(2.5) + 0 ] = 2.090909 z = [ 5 6(2.5) (2.090909) ] =.4994 2 Second teraton 2 = [ 20 + y z] = [ 20 + (2.090909) 2(.4994) ] = 2.99806 8 8 y2 = [ 42 + z] = [ 4(2.99806) +.4994] = 2.0774 z2 = [ 5 62 y2] = [ 5 6(2.99806) (2.0774) ] = 0.9470 2 2 thrd teraton = [ 20 + (2.0774) 2(0.9470) ] =.02662 8 y = [ 4(.02662) + 0.9470 ] =.98256 z = [ 5 6(.02662) (.98256) ] = 0.9077262 2 Copyrght Vrtual Unversty of Pakstan 4

fourth teraton 4 = [ 20 + (.98256) 2(0.9077262) ] =.0652 8 y4 = [ 4(.0652) + 0.9077262 ] =.985607 z4 = [ 5 6(.0652) (.985607) ] = 0.89 2 Eample Solve the system by sung Gauss-sedel teraton method + 4y z = 2 + y+ 0z = 24 2+ 7y+ 4z Soluton + 4y z = 2 + y+ 0z = 24 2+ 7y+ 4z the gven system s dagonally do mn ant so we wll make t dagonaaly do mn ant by terchanagnhg the equatons + 4y z = 2 2+ 7y+ 4z + y+ 0z = 24 hence we can apply Gauss Sedel method from the above equatons = [2 4 y+ z ] y = [5 2 4 z ] 7 z = [24 y ] 0 Copyrght Vrtual Unversty of Pakstan 5

Frst appromaton puttng y = z = 0 = [2] =.457 putng =.457, z = 0 y = [5 2(.457) 4(0)] =.924697 7 puttng =.457, y =.924697 z = [24.457 (.924697)] =.708404 0 Second teraton 2 = [2 4(.924697) +.708404] = 0.9965 y2 = [5 2(0.9965) 4(.708404)] =.5475567 7 z2 = [24 0.9965 (.5475567)] =.840868 0 thrd teraton = [2 4(.5475567) +.8468] = 0.98759 2 y = [5 2(0.987592) 4(.8468)] =.5090274 7 z = [24 0.987592 (.5090274)] =.848525 0 fourth teraton 4 = [2 4(.5090274) +.848525] = 0.99008 y4 = [5 2(0.99008) 4(.8468)] =.507058 7 z 4 = [24 0.99008 (.507058)] =.8485652 0 Eample Usng Gauss-Sedel teraton method, solve the system of the equaton. 0 2y z w= 2+ 0y z w= 5 y+ 0z 2w= 27 y 2z+ 0w= 9 Copyrght Vrtual Unversty of Pakstan 6

(Perform only four teratons) Soluton 0 2y z w= 2+ 0y z w= 5 y+ 0z 2w= 27 y 2z+ 0w= 9 t s dagonally do mn anat and we may wrte eqauton as = [ + 2 y+ z+ w ] 0 y = [5 + 2 + z+ w ] 0 z = [27 + + y+ 2 w ] 0 w= [ 9 + + y+ 2 z ] 0 frst appromaton puttng y = z = w = 0 on RHS of (), we get = 0. y = [5 + 2(0.)] =.56 0 puttng = 0., y =.56 and w = 0 z = [27 + 0. +.56] = 2.886 0 puttng = 0., y =.56 and z = 2.886 w = [ 9 + 0. +.56 + 2(2.886)] = 0.68 0 second teraton 2 = [ + 2(.56) + 2.886 0.68] = 0.88692 0 y2 = [5 + 2(0.88692) + 2.886 0.68] =.95204 0 z2 = [27 + 0.88692 +.95204 + 2( 0.68)] = 2.9565624 0 w2 = [ 9 + 0.88692 +.95204 + 2(2.9565624)] = 0.024765 0 thrd teraton = [+ 2(.95204) + 2.9565624 0.0.024765] = 0.986405 0 Copyrght Vrtual Unversty of Pakstan 7

y = [5 + 2(0.986405) + 2.9565624 0.024765] =.9899087 0 z = [27 + 0.986405 +.9899087 + 2( 0.024765)] = 2.992409 0 w = [ 9 + 0.98405 +.9899087 + 2(2.992409)] = 0.004647 0 fourth teraton 4 = [ + 2(.9899087) + 2.992409 0.004647] = 0.9968054 0 y4 = [5 + 2(0.9968054) + 2.992409 0.004647] =.998848 0 z4 = [27 + 0.9968054 +.998848 + 2( 0.004647)] = 2.998666 0 w4 = [ 9 + 0.9968054 +.998848 + 2(2.998666)] = 0.0007677 0 Note When to stop the teratve processes,we stop the teratve process when we get the requred accuracy means f your are asked that fnd the accurate up to four places of decmal then we wll smply perform up to that teraton after whch we wll get the requred accuracy. If we calculate the root of the equaton and ts consecutve values are.8952625,.966625,.995625,.992655,.992745,.9927 Here the accuracy up to seven places of decmal s acheved so f you are asked to acqure the accuracy up to s places of decmal then we wll stop here. But n the solved eamples only some teraton are carred out and accuracy s not consdered here. Copyrght Vrtual Unversty of Pakstan 8