Chapter Gauss-Seidel Method

Similar documents
ITERATIVE METHODS FOR SOLVING SYSTEMS OF LINEAR ALGEBRAIC EQUATIONS

12 Iterative Methods. Linear Systems: Gauss-Seidel Nonlinear Systems Case Study: Chemical Reactions

The linear system. The problem: solve

Numerical Analysis Topic 4: Least Squares Curve Fitting

Lecture 3-4 Solutions of System of Linear Equations

3/20/2013. Splines There are cases where polynomial interpolation is bad overshoot oscillations. Examplef x. Interpolation at -4,-3,-2,-1,0,1,2,3,4

Chapter Simpson s 1/3 Rule of Integration. ( x)

Advanced Algorithmic Problem Solving Le 3 Arithmetic. Fredrik Heintz Dept of Computer and Information Science Linköping University

Chapter Unary Matrix Operations

Numerical Differentiation and Integration

DATA FITTING. Intensive Computation 2013/2014. Annalisa Massini

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

Chapter Linear Regression

1 4 6 is symmetric 3 SPECIAL MATRICES 3.1 SYMMETRIC MATRICES. Defn: A matrix A is symmetric if and only if A = A, i.e., a ij =a ji i, j. Example 3.1.

Mathematically, integration is just finding the area under a curve from one point to another. It is b

PubH 7405: REGRESSION ANALYSIS REGRESSION IN MATRIX TERMS

CS537. Numerical Analysis

The z-transform. LTI System description. Prof. Siripong Potisuk

2006 Jamie Trahan, Autar Kaw, Kevin Martin University of South Florida United States of America

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

CS321. Introduction to Numerical Methods

CURVE FITTING LEAST SQUARES METHOD

Matrix. Definition 1... a1 ... (i) where a. are real numbers. for i 1, 2,, m and j = 1, 2,, n (iii) A is called a square matrix if m n.

Chapter 2 Intro to Math Techniques for Quantum Mechanics

under the curve in the first quadrant.

INTRODUCTION ( ) 1. Errors

In Calculus I you learned an approximation method using a Riemann sum. Recall that the Riemann sum is

Asynchronous Analogs of Iterative Methods and Their Efficiency for Parallel Computers

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

Sequences and summations

10.2 Series. , we get. which is called an infinite series ( or just a series) and is denoted, for short, by the symbol. i i n

ME 501A Seminar in Engineering Analysis Page 1

MTH 146 Class 7 Notes

Chapter 2. LOGARITHMS

Math 1313 Final Exam Review

Chapter 3 Supplemental Text Material

Computer Programming

Level-2 BLAS. Matrix-Vector operations with O(n 2 ) operations (sequentially) BLAS-Notation: S --- single precision G E general matrix M V --- vector

Chapter System of Equations

Chapter 2 Solving Linear Equation

Recent Progresses on the Simplex Method

St John s College. UPPER V Mathematics: Paper 1 Learning Outcome 1 and 2. Examiner: GE Marks: 150 Moderator: BT / SLS INSTRUCTIONS AND INFORMATION

COMPLEX NUMBERS AND DE MOIVRE S THEOREM

Rendering Equation. Linear equation Spatial homogeneous Both ray tracing and radiosity can be considered special case of this general eq.

MATRIX AND VECTOR NORMS

Chapter 12-b Integral Calculus - Extra

INTERPOLATION(2) ELM1222 Numerical Analysis. ELM1222 Numerical Analysis Dr Muharrem Mercimek

ES240 Solid Mechanics Z. Suo. Principal stress. . Write in the matrix notion, and we have

Modeling uncertainty using probabilities

Introduction to Matrix Algebra

Stats & Summary

Analyzing Control Structures

Bond Additive Modeling 5. Mathematical Properties of the Variable Sum Exdeg Index

Graphing Review Part 3: Polynomials

Area and the Definite Integral. Area under Curve. The Partition. y f (x) We want to find the area under f (x) on [ a, b ]

i+1 by A and imposes Ax

SOLVING SYSTEMS OF EQUATIONS, DIRECT METHODS

Preliminary Examinations: Upper V Mathematics Paper 1

Density estimation II

Global Journal of Engineering and Technology Review

Objective of curve fitting is to represent a set of discrete data by a function (curve). Consider a set of discrete data as given in table.

PAIR OF STRAIGHT LINES. will satisfy L1 L2 0, and thus L1 L. 0 represent? It is obvious that any point lying on L 1

Linear Open Loop Systems

3. REVIEW OF PROPERTIES OF EIGENVALUES AND EIGENVECTORS

5 - Determinants. r r. r r. r r. r s r = + det det det

Diagonally Implicit Runge-Kutta Nystrom General Method Order Five for Solving Second Order IVPs

19 22 Evaluate the integral by interpreting it in terms of areas. (1 x ) dx. y Write the given sum or difference as a single integral in

20 23 Evaluate the integral by interpreting it in terms of areas. (1 x ) dx. y 2 2

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

Numerical Methods. Lecture 5. Numerical integration. dr hab. inż. Katarzyna Zakrzewska, prof. AGH. Numerical Methods lecture 5 1

Chapter 7. Bounds for weighted sums of Random Variables

UNIVERSITI KEBANGSAAN MALAYSIA PEPERIKSAAN AKHIR SEMESTER I SESI AKADEMIK 2007/2008 IJAZAH SARJANAMUDA DENGAN KEPUJIAN NOVEMBER 2007 MASA : 3 JAM

SPH3UW Unit 7.5 Snell s Law Page 1 of Total Internal Reflection occurs when the incoming refraction angle is

DCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x)

Band structures calculations

SOME REMARKS ON HORIZONTAL, SLANT, PARABOLIC AND POLYNOMIAL ASYMPTOTE

Problem Set 4 Solutions

The Algebraic Least Squares Fitting Of Ellipses

CHAPTER 7 SOLVING FUZZY LINEAR FRACTIONAL PROGRAMMING PROBLEM BY USING TAYLOR'S SERIES METHOD

CHAPTER 5 Vectors and Vector Space

Chapter 17. Least Square Regression

A Technique for Constructing Odd-order Magic Squares Using Basic Latin Squares

Describes techniques to fit curves (curve fitting) to discrete data to obtain intermediate estimates.

4 Linear Homogeneous Recurrence Relation 4-1 Fibonacci Rabbits. 组合数学 Combinatorics

Content: Essential Calculus, Early Transcendentals, James Stewart, 2007 Chapter 1: Functions and Limits., in a set B.

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc. Matrix eigenvalues of jacobi iterative method for solving

Introduction to mathematical Statistics

Roberto s Notes on Integral Calculus Chapter 4: Definite integrals and the FTC Section 2. Riemann sums

GENERALIZED OPERATIONAL RELATIONS AND PROPERTIES OF FRACTIONAL HANKEL TRANSFORM

Decompression diagram sampler_src (source files and makefiles) bin (binary files) --- sh (sample shells) --- input (sample input files)

Methods to Invert a Matrix

Chapter 1 Vector Spaces

The Z-Transform in DSP Lecture Andreas Spanias

Current Programmed Control (i.e. Peak Current-Mode Control) Lecture slides part 2 More Accurate Models

Implicit Runge-Kutta method for Van der pol problem

ICS141: Discrete Mathematics for Computer Science I

G S Power Flow Solution

Analele Universităţii din Oradea, Fascicula: Protecţia Mediului, Vol. XIII, 2008

A Mean- maximum Deviation Portfolio Optimization Model

Chapter Simpson s 1/3 Rule of Integration. ( x)

Transcription:

Chpter 04.08 Guss-Sedel Method After redg ths hpter, you should be ble to:. solve set of equtos usg the Guss-Sedel method,. reogze the dvtges d ptflls of the Guss-Sedel method, d. determe uder wht odtos the Guss-Sedel method lwys overges. Why do we eed other method to solve set of smulteous ler equtos? I ert ses, suh s whe system of equtos s lrge, tertve methods of solvg equtos re more dvtgeous. Elmto methods, suh s Guss elmto, re proe to lrge roud-off errors for lrge set of equtos. Itertve methods, suh s the Guss-Sedel method, gve the user otrol of the roud-off error. Also, f the physs of the problem re well kow, tl guesses eeded tertve methods be mde more udously ledg to fster overgee. Wht s the lgorthm for the Guss-Sedel method? Gve geerl set of equtos d ukows, we hve............... If the dgol elemets re o-zero, eh equto s rewrtte for the orrespodg ukow, tht s, the frst equto s rewrtte wth o the left hd sde, the seod equto s rewrtte wth o the left hd sde d so o s follows 04.08.

04.08. Chpter 04.08,,,,,, These equtos be rewrtte summto form s...,, Hee for y row,.,,,, Now to fd s, oe ssumes tl guess for the s d the uses the rewrtte equtos to lulte the ew estmtes. Remember, oe lwys uses the most reet estmtes to lulte the et estmtes,. At the ed of eh terto, oe lultes the bsolute reltve ppromte error for eh s 00 ew old ew where ew s the reetly obted vlue of, d old s the prevous vlue of.

Guss-Sedel Method 04.08. Whe the bsolute reltve ppromte error for eh s less th the pre-spefed tolere, the tertos re stopped. Emple The upwrd veloty of roket s gve t three dfferet tmes the followg tble Tble Veloty vs. tme dt. Tme, t (s) Veloty, v (m/s) 5 06.8 8 77. 79. The veloty dt s ppromted by polyoml s v t t t, 5 t Fd the vlues of,, d usg the Guss-Sedel method. Assume tl guess of the soluto s 5 d odut two tertos. Soluto The polyoml s gog through three dt pots, v, t, v, d t v bove tble t 5, v 06.8 t 8, v 77. t, v 79. Requrg tht v t t t v t t v t t v t t vt vt vt Substtutg the dt, v, t, v, d t v or, 5 5 06. 8 8 8 77. 79. 5 5 64 8 t where from the, psses through the three dt pots gves t gves 06.8 77.

04.08.4 Chpter 04.08 44 79. The oeffets,, d for the bove epresso re gve by 5 5 06.8 64 8 77. 44 79. Rewrtg the equtos gves 06.8 5 5 77. 64 8 79. 44 Iterto # Gve the tl guess of the soluto vetor s 5 we get 06.8 5() (5) 5.670 77. 64.670 5 8 7.850 79. 44.670 7.850 55.6 The bsolute reltve ppromte error for eh the s.670 00.670 7.76% 7.850 00 7.850 5.47% 55.6 5 00 55.6 0.% At the ed of the frst terto, the estmte of the soluto vetor s

Guss-Sedel Method 04.08.5.670 7.850 55.6 d the mmum bsolute reltve ppromte error s 5.47%. Iterto # The estmte of the soluto vetor t the ed of Iterto # s.670 7.850 55.6 Now we get 06.8 5 7.850 ( 55.6) 5.056 77. 64.056 ( 55.6) 8 54.88 79. 44.056 54.88 = 798. 4 The bsolute reltve ppromte error for eh the s.056.670 00.056 69.54% 54.88 7.850 00 54.88 85.695% 798.4 55.6 00 798.4 80.540% At the ed of the seod terto the estmte of the soluto vetor s.056 54.88 798.54 d the mmum bsolute reltve ppromte error s 85.695%. Codutg more tertos gves the followg vlues for the soluto vetor d the orrespodg bsolute reltve ppromte errors.

04.08.6 Chpter 04.08 Iterto %.670 7.767.056 69.54 47.8 74.447 4 9. 75.595 5 800.5 75.850 6.6 75.906 % 7.850 54.88 55.5 09.4 4577. 9049 5.47 85.695 78.5 76.6 76. 75.97 % 55.6 798.4 448.9 4440 6007 49580 0. 80.540 76.85 76.6 75.96 75.9 As see the bove tble, the soluto estmtes re ot overgg to the true soluto of 0.9048 9.690.0857 The bove system of equtos does ot seem to overge. Why? Well, ptfll of most tertve methods s tht they my or my ot overge. However, the soluto to ert lsses of systems of smulteous equtos does lwys overge usg the Guss-Sedel method. Ths lss of system of equtos s where the oeffet mtr [A] [ A][ X ] [ C] s dgolly domt, tht s for ll for t lest oe If system of equtos hs oeffet mtr tht s ot dgolly domt, t my or my ot overge. Fortutely, my physl systems tht result smulteous ler equtos hve dgolly domt oeffet mtr, whh the ssures overgee for tertve methods suh s the Guss-Sedel method of solvg smulteous ler equtos. Emple Fd the soluto to the followg system of equtos usg the Guss-Sedel method. 5 5 8 7 76 Use 0 s the tl guess d odut two tertos. Soluto The oeffet mtr

Guss-Sedel Method 04.08.7 5 A 5 7 s dgolly domt s 5 8 5 5 4 7 0 d the equlty s strtly greter th for t lest oe row. Hee, the soluto should overge usg the Guss-Sedel method. Rewrtg the equtos, we get 5 8 5 76 7 Assumg tl guess of 0 Iterto # 0 5 0.50000 8 0.50000 5 4.9000 76 0.50000 74.9000.09 The bsolute reltve ppromte error t the ed of the frst terto s 0.50000 00 0.50000 00.00% 4.9000 0 00 4.9000 00.00%.09 00.09 67.66%

04.08.8 Chpter 04.08 The mmum bsolute reltve ppromte error s 00.00% Iterto # 4.9000 5.09 0.4679 8 0.4679.09 5.75 76 0.4679 7.75.88 At the ed of seod terto, the bsolute reltve ppromte error s 0.4679 0.50000 00 0.4679 40.6%.75 4.9000 00.75.889%.88.09 00.88 8.874% The mmum bsolute reltve ppromte error s 40.6%. Ths s greter th the vlue of 00.00% we obted the frst terto. Is the soluto dvergg? No, s you odut more tertos, the soluto overges s follows. Iterto % 0.50000 00.00 0.4679 40.6 0.7475 80.6 4 0.94675.546 5 0.9977 4.59 6 0.9999 0.7407 Ths s lose to the et soluto vetor of 4 Emple Gve the system of equtos 7 76 % 4.9000.75.644.08.004.000 00.00.889 7.408 4.4996 0.8499 0.0856 %.09.88.9708.997 4.000 4.000 67.66 8.874 4.0064 0.6577 0.0748 0.000

Guss-Sedel Method 04.08.9 5 8-5 fd the soluto usg the Guss-Sedel method. Use 0 s the tl guess. Soluto Rewrtg the equtos, we get 76 7 8 5 5 Assumg tl guess of 0 the et s tertve vlues re gve the tble below. Iterto %.000 95.8 96.5 0.7 995.0 09.8 4 049 09.90 5.0640 5 09.89 6.05790 6 09.89 % 0.80000 4.4 6.0 04.6 40.70 5 00.00 94.45.4 09.6 09.9 09.89 % 50.680 46.0 478. 4766 4.8440 5 4.8650 6 98.07 0.96 09.80 09.90 09.89 09.89 You see tht ths soluto s ot overgg d the oeffet mtr s ot dgolly domt. The oeffet mtr 7 A 5 5 s ot dgolly domt s 7 0 Hee, the Guss-Sedel method my or my ot overge. However, t s the sme set of equtos s the prevous emple d tht overged. The oly dfferee s tht we ehged frst d the thrd equto wth eh other d tht mde the oeffet mtr ot dgolly domt.

04.08.0 Chpter 04.08 Therefore, t s possble tht system of equtos be mde dgolly domt f oe ehges the equtos wth eh other. However, t s ot possble for ll ses. For emple, the followg set of equtos 4 9 7 9 ot be rewrtte to mke the oeffet mtr dgolly domt. Key Terms: Guss-Sedel method Covergee of Guss-Sedel method Dgolly domt mtr