CONVERGENCE OF MULTISPLITTING METHOD FOR A SYMMETRIC POSITIVE DEFINITE MATRIX
|
|
- Abel Adams
- 5 years ago
- Views:
Transcription
1 J. Appl. Math. & Computing Vol No. 1-2 pp CONVERGENCE OF MULTISPLITTING METHOD FOR A SYMMETRIC POSITIVE DEFINITE MATRIX JAE HEON YUN SEYOUNG OH AND EUN HEUI KIM Abstract. We study convergence of symmetric multisplitting method associated with many different multisplittings for solving a linear system whose coefficient matrix is a symmetric positive definite matrix which is not an H-matrix. AMS Mathematics Subject Classification : 65F10 65F15. Key word and phrases : Symmetric multisplitting method multisplitting incomplete factorization symmetric positive definite matrix H-matrix. 1. Introduction In this paper we consider multisplitting method for solving a linear system of the form Ax = b x b R n 1 where A R n n is a symmetric positive definite matrix which is not an H- matrix. Multisplitting method was introduced by O Leary and White [7] and was further studied by many authors [ ]. But the attention was mainly paid to a monotone matrix and an H-matrix. Thus the purpose of this paper is to study the convergence of symmetric multisplitting method for a symmetric positive definite matrix A which is not an H-matrix by using the diagonally dominated matrix [11] of A. This paper is organized as follows. In Section 2 we present some preliminary results which we refer to later. In Section 3 we present convergence results of the symmetric multisplitting method for solving the linear system 1. Received October This work was supported by Chungbuk National University Grant in c 2005 Korean Society for Computational & Applied Mathematics and Korean SIGCAM. 59
2 60 Jae Heon Yun SeYoung Oh and Eun Heui Kim 2. Preliminaries For a vector x R n x 0x>0 denotes that all components of x are nonnegative positive and x denotes the vector whose components are the absolute values of the corresponding components of x. For two vectors x y R n x y x >y means that x y 0x y > 0. These definitions carry immediately over to matrices. For a square matrix A ρa denotes the spectral radius of A. A matrix A =a ij R n n is called an M-matrix if a ij 0 for i j and A 1 0. The comparison matrix A =α ij of a matrix A =a ij is defined by { a ij if i = j α ij = a ij if i j. A matrix A is called an H-matrix if A is an M-matrix. A representation A = M N is called a splitting of A when M is nonsingular. A splitting A = M N is called regular if M 1 0 and N 0 and convergent if ρm 1 N < 1. When A is symmetric a splitting A = M N is called symmetric if M is symmetric. A splitting A = M N is called an H-compatible splitting if A = M N. It was shown in [3] that if A is an H-matrix and A = M N is an H- compatible splitting then M is also an H-matrix and ρm 1 N < 1. Note that M-matrices and strictly or irreducibly diagonally dominant matrices are contained in the class of all H-matrices. Actually an n nh-matrix A =a ij can be equivalently characterized by being generalized strictly diagonally dominant [1] i.e. a ii u i > j i a ij u j i =1 2...n for some vector u =u 1 u 2...u n T > 0. A collection of triples M k N k E k k =1 2...l is called a multisplitting of A if A = M k N k is a splitting of A for k =1 2...l and E k s called l weighting matrices are nonnegative diagonal matrices such that E k = I. k=1 Lemma 2.1 [2]. If A = D B is an H-matrix then A 1 A 1. Let S n denote the set of all pairs of indices of off-diagonal matrix entries that is { } S n = i j i j 1 i n 1 j n.
3 Convergence of multisplitting method 61 The following theorem shows the existence of an incomplete factorization for a symmetric H-matrix A. Theorem 2.2 [5 11]. Let A R n n be a symmetric H-matrix. Then for every symmetric zero pattern set Q S n i.e. i j Q implies j i Q there exist an upper triangular matrix U =u ij a diagonal matrix D whose kth diagonal element is u 1 kk and a symmetric matrix N =n ij with u ij =0if i j Q and n ij =0if i j / Q such that A = U T DU N. Moreover U is an H-matrix. In Theorem 2.2 A = U T DU N is called an incomplete factorization of A corresponding to a symmetric zero pattern set Q. When A is a symmetric H- matrix with positive diagonal elements the diagonal matrix D in the incomplete factorization A = U T DU N given in Theorem 2.2 has also positive diagonal elements and thus U T DU is a symmetric positive definite matrix cf. [4]. When A is a symmetric M-matrix the incomplete factorization A = U T DU N in Theorem 2.2 is a regular splitting of A and U T DU is also a symmetric positive definite matrix. It is easy to show that the incomplete factorization A = U T DU N in Theorem 2.2 is a convergent splitting. Theorem 2.3 [11]. Let A R n n be a symmetric H-matrix. Let A = U T DU N and A = Ũ T DŨ Ñ be the incomplete factorizations of A and A corresponding to a symmetric zero pattern set Q S n respectively. Then each of the following holds: 1 a U DU T T 1 Ũ DŨ b N Ñ. 3. Convergence results Let A R n n be a symmetric positive definite matrix which is not an H-matrix. Then we can choose a nonnegative diagonal matrix Λ such that  = A + Λ is a generalized strictly diagonally dominant matrix i.e. an H- matrix. For example the easiest way of finding such a matrix  is to choose a nonnegative diagonal matrix Λ such that  = A+Λ is a strictly diagonally dominant matrix. From now on the transformed matrix  = A+Λ is called a diagonally dominated matrix of A. Since  is a symmetric positive definite H-matrix Theorem 2.2 implies that  has an incomplete factorization  = U T DU N
4 62 Jae Heon Yun SeYoung Oh and Eun Heui Kim for any symmetric zero pattern set Q S n and the U T DU is symmetric positive definite. Example 3.1 shows how a diagonally dominated matrix  can be obtained from a symmetric positive definite matrix A. In Example 3.1 matrix inverses and eigenvalues have been computed using MATLAB. Example 3.1. Consider a 4 4 matrix A of the form A = A is a symmetric positive definite matrix since all eigenvalues of A are positive. However A is not an H-matrix since A 1 < 0. Let Λ = diag { } which denotes a diagonal matrix whose consecutive diagonal elements are and 0. That is Λ= Then  = A + Λ is a symmetric positive definite H-matrix since  1 > 0. Hence  is a diagonally dominated matrix of A. Lemma 3.2 [11]. Let A be a symmetric positive definite matrix and  be a diagonally dominated matrix of A. Let  = M ˆN be a splitting of  with M being symmetric positive definite and let N = M A. If the splitting  = M ˆN is convergent then the splitting A = M N is convergent. From Lemma 3.2 it can be seen that the problem of constructing a convergent splitting for a symmetric positive definite matrix A can be reduced to that for a diagonally dominated matrix  of A. Let M k N k E k k =1 2...l be a multisplitting of a symmetric positive definite matrix A. Then the parallel symmetric multisplitting method introduced in [9] can be constructed as follows. For m = compute x m+1 = x m + Gr m 2 where G = 1 l E k M 1 k + M T k E k and r m = b Ax m. 3 2 k=1
5 Convergence of multisplitting method 63 The equation 2 can be transformed into x m+1 =I GAx m + Gb. 4 Hence the iteration matrix of parallel symmetric multisplitting method is H = I GA. If G is nonsingular A = G 1 G 1 H is a splitting of A. Now let us construct the multisplitting M k N k E k k =1 2...l of A by using the diagonally dominated matrix  of A. For simplicity of exposition suppose that l = 3. Then A and  are partitioned into 3 3 block matrices of the form A 1 C 12 C 13  1 C 12 C 13 A = C 21 A 2 C 23  = C 21  2 C 23 5 C 31 C 32 A 3 C 31 C 32  3 where A i and Âi are n i n i matrices with 3 n i = n. Since A and  are symmetric C ij = Cji T for i j. Let Âi = B i C i be an H-compatible splitting of  i for each i = Then Âi = B i C i for each i. Since Âi is an H-matrix B i is also an H-matrix. Let B B B M 1 = C 21 B 2 0 C 31 0 B 3 M 2 = i=1 0 B C 32 B 3 M 3 = 0 B B 3 6 ˆN 1 = M 1  ˆN2 = M 2  ˆN3 = M 3  7 N 1 = M 1 A N 2 = M 2 A N 3 = M 3 A. 8 For each k =1 2 3 let d 1k I E k = 0 d 2k I d 3k I 3 where 0 d ik 1 3 d ik = 1 and I i is an n i n i identity matrix for each k=1 i = Then M k N k E k k =1 2 3 is a multisplitting of A and M k ˆN k E k k =1 2 3 is a multisplitting of Â. It can be easily shown that  = M k ˆN k is an H-compatible splitting of  for
6 64 Jae Heon Yun SeYoung Oh and Eun Heui Kim each k. Hence M k ˆN k E k k =1 2 3 is a multisplitting of  with regular splittings  = M k ˆN k. Some simple but tedious matrix manipulations show 3 G = 1 E k M 1 k + M T k E k 2 G = 1 2 = 1 2 where = 1 2 k=1 B B T 1 d 21B T 1 C 12B T 2 d 31B T 1 C 13B T 3 d 21B 1 2 C21B 1 1 B B T 2 d 32B T 2 C 23B T 3 d 31B 1 3 C31B 1 1 d 32B 1 3 C32B 1 2 B B T 3 E k M k 1 + M k T E k 10 3 k=1 B1 1 + B 1 T d 21 B 1 T C 12 B 2 T d 31 B 1 T C 13 B 3 T d 21 B 2 1 C 21 B 1 1 B B 2 T d 32 B 2 T C 23 B 3 T d 31 B 3 1 C 31 B 1 1 d 32 B 3 1 C 32 B 2 1 B B 3 T Ĥ = I G = ĥ 11 ĥ 12 ĥ 13 ĥ 21 ĥ 22 ĥ 23 ĥ 31 ĥ 32 ĥ 33 H = I G  = ĥ 11 = 1 2 ĥ 12 = 1 2 ĥ 13 = 1 2 B 1 1 C 1 + B T 1 C T 1 + ĥ 21 = 1 2 ĥ 22 = 1 B 1 2 ĥ 23 = j=2 d j1b T 1 C 1jB T j C j1 h 11 h12 h13 h 21 h22 h23 1 d 21B T 1 C 12 + B 1 1 C 12 + d 21B T 1 C 12B T 2 C T 2 d 31B T 1 C 13B T 3 C 32 1 d 31B T 1 C 13 + B 1 1 C 13 + d 31B T 1 C 13B T 3 C T 3 d 21B T 1 C 12B T 2 C 23 1 d 21B 1 2 C 21 + B T 2 C 21 + d 21B 1 2 C 21B 1 1 C 1 d 32B T 2 C 23B T 3 C 31 ĥ 31 = h 31 h32 h C 2 + B T 2 C 2 + d 21B 1 2 C 21B 1 1 C 12 + d 32B T 2 C 23B T d 21B 1 2 C 21B 1 1 C 13 1 d 32B T 2 C 23 B 1 2 C 23 d 32B T 2 C 23B T 3 C T 3 1 d 31B 1 3 C 31 + B T 3 C 31 + d 31B 1 3 C 31B 1 1 C 1 3 C 32
7 and ĥ 32 = 1 2 d 32B 1 3 C 32B 1 2 C 21 Convergence of multisplitting method 65 d 31B 1 3 C 31B 1 1 C 12 1 d 32B 1 3 C 32 B T 3 C 32 d 32B 1 3 C 32B 1 2 C 2 ĥ 33 = 1 B 1 3 C 3 + B T 3 C3 T + 2 h 11 = 1 2 h 12 = 1 2 h 13 = 1 2 h 21 = 1 2 h 22 = 1 2 h 23 = 1 2 h 31 = 1 2 h 32 = 1 2 h 33 = j=1 B 1 1 C 1 + B 1 T C 1 T + d 3jB 1 3 C 3jB 1 j C j3 3 j=2 d j1 B 1 T C 1j B j T C j1 1 d 21 B 1 T C 12 + B 1 1 C 12 + d 21 B 1 T C 12 B 2 T C 2 T +d 31 B 1 T C 13 B 3 T C 32 1 d 31 B 1 T C 13 + B 1 1 C 13 + d 31 B 1 T C 13 B 3 T C 3 T +d 21 B 1 T C 12 B 2 T C 23 1 d 21 B 2 1 C 21 + B 2 T C 21 + d 21 B 2 1 C 21 B 1 1 C 1 +d 32 B 2 T C 23 B 3 T C 31 B 2 1 C 2 + B 2 T C 2 + d 21 B 2 1 C 21 B 1 1 C 12 +d 32 B 2 T C 23 B 3 T C 32 d 21 B 2 1 C 21 B 1 1 C d 32 B 2 T C 23 + B 2 1 C 23 +d 32 B 2 T C 23 B 3 T C 3 T 1 d 31 B 3 1 C 31 + B 3 T C 31 + d 31 B 3 1 C 31 B 1 1 C 1 +d 32 B 3 1 C 32 B 2 1 C 21 d 31 B 3 1 C 31 B 1 1 C d 32 B 3 1 C 32 + B 3 T C 32 +d 32 B 3 1 C 32 B 2 1 C 2 B 3 1 C 3 + B 3 T C 3 T + 2 j=1 d 3j B 3 1 C 3j B j 1 C j3. Since B i is an H-matrix from Lemma 2.1 B 1 i B i 1 for each i. Using this inequality and equation 12 it is easy to show that ĥij h ij for all i and
8 66 Jae Heon Yun SeYoung Oh and Eun Heui Kim j. Hence Ĥ H from which one obtains ρĥ ρ H. 13 Theorem 3.3. Let A R n n be a symmetric positive definite matrix and  be a diagonally dominated matrix of A. Assume that  is partitioned into an l l block matrix as in the form 5 with Âk = B k C k being an H-compatible splitting of  k for each k =1 2...l and assume that M k ˆN k E k k =1 2...l is a multisplitting of  which is constructed as in the form 6 7 and 9. Then ρĥ < 1 and G is nonsingular. Proof. Since Âk = B k C k is an H-compatible splitting of an H-matrix Âk Âk = B k C k is a regular splitting of Âk. It follows from 11 and 12 that G 0 and H 0. Since G  = I H we have G = I H  1 and thus 0 I + H + + H m 1 G = I + H + + H m 1 I H  1 14 = I H m  1  1 for any positive integer m. Since it is easy to see from 11 that each row of G has at least one nonzero component 14 implies that lim H m = 0 which m is equivalent to ρ H < 1. From 13 ρĥ < 1. Since G = I Ĥ G is nonsingular. Since  is a symmetric H-matrix  k is also a symmetric H-matrix and thus there exists an incomplete factorization of Âk corresponding to a symmetric zero pattern set see Theorem 2.2. Hence the following theorem can be obtained. Theorem 3.4. Let A R n n be a symmetric positive definite matrix and  be a diagonally dominated matrix of A. Assume that  is partitioned into an l l block matrix as in the form 5 with  k = Uk T D k U k C k being an incomplete factorization of  k corresponding to a symmetric zero pattern set Q k for each k =1 2...l. Also assume that M k ˆN k E k k =1 2...l
9 Convergence of multisplitting method 67 is a multisplitting of  which is constructed as in the form 6 7 and 9 where B k = Uk T D ku k in 6. Then ρĥ < 1 and G is nonsingular. Proof. Let Âk = Ũ T k D k Ũ k C k be an incomplete factorization of Âk corresponding to the symmetric zero pattern set Q k and let B k = Ũ k T D k Ũ k. Then from Theorem 2.3 one obtains B 1 k 1 B k and C k C k. 15 Let G and H be defined as in 11 and 12 except that B k and C k are replaced by B k and C k respectively. From 12 and 15 it can be easily shown that Ĥ H G 0 and H 0. Since Âk = B k C k is a regular splitting of Âk ρ H < 1 is obtained as in the proof of Theorem 3.3. Therefore ρĥ < 1 and thus G is nonsingular. Theorem 3.5. Let A R n n be a symmetric positive definite matrix and  be a diagonally dominated matrix of A. Assume that  is partitioned into an l l block matrix as in the form 5 with  k = B k C k being an H-compatible splitting of  k for each k =1 2...l and assume that M k ˆN k E k k =1 2...l is a multisplitting of  which is constructed as in the form 6 7 and 9. If G is symmetric positive definite then ρh < 1. Proof. Since GA = I H and G = I Ĥ we have two splittings A = G 1 G 1 H and  = G 1 G 1 Ĥ of A and  respectively. Since ρĥ < 1 from Theorem 3.3 the latter is a convergent splitting. Hence Lemma 3.2 implies that the former is a convergent splitting i.e. ρh < 1. If Âk = B k C k is a symmetric splitting of Âk for k =1 2...l the matrix G in 10 has the form G = diag G diag 16 B1 1 B 1 2 B 1 3 B1 1 B 1 2 B 1 3
10 68 Jae Heon Yun SeYoung Oh and Eun Heui Kim where G = B 1 d21 d21 2 C 12 d31 2 C 13 2 C 21 B 2 d32 d31 2 C 31 d32 2 C 32 B 3 2 C Equation 16 implies that G is symmetric positive definite if and only if G is symmetric positive definite. Theorem 3.6. Let A R n n be a symmetric positive definite matrix and  be a diagonally dominated matrix of A. Assume that  is partitioned into an l l block matrix as in the form 5 with  k = U T k D k U k C k being an incomplete factorization of  k corresponding to a symmetric zero pattern set Q k for each k =1 2...l. Also assume that M k ˆN k E k k =1 2...l is a multisplitting of  which is constructed as in the form 6 7 and 9 where B k = Uk T D ku k in 6. If G of the form 17 is symmetric positive definite then ρh < 1. Proof. Since G is symmetric positive definite G is symmetric positive definite. Using Theorem 3.4 and Lemma 3.2 ρh < 1 is obtained as in the proof of Theorem 3.5. If d ik = 0 for i>kin Theorem 3.6 then the assumption that G is symmetric positive definite is not necessary since G = diagb 1 B 2...B l and B k = Uk T D ku k is symmetric positive definite for each k. The following theorem shows that the assumption that G is symmetric positive definite in Theorem 3.5 can be omitted if  k = B k C k is a symmetric H- compatible splitting of  k for each k. Theorem 3.7. Let A R n n be a symmetric positive definite matrix and  be a diagonally dominated matrix of A. Assume that  is partitioned into an l l block matrix as in the form 5 with  k = B k C k being a symmetric H-compatible splitting of  k for each k = l and assume that M k ˆN k E k k =1 2...l
11 Convergence of multisplitting method 69 is a multisplitting of  which is constructed as in the form 6 7 and 9. Then ρh < 1. Proof. Since Âk = B k C k is a symmetric H-compatible splitting of Âk this theorem follows from Theorem 3.5 if we show that G of the form 17 is symmetric positive definite. Notice that Âk = B k C k B k. Since 0 d ik 1  G. It follows that G is an H-matrix since  is an H-matrix. First we show that each B k has positive diagonal elements. Let From Âk = B k C k From Âk = B k C k  k =â ij B k =b ij and C k =c ij. â ii = b ii c ii > 0 and thus b ii >c ii. â ii = b ii c ii > 0 and thus b ii > c ii. Suppose that b ii 0 for some i. Then c ii <b ii 0 and hence c ii > b ii. This is a contradiction to b ii > c ii. Hence b ii must be positive for all i i.e. B k has positive diagonal elements. From 17 G has positive diagonal elements. Since G is a symmetric H-matrix with positive diagonal elements G is symmetric positive definite. We now give some examples of symmetric splittings of Âk. Let Âk = D k L k L T k where D k = diagâk and L k is the strictly lower triangular part of  k.  k = B k C k is called a Jacobi splitting of  k if B k = D k and C k = L k L T k and it is called an SSORω splitting of  k if 1 B k = ω2 ω D k ωl k D 1 k 1 C k = 1 ωd k + ωl k ω2 ω D k ωl T k D 1 k 1 ωd k + ωl T k 18 where 0 < ω < 2. Note that the Jacobi splitting of  k is a symmetric H- compatible splitting of Âk. Hence Theorem 3.7 holds for the Jacobi splitting of  k. Since Âk = D k L k L T k
12 70 Jae Heon Yun SeYoung Oh and Eun Heui Kim Âk = B k C k is an SSORω splitting of Âk where 1 B k = D k ω L k D k 1 D k ω L T k ω2 ω 1 C k = 1 ω D k + ω L k D k 1 1 ω D k + ω L T k ω2 ω. 19 Theorem 3.8. Let A R n n be a symmetric positive definite matrix and  be a diagonally dominated matrix of A. Assume that  is partitioned into an l l block matrix as in the form 5 with  k = B k C k being an SSORω splitting of  k for each k =1 2...l and assume that M k ˆN k E k k =1 2...l is a multisplitting of  which is constructed as in the form 6 7 and 9. If 0 <ω 1 then ρĥ < 1 and G is nonsingular. Proof. Let Âk = B k C k be an SSORω splitting of Âk which is defined as in 19. Since D k ωl k and D k ωl T k are H-matrices D k ωl k D k ωl k = D k ω L k D k ωl T k 1 D k ωl T 1 1. k = D k ω L T k Hence one obtains B 1 1 k D ω2 ω k ωl T k Dk D k ωl k = ω2 ω D k ω L T k Dk D k ω L k 20 = B 1 k. Since 0 <ω 1 C k C k is directly obtained from 18 and 19. Let G and H be defined as in 11 and 12 except that B k and C k are replaced by B k and C k respectively. From 20 and C k C k it is clear that Ĥ H G 0 and H 0. Since Âk = B k C k is a regular splitting of Âk ρ H < 1 is obtained as in the proof of Theorem 3.3. Therefore ρĥ < 1 and thus G is nonsingular.
13 Convergence of multisplitting method 71 Theorem 3.9. Let A R n n be a symmetric positive definite matrix and  be a diagonally dominated matrix of A. Assume that  is partitioned into an l l block matrix as in the form 5 with  k = B k C k being an SSORω splitting of  k for each k =1 2...l and assume that M k ˆN k E k k =1 2...l is a multisplitting of  which is constructed as in the form 6 7 and 9. If 0 <ω 1 and d ik =0for i>k then ρh < 1. Proof. Notice that Âk = B k C k is a symmetric splitting and B k is symmetric positive definite. Since d ik = 0 for i>k G = diagb 1 B 2...B l is symmetric positive definite and hence G is symmetric positive definite. Using Theorem 3.8 and Lemma 3.2 ρh < 1 is obtained as in the proof of Theorem 3.5. References 1. K. Fan Topological proofs of certain theorems on matrices with nonnegative elements Monatshefte für Mathematik A. Frommer and G. Mayer Convergence of relaxed parallel multisplitting methods Linear Algebra Appl A. Frommer and D.B. Szyld H-splittings and two-stage iterative methods Numer. Math T.A. Manteuffel An incomplete factorization technique for positive definite linear systems Math. Comput A. Messaoudi On the stability of the incomplete LUfactorizations and characterizations of H-matrices Numer. Math M. Neumann and R.J. Plemmons Convergence of parallel multisplitting methods for M- matrices Linear Algebra Appl D.P. O Leary and R.E. White Multisplittings of matrices and parallel solution of linear systems SIAM J. Algebraic Discrete Meth D.B. Szyld and M.T. Jones Two-stage and multisplitting methods for the parallel solution of linear systems SIAM J. Matrix Anal. Appl R.E. White Multisplitting with different weighting schemes SIAM J. Matrix Anal. Appl R.E. White Multisplitting of a symmetric positive definite matrix SIAM J. Matrix Anal. Appl
14 72 Jae Heon Yun SeYoung Oh and Eun Heui Kim 11. J.H. Yun and S.W. Kim Convergence of two-stage iterative methods using incomplete factorization J. Comput. Appl. Math Jae Heon Yun received M.Sc. from Kyungpook National University and Ph.D. from Iowa State University. He is currently a professor at Chungbuk National University since His research interests are computational mathematics iterative method and parallel computation. Department of Mathematics Institute for Basic Sciences & College of Natural Sciences Chungbuk National University Cheongju Korea gmjae@cbucc.chungbuk.ac.kr SeYoung Oh received M.Sc. from Seoul National University and Ph.D at University of Minnesota. Since 1992 he has been at Chungnam National University. His research interests include numerical optimization and biological computation. Department of Mathematics Chungnam National University Daejeon Korea soh@cnu.ac.kr Eun Heui Kim received M.Sc. in Applied Mathematics from Chungbuk National University. She is currently a temporary instructor at Chungbuk National University. Department of Mathematics College of Natural Sciences Chungbuk National University Cheongju Korea chaos75@chungbuk.ac.kr
Jae Heon Yun and Yu Du Han
Bull. Korean Math. Soc. 39 (2002), No. 3, pp. 495 509 MODIFIED INCOMPLETE CHOLESKY FACTORIZATION PRECONDITIONERS FOR A SYMMETRIC POSITIVE DEFINITE MATRIX Jae Heon Yun and Yu Du Han Abstract. We propose
More informationComputers and Mathematics with Applications. Convergence analysis of the preconditioned Gauss Seidel method for H-matrices
Computers Mathematics with Applications 56 (2008) 2048 2053 Contents lists available at ScienceDirect Computers Mathematics with Applications journal homepage: wwwelseviercom/locate/camwa Convergence analysis
More informationA NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES
Journal of Mathematical Sciences: Advances and Applications Volume, Number 2, 2008, Pages 3-322 A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES Department of Mathematics Taiyuan Normal University
More informationPerformance Comparison of Relaxation Methods with Singular and Nonsingular Preconditioners for Singular Saddle Point Problems
Applied Mathematical Sciences, Vol. 10, 2016, no. 30, 1477-1488 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.6269 Performance Comparison of Relaxation Methods with Singular and Nonsingular
More informationScientific Computing WS 2018/2019. Lecture 9. Jürgen Fuhrmann Lecture 9 Slide 1
Scientific Computing WS 2018/2019 Lecture 9 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 9 Slide 1 Lecture 9 Slide 2 Simple iteration with preconditioning Idea: Aû = b iterative scheme û = û
More informationON POSITIVE SEMIDEFINITE PRESERVING STEIN TRANSFORMATION
J. Appl. Math. & Informatics Vol. 33(2015), No. 1-2, pp. 229-234 http://dx.doi.org/10.14317/jami.2015.229 ON POSITIVE SEMIDEFINITE PRESERVING STEIN TRANSFORMATION YOON J. SONG Abstract. In the setting
More informationMath Introduction to Numerical Analysis - Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012.
Math 5620 - Introduction to Numerical Analysis - Class Notes Fernando Guevara Vasquez Version 1990. Date: January 17, 2012. 3 Contents 1. Disclaimer 4 Chapter 1. Iterative methods for solving linear systems
More informationJordan Journal of Mathematics and Statistics (JJMS) 5(3), 2012, pp A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS
Jordan Journal of Mathematics and Statistics JJMS) 53), 2012, pp.169-184 A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS ADEL H. AL-RABTAH Abstract. The Jacobi and Gauss-Seidel iterative
More informationModified Gauss Seidel type methods and Jacobi type methods for Z-matrices
Linear Algebra and its Applications 7 (2) 227 24 www.elsevier.com/locate/laa Modified Gauss Seidel type methods and Jacobi type methods for Z-matrices Wen Li a,, Weiwei Sun b a Department of Mathematics,
More informationThe upper Jacobi and upper Gauss Seidel type iterative methods for preconditioned linear systems
Applied Mathematics Letters 19 (2006) 1029 1036 wwwelseviercom/locate/aml The upper Jacobi upper Gauss Seidel type iterative methods for preconditioned linear systems Zhuan-De Wang, Ting-Zhu Huang School
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 informationCAAM 454/554: Stationary Iterative Methods
CAAM 454/554: Stationary Iterative Methods Yin Zhang (draft) CAAM, Rice University, Houston, TX 77005 2007, Revised 2010 Abstract Stationary iterative methods for solving systems of linear equations are
More informationOPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY
published in IMA Journal of Numerical Analysis (IMAJNA), Vol. 23, 1-9, 23. OPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY SIEGFRIED M. RUMP Abstract. In this note we give lower
More informationTHE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR
THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR WEN LI AND MICHAEL K. NG Abstract. In this paper, we study the perturbation bound for the spectral radius of an m th - order n-dimensional
More informationOn the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination
On the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination J.M. Peña 1 Introduction Gaussian elimination (GE) with a given pivoting strategy, for nonsingular matrices
More informationLecture 18 Classical Iterative Methods
Lecture 18 Classical Iterative Methods MIT 18.335J / 6.337J Introduction to Numerical Methods Per-Olof Persson November 14, 2006 1 Iterative Methods for Linear Systems Direct methods for solving Ax = b,
More informationApplied Mathematics Letters. Comparison theorems for a subclass of proper splittings of matrices
Applied Mathematics Letters 25 (202) 2339 2343 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Comparison theorems for a subclass
More informationThe semi-convergence of GSI method for singular saddle point problems
Bull. Math. Soc. Sci. Math. Roumanie Tome 57(05 No., 04, 93 00 The semi-convergence of GSI method for singular saddle point problems by Shu-Xin Miao Abstract Recently, Miao Wang considered the GSI method
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 4, pp. 1-13, March 1996. Copyright 1996,. ISSN 1068-9613. ETNA NON-STATIONARY PARALLEL MULTISPLITTING AOR METHODS ROBERT FUSTER, VIOLETA MIGALLÓN,
More informationBOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION
K Y BERNETIKA VOLUM E 46 ( 2010), NUMBER 4, P AGES 655 664 BOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION Guang-Da Hu and Qiao Zhu This paper is concerned with bounds of eigenvalues of a complex
More informationSome bounds for the spectral radius of the Hadamard product of matrices
Some bounds for the spectral radius of the Hadamard product of matrices Guang-Hui Cheng, Xiao-Yu Cheng, Ting-Zhu Huang, Tin-Yau Tam. June 1, 2004 Abstract Some bounds for the spectral radius of the Hadamard
More informationAn Extrapolated Gauss-Seidel Iteration
mathematics of computation, volume 27, number 124, October 1973 An Extrapolated Gauss-Seidel Iteration for Hessenberg Matrices By L. J. Lardy Abstract. We show that for certain systems of linear equations
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 information9. Iterative Methods for Large Linear Systems
EE507 - Computational Techniques for EE Jitkomut Songsiri 9. Iterative Methods for Large Linear Systems introduction splitting method Jacobi method Gauss-Seidel method successive overrelaxation (SOR) 9-1
More informationTHE BOOLEAN IDEMPOTENT MATRICES. Hong Youl Lee and Se Won Park. 1. Introduction
J. Appl. Math. & Computing Vol. 15(2004), No. 1-2. pp. 475-484 THE BOOLEAN IDEMPOTENT MATRICES Hong Youl Lee and Se Won Park Abstract. In general, a matrix A is idempotent if A 2 = A. The idempotent matrices
More informationAbed Elhashash and Daniel B. Szyld. Report August 2007
Generalizations of M-matrices which may not have a nonnegative inverse Abed Elhashash and Daniel B. Szyld Report 07-08-17 August 2007 This is a slightly revised version of the original report dated 17
More informationA Method for Constructing Diagonally Dominant Preconditioners based on Jacobi Rotations
A Method for Constructing Diagonally Dominant Preconditioners based on Jacobi Rotations Jin Yun Yuan Plamen Y. Yalamov Abstract A method is presented to make a given matrix strictly diagonally dominant
More informationELA
Volume 16, pp 171-182, July 2007 http://mathtechnionacil/iic/ela SUBDIRECT SUMS OF DOUBLY DIAGONALLY DOMINANT MATRICES YAN ZHU AND TING-ZHU HUANG Abstract The problem of when the k-subdirect sum of a doubly
More informationZ-Pencils. November 20, Abstract
Z-Pencils J. J. McDonald D. D. Olesky H. Schneider M. J. Tsatsomeros P. van den Driessche November 20, 2006 Abstract The matrix pencil (A, B) = {tb A t C} is considered under the assumptions that A is
More informationGeneralizations of M-matrices which may not have a nonnegative inverse
Available online at www.sciencedirect.com Linear Algebra and its Applications 429 (2008) 2435 2450 www.elsevier.com/locate/laa Generalizations of M-matrices which may not have a nonnegative inverse Abed
More informationFirst, we review some important facts on the location of eigenvalues of matrices.
BLOCK NORMAL MATRICES AND GERSHGORIN-TYPE DISCS JAKUB KIERZKOWSKI AND ALICJA SMOKTUNOWICZ Abstract The block analogues of the theorems on inclusion regions for the eigenvalues of normal matrices are given
More informationOn the Stability of LU-Factorizations
Australian Journal of Basic and Applied Sciences 5(6): 497-503 2011 ISSN 1991-8178 On the Stability of LU-Factorizations R Saneifard and A Asgari Department of Mathematics Oroumieh Branch Islamic Azad
More informationCLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted
More informationLecture Note 7: Iterative methods for solving linear systems. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 7: Iterative methods for solving linear systems Xiaoqun Zhang Shanghai Jiao Tong University Last updated: December 24, 2014 1.1 Review on linear algebra Norms of vectors and matrices vector
More informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
More informationWe first repeat some well known facts about condition numbers for normwise and componentwise perturbations. Consider the matrix
BIT 39(1), pp. 143 151, 1999 ILL-CONDITIONEDNESS NEEDS NOT BE COMPONENTWISE NEAR TO ILL-POSEDNESS FOR LEAST SQUARES PROBLEMS SIEGFRIED M. RUMP Abstract. The condition number of a problem measures the sensitivity
More informationChapter 7 Iterative Techniques in Matrix Algebra
Chapter 7 Iterative Techniques in Matrix Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128B Numerical Analysis Vector Norms Definition
More informationCLASSICAL ITERATIVE METHODS
CLASSICAL ITERATIVE METHODS LONG CHEN In this notes we discuss classic iterative methods on solving the linear operator equation (1) Au = f, posed on a finite dimensional Hilbert space V = R N equipped
More informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More informationInterlacing Inequalities for Totally Nonnegative Matrices
Interlacing Inequalities for Totally Nonnegative Matrices Chi-Kwong Li and Roy Mathias October 26, 2004 Dedicated to Professor T. Ando on the occasion of his 70th birthday. Abstract Suppose λ 1 λ n 0 are
More informationMath 471 (Numerical methods) Chapter 3 (second half). System of equations
Math 47 (Numerical methods) Chapter 3 (second half). System of equations Overlap 3.5 3.8 of Bradie 3.5 LU factorization w/o pivoting. Motivation: ( ) A I Gaussian Elimination (U L ) where U is upper triangular
More informationIn particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with
Appendix: Matrix Estimates and the Perron-Frobenius Theorem. This Appendix will first present some well known estimates. For any m n matrix A = [a ij ] over the real or complex numbers, it will be convenient
More informationPermutation transformations of tensors with an application
DOI 10.1186/s40064-016-3720-1 RESEARCH Open Access Permutation transformations of tensors with an application Yao Tang Li *, Zheng Bo Li, Qi Long Liu and Qiong Liu *Correspondence: liyaotang@ynu.edu.cn
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 informationOn optimal improvements of classical iterative schemes for Z-matrices
Journal of Computational and Applied Mathematics 188 (2006) 89 106 www.elsevier.com/locate/cam On optimal improvements of classical iterative schemes for Z-matrices D. Noutsos a,, M. Tzoumas b a Department
More informationDEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix to upper-triangular
form) Given: matrix C = (c i,j ) n,m i,j=1 ODE and num math: Linear algebra (N) [lectures] c phabala 2016 DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix
More informationNonnegative and spectral matrix theory Lecture notes
Nonnegative and spectral matrix theory Lecture notes Dario Fasino, University of Udine (Italy) Lecture notes for the first part of the course Nonnegative and spectral matrix theory with applications to
More informationHere is an example of a block diagonal matrix with Jordan Blocks on the diagonal: J
Class Notes 4: THE SPECTRAL RADIUS, NORM CONVERGENCE AND SOR. Math 639d Due Date: Feb. 7 (updated: February 5, 2018) In the first part of this week s reading, we will prove Theorem 2 of the previous class.
More informationComponentwise perturbation analysis for matrix inversion or the solution of linear systems leads to the Bauer-Skeel condition number ([2], [13])
SIAM Review 4():02 2, 999 ILL-CONDITIONED MATRICES ARE COMPONENTWISE NEAR TO SINGULARITY SIEGFRIED M. RUMP Abstract. For a square matrix normed to, the normwise distance to singularity is well known to
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 36, pp. 39-53, 009-010. Copyright 009,. ISSN 1068-9613. ETNA P-REGULAR SPLITTING ITERATIVE METHODS FOR NON-HERMITIAN POSITIVE DEFINITE LINEAR SYSTEMS
More informationMath/Phys/Engr 428, Math 529/Phys 528 Numerical Methods - Summer Homework 3 Due: Tuesday, July 3, 2018
Math/Phys/Engr 428, Math 529/Phys 528 Numerical Methods - Summer 28. (Vector and Matrix Norms) Homework 3 Due: Tuesday, July 3, 28 Show that the l vector norm satisfies the three properties (a) x for x
More informationAnn. Funct. Anal. 5 (2014), no. 2, A nnals of F unctional A nalysis ISSN: (electronic) URL:
Ann Funct Anal 5 (2014), no 2, 127 137 A nnals of F unctional A nalysis ISSN: 2008-8752 (electronic) URL:wwwemisde/journals/AFA/ THE ROOTS AND LINKS IN A CLASS OF M-MATRICES XIAO-DONG ZHANG This paper
More informationSpectral inequalities and equalities involving products of matrices
Spectral inequalities and equalities involving products of matrices Chi-Kwong Li 1 Department of Mathematics, College of William & Mary, Williamsburg, Virginia 23187 (ckli@math.wm.edu) Yiu-Tung Poon Department
More informationMATH36001 Perron Frobenius Theory 2015
MATH361 Perron Frobenius Theory 215 In addition to saying something useful, the Perron Frobenius theory is elegant. It is a testament to the fact that beautiful mathematics eventually tends to be useful,
More informationAMS Mathematics Subject Classification : 65F10,65F50. Key words and phrases: ILUS factorization, preconditioning, Schur complement, 1.
J. Appl. Math. & Computing Vol. 15(2004), No. 1, pp. 299-312 BILUS: A BLOCK VERSION OF ILUS FACTORIZATION DAVOD KHOJASTEH SALKUYEH AND FAEZEH TOUTOUNIAN Abstract. ILUS factorization has many desirable
More informationSign Patterns with a Nest of Positive Principal Minors
Sign Patterns with a Nest of Positive Principal Minors D. D. Olesky 1 M. J. Tsatsomeros 2 P. van den Driessche 3 March 11, 2011 Abstract A matrix A M n (R) has a nest of positive principal minors if P
More informationMaximizing the numerical radii of matrices by permuting their entries
Maximizing the numerical radii of matrices by permuting their entries Wai-Shun Cheung and Chi-Kwong Li Dedicated to Professor Pei Yuan Wu. Abstract Let A be an n n complex matrix such that every row and
More informationLecture 2 INF-MAT : A boundary value problem and an eigenvalue problem; Block Multiplication; Tridiagonal Systems
Lecture 2 INF-MAT 4350 2008: A boundary value problem and an eigenvalue problem; Block Multiplication; Tridiagonal Systems Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University
More informationSolving Linear Systems
Solving Linear Systems Iterative Solutions Methods Philippe B. Laval KSU Fall 207 Philippe B. Laval (KSU) Linear Systems Fall 207 / 2 Introduction We continue looking how to solve linear systems of the
More informationWavelets and Linear Algebra
Wavelets and Linear Algebra 4(1) (2017) 43-51 Wavelets and Linear Algebra Vali-e-Asr University of Rafsanan http://walavruacir Some results on the block numerical range Mostafa Zangiabadi a,, Hamid Reza
More informationON A HOMOTOPY BASED METHOD FOR SOLVING SYSTEMS OF LINEAR EQUATIONS
TWMS J. Pure Appl. Math., V.6, N.1, 2015, pp.15-26 ON A HOMOTOPY BASED METHOD FOR SOLVING SYSTEMS OF LINEAR EQUATIONS J. SAEIDIAN 1, E. BABOLIAN 1, A. AZIZI 2 Abstract. A new iterative method is proposed
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 informationIterative Methods for Solving A x = b
Iterative Methods for Solving A x = b A good (free) online source for iterative methods for solving A x = b is given in the description of a set of iterative solvers called templates found at netlib: http
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 informationCHAPTER 5. Basic Iterative Methods
Basic Iterative Methods CHAPTER 5 Solve Ax = f where A is large and sparse (and nonsingular. Let A be split as A = M N in which M is nonsingular, and solving systems of the form Mz = r is much easier than
More informationSpectral radius of bipartite graphs
Linear Algebra and its Applications 474 2015 30 43 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Spectral radius of bipartite graphs Chia-an
More informationOn the spectra of striped sign patterns
On the spectra of striped sign patterns J J McDonald D D Olesky 2 M J Tsatsomeros P van den Driessche 3 June 7, 22 Abstract Sign patterns consisting of some positive and some negative columns, with at
More informationComputational Economics and Finance
Computational Economics and Finance Part II: Linear Equations Spring 2016 Outline Back Substitution, LU and other decomposi- Direct methods: tions Error analysis and condition numbers Iterative methods:
More informationA generalization of the Gauss-Seidel iteration method for solving absolute value equations
A generalization of the Gauss-Seidel iteration method for solving absolute value equations Vahid Edalatpour, Davod Hezari and Davod Khojasteh Salkuyeh Faculty of Mathematical Sciences, University of Guilan,
More informationConvergence of Inner-Iteration GMRES Methods for Least Squares Problems
ISSN 1346-5597 NII Technical Report Convergence of Inner-Iteration GMRES Methods for Least Squares Problems Keiichi Moriuni and Ken Hayami NII-212-5E Aug. 212 CONVERGENCE OF INNER-ITERATION GMRES METHODS
More informationSign patterns that allow eventual positivity
Electronic Journal of Linear Algebra Volume 19 Volume 19 (2009/2010) Article 5 2009 Sign patterns that allow eventual positivity Abraham Berman Minerva Catral Luz Maria DeAlba Abed Elhashash Frank J. Hall
More information1. Introduction. We consider restricted Schwarz methods for the solution of linear systems of the form
SIAM J. NUMER. ANAL. Vol. 40, No. 6, pp. 2318 2336 c 2003 Society for Industrial and Applied Mathematics CONVERGENCE THEORY OF RESTRICTED MULTIPLICATIVE SCHWARZ METHODS REINHARD NABBEN AND DANIEL B. SZYLD
More informationAn estimation of the spectral radius of a product of block matrices
Linear Algebra and its Applications 379 (2004) 267 275 wwwelseviercom/locate/laa An estimation of the spectral radius of a product of block matrices Mei-Qin Chen a Xiezhang Li b a Department of Mathematics
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 informationON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH
ON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH V. FABER, J. LIESEN, AND P. TICHÝ Abstract. Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix
More informationReview of Basic Concepts in Linear Algebra
Review of Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University September 7, 2017 Math 565 Linear Algebra Review September 7, 2017 1 / 40 Numerical Linear Algebra
More informationDetailed Proof of The PerronFrobenius Theorem
Detailed Proof of The PerronFrobenius Theorem Arseny M Shur Ural Federal University October 30, 2016 1 Introduction This famous theorem has numerous applications, but to apply it you should understand
More informationMath 502 Fall 2005 Solutions to Homework 3
Math 502 Fall 2005 Solutions to Homework 3 (1) As shown in class, the relative distance between adjacent binary floating points numbers is 2 1 t, where t is the number of digits in the mantissa. Since
More informationMATRIX SPLITTING PRINCIPLES
IJS 8:5 00 5 84 PII. S067000706 http://ijmms.hindawi.com Hindawi Publishing Corp. ATRIX SPLITTING PRINCIPLES ZBIGNIEW I. WOŹNICKI Received 5 arch 00 Abstract. The systematic analysis of convergence conditions,
More informationarxiv: v1 [math.ra] 11 Aug 2014
Double B-tensors and quasi-double B-tensors Chaoqian Li, Yaotang Li arxiv:1408.2299v1 [math.ra] 11 Aug 2014 a School of Mathematics and Statistics, Yunnan University, Kunming, Yunnan, P. R. China 650091
More informationSome bounds for the spectral radius of the Hadamard product of matrices
Some bounds for the spectral radius of the Hadamard product of matrices Tin-Yau Tam Mathematics & Statistics Auburn University Georgia State University, May 28, 05 in honor of Prof. Jean H. Bevis Some
More information2 Two-Point Boundary Value Problems
2 Two-Point Boundary Value Problems Another fundamental equation, in addition to the heat eq. and the wave eq., is Poisson s equation: n j=1 2 u x 2 j The unknown is the function u = u(x 1, x 2,..., x
More informationarxiv: v3 [math.ra] 22 Aug 2014
arxiv:1407.0331v3 [math.ra] 22 Aug 2014 Positivity of Partitioned Hermitian Matrices with Unitarily Invariant Norms Abstract Chi-Kwong Li a, Fuzhen Zhang b a Department of Mathematics, College of William
More informationTwo Characterizations of Matrices with the Perron-Frobenius Property
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2009;??:1 6 [Version: 2002/09/18 v1.02] Two Characterizations of Matrices with the Perron-Frobenius Property Abed Elhashash and Daniel
More informationKey words. Strongly eventually nonnegative matrix, eventually nonnegative matrix, eventually r-cyclic matrix, Perron-Frobenius.
May 7, DETERMINING WHETHER A MATRIX IS STRONGLY EVENTUALLY NONNEGATIVE LESLIE HOGBEN 3 5 6 7 8 9 Abstract. A matrix A can be tested to determine whether it is eventually positive by examination of its
More informationIterative techniques in matrix algebra
Iterative techniques in matrix algebra Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan September 12, 2015 Outline 1 Norms of vectors and matrices 2 Eigenvalues and
More informationProperties for the Perron complement of three known subclasses of H-matrices
Wang et al Journal of Inequalities and Applications 2015) 2015:9 DOI 101186/s13660-014-0531-1 R E S E A R C H Open Access Properties for the Perron complement of three known subclasses of H-matrices Leilei
More informationSpectral radius, symmetric and positive matrices
Spectral radius, symmetric and positive matrices Zdeněk Dvořák April 28, 2016 1 Spectral radius Definition 1. The spectral radius of a square matrix A is ρ(a) = max{ λ : λ is an eigenvalue of A}. For an
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 informationPerron Frobenius Theory
Perron Frobenius Theory Oskar Perron Georg Frobenius (1880 1975) (1849 1917) Stefan Güttel Perron Frobenius Theory 1 / 10 Positive and Nonnegative Matrices Let A, B R m n. A B if a ij b ij i, j, A > B
More informationWhat is A + B? What is A B? What is AB? What is BA? What is A 2? and B = QUESTION 2. What is the reduced row echelon matrix of A =
STUDENT S COMPANIONS IN BASIC MATH: THE ELEVENTH Matrix Reloaded by Block Buster Presumably you know the first part of matrix story, including its basic operations (addition and multiplication) and row
More informationGeometric Mapping Properties of Semipositive Matrices
Geometric Mapping Properties of Semipositive Matrices M. J. Tsatsomeros Mathematics Department Washington State University Pullman, WA 99164 (tsat@wsu.edu) July 14, 2015 Abstract Semipositive matrices
More informationc 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp , March
SIAM REVIEW. c 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp. 93 97, March 1995 008 A UNIFIED PROOF FOR THE CONVERGENCE OF JACOBI AND GAUSS-SEIDEL METHODS * ROBERTO BAGNARA Abstract.
More informationLecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?
KTH ROYAL INSTITUTE OF TECHNOLOGY Norms for vectors and matrices Why? Lecture 5 Ch. 5, Norms for vectors and matrices Emil Björnson/Magnus Jansson/Mats Bengtsson April 27, 2016 Problem: Measure size of
More informationRemarks on BMV conjecture
Remarks on BMV conjecture Shmuel Friedland April 24, 2008 arxiv:0804.3948v1 [math-ph] 24 Apr 2008 Abstract We show that for fixed A, B, hermitian nonnegative definite matrices, and fixed k the coefficients
More information6. Iterative Methods for Linear Systems. The stepwise approach to the solution...
6 Iterative Methods for Linear Systems The stepwise approach to the solution Miriam Mehl: 6 Iterative Methods for Linear Systems The stepwise approach to the solution, January 18, 2013 1 61 Large Sparse
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 informationSection 3.9. Matrix Norm
3.9. Matrix Norm 1 Section 3.9. Matrix Norm Note. We define several matrix norms, some similar to vector norms and some reflecting how multiplication by a matrix affects the norm of a vector. We use matrix
More informationClassical iterative methods for linear systems
Classical iterative methods for linear systems Ed Bueler MATH 615 Numerical Analysis of Differential Equations 27 February 1 March, 2017 Ed Bueler (MATH 615 NADEs) Classical iterative methods for linear
More informationOn the simultaneous diagonal stability of a pair of positive linear systems
On the simultaneous diagonal stability of a pair of positive linear systems Oliver Mason Hamilton Institute NUI Maynooth Ireland Robert Shorten Hamilton Institute NUI Maynooth Ireland Abstract In this
More information