Solve Linear System with Sylvester s Condensation
|
|
- Scott Francis
- 6 years ago
- Views:
Transcription
1 International Journal of Algebra, Vol 5, 2011, no 20, Solve Linear System with Sylvester s Condensation Abdelmalek Salem Department of Mathematics University of Tebessa, Algeria And Faculty of Sciences and Arts at Yanbu, Taibah University, Saudi Arabia asalem@gawabcom Khaled Sioud Department of Mathematics Faculty of Sciences and Arts at Yanbu, Taibah University, Saudi Arabia Taher Mekhaznia Department of Informatics University of Tebessa, Algeria mekhaznia@yahoofr Abstract We present a development of Dodgson s method for the solution to a system of linear equations (see [5]) using the determinants of the Sylvester s (Determinants) Identity We explicitly write down the algorithm for this developed method Mathematics Subject Classification: Primary 05A19; Secondary 05A10 Keywords: Linear system, Dodgson s condensation, Sylvester s determinant identity 1 Introduction In this paper we consider a system of n linear equations: a 11 x 1 + a 12 x a 1n x n b 1 =0, a 21 x 1 + a 22 x a 2n x n b 2 =0, a n1 x 1 + a n2 x a nn x n b n =0 (11) with a ij,b i R i, j =1, 2,, n and n N
2 994 S Abdelmalek, K Sioud and T Mekhaznia We can rewrite expression (11) in the following matricial form: AX B =0 A = a 11 a 12 a 1n a 21 a 22 a 2n a n1 a n2 a nn,x= x 1 x 2 x n and B = b 1 b 2 b n (12) Also write A =[C 1,C 2,,C n ] (13) where C 1 is the first column and C 2 is the second column, ect Previous Results 11 Method of Gabriel Cramer ( ) Cramer s rule is a theorem, which gives an expression for the solution of a system of linear equations with as many equations as unknowns, Theorem 1 If det A 0, then the solution of (11) is X := A 1 B with A 1 the inverse matrix of A, the unknowns (x j ) m j=1 are given by Cramer formula : x j = det [C 1,C 2,,C j 1,B,C j+1,,c n ] ; j =1, 2,, n (21) det A Proof Let X = n x i e i So B = AX = n x i C i Then for j =1, 2,, n i=1 i=1 [ ] det [C 1,C 2,,C j 1,B,C j+1,,c n ] = det C 1,C 2,,C j 1, n x i C i,c j+1,,c n = i=1 n x i det [C 1,C 2,,C j 1,C i,c j+1,,c n ]= i=1 n x j det [C 1,C 2,,C j 1,C j,c j+1,,c n ] + x i det [C 1,C 2,,C j 1,C i,c j+1,,c n ]= x j det A 12 Method of Charles L Dodgson (Lewis Carroll, )(see [5]) This method concludes by showing how this process may be applied to the solution of simultaneous linear equations i=1 i j
3 Solve linear system 995 If we take a block consisting of n rows and (n + 1) columns, and condense it, we reduce it at last to 2 terms, the first of which is the determinant of the first n columns, the other of the last n columns Hence, if we take the n simultaneous equations (11), and if we condense the whole block of coefficients and constants a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 (22) a n1 a n2 a nn b n we reduce it at last to two terms which we denote by S, T, so that s = a 11 a 12 a 1n a 21 a 22 a 2n a n1 a n2 a nn and t = a 12 a 1n b 1 a 22 a 2n b 2 a n2 a nn b n Now we know that x 1 = ( 1) n T, which may be written in the form S ( 1) n Sx 1 = T Hence the two terms obtained by the process of condensation may be converted into an equation for x 1, by multiplying the first of these equations by x 1, affected by a (+) or ( ) according to n being even or odd respectively The latter part of the rule may simply be expressed as: place the signs (+) and ( ) alternately over the several columns, beginning with the last column with a (+) sign, and the sign which occurs over the column containing x 1 is the sign with which x 1 is to be affected When the value of x 1 has been thus found, it may be substituted in the first (n 1) equations, and the same operation is repeated on the new block, which will now consist of (n 1) rows and n columns But in calculating the second series of blocks, it will be found that most of the work has already been done In fact, of the two determinants required in the new block, one has already been computed correctly, and the computation of the other only requires the last column in each of the derived blocks to be corrected This method based on Dodgson s algorithm is based on the following algorithm: algorithm 11 (Dodgson s algorithm) This algorithm can be described in the following four steps: (1) Let A be the given n n matrix Arrange A so that no zeros occur in its interior An explicit definition of interior would be all a i,j with i, j 1,n We can do this using any operation that we could normally perform without changing the value of the determinant, such as adding a multiple of one row to another (2) Create an (n 1) (n 1) matrix B, consisting of the determinants of
4 996 S Abdelmalek, K Sioud and T Mekhaznia every 2 2 submatrix of A Explicitly, we write b i,j = a i,j a i,j+1 a i+1,j a i+1,j+1 (3) Using this (n 1) (n 1) matrix, perform step (2) to obtain an (n 2) (n 2) matrix C Divide each term in C by the corresponding term in the interior of A (4) Let A = B, and B = C Repeat step (3) as necessary until the 1 1 matrix is found; its only entry is the determinant To clarify how the algorithm works, let us deal with the following example: Example 1 We wish to find We make a matrix of its 2 2 submatrices = We then find another matrix of determinants: = We must then divide each element by the corresponding element of our original matrix The interior of our original matrix is , so after dividing we get The process is repeated untill one arrives at a 1 1 matrix: = 40 We divide by the interior of our 3 3 matrix, which is just 5, giving us 8 8 is indeed the determinant of the original matrix However we cannot apply these steps on all matrices as shown in the following examples: Example 2 We wish to find A = we apply step
5 Solve linear system (2) on matrix A, we find B = again we apply step (2) on matrix B, we get: C = By applying step (3), we get: By applying step (4), we find: A = , B = and C = ,so = We repeat the previous steps, 3 we get : A = , B = and C = 0, so 0 0 This means Dodgson s method cannot be used to compute A because = Example 3 We wish to find A = ,we notice that With the same way in example (13), we find: B = By the condensation of B, we get: C = ,so = by applying the same previous steps, we find:
6 998 S Abdelmalek, K Sioud and T Mekhaznia A = , B = B, we get: C = Finally and by the condensation of In examples 2 and 3, we face problems in the computation of the determinant If we continue the process, we will eventually be dividing by 0 We can avoid this problem by changing some rows or columns and then repeating the process 13 Sylvester and Chio s condensation Chio s pivotal condensation (see [4]) is a special case of Sylvester s determinant identity (see [7]) It is a method for evaluating an n n determinant in terms of (n 1) (n 1) determinants Proposition 2 ( [1, 2]) we condense the determinant of an n n matrix to the determinant of (n 1) (n 1) matrix The elements of (n 1) (n 1) matrix are the determinants of 2 2 matrix as is shown in the following formula: ] (a k,l ) n 2 det [(a i,j ) 1 i,j n = det i,j)], 1 i,j n 1 1 n, l n (31) where A (i,j) = ( ) ai,j a i,l a k,j a k,l ( ) ai,l a i,j+1 a k,l a k,j+1 ( ) ak,j a k,l a i+1,j a i+1,l ( ak,l a k,j+1 a i+1,l a i+1,j+1 ) if j<l,i<k if j l, i < k if j<l,i k if j l, i k 2 Main Results In this section, we ll show the main result which is a development of Dodgson s method for the solution to a system of linear equations (see [5]) We use the determinants of the Sylvester s (Determinants) Identity For this, we propose the following algorithm:
7 Solve linear system 999 algorithm 21 This algorithm can be described in the following three steps: (1) Let A be a given (n +1) n matrix in (22) We use the elements of the column before the last as pivots in the matrix A (2) Create an n (n 1) matrix B, consisting of the determinants of every 2 2 submatrix of A a i,j a i,l a n,j a n,l if i<n, j<l, a i,l a i,j+1 a n,l a n,j+1 if i < n, j l, b i,j = a n,j a n,l a n+1,j a n+1,l if i = n, j < l, a n,l a n,j+1 if i = n, j l, a n+1,l a n+1,j+1 Taking a n+1,j = b j for j =1, 2,, n We take the first non-zero element in column before the last as the l th row of matrix B If all elements are zero stop (3) Let A = B Repeat step (2) as necessary until a 2 1 matrix is found, its only entry is the (s, t) in (32) Remark 1 In the algorithm 21 if we divide elements b i,j of matrix B by the pivot (a n,l ) n 2 at every iteration we find (s, t) =(S, T ) Let us consider the system (11) If we condense the whole block of coefficients and constants (22) we find two terms denoted s and t; the first is the determinant of the first n columns multiplied by α, the second is the determinant of the last n columns multiplied by α: s = α a 11 a 12 a 1n a 21 a 22 a 2n a n1 a n2 a nn and t = α a 12 a 1n b 1 a 22 a 2n b 2 a n2 a nn b n (32) where α is the result of not dividing by the pivots For computing s and t, we use (algorithm 21 ) Hence the two terms obtained by the process of condensation may be converted into an equation for x 1, by multiplying the first of these equation by ( 1) n x 1 Now we know that x 1 =( 1) n t, which may be written in the form s ( 1) n x 1 s = t (these computations are independent of α) The sign that x i is to be affected with is the sign of ( 1) n+i 1 When the value of x 1 has been found, it may be substituted in the (n 1) equations after deleting the equation that corresponds to the row which is not included in forming the pivot, and the same operation is repeated on the new
8 1000 S Abdelmalek, K Sioud and T Mekhaznia matrix, which will now consist of (n 1) rows and n columns However in calculating the second series of matrices, it is found that most of the work has already been done In fact one of the two determinants required in the new matrix has already been found correctly, and the computation of the other only requires the last column in each of the derived matrices To clarify the algorithm we give the following examples: Example 4 Consider the following system of five linear equations: The table of solution is: x 1 +2x 2 + x 3 x 4 +2x 5 +2=0 x 1 x 2 2x 3 x 4 x 5 4=0 2x 1 + x 2 x 3 2x 4 x 5 6=0 x 1 2x 2 x 3 x 4 +2x 5 +4=0 2x 1 x 2 +2x 3 + x 4 3x 5 8= x 5 =4 x 5 = x 4 =3 x 4 = x 3 =12 x 3 = x 2 = 144 x 2 =1 ( 1) x 1 = x 1 =2 In this example the last equation is always deleted
9 Solve linear system 1001 Example 5 Consider the following system of five linear equations: 2x 1 + x 2 +2x 3 +2x 4 +2=0 x 1 2x 2 x 3 x 4 4=0 x 1 x 2 x 3 x 4 6=0 2x 1 x 2 x 3 +2x 4 +4= x 4 = 8 x 3 4 = x 3 = 4 x 3 = x 2 = 12 x 2 = 2 432x 1 = 864 x 1 =2, In this example the Third equation is always deleted, because we remove the equations which do not contain a pivot The issue of removing equations is resolved by the method of permutations which is shown in the following subsection 3 Algorithm The algorithm is presented is two steps: Step 1- Transformation of the matrix into a triangular matrix Step 2- Resolution of the system Step 1 - Transformation: for i =1ton π (i) =i end loop for k = 1 to n
10 1002 S Abdelmalek, K Sioud and T Mekhaznia m = k piv = a (k) k,n k+1 while piv = 0 m = m +1 piv = a (k) m,n k+1 end while if piv = 0 Stop Singular matrix A end c = π (m) π (m) =π (k) permutation π (m) and π (k) π (k) =c for l from 1 to n L k (l) =a (k) m,l L k (l) =a (k) m,l a (k) m,l = a(k) k,l k,l = L k (l) a (k) end loop l for i from k +1to n for j from 1 to n k a (k+1) i,j end loop j end loop i end loop k Step 2 - Resolution Permutation between rows number k and m = a (k) k,j a(k) i,n k+1 a(k) ij a (k) k,n k+1 for l from 1 to n } c l = b l Permutation of terms of vector b b l = c π(l) end loop l b = b eps = ( 1) n 1 for j from 1 to n b(1) = b for k from 1 to n j for i from k +1to n j +1 b(k+1) i end loop i end loop k x j = eps (k) = b i b (k+1) n j+1 /a(n+1) n j+1,j a (n+1) (k) k,n k+1 b k a (k) i,n k+1
11 Solve linear system 1003 if j =< n 1, for i from 1 to n j b i = b i a (1) i,j x j end if end main loop j End of algorithm } update b for next iteration References [1] S Abdelmalek, and S Kouachi, Condensation of determinants arxiv: [2] S Abdelmalek and S Kouachi, A Simple Proof of Sylvester s (Determinants ) Identity, AppMath scie Vol n o [3] A G Akritas, E K Akritas, and G I Malaschonok, Various proofs of Sylvester s (determinant) identity, Math and Computers in Simulation 42 (1996) [4] F Chio, Mémoires ur les FonctionsC onnues sous le nom des Résultants ou des Déterminants Turin,(1853) [5] CL Dodgson, Condensation of Determinants, Proceedings of the Royal Society of London 15(1866), [6] S Kouachi, S Abdelmalek, and B Rebai, A Mathematical Proof of Dodgson s Algorithm arxiv: [7] T Muir, The Theory of determinants in The Historical Order of Development, vol II London (1911) Received: April, 2011
1 Determinants. 1.1 Determinant
1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationDeterminants Chapter 3 of Lay
Determinants Chapter of Lay Dr. Doreen De Leon Math 152, Fall 201 1 Introduction to Determinants Section.1 of Lay Given a square matrix A = [a ij, the determinant of A is denoted by det A or a 11 a 1j
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationCHAPTER 6. Direct Methods for Solving Linear Systems
CHAPTER 6 Direct Methods for Solving Linear Systems. Introduction A direct method for approximating the solution of a system of n linear equations in n unknowns is one that gives the exact solution to
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 13
STAT 309: MATHEMATICAL COMPUTATIONS I FALL 208 LECTURE 3 need for pivoting we saw that under proper circumstances, we can write A LU where 0 0 0 u u 2 u n l 2 0 0 0 u 22 u 2n L l 3 l 32, U 0 0 0 l n l
More informationLecture 12 (Tue, Mar 5) Gaussian elimination and LU factorization (II)
Math 59 Lecture 2 (Tue Mar 5) Gaussian elimination and LU factorization (II) 2 Gaussian elimination - LU factorization For a general n n matrix A the Gaussian elimination produces an LU factorization if
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More informationANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3
ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any
More informationLemma 8: Suppose the N by N matrix A has the following block upper triangular form:
17 4 Determinants and the Inverse of a Square Matrix In this section, we are going to use our knowledge of determinants and their properties to derive an explicit formula for the inverse of a square matrix
More informationComputational Linear Algebra
Computational Linear Algebra PD Dr. rer. nat. habil. Ralf Peter Mundani Computation in Engineering / BGU Scientific Computing in Computer Science / INF Winter Term 2017/18 Part 2: Direct Methods PD Dr.
More informationLectures on Linear Algebra for IT
Lectures on Linear Algebra for IT by Mgr. Tereza Kovářová, Ph.D. following content of lectures by Ing. Petr Beremlijski, Ph.D. Department of Applied Mathematics, VSB - TU Ostrava Czech Republic 11. Determinants
More informationDETERMINANTS IN WONDERLAND: MODIFYING DODGSON S METHOD TO COMPUTE DETERMINANTS
DETERMINANTS IN WONDERLAND: MODIFYING DODGSON S METHOD TO COMPUTE DETERMINANTS DEANNA LEGGETT, JOHN PERRY, AND EVE TORRENCE ABSTRACT We consider the problem of zeroes appearing in the interior of a matrix
More informationNotes on Determinants and Matrix Inverse
Notes on Determinants and Matrix Inverse University of British Columbia, Vancouver Yue-Xian Li March 17, 2015 1 1 Definition of determinant Determinant is a scalar that measures the magnitude or size of
More informationA Simple Proof of Sylvester s (Determinants) Identity
Appled Mathematcal Scences, Vol 2, 2008, no 32, 1571-1580 A Smple Proof of Sylvester s (Determnants) Identty Abdelmalek Salem Department of Mathematcs and Informatques, Unversty Centre Chekh Larb Tebess
More informationLinear Algebra and Vector Analysis MATH 1120
Faculty of Engineering Mechanical Engineering Department Linear Algebra and Vector Analysis MATH 1120 : Instructor Dr. O. Philips Agboola Determinants and Cramer s Rule Determinants If a matrix is square
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More informationDiscrete Math, Spring Solutions to Problems V
Discrete Math, Spring 202 - Solutions to Problems V Suppose we have statements P, P 2, P 3,, one for each natural number In other words, we have the collection or set of statements {P n n N} a Suppose
More information22m:033 Notes: 3.1 Introduction to Determinants
22m:033 Notes: 3. Introduction to Determinants Dennis Roseman University of Iowa Iowa City, IA http://www.math.uiowa.edu/ roseman October 27, 2009 When does a 2 2 matrix have an inverse? ( ) a a If A =
More informationYet Another Proof of Sylvester s Identity
Yet Another Proof of Sylvester s Identity Paul Vrbik 1 1 University of Newcastle Australia Sylvester s Identity Let A be an n n matrix with entries a i,j for i, j [1, n] and denote by A i k the matrix
More informationMATRICES. a m,1 a m,n A =
MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.1 SYSTEMS OF LINEAR EQUATIONS LINEAR EQUATION x 1,, x n A linear equation in the variables equation that can be written in the form a 1 x 1 + a 2 x 2 + + a n x n
More information2.1 Gaussian Elimination
2. Gaussian Elimination A common problem encountered in numerical models is the one in which there are n equations and n unknowns. The following is a description of the Gaussian elimination method for
More informationCSE 160 Lecture 13. Numerical Linear Algebra
CSE 16 Lecture 13 Numerical Linear Algebra Announcements Section will be held on Friday as announced on Moodle Midterm Return 213 Scott B Baden / CSE 16 / Fall 213 2 Today s lecture Gaussian Elimination
More informationLinear Algebra Section 2.6 : LU Decomposition Section 2.7 : Permutations and transposes Wednesday, February 13th Math 301 Week #4
Linear Algebra Section. : LU Decomposition Section. : Permutations and transposes Wednesday, February 1th Math 01 Week # 1 The LU Decomposition We learned last time that we can factor a invertible matrix
More informationMatrices: 2.1 Operations with Matrices
Goals In this chapter and section we study matrix operations: Define matrix addition Define multiplication of matrix by a scalar, to be called scalar multiplication. Define multiplication of two matrices,
More informationCOURSE Numerical methods for solving linear systems. Practical solving of many problems eventually leads to solving linear systems.
COURSE 9 4 Numerical methods for solving linear systems Practical solving of many problems eventually leads to solving linear systems Classification of the methods: - direct methods - with low number of
More informationMATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product.
MATH 311-504 Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product. Determinant is a scalar assigned to each square matrix. Notation. The determinant of a matrix A = (a ij
More informationDirect Methods for Solving Linear Systems. Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le
Direct Methods for Solving Linear Systems Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le 1 Overview General Linear Systems Gaussian Elimination Triangular Systems The LU Factorization
More informationFundamentals of Engineering Analysis (650163)
Philadelphia University Faculty of Engineering Communications and Electronics Engineering Fundamentals of Engineering Analysis (6563) Part Dr. Omar R Daoud Matrices: Introduction DEFINITION A matrix is
More informationMath 18.6, Spring 213 Problem Set #6 April 5, 213 Problem 1 ( 5.2, 4). Identify all the nonzero terms in the big formula for the determinants of the following matrices: 1 1 1 2 A = 1 1 1 1 1 1, B = 3 4
More informationFormula for the inverse matrix. Cramer s rule. Review: 3 3 determinants can be computed expanding by any row or column
Math 20F Linear Algebra Lecture 18 1 Determinants, n n Review: The 3 3 case Slide 1 Determinants n n (Expansions by rows and columns Relation with Gauss elimination matrices: Properties) Formula for the
More informationDirect Methods for Solving Linear Systems. Matrix Factorization
Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationDeterminants. Chia-Ping Chen. Linear Algebra. Professor Department of Computer Science and Engineering National Sun Yat-sen University 1/40
1/40 Determinants Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra About Determinant A scalar function on the set of square matrices
More informationLecture Notes in Linear Algebra
Lecture Notes in Linear Algebra Dr. Abdullah Al-Azemi Mathematics Department Kuwait University February 4, 2017 Contents 1 Linear Equations and Matrices 1 1.2 Matrices............................................
More informationDEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix to upper-triangular
form) Given: matrix C = (c i,j ) n,m i,j=1 ODE and num math: Linear algebra (N) [lectures] c phabala 2016 DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix
More informationENGR-1100 Introduction to Engineering Analysis. Lecture 21. Lecture outline
ENGR-1100 Introduction to Engineering Analysis Lecture 21 Lecture outline Procedure (algorithm) for finding the inverse of invertible matrix. Investigate the system of linear equation and invertibility
More informationMATH2210 Notebook 2 Spring 2018
MATH2210 Notebook 2 Spring 2018 prepared by Professor Jenny Baglivo c Copyright 2009 2018 by Jenny A. Baglivo. All Rights Reserved. 2 MATH2210 Notebook 2 3 2.1 Matrices and Their Operations................................
More informationc c c c c c c c c c a 3x3 matrix C= has a determinant determined by
Linear Algebra Determinants and Eigenvalues Introduction: Many important geometric and algebraic properties of square matrices are associated with a single real number revealed by what s known as the determinant.
More informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 6
CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 6 GENE H GOLUB Issues with Floating-point Arithmetic We conclude our discussion of floating-point arithmetic by highlighting two issues that frequently
More informationENGR-1100 Introduction to Engineering Analysis. Lecture 21
ENGR-1100 Introduction to Engineering Analysis Lecture 21 Lecture outline Procedure (algorithm) for finding the inverse of invertible matrix. Investigate the system of linear equation and invertibility
More informationDeterminants. Samy Tindel. Purdue University. Differential equations and linear algebra - MA 262
Determinants Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T. Determinants Differential equations
More informationSolution of Linear systems
Solution of Linear systems Direct Methods Indirect Methods -Elimination Methods -Inverse of a matrix -Cramer s Rule -LU Decomposition Iterative Methods 2 A x = y Works better for coefficient matrices with
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationProcess Model Formulation and Solution, 3E4
Process Model Formulation and Solution, 3E4 Section B: Linear Algebraic Equations Instructor: Kevin Dunn dunnkg@mcmasterca Department of Chemical Engineering Course notes: Dr Benoît Chachuat 06 October
More informationThe purpose of computing is insight, not numbers. Richard Wesley Hamming
Systems of Linear Equations The purpose of computing is insight, not numbers. Richard Wesley Hamming Fall 2010 1 Topics to Be Discussed This is a long unit and will include the following important topics:
More informationLecture 8: Determinants I
8-1 MATH 1B03/1ZC3 Winter 2019 Lecture 8: Determinants I Instructor: Dr Rushworth January 29th Determinants via cofactor expansion (from Chapter 2.1 of Anton-Rorres) Matrices encode information. Often
More informationAMS 209, Fall 2015 Final Project Type A Numerical Linear Algebra: Gaussian Elimination with Pivoting for Solving Linear Systems
AMS 209, Fall 205 Final Project Type A Numerical Linear Algebra: Gaussian Elimination with Pivoting for Solving Linear Systems. Overview We are interested in solving a well-defined linear system given
More informationDeterminants of 2 2 Matrices
Determinants In section 4, we discussed inverses of matrices, and in particular asked an important question: How can we tell whether or not a particular square matrix A has an inverse? We will be able
More informationMATH 2030: EIGENVALUES AND EIGENVECTORS
MATH 2030: EIGENVALUES AND EIGENVECTORS Determinants Although we are introducing determinants in the context of matrices, the theory of determinants predates matrices by at least two hundred years Their
More informationWeek 15-16: Combinatorial Design
Week 15-16: Combinatorial Design May 8, 2017 A combinatorial design, or simply a design, is an arrangement of the objects of a set into subsets satisfying certain prescribed properties. The area of combinatorial
More informationRATIONAL REALIZATION OF MAXIMUM EIGENVALUE MULTIPLICITY OF SYMMETRIC TREE SIGN PATTERNS. February 6, 2006
RATIONAL REALIZATION OF MAXIMUM EIGENVALUE MULTIPLICITY OF SYMMETRIC TREE SIGN PATTERNS ATOSHI CHOWDHURY, LESLIE HOGBEN, JUDE MELANCON, AND RANA MIKKELSON February 6, 006 Abstract. A sign pattern is a
More informationLecture 4: Products of Matrices
Lecture 4: Products of Matrices Winfried Just, Ohio University January 22 24, 2018 Matrix multiplication has a few surprises up its sleeve Let A = [a ij ] m n, B = [b ij ] m n be two matrices. The sum
More information9 Appendix. Determinants and Cramer s formula
LINEAR ALGEBRA: THEORY Version: August 12, 2000 133 9 Appendix Determinants and Cramer s formula Here we the definition of the determinant in the general case and summarize some features Then we show how
More informationToday s class. Linear Algebraic Equations LU Decomposition. Numerical Methods, Fall 2011 Lecture 8. Prof. Jinbo Bi CSE, UConn
Today s class Linear Algebraic Equations LU Decomposition 1 Linear Algebraic Equations Gaussian Elimination works well for solving linear systems of the form: AX = B What if you have to solve the linear
More informationMATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.
MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. Elementary matrices Theorem 1 Any elementary row operation σ on matrices with n rows can be simulated as left multiplication
More informationUnit 1 Matrices Notes Packet Period: Matrices
Algebra 2/Trig Unit 1 Matrices Notes Packet Name: Period: # Matrices (1) Page 203 204 #11 35 Odd (2) Page 203 204 #12 36 Even (3) Page 211 212 #4 6, 17 33 Odd (4) Page 211 212 #12 34 Even (5) Page 218
More informationChapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in
Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column
More informationMatrices and Linear Algebra
Contents Quantitative methods for Economics and Business University of Ferrara Academic year 2017-2018 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2
More informationElementary Row Operations on Matrices
King Saud University September 17, 018 Table of contents 1 Definition A real matrix is a rectangular array whose entries are real numbers. These numbers are organized on rows and columns. An m n matrix
More information1 Last time: determinants
1 Last time: determinants Let n be a positive integer If A is an n n matrix, then its determinant is the number det A = Π(X, A)( 1) inv(x) X S n where S n is the set of n n permutation matrices Π(X, A)
More informationMATH 1210 Assignment 4 Solutions 16R-T1
MATH 1210 Assignment 4 Solutions 16R-T1 Attempt all questions and show all your work. Due November 13, 2015. 1. Prove using mathematical induction that for any n 2, and collection of n m m matrices A 1,
More informationReview Questions REVIEW QUESTIONS 71
REVIEW QUESTIONS 71 MATLAB, is [42]. For a comprehensive treatment of error analysis and perturbation theory for linear systems and many other problems in linear algebra, see [126, 241]. An overview of
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
More informationCS412: Lecture #17. Mridul Aanjaneya. March 19, 2015
CS: Lecture #7 Mridul Aanjaneya March 9, 5 Solving linear systems of equations Consider a lower triangular matrix L: l l l L = l 3 l 3 l 33 l n l nn A procedure similar to that for upper triangular systems
More informationFraction-Free Methods for Determinants
The University of Southern Mississippi The Aquila Digital Community Master's Theses 5-2011 Fraction-Free Methods for Determinants Deanna Richelle Leggett University of Southern Mississippi Follow this
More informationEquality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.
Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read
More informationLU Factorization. LU factorization is the most common way of solving linear systems! Ax = b LUx = b
AM 205: lecture 7 Last time: LU factorization Today s lecture: Cholesky factorization, timing, QR factorization Reminder: assignment 1 due at 5 PM on Friday September 22 LU Factorization LU factorization
More informationTrace Inequalities for a Block Hadamard Product
Filomat 32:1 2018), 285 292 https://doiorg/102298/fil1801285p Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Trace Inequalities for
More informationMODULE 7. where A is an m n real (or complex) matrix. 2) Let K(t, s) be a function of two variables which is continuous on the square [0, 1] [0, 1].
Topics: Linear operators MODULE 7 We are going to discuss functions = mappings = transformations = operators from one vector space V 1 into another vector space V 2. However, we shall restrict our sights
More informationApril 26, Applied mathematics PhD candidate, physics MA UC Berkeley. Lecture 4/26/2013. Jed Duersch. Spd matrices. Cholesky decomposition
Applied mathematics PhD candidate, physics MA UC Berkeley April 26, 2013 UCB 1/19 Symmetric positive-definite I Definition A symmetric matrix A R n n is positive definite iff x T Ax > 0 holds x 0 R n.
More informationThings we can already do with matrices. Unit II - Matrix arithmetic. Defining the matrix product. Things that fail in matrix arithmetic
Unit II - Matrix arithmetic matrix multiplication matrix inverses elementary matrices finding the inverse of a matrix determinants Unit II - Matrix arithmetic 1 Things we can already do with matrices equality
More informationVarious Proofs of Sylvester s (Determinant) Identity
Various Proofs of Sylvester s Determinant Identity IMACS Symposium SC 1993 Alkiviadis G Akritas, Evgenia K Akritas, University of Kansas Department of Computer Science Lawrence, KS 66045-2192, USA Genadii
More informationII. Determinant Functions
Supplemental Materials for EE203001 Students II Determinant Functions Chung-Chin Lu Department of Electrical Engineering National Tsing Hua University May 22, 2003 1 Three Axioms for a Determinant Function
More informationChapter 3. Determinants and Eigenvalues
Chapter 3. Determinants and Eigenvalues 3.1. Determinants With each square matrix we can associate a real number called the determinant of the matrix. Determinants have important applications to the theory
More informationDeterminants. Beifang Chen
Determinants Beifang Chen 1 Motivation Determinant is a function that each square real matrix A is assigned a real number, denoted det A, satisfying certain properties If A is a 3 3 matrix, writing A [u,
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationGraduate Mathematical Economics Lecture 1
Graduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 23, 2012 Outline 1 2 Course Outline ematical techniques used in graduate level economics courses Mathematics for Economists
More informationUndergraduate Mathematical Economics Lecture 1
Undergraduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 15, 2014 Outline 1 Courses Description and Requirement 2 Course Outline ematical techniques used in economics courses
More informationc 2009 Society for Industrial and Applied Mathematics
SIAM J MATRIX ANAL APPL Vol 30, No 4, pp 1761 1772 c 2009 Society for Industrial and Applied Mathematics INTERVAL GAUSSIAN ELIMINATION WITH PIVOT TIGHTENING JÜRGEN GARLOFF Abstract We present a method
More informationRoundoff Analysis of Gaussian Elimination
Jim Lambers MAT 60 Summer Session 2009-0 Lecture 5 Notes These notes correspond to Sections 33 and 34 in the text Roundoff Analysis of Gaussian Elimination In this section, we will perform a detailed error
More informationChapter 5: Matrices. Daniel Chan. Semester UNSW. Daniel Chan (UNSW) Chapter 5: Matrices Semester / 33
Chapter 5: Matrices Daniel Chan UNSW Semester 1 2018 Daniel Chan (UNSW) Chapter 5: Matrices Semester 1 2018 1 / 33 In this chapter Matrices were first introduced in the Chinese Nine Chapters on the Mathematical
More informationGeneralizations of Sylvester s determinantal identity
Generalizations of Sylvester s determinantal identity. Redivo Zaglia,.R. Russo Università degli Studi di Padova Dipartimento di atematica Pura ed Applicata Due Giorni di Algebra Lineare Numerica 6-7 arzo
More informationMatrices and systems of linear equations
Matrices and systems of linear equations Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T.
More informationLinear Algebraic Equations
Linear Algebraic Equations Linear Equations: a + a + a + a +... + a = c 11 1 12 2 13 3 14 4 1n n 1 a + a + a + a +... + a = c 21 2 2 23 3 24 4 2n n 2 a + a + a + a +... + a = c 31 1 32 2 33 3 34 4 3n n
More informationarxiv: v1 [cs.sc] 17 Apr 2013
EFFICIENT CALCULATION OF DETERMINANTS OF SYMBOLIC MATRICES WITH MANY VARIABLES TANYA KHOVANOVA 1 AND ZIV SCULLY 2 arxiv:1304.4691v1 [cs.sc] 17 Apr 2013 Abstract. Efficient matrix determinant calculations
More informationDeterminants - Uniqueness and Properties
Determinants - Uniqueness and Properties 2-2-2008 In order to show that there s only one determinant function on M(n, R), I m going to derive another formula for the determinant It involves permutations
More informationMatrix & Linear Algebra
Matrix & Linear Algebra Jamie Monogan University of Georgia For more information: http://monogan.myweb.uga.edu/teaching/mm/ Jamie Monogan (UGA) Matrix & Linear Algebra 1 / 84 Vectors Vectors Vector: A
More informationMATH 2030: MATRICES ,, a m1 a m2 a mn If the columns of A are the vectors a 1, a 2,...,a n ; A is represented as A 1. .
MATH 030: MATRICES Matrix Operations We have seen how matrices and the operations on them originated from our study of linear equations In this chapter we study matrices explicitely Definition 01 A matrix
More informationLinear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02)
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 206, v 202) Contents 2 Matrices and Systems of Linear Equations 2 Systems of Linear Equations 2 Elimination, Matrix Formulation
More informationLinear Algebra: Lecture notes from Kolman and Hill 9th edition.
Linear Algebra: Lecture notes from Kolman and Hill 9th edition Taylan Şengül March 20, 2019 Please let me know of any mistakes in these notes Contents Week 1 1 11 Systems of Linear Equations 1 12 Matrices
More informationTOPIC III LINEAR ALGEBRA
[1] Linear Equations TOPIC III LINEAR ALGEBRA (1) Case of Two Endogenous Variables 1) Linear vs. Nonlinear Equations Linear equation: ax + by = c, where a, b and c are constants. 2 Nonlinear equation:
More informationApplied Linear Algebra
Applied Linear Algebra Gábor P. Nagy and Viktor Vígh University of Szeged Bolyai Institute Winter 2014 1 / 262 Table of contents I 1 Introduction, review Complex numbers Vectors and matrices Determinants
More informationDifferential equations
Differential equations Math 7 Spring Practice problems for April Exam Problem Use the method of elimination to find the x-component of the general solution of x y = 6x 9x + y = x 6y 9y Soln: The system
More informationDeterminants. Recall that the 2 2 matrix a b c d. is invertible if
Determinants Recall that the 2 2 matrix a b c d is invertible if and only if the quantity ad bc is nonzero. Since this quantity helps to determine the invertibility of the matrix, we call it the determinant.
More informationThe Solution of Linear Systems AX = B
Chapter 2 The Solution of Linear Systems AX = B 21 Upper-triangular Linear Systems We will now develop the back-substitution algorithm, which is useful for solving a linear system of equations that has
More informationCS475: Linear Equations Gaussian Elimination LU Decomposition Wim Bohm Colorado State University
CS475: Linear Equations Gaussian Elimination LU Decomposition Wim Bohm Colorado State University Except as otherwise noted, the content of this presentation is licensed under the Creative Commons Attribution
More informationChapter 2. Solving Systems of Equations. 2.1 Gaussian elimination
Chapter 2 Solving Systems of Equations A large number of real life applications which are resolved through mathematical modeling will end up taking the form of the following very simple looking matrix
More informationMath 577 Assignment 7
Math 577 Assignment 7 Thanks for Yu Cao 1. Solution. The linear system being solved is Ax = 0, where A is a (n 1 (n 1 matrix such that 2 1 1 2 1 A =......... 1 2 1 1 2 and x = (U 1, U 2,, U n 1. By the
More informationMTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018)
MTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018) COURSEWORK 3 SOLUTIONS Exercise ( ) 1. (a) Write A = (a ij ) n n and B = (b ij ) n n. Since A and B are diagonal, we have a ij = 0 and
More information