More calculations on determinant evaluations
|
|
- Brent Washington
- 6 years ago
- Views:
Transcription
1 Electronic Journal of Linear Algebra Volume 16 Article 007 More calculations on determinant evaluations A. R. Moghaddamfar S. M. H. Pooya S. Navid Salehy S. Nima Salehy Follow this and additional works at: Recommended Citation Moghaddamfar, A. R.; Pooya, S. M. H.; Salehy, S. Navid; and Salehy, S. Nima. (007), "More calculations on determinant evaluations", Electronic Journal of Linear Algebra, Volume 16. DOI: This Article is brought to you for free and open access by Wyoming Scholars Repository. It has been accepted for inclusion in Electronic Journal of Linear Algebra by an authorized editor of Wyoming Scholars Repository. For more information, please contact
2 MORE CALCULATIONS ON DETERMINANT EVALUATIONS A. R. MOGHADDAMFAR, S. M. H. POOYA, S. NAVID SALEHY, AND S. NIMA SALEHY Abstract. The purpose of this article is to prove several evaluations of determinants of matrices, the entries of which are given by the recurrence a i,j = a i 1,j 1 +a i 1,j, i, j, with various choices for the first row a 1,j and first column a i,1. Key words. Determinant, Matrix factorization, Recurrence relation. AMS subject classifications. 15A15, 11C0. 1. Introduction. Determinants have played a significant part in various areas in mathematics. For instance, they are quite useful in the analysis and solution of systems of linear equations. There are different perspectives on the study of determinants. One may notice several practical and effective instruments for calculating determinants in the nice survey articles [3]and [4]. Much attention has been paid to the symbolic evaluation of determinants of matrices, especially when their entries are given recursively (see Section 5.6 in [4]). Toward these matrices one usually introduces the first row and column as initial conditions for a recurrence relation used for constructing the other entries. Both this relation and the initial conditions play an important part in constructing the matrix, as well as in evaluating its determinant. Several relevant studies on evaluating determinants can be found in the literature; e.g., see [1,, 5, 7]. In this article we are interested in the sequences of determinants of matrices satisfying the recurrence relation a i,j = a i 1,j 1 + a i 1,j for i, j n, with various choices for the first row a 1,j and first column a i,1. To state our results we need to introduce some notation. The Fibonacci numbers F (n) satisfy { F (0) = 0, F (1) = 1 F (n +)=F (n +1)+F (n) (n 0). Throughout this article, we also use the following notation: Received by the editors 15 September 006. Accepted for publication 8 December 006. Handling Editor: Michael Neumann. Department of Mathematics, Faculty of Science, K. N. Toosi University of Technology, P.O. Box , Tehran, Iran. First author also affiliated with Institute for Studies in Theoretical Physics and Mathematics (IPM) (moghadam@kntu.ac.ir, moghadam@ipm.ir). This research was in part supported by a grant from IPM (No ). 19
3 0 A.R.Moghaddamfar,S.M.H.Pooya,S.NavidSalehy,andS.NimaSalehy ω k (n) =(ωi k) 1 i n =(1, 1,...,1, 0, 0,...,0, 1, 1,...,1), }{{}}{{}}{{} k times (n k) times k times ϖ k (n) =(ϖi k) 1 i n =(1, 1,...,1, 0, 0,...,0), }{{} (n k) times } {{ } k times χ k =(χ k i ) i 1 =(a,a,...,a, 0, 0, 0,...), }{{} k times ϑ k =(ϑ k i ) i 1 =(a, 0, 0,...,0,a,0, 0, 0,...). } {{ } k times Given a matrix A we denote by R i (A) andc j (A) therowi and the column j of A, respectively. We denote by e i,j the square matrix having 1 in the (i, j) position and 0 elsewhere. Now, it is easy to see that e i,j e k,l = δ jk e i,l. (1.1) In the case that the two matrices e i,j and A are to be multiplied together, we obtain R k (e i,j A) =δ ki R j (A) and C k (A e i,j )=δ kj C i (A). (1.) In fact, the matrix e i,j A is a matrix that all its rows except for the ith row are 0 and its ith row is the jth row of the matrix A. Similarly, the matrix A e i,j is a matrix that all its columns except for the jth column are 0 and its jth column is the ith column of the matrix A.. Main Results. Theorem.1. Let α =(α i ) i 1 be a given sequence and let A =(a i,j ) 1 i,j n be the doubly indexed sequence given by the recurrence a i,j = a i 1,j 1 + a i 1,j, i, j n, (.1) and the initial conditions a i,1 = α 1 +(i 1)d, a 1,j = α j, 1 i, j n. Then we have A = L B, wherel =(L i,j ) 1 i,j n is a lower triangular matrix given by the recurrence L i,j = L i 1,j 1 + L i 1,j, i, j n, (.) and the initial conditions L 1,1 =1, L 1,j =0, j n, andl i,1 =1, i n, and B =(B i,j ) 1 i,j n is a matrix given by the recurrence B i,j = B i 1,j 1, i, j n, (.3) and the initial conditions B 1,j = α j, 1 j n, B,1 = d and B i,1 =0, 3 i n. Note that B is a Hessenberg-Töplitz matrix. In particular, det(a) =det(b). Proof. For the proof of the claimed factorization we compute the (i, j) entry of L B, thatis (L B) i,j = n L i,k B k,j. k=1
4 More Calculations on Determinant Evaluations 1 In fact, so as to prove the theorem, we should establish R 1 (L B) =R 1 (A) =(α 1, α,..., α n ), and C 1 (L B) =C 1 (A) =(α 1, α 1 + d,..., α 1 +(n 1)d), (L B) i,j =(L B) i 1,j 1 +(L B) i 1,j, (.4) for i, j n. Let us do the required calculations. First, suppose that i =1. Then (L B) 1,j = n L 1,k B k,j = L 1,1 B 1,j = α j, k=1 and so R 1 (L B) =R 1 (A) =(α 1, α,..., α n ). Next, we suppose that j =1,andweobtain (L B) i,1 = n L i,k B k,1 = L i,1 B 1,1 + L i, B,1 = α 1 +(i 1)d, k=1 which implies that C 1 (L B) =C 1 (A) =(α 1,α 1 + d,..., α 1 +(n 1)d). Finally, we must establish Eq. (.4). At the moment, let us assume that i, j n. Inthiscasewehave (L B) i,j = P n k=1 L i,kb k,j = L i,1b 1,j + P n k= L i,kb k,j = L i,1b 1,j + P n k= (L i 1,k 1 + L i 1,k )B k,j (by (.)) = L i,1b 1,j + P n k= L i 1,k 1B k,j + P n k= L i 1,kB k,j = L i,1b 1,j + P n k= L i 1,k 1B k 1,j 1 + P n k=1 L i 1,kB k,j L i 1,1B 1,j (by (.3)) = (L i,1 L i 1,1)B 1,j + P n k=1 L i 1,kB k,j 1 + P n k=1 L i 1,kB k,j (it should be noticed that L i 1,n =0) = (L B) i 1,j 1 +(L B) i 1,j, which is Eq. (.4). Our proof is thus complete. An interesting corollary to Theorem.1 is the following. Corollary.. In Theorem.1, ifα = ω k (n), d =1and D(n) =det(a), then Furthermore, we have D(n) =( 1) k+1 D(n k 1), (n >3k). (.5)
5 A.R.Moghaddamfar,S.M.H.Pooya,S.NavidSalehy,andS.NimaSalehy (1) if k =,then D(n) = (resp. ) if n 6 0(resp. 3) 0 if n 6 1, 4 1(resp. 1) if n 6 (resp. 5) () if k 3 is even, then 1 if n k+ 0, 1, D(n) = 1 if n k +1,k+, 0 otherwise. Also, if k 3 is odd, then { D(n) = 1 if n k+1 0, 1 0 otherwise. Proof. Using Theorem.1, D(n) =det(b) whereb =(B i,j ) 1 i,j n is a matrix given by the recurrence B i,j = B i 1,j 1, i, j n, and the initial conditions B 1,j = ω k j,1 j n, B,1 =1andB i,1 =0,3 i n. To obtain the result we thus need to compute det(b). Put B = B k (n). We claim that B = U B L, where the matrices U =(U i,j ) 1 i,j n, B =( Bi,j ) 1 i,j n,andl =(L i,j ) 1 i,j n are defined as follows: 1 if i = j, U i,j = 1 if j = i + n k, 1 i k, 0 otherwise, 1 if 1 i k and n k + i 1 j n k + i 1, B i,j = L i,j = 0 if (i, j) =(n k, n k 1), B i,j otherwise, 1 if i = j or (i, j) =(n 1,n k 1), 1 if (i, j) =(n, n k 1), 0 otherwise. It is obvious that, the matrices U and L are the upper triangular matrix and lower triangular one, respectively, with 1 s on their diagonals. In addition, we can restate the matrices U and L as follows: U = I k e i,n k+i and L = I + e n 1,n k+1 e n,n k 1. i=1
6 More Calculations on Determinant Evaluations 3 Moreover, we can partition the matrix B in this way [ ] B1 B =, 0 B where B 1 = B k (n k 1), and B = Since det(b )=( 1) k+1, it is obvious that the claimed factorization of B immediately implies the validity of Eq. (.5). For the proof of the claim, we observe that U B L = (I k i=1 e i,n k+i) B (I + e n 1,n k 1 e n,n k 1 ) = ( B k i=1 e i,n k+i B) (I + e n 1,n k 1 e n,n k 1 ) = (B e n 1,n k 1 + e k,n k 1 ) (I + e n 1,n k 1 e n,n k 1 ) = B + B e n 1,n k 1 B e n,n k 1 e n 1,n k 1 + e k,n k 1 (by (1.1)). Thus, it is enough to show that B e n 1,n k 1 B e n,n k 1 e n 1,n k 1 +e k,n k 1 = 0. To see this, from Eq. (1.), we obtain C l (B e n 1,n k 1 )=δ l,n k 1 C n 1 (B) and C l (B e n,n k 1 )=δ l,n k 1 C n (B), for l =1,,...,n. Hence, by the structure of B, it follows that B e n 1,n k 1 B e n,n k 1 = e n 1,n k 1 e k,n k 1. The rest of the proof is simple and left to the reader. Second Proof of Corollary.. Here, we compute det(b) directly. We will assume that k>1, since the case k =1iseasy. PutR i =R i (B) andc j =C j (B). We first subtract C 1 from C through C k and from C n k+ through C n. Then we subtract R from R 1. So this leaves us with a matrix B 1 = where the boxed entries 1 and 1 are in positions (1,k+1)and(1,n k +1) respectively, and the part is unchanged from B. The goal now is to push the,
7 4 A.R.Moghaddamfar,S.M.H.Pooya,S.NavidSalehy,andS.NimaSalehy entries 1 and 1 all the way to position (1,n), with no other changes in the matrix. Let us first deal with 1. Unlessk =, we can get rid of it by replacing R 1 R 1 + R n k+1 R n k+. If k =,wemaker 1 R 1 R n and we then have 1at(1,n). Next we treat 1. Wecanmoveitk + 1 positions to the right by doing R 1 R 1 + R k+ R k+3. We can repeatedly move it to the right k + 1 places by adding and subtracting the appropriate consecutive rows. This is done until we are at (1,r)forr>n k. There are three cases: (i) If n 0(modk + 1), we bring the 1 to (1,n). (ii) If n 1(modk+1), then 1 is brought to (1,n 1) and then R 1 R 1 +R n brings it to (1,n) by changing sign. (iii) Otherwise we bring 1 to (1,r)forn k<r<n 1andthenwemake it disappear by R 1 R 1 + R r+1 R r+. At this point we have the matrix B = c , where c = a n + b n for a n = { 1 k = 0 k> and b n = 1 n 0 (mod k +1) 1 n 1 (mod k +1) 0 otherwise. Expanding det(b ) by the first row we see that det(b) =det(b )=( 1) n 1 c,and the corollary follows from here immediately. Corollary.3. Suppose that in Theorem.1, D(n) =det(a). Then (i) If α = χ k,then D(n) =a k ( d) i 1 D(n i), n k +1. i=1 In particular, in case that k =and a =1, we have D(n) = 1 [( 1+η ) n+1 ( 1 η ) n+1 ]. η where η = 1 4d. (ii) If α = ϖ k (n) and d =1, then we have ( 1) n if n 0(modn k +1), det(a) = ( 1) n+1 if n 1(modn k +1), 0 otherwise. (iii) If α = ϑ k,then a n if 1 n k +1, D(n) = a n +( 1) n 1 ad n 1 if n = k +, ad(n 1) + a( d) k+1 D(n k ) if n k +3.
8 More Calculations on Determinant Evaluations 5 Proof. First of all, by Theorem.1, D(n) =det(b) whereb =(B i,j ) 1 i,j n is a matrix given by the recurrence B i,j = B i 1,j 1, i, j n, and the initial conditions B 1,j = α j,1 j n, B,1 = d and B i,1 =0,3 i n. (i). Suppose α = χ k. If we expand the determinant det(b) alongthefirstrow, then the (1,j) cofactor is of the form det(di j 1 B n j ), where B n j equals the principal submatrix of B taking the first n j rows and columns. Now, we easily get the desired recursion, that is D(n) =a k ( d) i 1 D(n i), n k +1. i=1 Now, assume k =anda = 1. In this case, we have D(1) = 1, D() = 1 d, and D(n) =D(n 1) dd(n ), n 3. To solve this recurrence relation, we see that its characteristic equation as follows x x + d =0, and its characteristic roots are x 1 = 1 η and x = 1+η, where η = 1 4d. Therefore, the general solution is given by D(n) =λ 1 ( 1 η ) n ( 1+η ) n, + λ (.6) where λ 1 and λ are constants. The initial conditions D(1) = 1 and D() = 1 d imply that λ 1 = 1 η ( 1 η )andλ = 1 η ( 1+η ), and so D(n) = 1 η [( 1+η ) n+1 ( 1 η ) n+1 ]. (ii). Assume α = ϖ k (n) andd = 1. We put n k = p. Similar arguments as in part (i) withk replaced by p, show that and D(1) = 1, D() = D(3) = = D(p) =0, D(n) = p ( 1) i+1 D(n i), n p +1. i=1
9 6 A.R.Moghaddamfar,S.M.H.Pooya,S.NavidSalehy,andS.NimaSalehy Hence, we observe that D(m + p +1) = p i=1 ( 1)i+1 D(m + p +1 i) = D(m + p)+ p i= ( 1)i+1 D(m + p +1 i) = p i=1 ( 1)i+1 D(m + p i)+ p i= ( 1)i+1 D(m + p +1 i) = ( 1) p+1 D(m), (m 1). (.7) Now, using the division algorithm we find integers r and s such that n = s(p +1)+r, and 0 r<p+1. First, assume that r = 0. In this case, from Eq. (.7) we obtain D(n) =D(s(p +1))=( 1) (s 1)(p+1) D(p +1)=( 1) (s 1)(p+1) ( 1) (p+1) =( 1) n. Next assume that 1 r<p+ 1. In this case, again by Eq. (.7) it follows that { 0 if 1 <r<p+1 D(n) =D(s(p +1)+r) =( 1) s(p+1) D(r) = ( 1) n 1 if r =1. This completes the proof of part (ii). (iii) The proof is similar to the previous parts. Theorem.4. Let α =(α i ) i 1 be a given sequence and let β =(β i ) i 1 be a sequence satisfying β 1 = α 1, β = α and the linear recursion β i = β i + β i 1, i 3. Let (a i,j ) i,j 1 be the doubly indexed sequence given by the recurrence det (a i,j) = 1 i,j n a i,j = a i 1,j 1 + a i 1,j, i,j, (.8) and the initial conditions a i,1 = β i and a 1,j = α j,wherei, j 1. Then α 1 if n =1, α 1 α + α 1α if n =, (α 1 α + α 1α )(α 1 + α α 3 ) n if n 3. Proof. Forn 3 the result is straightforward. Hence, we assume that n 4. Let A denote the matrix (a i,j ) 1 i,j n. We claim that A = L B, where L =(L i,j ) 1 i,j n is a lower triangular matrix by the recurrence L i,j = L i 1,j 1 + L i 1,j, i,j 3, (.9)
10 More Calculations on Determinant Evaluations 7 and the initial conditions L i,1 = F (i), L 1,i =0,i, and L i, = F (i 1), i, and where B =(B i,j ) 1 i,j n with α j if i =1,j 1, α α 1 if i =,j =1, B i,j = B,j 1 + B,j B 1,j if i =3,j, (.10) B i 1,j 1 if i 1, 3, j, 0 if i 3,j =1. For instance, when n =4thematrixB is hence given by α 1 α α 3 α 4 B = α α 1 α 1 α α α 1 + α α 3 α + α 3 α α 1 + α α 3 Notice that, by the structure of matrices L and B, for every i, it follows that L i,3 L i 1,3 = L i 1,, L i, = L i 1,1, B,i = B 1,i 1. (.11) By expanding, in terms of the first column, we easily see that α 1 if n =1, det(b) = α 1 α + α 1α if n =, (α 1 α + α 1α )(α 1 + α α 3 ) n if n 3, and so the claimed factorization of A immediately implies the validity of the theorem. As before, the proof of the claim requires again some calculations. In fact, it suffices to show that R 1 (L B) =R 1 (A), C 1 (L B) =C 1 (A) and. (L B) i,j =(L B) i 1,j 1 +(L B) i 1,j, (.1) for i, j n. First, suppose that i =1. Then n (L B) 1,j = L 1,k B k,j = L 1,1 B 1,j = α j, k=1 and so R 1 (L B) =R 1 (A) =(α 1, α,..., α n ). Next, we assume that i andj =1. Inthiscasewehave (L B) i,1 = n L i,k B k,1 = L i,1 B 1,1 + L i, B,1 k=1 = F (i)α 1 + F (i 1)(α α 1 )=F (i )α 1 + F (i 1)α, and we get C 1 (L B) =C 1 (A) =(α 1, α,..., F(n )α 1 + F (n 1)α ). Finally, we must establish Eq. (.1). Therefore, we assume that i, j n. In this case we have
11 8 A.R.Moghaddamfar,S.M.H.Pooya,S.NavidSalehy,andS.NimaSalehy (L B) i,j = P n k=1 L i,kb k,j = P 3 k=1 L i,kb k,j + P n k=4 L i,kb k,j P P 3 = P k=1 L n i,kb k,j + P k=4 (L i 1,k 1 + L i 1,k P )B k,j (by (.9)) 3 = k=1 L n i,kb k,j + k=4 L n i 1,k 1B k,j + k=4 L i 1,kB k,j = P 3 k=1 L i,kb k,j + P n k=4 L i 1,k 1B k 1,j 1 + P n k=4 L i 1,kB k,j (by (.10)) = P 3 k=1 L i,kb k,j + P n k=3 L i 1,kB k,j 1 + P n k=4 L i 1,kB k,j (it should be noticed that L i 1,n P =0) 3 = (L B) i 1,j 1 +(L B) i 1,j + k=1 L i,kb k,j P k=1 L i 1,kB k,j 1 P 3 k=1 L i 1,kB k,j, = (L B) i 1,j 1 +(L B) i 1,j +(L i,1 L i 1,1)B 1,j +(L i 1, +L i 1,3)B 3,j L i 1,B,j 1 L i 1,B,j L i 1,3B 3,j, (by (.11)) = (L B) i 1,j 1 +(L B) i 1,j + L i 1,(B 1,j + B 3,j B,j 1 B,j), (because L i,1 L i 1,1 = L i,1 = L i 1,) = (L B) i 1,j 1 +(L B) i 1,j (by (.10)), which is Eq. (.1), and the proof is completed. As an immediate consequence of Theorem.4, we have the following corollary. Corollary.5. In Theorem.4, ifα = ω k (n) with k and β =(β i ) 1 i n = (1, 1,,...,F(n)), then det (a i,j) = 1 i,j n 1 if k =, n =4, n if k =, n 5, 1 if k 3, n k. Theorem.6. Let (a i,j ) 1 i,j n be the doubly indexed sequence given by the recurrence a i,j = a i 1,j 1 + a i 1,j, i,j, (.13) and the initial conditions a i,1 = F (i) and a 1,j = ωj 1,where1 i, j n. Then { if n even, det (a i,j) = 1 i,j n 0 if n odd; where n 3. Proof. Let us denote the matrix (a i,j ) 1 i,j n by A. We claim that A = L B,
12 More Calculations on Determinant Evaluations 9 where L =(L i,j ) 1 i,j n is a matrix by the recurrence L i,j = L i 1,j 1 + L i 1,j, i,j 3, (.14) and the initial conditions L i,1 = F (i), L 1,i =0,andL i, = F (i 1), i, and where B =(B i,j ) 1 i,j n with ωj 1 if i =1,j 1, B B i,j =,j 1 + B,j B 1,j if i =3,j, (.15) B i 1,j 1 if i 1, 3, j, 0 if i,j =1. The proof of the claim is quite similar to the proof of Theorem.4 and we leave it to the reader. Notice that, the matrix L is a lower triangular one with 1 s on the diagonal, and hence det(a) =det(b). Through a short computation one gets det(b) =1+( 1) n, and so the theorem follows now immediately. Acknowledgement We would like to express our sincere gratitude to the referee who read the article thoroughly and made many outstanding comments and suggestions. Moreover, the second proof of Corollary. is due to the referee. REFERENCES [1] R. Bacher. Determinants of matrices related to the Pascal triangle. J. Theorie Nombres Bordeaux, 14:19-41, 00. [] C. Krattenthaler. Evaluations of some determinants of matrices related to the Pascal triangle. Séminaire Lotharingien Combin., Article b47g, 19 pp, 00. [3] C. Krattenthaler. Advanced determinant calculus, Séminaire Lotharingien Combin., Article b4q, 67 pp, [4] C. Krattenthaler. Advanced determinant calculus: a complement. Linear Algebra Appl., 411:68-166, 005. [5] A. R. Moghaddamfar, S. Navid Salehy, and S. Nima Salehy. Evaluating some determinants of matrices with recursive entries, submitted. [6] E. Neuwirth. Treeway Galton arrays and generalized Pascal-like determinants. Adv. Appl. Math., to appear. [7] H. Zakrajšek and M. Petkovšek. Pascal-like determinants are recursive. Adv. Appl. Math., 33: , 004.
Certain matrices related to Fibonacci sequence having recursive entries
Electronic Journal of Linear Algebra Volume 17 Volume 17 (2008) Article 40 2008 Certain matrices related to Fibonacci sequence having recursive entries Ali Reza Moghaddamfar moghadam@mail.ipm.ir S. Navid
More informationELA
Volume 18, pp 564-588, August 2009 http://mathtechnionacil/iic/ela GENERALIZED PASCAL TRIANGLES AND TOEPLITZ MATRICES A R MOGHADDAMFAR AND S M H POOYA Abstract The purpose of this article is to study determinants
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 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 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 informationEvaluating Determinants by Row Reduction
Evaluating Determinants by Row Reduction MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Objectives Reduce a matrix to row echelon form and evaluate its determinant.
More informationShort proofs of theorems of Mirsky and Horn on diagonals and eigenvalues of matrices
Electronic Journal of Linear Algebra Volume 18 Volume 18 (2009) Article 35 2009 Short proofs of theorems of Mirsky and Horn on diagonals and eigenvalues of matrices Eric A. Carlen carlen@math.rutgers.edu
More informationWilliam Stallings Copyright 2010
A PPENDIX E B ASIC C ONCEPTS FROM L INEAR A LGEBRA William Stallings Copyright 2010 E.1 OPERATIONS ON VECTORS AND MATRICES...2 Arithmetic...2 Determinants...4 Inverse of a Matrix...5 E.2 LINEAR ALGEBRA
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 Determinant, Inverse matrix. Matrices. A. Fabretti. Mathematics 2 A.Y. 2015/2016. A. Fabretti Matrices
Matrices A. Fabretti Mathematics 2 A.Y. 2015/2016 Table of contents Matrix Algebra Determinant Inverse Matrix Introduction A matrix is a rectangular array of numbers. The size of a matrix is indicated
More informationOn the maximum positive semi-definite nullity and the cycle matroid of graphs
Electronic Journal of Linear Algebra Volume 18 Volume 18 (2009) Article 16 2009 On the maximum positive semi-definite nullity and the cycle matroid of graphs Hein van der Holst h.v.d.holst@tue.nl Follow
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. 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 spectrum of the edge corona of two graphs
Electronic Journal of Linear Algebra Volume Volume (1) Article 4 1 The spectrum of the edge corona of two graphs Yaoping Hou yphou@hunnu.edu.cn Wai-Chee Shiu Follow this and additional works at: http://repository.uwyo.edu/ela
More informationOn the distance signless Laplacian spectral radius of graphs and digraphs
Electronic Journal of Linear Algebra Volume 3 Volume 3 (017) Article 3 017 On the distance signless Laplacian spectral radius of graphs and digraphs Dan Li Xinjiang University,Urumqi, ldxjedu@163.com Guoping
More informationNon-trivial solutions to certain matrix equations
Electronic Journal of Linear Algebra Volume 9 Volume 9 (00) Article 4 00 Non-trivial solutions to certain matrix equations Aihua Li ali@loyno.edu Duane Randall Follow this and additional works at: http://repository.uwyo.edu/ela
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 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 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 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 informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
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 informationNilpotent matrices and spectrally arbitrary sign patterns
Electronic Journal of Linear Algebra Volume 16 Article 21 2007 Nilpotent matrices and spectrally arbitrary sign patterns Rajesh J. Pereira rjxpereira@yahoo.com Follow this and additional works at: http://repository.uwyo.edu/ela
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 informationMATH 2050 Assignment 8 Fall [10] 1. Find the determinant by reducing to triangular form for the following matrices.
MATH 2050 Assignment 8 Fall 2016 [10] 1. Find the determinant by reducing to triangular form for the following matrices. 0 1 2 (a) A = 2 1 4. ANS: We perform the Gaussian Elimination on A by the following
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 informationOn EP elements, normal elements and partial isometries in rings with involution
Electronic Journal of Linear Algebra Volume 23 Volume 23 (2012 Article 39 2012 On EP elements, normal elements and partial isometries in rings with involution Weixing Chen wxchen5888@163.com Follow this
More informationA note on estimates for the spectral radius of a nonnegative matrix
Electronic Journal of Linear Algebra Volume 13 Volume 13 (2005) Article 22 2005 A note on estimates for the spectral radius of a nonnegative matrix Shi-Ming Yang Ting-Zhu Huang tingzhuhuang@126com Follow
More informationNote on deleting a vertex and weak interlacing of the Laplacian spectrum
Electronic Journal of Linear Algebra Volume 16 Article 6 2007 Note on deleting a vertex and weak interlacing of the Laplacian spectrum Zvi Lotker zvilo@cse.bgu.ac.il Follow this and additional works at:
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 informationPotentially nilpotent tridiagonal sign patterns of order 4
Electronic Journal of Linear Algebra Volume 31 Volume 31: (2016) Article 50 2016 Potentially nilpotent tridiagonal sign patterns of order 4 Yubin Gao North University of China, ybgao@nuc.edu.cn Yanling
More informationDeterminant evaluations for binary circulant matrices
Spec Matrices 014; :187 199 Research Article Open Access Christos Kravvaritis* Determinant evaluations for binary circulant matrices Abstract: Determinant formulas for special binary circulant matrices
More informationInertially arbitrary nonzero patterns of order 4
Electronic Journal of Linear Algebra Volume 1 Article 00 Inertially arbitrary nonzero patterns of order Michael S. Cavers Kevin N. Vander Meulen kvanderm@cs.redeemer.ca Follow this and additional works
More informationSparse spectrally arbitrary patterns
Electronic Journal of Linear Algebra Volume 28 Volume 28: Special volume for Proceedings of Graph Theory, Matrix Theory and Interactions Conference Article 8 2015 Sparse spectrally arbitrary patterns Brydon
More informationGaussian Elimination and Back Substitution
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 4 Notes These notes correspond to Sections 31 and 32 in the text Gaussian Elimination and Back Substitution The basic idea behind methods for solving
More informationMatrices and Determinants
Chapter1 Matrices and Determinants 11 INTRODUCTION Matrix means an arrangement or array Matrices (plural of matrix) were introduced by Cayley in 1860 A matrix A is rectangular array of m n numbers (or
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 informationHere are some additional properties of the determinant function.
List of properties Here are some additional properties of the determinant function. Prop Throughout let A, B M nn. 1 If A = (a ij ) is upper triangular then det(a) = a 11 a 22... a nn. 2 If a row or column
More informationOn nonnegative realization of partitioned spectra
Electronic Journal of Linear Algebra Volume Volume (0) Article 5 0 On nonnegative realization of partitioned spectra Ricardo L. Soto Oscar Rojo Cristina B. Manzaneda Follow this and additional works at:
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 informationLecture Notes 1: Matrix Algebra Part C: Pivoting and Matrix Decomposition
University of Warwick, EC9A0 Maths for Economists Peter J. Hammond 1 of 46 Lecture Notes 1: Matrix Algebra Part C: Pivoting and Matrix Decomposition Peter J. Hammond Autumn 2012, revised Autumn 2014 University
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 informationProducts of commuting nilpotent operators
Electronic Journal of Linear Algebra Volume 16 Article 22 2007 Products of commuting nilpotent operators Damjana Kokol Bukovsek Tomaz Kosir tomazkosir@fmfuni-ljsi Nika Novak Polona Oblak Follow this and
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 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 information1 Introduction. 2 Determining what the J i blocks look like. December 6, 2006
Jordan Canonical Forms December 6, 2006 1 Introduction We know that not every n n matrix A can be diagonalized However, it turns out that we can always put matrices A into something called Jordan Canonical
More informationRETRACTED On construction of a complex finite Jacobi matrix from two spectra
Electronic Journal of Linear Algebra Volume 26 Volume 26 (203) Article 8 203 On construction of a complex finite Jacobi matrix from two spectra Gusein Sh. Guseinov guseinov@ati.edu.tr Follow this and additional
More informationAnalytic roots of invertible matrix functions
Electronic Journal of Linear Algebra Volume 13 Volume 13 (2005) Article 15 2005 Analytic roots of invertible matrix functions Leiba X. Rodman lxrodm@math.wm.edu Ilya M. Spitkovsky Follow this and additional
More informationIntroduction to Matrices
214 Analysis and Design of Feedback Control Systems Introduction to Matrices Derek Rowell October 2002 Modern system dynamics is based upon a matrix representation of the dynamic equations governing the
More informationGeneralization of Gracia's Results
Electronic Journal of Linear Algebra Volume 30 Volume 30 (015) Article 16 015 Generalization of Gracia's Results Jun Liao Hubei Institute, jliao@hubueducn Heguo Liu Hubei University, ghliu@hubueducn Yulei
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 informationACI-matrices all of whose completions have the same rank
ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices
More informationA method for computing quadratic Brunovsky forms
Electronic Journal of Linear Algebra Volume 13 Volume 13 (25) Article 3 25 A method for computing quadratic Brunovsky forms Wen-Long Jin wjin@uciedu Follow this and additional works at: http://repositoryuwyoedu/ela
More informationEE731 Lecture Notes: Matrix Computations for Signal Processing
EE731 Lecture Notes: Matrix Computations for Signal Processing James P. Reilly c Department of Electrical and Computer Engineering McMaster University September 22, 2005 0 Preface This collection of ten
More informationAlgebra & Trig. I. For example, the system. x y 2 z. may be represented by the augmented matrix
Algebra & Trig. I 8.1 Matrix Solutions to Linear Systems A matrix is a rectangular array of elements. o An array is a systematic arrangement of numbers or symbols in rows and columns. Matrices (the plural
More informationDeterminants in detail
Determinants in detail Kyle Miller September 27, 2016 The book s introduction to the determinant det A of an n n square matrix A is to say there is a quantity which determines exactly when A is invertible,
More informationBicyclic digraphs with extremal skew energy
Electronic Journal of Linear Algebra Volume 3 Volume 3 (01) Article 01 Bicyclic digraphs with extremal skew energy Xiaoling Shen Yoaping Hou yphou@hunnu.edu.cn Chongyan Zhang Follow this and additional
More informationAnnouncements Wednesday, October 25
Announcements Wednesday, October 25 The midterm will be returned in recitation on Friday. The grade breakdown is posted on Piazza. You can pick it up from me in office hours before then. Keep tabs on your
More informationb jσ(j), Keywords: Decomposable numerical range, principal character AMS Subject Classification: 15A60
On the Hu-Hurley-Tam Conjecture Concerning The Generalized Numerical Range Che-Man Cheng Faculty of Science and Technology, University of Macau, Macau. E-mail: fstcmc@umac.mo and Chi-Kwong Li Department
More informationSection 3.2. Multiplication of Matrices and Multiplication of Vectors and Matrices
3.2. Multiplication of Matrices and Multiplication of Vectors and Matrices 1 Section 3.2. Multiplication of Matrices and Multiplication of Vectors and Matrices Note. In this section, we define the product
More informationThe Structure of the Jacobian Group of a Graph. A Thesis Presented to The Division of Mathematics and Natural Sciences Reed College
The Structure of the Jacobian Group of a Graph A Thesis Presented to The Division of Mathematics and Natural Sciences Reed College In Partial Fulfillment of the Requirements for the Degree Bachelor of
More informationPhysics 116A Determinants
Physics 116A Determinants Peter Young (Dated: February 5, 2014) I. DEFINITION The determinant is an important property of a square n n matrix. Such a matrix, A say, has n 2 elements, a ij, and is written
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 informationReachability indices of positive linear systems
Electronic Journal of Linear Algebra Volume 11 Article 9 2004 Reachability indices of positive linear systems Rafael Bru rbru@matupves Carmen Coll Sergio Romero Elena Sanchez Follow this and additional
More informationCombinatorial Proofs and Algebraic Proofs I
Combinatorial Proofs and Algebraic Proofs I Shailesh A Shirali Shailesh A Shirali is Director of Sahyadri School (KFI), Pune, and also Head of the Community Mathematics Centre in Rishi Valley School (AP).
More informationThe 4-periodic spiral determinant
The 4-periodic spiral determinant Darij Grinberg rough draft, October 3, 2018 Contents 001 Acknowledgments 1 1 The determinant 1 2 The proof 4 *** The purpose of this note is to generalize the determinant
More information1300 Linear Algebra and Vector Geometry
1300 Linear Algebra and Vector Geometry R. Craigen Office: MH 523 Email: craigenr@umanitoba.ca May-June 2017 Matrix Inversion Algorithm One payoff from this theorem: It gives us a way to invert matrices.
More informationChapter 2:Determinants. Section 2.1: Determinants by cofactor expansion
Chapter 2:Determinants Section 2.1: Determinants by cofactor expansion [ ] a b Recall: The 2 2 matrix is invertible if ad bc 0. The c d ([ ]) a b function f = ad bc is called the determinant and it associates
More informationSPRING OF 2008 D. DETERMINANTS
18024 SPRING OF 2008 D DETERMINANTS In many applications of linear algebra to calculus and geometry, the concept of a determinant plays an important role This chapter studies the basic properties of determinants
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 informationA = , A 32 = n ( 1) i +j a i j det(a i j). (1) j=1
Lecture Notes: Determinant of a Square Matrix Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk 1 Determinant Definition Let A [a ij ] be an
More informationPERMANENTLY WEAK AMENABILITY OF REES SEMIGROUP ALGEBRAS. Corresponding author: jabbari 1. Introduction
International Journal of Analysis and Applications Volume 16, Number 1 (2018), 117-124 URL: https://doi.org/10.28924/2291-8639 DOI: 10.28924/2291-8639-16-2018-117 PERMANENTLY WEAK AMENABILITY OF REES SEMIGROUP
More informationOn identities with multinomial coefficients for Fibonacci-Narayana sequence
Annales Mathematicae et Informaticae 49 08 pp 75 84 doi: 009/ami080900 http://amiuni-eszterhazyhu On identities with multinomial coefficients for Fibonacci-Narayana sequence Taras Goy Vasyl Stefany Precarpathian
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 informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 157 (2009 1696 1701 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Riordan group involutions and the -sequence
More informationEigenvalues and eigenvectors of tridiagonal matrices
Electronic Journal of Linear Algebra Volume 15 Volume 15 006) Article 8 006 Eigenvalues and eigenvectors of tridiagonal matrices Said Kouachi kouachisaid@caramailcom Follow this and additional works at:
More informationarxiv: v1 [math.co] 4 Mar 2010
NUMBER OF COMPOSITIONS AND CONVOLVED FIBONACCI NUMBERS arxiv:10030981v1 [mathco] 4 Mar 2010 MILAN JANJIĆ Abstract We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers
More informationINSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW MATRICES
1 CHAPTER 4 MATRICES 1 INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW MATRICES 1 Matrices Matrices are of fundamental importance in 2-dimensional and 3-dimensional graphics programming
More informationOn the reduction of matrix polynomials to Hessenberg form
Electronic Journal of Linear Algebra Volume 3 Volume 3: (26) Article 24 26 On the reduction of matrix polynomials to Hessenberg form Thomas R. Cameron Washington State University, tcameron@math.wsu.edu
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 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 informationInverses and Determinants
Engineering Mathematics 1 Fall 017 Inverses and Determinants I begin finding the inverse of a matrix; namely 1 4 The inverse, if it exists, will be of the form where AA 1 I; which works out to ( 1 4 A
More informationApplication of Theorems of Schur and Albert
University of South Carolina Scholar Commons Faculty Publications Mathematics, Department of 9-1-1976 Application of Theorems of Schur and Albert Thomas L. Markham University of South Carolina - Columbia,
More informationThe following two problems were posed by de Caen [4] (see also [6]):
BINARY RANKS AND BINARY FACTORIZATIONS OF NONNEGATIVE INTEGER MATRICES JIN ZHONG Abstract A matrix is binary if each of its entries is either or The binary rank of a nonnegative integer matrix A is the
More informationOn cardinality of Pareto spectra
Electronic Journal of Linear Algebra Volume 22 Volume 22 (2011) Article 50 2011 On cardinality of Pareto spectra Alberto Seeger Jose Vicente-Perez Follow this and additional works at: http://repository.uwyo.edu/ela
More informationDeterminants by Cofactor Expansion (III)
Determinants by Cofactor Expansion (III) Comment: (Reminder) If A is an n n matrix, then the determinant of A can be computed as a cofactor expansion along the jth column det(a) = a1j C1j + a2j C2j +...
More informationDihedral groups of automorphisms of compact Riemann surfaces of genus two
Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 36 2013 Dihedral groups of automorphisms of compact Riemann surfaces of genus two Qingje Yang yangqj@ruc.edu.com Dan Yang Follow
More informationAn angle metric through the notion of Grassmann representative
Electronic Journal of Linear Algebra Volume 18 Volume 18 (009 Article 10 009 An angle metric through the notion of Grassmann representative Grigoris I. Kalogeropoulos gkaloger@math.uoa.gr Athanasios D.
More informationQuestion: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?
Section 5. The Characteristic Polynomial Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI? Property The eigenvalues
More informationDeterminants: Uniqueness and more
Math 5327 Spring 2018 Determinants: Uniqueness and more Uniqueness The main theorem we are after: Theorem 1 The determinant of and n n matrix A is the unique n-linear, alternating function from F n n to
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 informationINVERSE TRIDIAGONAL Z MATRICES
INVERSE TRIDIAGONAL Z MATRICES (Linear and Multilinear Algebra, 45() : 75-97, 998) J J McDonald Department of Mathematics and Statistics University of Regina Regina, Saskatchewan S4S 0A2 M Neumann Department
More informationMatrices Gaussian elimination Determinants. Graphics 2009/2010, period 1. Lecture 4: matrices
Graphics 2009/2010, period 1 Lecture 4 Matrices m n matrices Matrices Definitions Diagonal, Identity, and zero matrices Addition Multiplication Transpose and inverse The system of m linear equations in
More informationPositive definiteness of tridiagonal matrices via the numerical range
Electronic Journal of Linear Algebra Volume 3 ELA Volume 3 (998) Article 9 998 Positive definiteness of tridiagonal matrices via the numerical range Mao-Ting Chien mtchien@math.math.scu.edu.tw Michael
More informationSection 1.6. M N = [a ij b ij ], (1.6.2)
The Calculus of Functions of Several Variables Section 16 Operations with Matrices In the previous section we saw the important connection between linear functions and matrices In this section we will
More informationOn the generating matrices of the k-fibonacci numbers
Proyecciones Journal of Mathematics Vol. 3, N o 4, pp. 347-357, December 013. Universidad Católica del Norte Antofagasta - Chile On the generating matrices of the k-fibonacci numbers Sergio Falcon Universidad
More informationMatrices. In this chapter: matrices, determinants. inverse matrix
Matrices In this chapter: matrices, determinants inverse matrix 1 1.1 Matrices A matrix is a retangular array of numbers. Rows: horizontal lines. A = a 11 a 12 a 13 a 21 a 22 a 23 a 31 a 32 a 33 a 41 a
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More information