24 Jul 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 3 – Systems of Linear Equations 24 July 2007 8.00 am – 9.00 am.

Slides:



Advertisements
Similar presentations
Method If an nxn matrix A has an LU-factorization, then the solution of AX = b can be determined by a Forward substitution followed by a Back substitution.
Advertisements

Example 1 Matrix Solution of Linear Systems Chapter 7.2 Use matrix row operations to solve the system of equations  2009 PBLPathways.
4/26/ LU Decomposition Civil Engineering Majors Authors: Autar Kaw Transforming.
Chapter 8 Numerical Technique 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
Major: All Engineering Majors Authors: Autar Kaw
Chapter 9.1 = LU Decomposition MATH 264 Linear Algebra.
Lecture 11 - LU Decomposition
14 Aug 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 6 – Interpolation & Curve Fitting 14 August am – 9.00 am.
Lecture 15 Recursive and Iterative Formula for Determinants Shang-Hua Teng.
18 September 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 11 – Ordinary Differential Equations 18 September am – 9.00 am.
11 September 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 10 – Ordinary Differential Equations 11 September am – 9.00 am.
02 October 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 13 – Partial Differential Equations 02 October am – 9.00 am.
25 September 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 12 – Partial Differential Equations 25 September am – 9.00 am.
07 Aug 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 5 – Systems of Nonlinear Equations 07 August am – 9.00 am.
ECIV 520 Structural Analysis II Review of Matrix Algebra.
Mujahed AlDhaifallah (Term 342) Read Chapter 9 of the textbook
17 Jul 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 2 – Systems of Linear Equations 17 July am – 9.00 am.
31 Jul 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 4 – Systems of Nonlinear Equations 31 July am – 9.00 am.
28 Aug 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 8 – Numerical Derivatives & Integrals 28 August am – 9.00 am.
CE 311 K - Introduction to Computer Methods Daene C. McKinney
LU Decomposition 1. Introduction Another way of solving a system of equations is by using a factorization technique for matrices called LU decomposition.
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
Slide Chapter 7 Systems and Matrices 7.1 Solving Systems of Two Equations.
More on Inverse. Last Week Review Matrix – Rule of addition – Rule of multiplication – Transpose – Main Diagonal – Dot Product Block Multiplication Matrix.
Chapter 7 Notes Honors Pre-Calculus. 7.1/7.2 Solving Systems Methods to solve: EXAMPLES: Possible intersections: 1 point, 2 points, none Elimination,
CALCULUS – II Inverse Matrix by Dr. Eman Saad & Dr. Shorouk Ossama.
Introduction to Numerical Analysis I MATH/CMPSC 455 LU Factorization.
Ch X 2 Matrices, Determinants, and Inverses.
Linear Algebra 1.Basic concepts 2.Matrix operations.
5 5.2 © 2012 Pearson Education, Inc. Eigenvalues and Eigenvectors THE CHARACTERISTIC EQUATION.
Lecture 8 Matrix Inverse and LU Decomposition
Chapter 5 MATRIX ALGEBRA: DETEMINANT, REVERSE, EIGENVALUES.
Chapter 6 Systems of Linear Equations and Matrices Sections 6.3 – 6.5.
10.2 Systems of Linear Equations: Matrices Objectives Objectives 1.Write the Augmented Matrix 2.Write the System from the Augmented matrix 3.Perform Row.
Lecture 10 - Nonlinear gradient techniques and LU Decomposition CVEN 302 June 24, 2002.
2x2 Matrices, Determinants and Inverses
1/18/ LU Decomposition Industrial Engineering Majors Authors: Autar Kaw Transforming.
2.5 – Determinants and Multiplicative Inverses of Matrices.
3/1/ LU Decomposition Computer Engineering Majors Authors: Autar Kaw Transforming.
LEARNING OUTCOMES At the end of this topic, student should be able to :  D efination of matrix  Identify the different types of matrices such as rectangular,
Lesson 4-2: Solving Systems – Substitution & Linear Combinations Objectives: Students will: Solve systems of equations using substitution and linear combinations.
Unit #1 Linear Systems Fall Dr. Jehad Al Dallal.
Autar Kaw Benjamin Rigsby Transforming Numerical Methods Education for STEM Undergraduates.
A ij i = row j = column A [ A ] Definition of a Matrix.
Matrices. Variety of engineering problems lead to the need to solve systems of linear equations matrixcolumn vectors.
Numerical Methods.  LU Decomposition is another method to solve a set of simultaneous linear equations  For most non-singular matrix [A] that one could.
Numerical Computation Lecture 6: Linear Systems – part II United International College.
MTH108 Business Math I Lecture 20.
TYPES OF SOLUTIONS SOLVING EQUATIONS
Chapter 8 Numerical Technique
TYPES OF SOLUTIONS SOLVING EQUATIONS
Spring Dr. Jehad Al Dallal
System of Linear Equations
Linear Equations.
Linear independence and matrix rank
Multiplication of Matrices
Linear Algebra Lecture 15.
ECON 213 Elements of Mathematics for Economists
Solving Matrix equations
CHAPTER OBJECTIVES The primary objective of this chapter is to show how to compute the matrix inverse and to illustrate how it can be.
RECORD. RECORD Gaussian Elimination: derived system back-substitution.
Multiplicative Inverses of Matrices and Matrix Equations
Numerical Analysis Lecture14.
Numerical Computation and Optimization
Determinant of a Matrix
Numerical Analysis Lecture10.
Multiplication of Matrices
Major: All Engineering Majors Authors: Autar Kaw
Solving simultaneous equations
Lecture 8 Matrix Inverse and LU Decomposition
Presentation transcript:

24 Jul 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 3 – Systems of Linear Equations 24 July am – 9.00 am

24 Jul 2007 Week 2 Page 2 Topics Introduction Elimination Methods Decomposition Methods Matrix Inverse and Determinant Errors, Residuals and Condition Number Iteration Methods Incomplete and Redundant Systems

24 Jul 2007 Week 2 Page 3 Tutorial Example 1 (WITHOUT row interchange) Forward elimination : [A].x = b [A]

24 Jul 2007 Week 2 Page 4 (i) Determinant det (A) = (1).(1).(2).(0.5) = 1 det (A) = (-1) p.a 11. a 22 (1).a 33 (2).a 44 (3) = (-1) 0.(1).(1).(2).(0.5) = 1 For triangular matrix: det [A] = product of diagonal terms, a ii Triangular obtained from [A] WITHOUT any row interchange Tutorial Example 1 (WITHOUT row interchange) Alternatively,

24 Jul 2007 Week 2 Page 5 (ii) LU decomposition of [A] Now, check if [L].[U] = [A] Tutorial Example 1 (WITHOUT row interchange)

24 Jul 2007 Week 2 Page 6 Tutorial Example 1 (WITH row interchange) [A].x = b ORIGINAL [A][b] [A*].x = b* [A*][b*] INTERCHANGE ROWS 2-4.

24 Jul 2007 Week 2 Page 7 Tutorial Example 1 (WITH row interchange) Forward elimination : [A*]

24 Jul 2007 Week 2 Page 8 (i) Determinant det (A) = (-1) p.a 11. a 22 (1).a 33 (2).a 44 (3) = (-1) 1.(1).(-1).(1).(1) = 1 Tutorial Example 1 (WITH row interchange) Equals det (A) previously ! NOT det (A*) !

24 Jul 2007 Week 2 Page 9 Alternatively, det (A*) = (1).(-1).(1).(1) = -1 For triangular matrix: det [ ] = product of diagonal terms, a ii Triangular obtained from [A*] Tutorial Example 1 (WITH row interchange) Hence, det (A) = (1) p.(-1) = 1

24 Jul 2007 Week 2 Page 10 Tutorial Example 1 (WITH row interchange) How many row interchange ? p = ?

24 Jul 2007 Week 2 Page 11 Tutorial Example 2 Refer exercise in Chapter 1 : Question #3

24 Jul 2007 Week 2 Page 12 Tutorial Example 2

24 Jul 2007 Week 2 Page 13 Tutorial Example 2