SOLUTION OF SYSTEM OF LINEAR EQUATIONS. Lecture 4: (a) Jacobi's method. method (general). (b) Gauss Seidel method.

Similar documents
Numerical Methods (CENG 2002) CHAPTER -III LINEAR ALGEBRAIC EQUATIONS. In this chapter, we will deal with the case of determining the values of x 1

Autar Kaw Benjamin Rigsby. Transforming Numerical Methods Education for STEM Undergraduates

Solving Systems of Equations

Chapter System of Equations

Taylor Polynomials. The Tangent Line. (a, f (a)) and has the same slope as the curve y = f (x) at that point. It is the best

Fast Fourier Transform 1) Legendre s Interpolation 2) Vandermonde Matrix 3) Roots of Unity 4) Polynomial Evaluation

PROGRESSIONS AND SERIES

Lesson 4 Linear Algebra

=> PARALLEL INTERCONNECTION. Basic Properties LTI Systems. The Commutative Property. Convolution. The Commutative Property. The Distributive Property

INFINITE SERIES. ,... having infinite number of terms is called infinite sequence and its indicated sum, i.e., a 1

Linear Programming. Preliminaries

10.5 Power Series. In this section, we are going to start talking about power series. A power series is a series of the form

SUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11

Variational Iteration Method for Solving Volterra and Fredholm Integral Equations of the Second Kind

Numerical Solutions of Fredholm Integral Equations Using Bernstein Polynomials

A GENERAL METHOD FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS: THE FROBENIUS (OR SERIES) METHOD

Sequence and Series of Functions

Statistics for Financial Engineering Session 1: Linear Algebra Review March 18 th, 2006

Interpolation. 1. What is interpolation?

f(bx) dx = f dx = dx l dx f(0) log b x a + l log b a 2ɛ log b a.

Vectors. Vectors in Plane ( 2

MATRIX ALGEBRA, Systems Linear Equations

APPLICATION OF DIFFERENCE EQUATIONS TO CERTAIN TRIDIAGONAL MATRICES

F x = 2x λy 2 z 3 = 0 (1) F y = 2y λ2xyz 3 = 0 (2) F z = 2z λ3xy 2 z 2 = 0 (3) F λ = (xy 2 z 3 2) = 0. (4) 2z 3xy 2 z 2. 2x y 2 z 3 = 2y 2xyz 3 = ) 2

Solution of the exam in TMA4212 Monday 23rd May 2013 Time: 9:00 13:00

UNISA NUMERICAL METHODS (COS 233-8) Solutions to October 2000 Final Exams

Lecture 4 Recursive Algorithm Analysis. Merge Sort Solving Recurrences The Master Theorem

Section 7.3, Systems of Linear Algebraic Equations; Linear Independence, Eigenvalues, Eigenvectors (the variable vector of the system) and

Discrete Mathematics I Tutorial 12

DETERMINANT. = 0. The expression a 1. is called a determinant of the second order, and is denoted by : y + c 1

Attempt any TEN of the following:

SUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11

A GENERALIZATION OF GAUSS THEOREM ON QUADRATIC FORMS

lecture 16: Introduction to Least Squares Approximation

is an ordered list of numbers. Each number in a sequence is a term of a sequence. n-1 term

SOLUTION OF DIFFERENTIAL EQUATION FOR THE EULER-BERNOULLI BEAM

Limit of a function:

The Islamic University of Gaza Faculty of Engineering Civil Engineering Department. Numerical Analysis ECIV Chapter 11

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures

Linear Algebra. Lecture 1 September 19, 2011

Graphing Review Part 3: Polynomials

Advanced Algorithmic Problem Solving Le 6 Math and Search

Elementary Linear Algebra

 n. A Very Interesting Example + + = d. + x3. + 5x4. math 131 power series, part ii 7. One of the first power series we examined was. 2!

We will begin by supplying the proof to (a).

Chapter 7 Infinite Series

GRAPHING LINEAR EQUATIONS. Linear Equations. x l ( 3,1 ) _x-axis. Origin ( 0, 0 ) Slope = change in y change in x. Equation for l 1.

ALGEBRA. Set of Equations. have no solution 1 b1. Dependent system has infinitely many solutions

Week 13 Notes: 1) Riemann Sum. Aim: Compute Area Under a Graph. Suppose we want to find out the area of a graph, like the one on the right:

Handout #2. Introduction to Matrix: Matrix operations & Geometric meaning

Unit 1. Extending the Number System. 2 Jordan School District

Northwest High School s Algebra 2

Definite Integral. The Left and Right Sums

[ 20 ] 1. Inequality exists only between two real numbers (not complex numbers). 2. If a be any real number then one and only one of there hold.

ECE 102 Engineering Computation

Section 6.3: Geometric Sequences

[Q. Booklet Number]

0 otherwise. sin( nx)sin( kx) 0 otherwise. cos( nx) sin( kx) dx 0 for all integers n, k.

Notes 17 Sturm-Liouville Theory

Crushed Notes on MATH132: Calculus

2. Infinite Series 3. Power Series 4. Taylor Series 5. Review Questions and Exercises 6. Sequences and Series with Maple

Basic Maths. Fiorella Sgallari University of Bologna, Italy Faculty of Engineering Department of Mathematics - CIRAM

Numbers (Part I) -- Solutions

Lesson-2 PROGRESSIONS AND SERIES

Homework 2 solutions

Titus Beu University Babes-Bolyai Department of Theoretical and Computational Physics Cluj-Napoca, Romania

1. (25 points) Use the limit definition of the definite integral and the sum formulas to compute. [1 x + x2

Frequency-domain Characteristics of Discrete-time LTI Systems

Numerical Integration

Review of Sections

Approximate Integration

9.5. Alternating series. Absolute convergence and conditional convergence

Some New Iterative Methods Based on Composite Trapezoidal Rule for Solving Nonlinear Equations

REVISION SHEET FP1 (AQA) ALGEBRA. E.g., if 2x

M3P14 EXAMPLE SHEET 1 SOLUTIONS


The total number of permutations of S is n!. We denote the set of all permutations of S by

MA123, Chapter 9: Computing some integrals (pp )

Merge Sort. Outline and Reading. Divide-and-Conquer. Divide-and-conquer paradigm ( 4.1.1) Merge-sort ( 4.1.1)

Options: Calculus. O C.1 PG #2, 3b, 4, 5ace O C.2 PG.24 #1 O D PG.28 #2, 3, 4, 5, 7 O E PG #1, 3, 4, 5 O F PG.

10. 3 The Integral and Comparison Test, Estimating Sums

Chapter 2 Infinite Series Page 1 of 9

Eigenfunction Expansion. For a given function on the internal a x b the eigenfunction expansion of f(x):

ALGEBRA II CHAPTER 7 NOTES. Name

Chapter 10: The Z-Transform Adapted from: Lecture notes from MIT, Binghamton University Dr. Hamid R. Rabiee Fall 2013

BC Calculus Review Sheet

The Exponential Function

INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)

Chapter 25 Sturm-Liouville problem (II)

Lecture 4 Recursive Algorithm Analysis. Merge Sort Solving Recurrences The Master Theorem

1 Tangent Line Problem

EXERCISE a a a 5. + a 15 NEETIIT.COM

Remarks: (a) The Dirac delta is the function zero on the domain R {0}.

MATH 118 HW 7 KELLY DOUGAN, ANDREW KOMAR, MARIA SIMBIRSKY, BRANDEN LASKE

ELG4156 Design of State Variable Feedback Systems

Simpson s 1/3 rd Rule of Integration

In an algebraic expression of the form (1), like terms are terms with the same power of the variables (in this case

the midpoint of the ith subinterval, and n is even for

Math1242 Project I (TI 84) Name:

Geometric Sequences. Geometric Sequence. Geometric sequences have a common ratio.

Transcription:

SOLUTION OF SYSTEM OF LINEAR EQUATIONS Lecture 4: () Jcobi's method. method (geerl). (b) Guss Seidel method.

Jcobi s Method: Crl Gustv Jcob Jcobi (804-85) gve idirect method for fidig the solutio of system of lier equtios, which is bsed o the successive better pproimtios of the vlues of the ukows, usig itertive procedure. The sufficiet coditio for the covergece of Guss Jcobi method to solve A b is tht the coefficiet mtri A is strictly digolly row domit, tht is, if A, the ii j ji ij It should be oted tht this method mkes two ssumptios. First, the system of lier equtios to be solved, must hve uique solutio d secod, there should ot be y zeros o the mi digol of the coefficiet mtri A. I cse, there eist zeros o its mi digol, the rows must be iterchged to obti coefficiet mtri tht does ot hve zero etries o the mi digol. Cosider system of lier equtios i ukows, which re strictly digolly row domit, s follows:... b,... b,...... b, Sice the system is strictly digolly row domit, 0. ii

Therefore, the system of equtios is rewritte s b 0...., b 0....,... b,... 0. We the cosider rbitrry iitil guess of the solutio s 0 0 0,,...,, which re row substituted to the right hd side of the rewritte equtios to obti the first pproimtio s b... 0 0 0 0 3 3 b... 0 0 0 0 3 3, b... 0 0 0, This process is repeted by substitutig the first pproimte solutio,,, to the r.h.s of the rewritte equtios. By repeted itertio, we get the required solutio up to the desired level of the ccurcy.

Emple 6. Solve the system of lier equtios by Jcobi s method. 4 9 3 8 3 0 3 4 33 3 Solutio: The give system of equtios is ot digolly row domit s 3. Therefore, we re-rrge the system s 8 3 0 3 4 33 3 4 9 3 Here, 8 3, 4 d 4. Thus, the system is digolly row domit. We ow re-write the system s 0 3 8 33 4 3 9 4 3 3 Let the iitil guess be the solutio is give by 3 0 0 0,, 0.The, the first pproimtio to 3 (0 3 0).875 8 33 4 0.636 9.75 4

Secod pproimtio 3 3 0 3.636.75 3.05 8 33 4.875.75.4 9.875.636 0.87 4 Third pproimtio 3 3 3 3 3.075.969 0.959 Fourth pproimtio 4 4 4 3.999.969 0.989 Fifth pproimtio 5 3 5 5.99.999.008 Sith pproimtio 6.997 6.004 6 3.00 Therefore, 3.0,.0 d 3.0, correct to two sigifict figures.

Guss Seidel Method Guss Seidel itertio method for solvig system of -lier equtios i - ukows is modified Jcobi s method. Therefore, ll the coditios tht is true for Jcobi s method, lso holds for Guss Seidel method. As before, the system of lier equtios re rewritte s If b 0...., b 0....,... b 0 0 0,... 0.,,..., be the iitil guess of the solutio, which is rbitrry, the the first pproimtio to the solutio is obtied s b... 0 0 0 0 3 3, b... 0 0 0 3 3, b... 0 0 0 3 3 3 34 4 3, 3...... b, () Plese ote, while clcultig, the vlue of () is replced by, ot by (0).. This is the bsic differece of Guss Seidel with Jocobi s method.

The successive itertio s re geerted by the scheme clled itertio formule of Guss-Seidel method, which is s follows: b... 3 3 b... 3 3... b...,,,, b..., The umber of itertios required depeds upo the desired degree of ccurcy.

Emple 6. Solve the system of lier equtios by Guss Seidel method. 4 9 3 8 3 0 3 4 33 3 Solutio: The give system of equtios is ot digolly row domit s 3. Therefore, we re-rrge the system s 8 3 0 3 4 33 3 4 9 3 Here, 8 3, 4 d 4. Thus, the system is digolly row domit. We ow re-write the system s 0 3 3 8 33 4 3 3 9 4 0 0 0 Let the iitil guess be,, 3 0. The, the first pproimtio to the solutio is give by 0 3 0.875 8 0 33 4 3 33 4.875 0.955 3 9 9.875.955.043 4 4

d pproimtio 0 3 3 0 3.955.043.97 8 8 3 33 4 33 4.97.043.04 3 9 3 9.97.04.004 4 4 3 rd pproimtio 3 0 3 3 0 3.04.004 3.004 8 8 3 3 33 4 3 33 4 3.004.004.999 3 3 3 3 9 9 3.004.999 0.999 4 4 4 th pproimtio 4 4 4 3 3.00.00.00 Therefore, 3.0,.0 d 3.0, correct to two sigifict figure.

Eercises () Use Jcobi s method to solve the followig system of equtios, with 0,, T s iitil pproimtio, correct to sigifict figures. 0y 3z 39 0 y 5z 6 4 5y 0z 47 Wht is the miimum umber of itertios required to get 5 sigifict digit ccurcy, if 5 digit rithmetic is used. (As: True solutio 3, 3, T () Do three itertios of Jcobi s method to solve 3y 0z 0 y z 9 0y z ; umber of itertio required=36) 0 with,, T s strtig vector. Wht is the miimum umber of itertios required, so tht the solutio is correct to 4 deciml plces. (As: True solutio ; umber of itertio required =7),,3 T (3) Solve, by Guss-Seidl itertio method, the system of lier equtios 3 9 y z 4 y 3z 4 4 y z 8 correct up to four sigifict figures. (As:.43, y.3, z.956)

(4) Compute the solutio of the system of lier equtios by Guss-Seidl itertio method 6.7.y.z 0.5 3. 9.4 y.5z.9..5y 8.4z 8.8 correct up to 3-sigifict figures. (As:.50, y.50, z 3.50 ) (5) Do five itertios of ech Jcobi s d Guss Seidel method to solve 3y 7z 6 3 y z 6 5y 3z 0 with strtig iitil guess s (, y, z) = (,,). Wht is the miimum umber of itertios required, so tht the solutios correct to 8 sigifict figures? (As: True solutio:., y 0.8, z.6 )