This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: MATH1111/2008-09/Tutorial II Solution 1 Tutorial II Suggested Solution 1. Let A = ( a ij ) n × n be a square matrix of order n . The trace of A , denoted by tr( A ), is defined as tr( A ) = n X i =1 a ii = a 11 + a 22 + ··· + a nn . Given any two square matrices A = ( a ij ) n × n and B = ( b ij ) n × n of order n . Prove that (a) tr( A + B ) = tr( A ) + tr( B ), (b) tr( AB ) = tr( BA ), (c) tr( A T ) = tr( A ). Ans . Let A = ( a ij ) n × n and B = ( b ij ) n × n . Then, (a) tr( A + B ) = n X i =1 ( a ii + b ii ) = n X i =1 a ii + n X i =1 b ii = tr( A ) + tr( B ) . (b) tr( AB ) = n X i =1 n X r =1 a ir b ri and tr( BA ) = n X i =1 n X r =1 b ir a ri . Renaming the indices i and r , it is clear that they are equal. (c) Write A T = ( b ij ) n × n , then b ij = a ij . Now tr( A T ) = n X i =1 b ii = n X i =1 a ii = tr( A ) . MATH1111/2008-09/Tutorial II Solution 2 2. (a) Apply the type II and type III elementary row operations (i.e. no interchange of rows) to reduce A = 2- 6- 2- 1 3 3- 1 3 7 into row echelon form. (b) Hence find a lower triangular matrix L and an upper triangular matrix U such that A = LU . [See p.67 of textbook for the definition of upper and lower triangular matrices.] Ans ....
View Full Document
This note was uploaded on 09/06/2010 for the course MATH MATH1111 taught by Professor Forgot during the Fall '08 term at HKU.
- Fall '08