Characteristic Polynomial
|
|
- Archibald Hall
- 6 years ago
- Views:
Transcription
1 Linear Algebra Massoud Malek Characteristic Polynomial Preleminary Results Let A = (a ij ) be an n n matrix If Au = λu, then λ and u are called the eigenvalue and eigenvector of A, respectively The eigenvalues of A are the roots of the characteristic polynomial K A (λ) = det (λi n A) The eigenvectors are the solutions to the Homogeneous system (λi n A) X = θ Note that K A (λ) is a monic polynomial (ie, the leading coefficient is one) Cayley-Hamilton Theorem If K A (λ) = λ n + p λ n + + p n λ + p n is the characteristic polynomial of the n n matrix A, then where Z n is the n n zero matrix K A (A) = A n + p A n + + p n A + p n I n = Z n, Corollary Let K A (λ) = λ n + p λ n + + p n λ + p n be the characteristic polynomial of the n n invertible matrix A Then A = p n [ A n + p A n p n 2 A + p n I n ] Proof According to the Cayley Hamilton s theorem we have A [ A n + p A n p n I n ] = pn I n, Since A is nonsingular, p n = ( ) n det(a) ; thus the result follows Newton s Identity Let λ, λ 2,, λ n be the roots of the polynomial If s k = λ k + λ k λ k n, then P (λ) = λ n + c λ n + c 2 λ n c n λ + c n c k = k (s k + s k c + s k 2 c s 2 c k 2 c + s c k ) Proof From P (λ) = (λ λ )(λ λ 2 ) (λ λ n )(λ λ n ) and the use of logarithmic differentiation, we obtain P (λ) P (λ) = nλn + (n )c λ n c n 2 λ + c n n λ n + c λ n + c 2 λ n 2 = + + c n λ + c n (λ λ i ) By using the geometric series for Hence n i= (λ λ i ) i= and choosing λ > max i n λ i, we obtain (λ λ i ) = n λ + s λ 2 + s 2 λ 3 + nλ n + (n )c λ n c n = ( λ n + c λ n + c 2 λ n c n ) ( n λ + s λ 2 + s 2 λ 3 + ) By equating both sides of the above equality we may obtain the Newton s identities
2 Massoud Malek The Method of Direct Expansion Page 2 The Method of Direct Expansion The characteristic polynomial of an n n matrix A = (a ij ) is defined as: λ a a 2 a n a K A (λ)=det(λi n A)= 2 λ a 22 a 2n a n a n2 λ a nn where σ = n a ii = trace(a) i= is the sum of all first-order diagonal minors of A, σ 2 = a ii a ji i<j a ij a jj is the sum of all second-order diagonal minors of A, σ 3 = i<j<k a ii a ij a ik a ji a jj a jk a ki a kj a kk =λ n σ λ n +σ 2 λ n 2 + ( ) n σ n, is the sum of all third-order diagonal minors of A, and so forth Finally, σ n = det(a) There are ( n k) diagonal minors of order k in A From this we find that the direct computation of the coefficients of the characteristic polynomial of an n n matrix is equivalent to computing ( ) n + ( ) n + 2 ( ) n = 2 n n determinants of various orders, which, generally speaking, is a major task This has given rise to special methods for expanding characteristic polynomial We shall explain some of these methods Example Compute the characteristic polynomial of A = We have: σ = = 4, σ 2 = = ( 3) + (2) + ( ) = 2, 2 3 and σ 3 = det(a) = = 7 Thus K A (λ) = det(λi 3 A) = λ 3 σ λ 2 + σ 2 λ σ 3 = λ 3 4λ 2λ + 7
3 Massoud Malek Leverrier s Algorithm Page 3 Leverrier s Algorithm This method allows us to find the characteristic polynomial of any n n matrix A using the trace of the matrix A k, where k =, 2, n Let σ(a) = {λ, λ 2,, λ n } be the set of all eigenvalues of A which is also called the spectrum of A Note that Let s k = trace(a k ) = n λ k i, for all k =, 2,, n i= K A (λ) = det(λi n A) = λ n + p λ n + + p n λ + p n be the characteristic polynomial of the matrix A, then for k n, the Newton s identities hold true: p k = k [s k + p s k + + p k s ] (k =, 2,, n) 2 2 Example Let A = Then A = A = So s = 4, s 2 = 2, s 3 = 44, and s 4 = 36 Hence p = s = 4, Therefore p 2 = 2 (s 2 + p s ) = (2 + ( 4)4) = 2, 2 A 4 = p 3 = 3 (s 3 + p s 2 + p 2 s ) = ( 44 + ( 4)2 + 2(4)) = 28, p 4 = 4 (s 4 + p s 3 + p 2 s 2 + p 3 s ) = (36 + ( 4)( 44) + 2(2) + 28(4)) = 87 4 K A (λ) = λ 4 4λ 3 + 2λ λ 87 and A = [ A 3 4A 2 ] + 2A + 28I 4 = A =
4 Massoud Malek The Method of Souriau Page 4 The Method of Souriau (or Fadeev and Frame) This is an elegant modification of the Leverrier s method Let A be an n n matrix, then define Theorem B n = Z n, and A = A, q = trace(a ), B = A + q I n A 2 = AB, q 2 = 2 trace(a 2), B 2 = A 2 + q 2 I n A n = AB n, q n = n trace(a n), B n = A n + q n I n K A (λ) = det(λi n A) = λ n + q λ n + + q n λ + q n If A is nonsingular, then A = q n B n Proof Suppose the characteristic polynomial of A is K A (λ) = det(λi n A) = λ n + p λ n + + p n λ + p n, where p ks are defined in the Leverrier s method Clearly p = trace(a) = trace(a ) = q, and now suppose that we have proved that Then by the hypothesis we have q = p, q 2 = p 2,, q k = p k A k = AB k = A(A k + q k I n ) = AA k + q k A = A[A(A k 2 + q k 2 I n )] + q k A = A 2 A k + q k 2 A 2 + q k A = Let s i = trace(a i ) (i =, 2,, k), then by Newton s identities = A k + q A k + + q k A kq k = trace(a k ) = trace(a k ) + q trace(a k ) + + q k trace(a) = s k + q s k + + q k s = s k + p s k + + p k s = kp k showing that p k = q k Hence this relation holds for all k and so By the Cayley-Hamilton theorem, B n = A n + q A n + + q n A + q n I n = Z n B n = A n + q n I n = Z n ; A n = AB n = q n I n If A is nonsingular, then det(a) = ( ) n K A () = ( ) n q n, and thus A = q n B n
5 Massoud Malek The Method of Souriau Page 5 Example Find the characteristic polynomial and if possible the inverse of the matrix 2 2 A = For k =, 2, 3, 4, compute A k = AB k 2 2 A = A 2 = q k = k trace(a k), B k = A k + q k I 4, q = 4, B = , q 2 = 2, B 2 = ; A 3 =, q = 28, B 3 = ; A 4 =, q 87 4 = 87, B 4 = 87 Therefore the characteristic polynomial of A is: K A (λ) = λ 4 4λ 3 + 2λ λ 87 Note that A 4 is a diagonal matrix, so we only need to multiply the first row of A by the first column of B 3 to obtain 87 Since q 4 = 87, the matrix A has an inverse A = B 3 = q Matlab Program A = input( Enter a square matrix : ) m = size(a); n = m(); q = zeros(, n); B = A; AB = A; In = eye(n); for k = : n, q(k) = (/k) trace(ab)b = AB + q(k) In; AB = A B; end C = B; q(n) = (/n) trace(ab); Q = [ q]; disp( T he Characteristic polynomial looks like : ) disp( K A (x) = x n + q()x (n ) + + q(n )x + q(n) ), disp( ), disp( T he coefficients list c(k) is : ), disp( ), disp(q), disp( ) if q(n) ==, disp( T he matrix is singular ); else, disp( T he matrix has an inverse ), disp( ) C = (/q(n)) B; disp( T he inverse of A is : ), disp( ), disp(c) end ;
6 Massoud Malek The Method of Undetermined Coefficients Page 6 The Method of Undetermined Coefficients If one has to expand large numbers of characteristic polynomials of the same order, then the method of undetermined coefficients may be used to produce characteristic polynomials of those matrices Let A be an n n matrix and K A (λ) = det(λi n A) = λ n + p λ n + + p n λ + p n be its characteristic polynomial In order to find the coefficients p is of K A (λ) we evaluate D j = K A (j) = det(ji n A) j =,, 2,, n and obtain the following system of linear equations: Which can be changed into: p n = D n + p n + + p n = D 2 n + p 2 n + + p n = D 2 (n ) n + p (n ) n + + p n = D n n n 2 2 S n P = n 2 n 2 2 (n ) n (n ) n 2 n The system may be solved as follows: P = S n D p p 2 p n = D D n D 2 D 2 n D n D (n ) n = D Since the (n ) (n ) matrix S n depends only on the order of A, we may store R n, the inverse of S n beforehand and use it to find the coefficients of characteristic polynomial of various n n matrices Examples Compute the characteristic polynomials of the 4 4 matrices A = and B = First we find S = and R = S = Then for the matrix A we obtain D = det( A) = 48, D = det(i 4 A) = 72, D 2 = det(2i 4 A) = 28 and D 3 = det(3i 4 A) = 8 D = D D 4 D 2 D 2 4 = D 3 D
7 Massoud Malek The Method of Undetermined Coefficients Page 7 Hence Thus Hence Thus P = p p 2 = 2 p 3 For the matrix B we have Matlab Program K A (λ) = λ 4 23λ 2 2λ 48 D = det( B) = 87, D = det(i 4 B) = 6, = 23 2 D 2 = det(2i 4 B) = 39 and D 3 = det(3i 4 B) = 2 P = p p 2 = 2 p 3 D = D D 4 D 2 D 2 4 = D 3 D = 6 K B (λ) = λ 4 4λ 3 + 2λ λ N = input( Enter the size of your square matrix : ); n = N ; In = eye(n); S = zeros(n); R = zeros(n); D = zeros(, n); DSP = [ F or any, int2str(n), square matrix, you need S = ]; DSP 2 = [ Do you want to try with another, int2str(n), square matrix? (Y es = /No = ) ]; %DEF INING S for i = : n, for j = : n, S(i, j) = i (N j); end; end; disp( ), disp(dsp ), disp( ), disp(s), R = inv(s); ok = ; while ok == ; A = input([ Enteran, int2str(n), x, int2str(n), matrix A : ); disp( ) D = det(a); for k = : n; D(k) = det(k In A); end; for i = : n; DD(i) = D(i) D i N; end; P = R DD ; disp( T he Characteristic polynomial looks like : ) disp( K A (x) = x n + p()x (n ) + + p(n )x + p(n) ), disp( ), disp( T he coefficients list p(k) is : ), disp( ), disp([ P D]), disp( ), disp(dsp 2), disp( ), ok = input(dsp 2); end
8 Massoud Malek The Method of Danilevsky Page 8 The Method of Danilevsky Consider an n n matrix A and let K A (λ) = det(λi n A) = λ n + p λ n + + p n λ + p n be its characteristic polynomial Then the companion matrix of K A (λ) F [A] = p p 2 p 3 p n p n is similar to A and is called the Frobenius form of A The method of Danilevsky (937) applies the Gauss-Jordan method to obtain the Frobenius form of an n n matrix According to this method the transition from the matrix A to F [A] is done by means of n similarity transformations which successively transform the rows of A, beginning with the last, into corresponding rows of F [A] Let us illustrate the beginning of the process Our purpose is to carry the nth row of a a 2 a 3 a,n a n a 2 a 22 a 23 a 2,n a 2n a 3 a 32 a 33 a 3,n a 3n A = a n a n2 a n3 a n,n a nn into the row ( ) Assuming that a n,n, we replace the (n )th row of the n n identity matrix with the nth row of A and obtained the matrix The inverse of U n is U n = a n a n2 a n3 a n,n a nn V n = v n, v n,2 v n,3 v n,n v n,n where a ni v n,i = for i n a n,n and v n,n = a n,n
9 Massoud Malek The Method of Danilevsky Page 9 Multiplying the right side of A by V n, we obtain b b 2 b 3 b,n b n b 2 b 22 b 23 b 2,n b 2n AV n = B = b n, b n,2 b n,3 b n,n b n,n However the matrix B = AM n is not similar to A To have a similarity transformation, it is necessary to multiply the left side of B by U n = Vn Let C = U n AV n, then C is similar to A and is of the form c c 2 c 3 c,n c n b 2 b 22 b 23 b 2,n b 2n C = c n, c n,2 c n,3 c n,n c n,n Now, if c n,n, then similar operations are performed on matrix C by taking its (n 2)th row as the principal one We then obtain the matrix D = U n 2 CV n 2 = U n 2 U n AV n V n 2 with two reduced rows We continue the same way until we finally obtain the Frobenius form F [A] = U U 2 U n 2 U n AV n V n 2 V 2 V if, of course, all the n intermediate transformations are possible Exceptional case in the Danilevsky method Suppose that in the transformation of the matrix A into its Frobenius form F [A] we arrived, after a few steps, at a matrix of the form r r 2 r k r,n r n r 2 r 22 r 2k r 2,n r 2n r R = k r k2 r kk r k,n r kn and it was found that r k,k = or r k,k is very small It is then possible to continue the transformation by the Danilevsky method Two cases are possible here Case Suppose for some j =, 2,, k 2, r kj Then by permuting the jth row and (k )th row and the jth column and (k )th column of R we obtain a matrix R = (r ij ) similar to R with r k,k
10 Massoud Malek The Method of Danilevsky Page Case 2 Suppose now that r kj = for all j =, 2,, k 2 Then R is in the form r r 2 r,k r,k r,k+ r n r 2 r 22 r 2,k r 2,k r 2,k+ r 2n [ ] R R r R = 2 k, r k,2 r k,k r k,k r k,k+ r k,n = R 3 r kk r k,k+ r kn In this case the characteristic polynomial of R breaks up into two determinants: det(λi n R) = det(λi k R ) det(λi n k+ R 3 ) Here, the matrix R 3 is already reduced to the Frobenius form It remains to apply the Danilevsky s method to the matrix R Note Since U k A k only changes the kth row of A k, it is more efficient to multiply first A k by its (k + )th row and then multiply on the right side the resulting matrix by V k The next result shows that once we transform A into its Frobenius form ; we may obtain the eigenvectors with the help of the matrices V i s Theorem Let A be an n n matrix and let F [A] be its Frobenius form If λ is an eigenvalue of A, then v = λ n λ n 2 λ and are the eigenvectors of F [A] and A respectively Proof Since we have w = V n V n 2 V 2 V v det(λi n A) = det(λi n F [A] ) = λ n + p λ n + + p n λ + p n, λ p p 2 p 3 p n p n λ (λi n F [A])v = λ λ λ n λ n 2 λ n 3 λ = Since F [A] = V V 2 V n 2 V n AV n V n 2 V 2 V and F [A]v = λv, we conclude that λw = V n 2 V 2 V (λv) = (V n 2 V 2 V ) F [A]v = A (V n V n 2 V 2 V v) = Aw Note For expanding characteristic polynomials of matrices of order higher than fifth, the method of Danilevsky requires less multiplications and additions than other methods
11 Massoud Malek The Method of Danilevsky Page Example Reduce the matrix to its Frobenius form A = 2 The matrix B = A 3 = U 3 AV 3 is as follows: B = = 2 Since b 32 =, we need the permutation matrix J = ; thus C = JBJ = = Next we obtain the matrix D = A 2 = U 2 CV D = = Finally the Frobenius form F [A] = A = U DV, F [A] = = Thus the Characteristic polynomial of A is : Matlab Program K A (λ) = x 4 x 3 4x 2 2x 3 A = input( Enter the square matrix A : ); m = size(a); N = m(); b = []; B = zeros(n); i = ; while i < N, J = eye(n); h = A(N i +, N i) while h == ; c = A(N i +, : N i); z = norm(c, inf); if z = ; k = ; r = ; while r == & k < N i; r = r + c(n i k); k = k + ; J(N i, N i) = ; J(N i, N i k + ) = ; J(N i k +, N i k + ) = ; J(N i k +, N i) =,
12 Massoud Malek The Method of Krylov Page 2 A = J A J; k = k + ; end else b = conv(b, [ A(N i +, N i + : N)]); B = A( : N i, : N i); A = B, N = N i; end h = A(N i +, N i); end U = eye(n); V = eye(n); U(N i, :) = A(N i +, :); V (N i, :) = A(N i +, :)/A(N i +, N i); V (N i, N i) = /A(N i +, N i); A = U A V ; i = i + ; end; b = conv(b, [ A(N i +, N i + : N)]); disp( ), disp( T he Characteristic polynomial looks like : ), disp( ), disp([ K A (x) = x n + c()x (n ), + + c(n )x + c(n) ]), disp( ), disp( T he coefficients list c(k) is : ), disp( ), disp(b), disp( ) The Method of Krylov Let A be an n n matrix For any n-dimensional nonzero column vector v we associate its successive transforms v k = A k v (k =,, 2, ), this sequence of vectors is called the Krylov sequence associated to the matrix A and the vector v At most n vectors of the sequence v, v, v 2, will be linearly independent Suppose for some r = r(v) n, the vectors v, v, v 2,, v r are linearly independent and the vector v r+ is a linear combination of the preceding ones Hence there exists a monic polynomial such that φ(λ) = c + c λ + c 2 λ c r λ r + λ r φ(a)v = (c I n + c A + + c r A r + A r )v = c v + c v + + c r v r + c r v r+ = θ The polynomial φ(λ) is said to annihilate v and to be minimal for v If ω(λ) is another monic polynomial which annihilates v, ω(a)v =, then φ(λ) divides ω(λ) To show that; suppose ω(λ) = γ(λ)φ(λ) + ρ(λ), where ρ(λ) is the remainder after dividing ω by φ, hence of degree strictly less than r, it follows that ρ(a)v = But φ(λ) is minimal for v, hence ρ(λ) = Now of all vectors v there is at least one vector for which the degree v is maximal, since for any vector v, r(v) n We call such vector a maximal vector A monic polynomial µ A (λ) is said to be the minimal polynomial for A, if µ A (λ) is monic and of minimum degree satisfying φ(a) = Z n
13 Massoud Malek The Method of Krylov Page 3 Theorem Let A be an n n matrix and let φ(λ) be a minimal polynomial for a maximal vector v Then φ(λ) is the minimal polynomial for A Proof Consider any vector u such that u and v are linearly independent Let ψ(λ) be its minimal polynomial If ω is the lowest common multiple of φ and ψ, then ω annihilates every vector in the plane of u and v, since ω(a)(αu + βv) = αω(a)u + βω(a)v = θ Hence ω contains as a divisor the minimal polynomial of every vector in the plane But ω is of degree 2n at most, hence has only finitely many divisors Since there are infinitely many pairs of linearly independent vectors in the plane and finitely many divisors of ω, there is a pair of linearly independent vectors x and y in this plane with the same minimal polynomial This polynomial also annihilates v since v is on this plane Therefore φ is minimal for every vectors in the plane of u and v, and since u was any vector whatever, other than v, φ annihilates every n-dimensional vector Since φ annihilates every vector, it annihilates in particular every vector e i, hence φ(a)i = φ(a) = Z n Thus φ(λ) = µ A (λ) is the minimal polynomial for A If the minimal polynomial and the characteristic polynomial of a matrix are equal, then they may be found by the use of Krylov s sequence To produce the characteristic polynomial of A by Krylov method, first choose an arbitrary n-dimensional nonzero column vector v such as e, then use the Krylov sequence to define the matrix V = [v, Av, A 2 v,, An 2v, A n v] = [v, v, v 2, v n 2, v n ] If the matrix V has rank n, then the system V c = v n has a unique solution The monic polynomial c t = (c, c, c 2,, c n ) φ(λ) = c + c λ + c 2 λ c n λ n + λ n which annihilates v is the characteristic polynomial of A If the system V c = v n does not have a unique solution, then change the initial vector and try for example with e 2 Examples Compute the characteristic polynomials of the following matrices: 2 2 A = and B = Choosing the initial vector v = for both matrices, we obtain 7 V A = [v, Av, A 2 v, A v] = and V B = [v, Bv, B 2 v, B 3 v] = 4 5 9
14 Massoud Malek The Method of Krylov Page 4 The matrix V A is nonsingular, hence c A = V A A4 v = characteristic polynomial of A which is From c 2 A we obtain the 4 K A (λ) = λ + 2λ 2 4λ 3 + λ 4 The matrix V B is singular, so we need another initial vector such as v = The new matrix V B = is invertible, so c B = V 2 B A4 v = From the 8 2 solution c B we obtain the characteristic polynomial of B which is K B (λ) = 9 2λ λ 2 + 2λ 3 + λ 4 Remark The minimal polynomial and the characteristic polynomial of the matrix A = are m A (λ) = λ 3 3λ 2 7λ and K A (λ) = λ 4 3λ 3 7λ 2, respectively Therefore by choosing any initial vector v, the matrix V A = [v, Av, A 2 v, A 3 v] will always be singular This means that the Krylov sequence will never produce the characteristic polynomial K A (λ) Matlab Program A = input( Enter a square matrix A : ); m = size(a); n = m(); V = zeros(n, n); DL = [ Enter an initial, int2str(n), dimensional row vector v = ]; v = input(dl); z = ; k = ; while z == & k < 5 w = v; V (:, ) = w; for i = 2 : n, w = A w; V (:, i) = w; end, if det(v ) = ; k = 8; c = inv(v ) A w; else while k < 5 v = input( T he matrix V is singular, please enter another initial row vector v : ); k = k + ; end; end; z = det(v ); end; if k == 5; disp( Sorry, the Krylov method is not suited for this matrix ), disp( ), else; disp( T he Characteristic polynomial looks like : ), disp( ), disp([ K A (x) = c() + C()x + c(2)x c(n )x (n ) + x n ]), disp( ), disp( T he coefficients list c(k) is : ), disp( ), disp([c, ]) end;
Jordan Canonical Form
Jordan Canonical Form Massoud Malek Jordan normal form or Jordan canonical form (named in honor of Camille Jordan) shows that by changing the basis, a given square matrix M can be transformed into a certain
More informationCayley-Hamilton Theorem
Cayley-Hamilton Theorem Massoud Malek In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n Let A be an n n matrix Although det (λ I n A
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More informationSolving Homogeneous Systems with Sub-matrices
Pure Mathematical Sciences, Vol 7, 218, no 1, 11-18 HIKARI Ltd, wwwm-hikaricom https://doiorg/112988/pms218843 Solving Homogeneous Systems with Sub-matrices Massoud Malek Mathematics, California State
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 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 informationAN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim
More informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
More informationMATHEMATICS 217 NOTES
MATHEMATICS 27 NOTES PART I THE JORDAN CANONICAL FORM The characteristic polynomial of an n n matrix A is the polynomial χ A (λ) = det(λi A), a monic polynomial of degree n; a monic polynomial in the variable
More informationNONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction
NONCOMMUTATIVE POLYNOMIAL EQUATIONS Edward S Letzter Introduction My aim in these notes is twofold: First, to briefly review some linear algebra Second, to provide you with some new tools and techniques
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationTherefore, A and B have the same characteristic polynomial and hence, the same eigenvalues.
Similar Matrices and Diagonalization Page 1 Theorem If A and B are n n matrices, which are similar, then they have the same characteristic equation and hence the same eigenvalues. Proof Let A and B be
More informationDiagonalizing Matrices
Diagonalizing Matrices Massoud Malek A A Let A = A k be an n n non-singular matrix and let B = A = [B, B,, B k,, B n ] Then A n A B = A A 0 0 A k [B, B,, B k,, B n ] = 0 0 = I n 0 A n Notice that A i B
More informationChapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors
Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there
More informationMAT 2037 LINEAR ALGEBRA I web:
MAT 237 LINEAR ALGEBRA I 2625 Dokuz Eylül University, Faculty of Science, Department of Mathematics web: Instructor: Engin Mermut http://kisideuedutr/enginmermut/ HOMEWORK 2 MATRIX ALGEBRA Textbook: Linear
More informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationLinear Algebra Primer
Linear Algebra Primer David Doria daviddoria@gmail.com Wednesday 3 rd December, 2008 Contents Why is it called Linear Algebra? 4 2 What is a Matrix? 4 2. Input and Output.....................................
More information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
More informationELE/MCE 503 Linear Algebra Facts Fall 2018
ELE/MCE 503 Linear Algebra Facts Fall 2018 Fact N.1 A set of vectors is linearly independent if and only if none of the vectors in the set can be written as a linear combination of the others. Fact N.2
More information4. Determinants.
4. Determinants 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 2 2 determinant 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 3 3 determinant 4.1.
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 informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationLinear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.
Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the
More informationMATH 583A REVIEW SESSION #1
MATH 583A REVIEW SESSION #1 BOJAN DURICKOVIC 1. Vector Spaces Very quick review of the basic linear algebra concepts (see any linear algebra textbook): (finite dimensional) vector space (or linear space),
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 informationEigenvalues, Eigenvectors. Eigenvalues and eigenvector will be fundamentally related to the nature of the solutions of state space systems.
Chapter 3 Linear Algebra In this Chapter we provide a review of some basic concepts from Linear Algebra which will be required in order to compute solutions of LTI systems in state space form, discuss
More informationELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS. 1. Linear Equations and Matrices
ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS KOLMAN & HILL NOTES BY OTTO MUTZBAUER 11 Systems of Linear Equations 1 Linear Equations and Matrices Numbers in our context are either real numbers or complex
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 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 informationLetting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc.
1 Polynomial Matrices 1.1 Polynomials Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc., n ws ( ) as a
More information1 Matrices and Systems of Linear Equations. a 1n a 2n
March 31, 2013 16-1 16. Systems of Linear Equations 1 Matrices and Systems of Linear Equations An m n matrix is an array A = (a ij ) of the form a 11 a 21 a m1 a 1n a 2n... a mn where each a ij is a real
More information1. Linear systems of equations. Chapters 7-8: Linear Algebra. Solution(s) of a linear system of equations (continued)
1 A linear system of equations of the form Sections 75, 78 & 81 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 a m1 x 1 + a m2 x 2 + + a mn x n = b m can be written in matrix
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 informationEigenvalues and Eigenvectors. Review: Invertibility. Eigenvalues and Eigenvectors. The Finite Dimensional Case. January 18, 2018
January 18, 2018 Contents 1 2 3 4 Review 1 We looked at general determinant functions proved that they are all multiples of a special one, called det f (A) = f (I n ) det A. Review 1 We looked at general
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 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 information1 Matrices and Systems of Linear Equations
March 3, 203 6-6. Systems of Linear Equations Matrices and Systems of Linear Equations An m n matrix is an array A = a ij of the form a a n a 2 a 2n... a m a mn where each a ij is a real or complex number.
More informationSTAT200C: Review of Linear Algebra
Stat200C Instructor: Zhaoxia Yu STAT200C: Review of Linear Algebra 1 Review of Linear Algebra 1.1 Vector Spaces, Rank, Trace, and Linear Equations 1.1.1 Rank and Vector Spaces Definition A vector whose
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 informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationand let s calculate the image of some vectors under the transformation T.
Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) =
More informationLinear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.
Linear Algebra M1 - FIB Contents: 5 Matrices, systems of linear equations and determinants 6 Vector space 7 Linear maps 8 Diagonalization Anna de Mier Montserrat Maureso Dept Matemàtica Aplicada II Translation:
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More information1 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 informationApplied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit V: Eigenvalue Problems Lecturer: Dr. David Knezevic Unit V: Eigenvalue Problems Chapter V.2: Fundamentals 2 / 31 Eigenvalues and Eigenvectors Eigenvalues and eigenvectors of
More informationEigenpairs and Diagonalizability Math 401, Spring 2010, Professor David Levermore
Eigenpairs and Diagonalizability Math 40, Spring 200, Professor David Levermore Eigenpairs Let A be an n n matrix A number λ possibly complex even when A is real is an eigenvalue of A if there exists a
More informationTopic 1: Matrix diagonalization
Topic : Matrix diagonalization Review of Matrices and Determinants Definition A matrix is a rectangular array of real numbers a a a m a A = a a m a n a n a nm The matrix is said to be of order n m if it
More informationIntroduction to Matrix Algebra
Introduction to Matrix Algebra August 18, 2010 1 Vectors 1.1 Notations A p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the line. When p
More informationReview of Linear Algebra
Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=
More informationSolution. That ϕ W is a linear map W W follows from the definition of subspace. The map ϕ is ϕ(v + W ) = ϕ(v) + W, which is well-defined since
MAS 5312 Section 2779 Introduction to Algebra 2 Solutions to Selected Problems, Chapters 11 13 11.2.9 Given a linear ϕ : V V such that ϕ(w ) W, show ϕ induces linear ϕ W : W W and ϕ : V/W V/W : Solution.
More informationProblem Set 9 Due: In class Tuesday, Nov. 27 Late papers will be accepted until 12:00 on Thursday (at the beginning of class).
Math 3, Fall Jerry L. Kazdan Problem Set 9 Due In class Tuesday, Nov. 7 Late papers will be accepted until on Thursday (at the beginning of class).. Suppose that is an eigenvalue of an n n matrix A and
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 16: Eigenvalue Problems; Similarity Transformations Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical Analysis I 1 / 18 Eigenvalue
More informationCheat Sheet for MATH461
Cheat Sheet for MATH46 Here is the stuff you really need to remember for the exams Linear systems Ax = b Problem: We consider a linear system of m equations for n unknowns x,,x n : For a given matrix A
More informationChapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations
Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2
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 informationReview of Vectors and Matrices
A P P E N D I X D Review of Vectors and Matrices D. VECTORS D.. Definition of a Vector Let p, p, Á, p n be any n real numbers and P an ordered set of these real numbers that is, P = p, p, Á, p n Then P
More informationa 11 a 12 a 11 a 12 a 13 a 21 a 22 a 23 . a 31 a 32 a 33 a 12 a 21 a 23 a 31 a = = = = 12
24 8 Matrices Determinant of 2 2 matrix Given a 2 2 matrix [ ] a a A = 2 a 2 a 22 the real number a a 22 a 2 a 2 is determinant and denoted by det(a) = a a 2 a 2 a 22 Example 8 Find determinant of 2 2
More informationNumerical Analysis: Solving Systems of Linear Equations
Numerical Analysis: Solving Systems of Linear Equations Mirko Navara http://cmpfelkcvutcz/ navara/ Center for Machine Perception, Department of Cybernetics, FEE, CTU Karlovo náměstí, building G, office
More informationEigenvalues and Eigenvectors
Eigenvalues and Eigenvectors week -2 Fall 26 Eigenvalues and eigenvectors The most simple linear transformation from R n to R n may be the transformation of the form: T (x,,, x n ) (λ x, λ 2,, λ n x n
More informationLinear Algebra Review. Vectors
Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors
More informationReview of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem
Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem Steven J. Miller June 19, 2004 Abstract Matrices can be thought of as rectangular (often square) arrays of numbers, or as
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More information3 (Maths) Linear Algebra
3 (Maths) Linear Algebra References: Simon and Blume, chapters 6 to 11, 16 and 23; Pemberton and Rau, chapters 11 to 13 and 25; Sundaram, sections 1.3 and 1.5. The methods and concepts of linear algebra
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
More informationStudy Guide for Linear Algebra Exam 2
Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real
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 informationEigenvalues and Eigenvectors
Contents Eigenvalues and Eigenvectors. Basic Concepts. Applications of Eigenvalues and Eigenvectors 8.3 Repeated Eigenvalues and Symmetric Matrices 3.4 Numerical Determination of Eigenvalues and Eigenvectors
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationMATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018
Homework #1 Assigned: August 20, 2018 Review the following subjects involving systems of equations and matrices from Calculus II. Linear systems of equations Converting systems to matrix form Pivot entry
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x
More informationCalculating determinants for larger matrices
Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det
More informationSolving Linear Systems of Equations
November 6, 2013 Introduction The type of problems that we have to solve are: Solve the system: A x = B, where a 11 a 1N a 12 a 2N A =.. a 1N a NN x = x 1 x 2. x N B = b 1 b 2. b N To find A 1 (inverse
More informationLinear Algebra Highlights
Linear Algebra Highlights Chapter 1 A linear equation in n variables is of the form a 1 x 1 + a 2 x 2 + + a n x n. We can have m equations in n variables, a system of linear equations, which we want to
More informationKnowledge Discovery and Data Mining 1 (VO) ( )
Knowledge Discovery and Data Mining 1 (VO) (707.003) Review of Linear Algebra Denis Helic KTI, TU Graz Oct 9, 2014 Denis Helic (KTI, TU Graz) KDDM1 Oct 9, 2014 1 / 74 Big picture: KDDM Probability Theory
More informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an
More information18.S34 linear algebra problems (2007)
18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - (Alberto Bressan, Spring 7) sec: Orthogonal diagonalization of symmetric matrices When we seek to diagonalize a general n n matrix A, two difficulties may arise:
More informationChap 3. Linear Algebra
Chap 3. Linear Algebra Outlines 1. Introduction 2. Basis, Representation, and Orthonormalization 3. Linear Algebraic Equations 4. Similarity Transformation 5. Diagonal Form and Jordan Form 6. Functions
More informationWhat s Eigenanalysis? Matrix eigenanalysis is a computational theory for the matrix equation
Eigenanalysis What s Eigenanalysis? Fourier s Eigenanalysis Model is a Replacement Process Powers and Fourier s Model Differential Equations and Fourier s Model Fourier s Model Illustrated What is Eigenanalysis?
More informationSystems of Second Order Differential Equations Cayley-Hamilton-Ziebur
Systems of Second Order Differential Equations Cayley-Hamilton-Ziebur Characteristic Equation Cayley-Hamilton Cayley-Hamilton Theorem An Example Euler s Substitution for u = A u The Cayley-Hamilton-Ziebur
More informationRemark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 5 Eigenvectors and Eigenvalues In this chapter, vector means column vector Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called
More informationEngineering Computation
Engineering Computation Systems of Linear Equations_1 1 Learning Objectives for Lecture 1. Motivate Study of Systems of Equations and particularly Systems of Linear Equations. Review steps of Gaussian
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - 4 (Alberto Bressan, Spring 27) Review of complex numbers In this chapter we shall need to work with complex numbers z C These can be written in the form z = a+ib,
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationECEN 605 LINEAR SYSTEMS. Lecture 7 Solution of State Equations 1/77
1/77 ECEN 605 LINEAR SYSTEMS Lecture 7 Solution of State Equations Solution of State Space Equations Recall from the previous Lecture note, for a system: ẋ(t) = A x(t) + B u(t) y(t) = C x(t) + D u(t),
More informationLinear Algebra Methods for Data Mining
Linear Algebra Methods for Data Mining Saara Hyvönen, Saara.Hyvonen@cs.helsinki.fi Spring 2007 1. Basic Linear Algebra Linear Algebra Methods for Data Mining, Spring 2007, University of Helsinki Example
More informationLinear Algebra: Lecture Notes. Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway
Linear Algebra: Lecture Notes Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway November 6, 23 Contents Systems of Linear Equations 2 Introduction 2 2 Elementary Row
More informationUnit 5: Matrix diagonalization
Unit 5: Matrix diagonalization Juan Luis Melero and Eduardo Eyras October 2018 1 Contents 1 Matrix diagonalization 3 1.1 Definitions............................. 3 1.1.1 Similar matrix.......................
More informationEE263: Introduction to Linear Dynamical Systems Review Session 5
EE263: Introduction to Linear Dynamical Systems Review Session 5 Outline eigenvalues and eigenvectors diagonalization matrix exponential EE263 RS5 1 Eigenvalues and eigenvectors we say that λ C is an eigenvalue
More informationLinear Algebra Practice Final
. Let (a) First, Linear Algebra Practice Final Summer 3 3 A = 5 3 3 rref([a ) = 5 so if we let x 5 = t, then x 4 = t, x 3 =, x = t, and x = t, so that t t x = t = t t whence ker A = span(,,,, ) and a basis
More informationEigenvalue and Eigenvector Problems
Eigenvalue and Eigenvector Problems An attempt to introduce eigenproblems Radu Trîmbiţaş Babeş-Bolyai University April 8, 2009 Radu Trîmbiţaş ( Babeş-Bolyai University) Eigenvalue and Eigenvector Problems
More informationChapter 4. Matrices and Matrix Rings
Chapter 4 Matrices and Matrix Rings We first consider matrices in full generality, i.e., over an arbitrary ring R. However, after the first few pages, it will be assumed that R is commutative. The topics,
More informationRemark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 6 Eigenvalues and Eigenvectors Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called an eigenvalue of A if there is a nontrivial
More informationLinear Algebra. Workbook
Linear Algebra Workbook Paul Yiu Department of Mathematics Florida Atlantic University Last Update: November 21 Student: Fall 2011 Checklist Name: A B C D E F F G H I J 1 2 3 4 5 6 7 8 9 10 xxx xxx xxx
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More informationPractical Linear Algebra: A Geometry Toolbox
Practical Linear Algebra: A Geometry Toolbox Third edition Chapter 12: Gauss for Linear Systems Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/pla
More information(f + g)(s) = f(s) + g(s) for f, g V, s S (cf)(s) = cf(s) for c F, f V, s S
1 Vector spaces 1.1 Definition (Vector space) Let V be a set with a binary operation +, F a field, and (c, v) cv be a mapping from F V into V. Then V is called a vector space over F (or a linear space
More information