Two-parameter preconditioned NSS method for non-hermitian and positive definite linear systems
|
|
- Βηθεσδά Γεννάδιος
- 7 χρόνια πριν
- Προβολές:
Transcript
1 Sept. 013 Communication on Applied Mathematics and Computation Vol.7 No.3 DOI /j.issn Two-parameter preconditioned NSS method for non-hermitian and positive definite linear systems WANG Yang 1,, WU Yu-jiang, FAN Xiao-yan (1. College of Mathematics, Jilin Normal University, Siping , Jilin Province, China;. School of Mathematics and Statistics, Lanzhou University, Lanzhou , China) (Communicated by BAI Zhong-zhi) Abstract By using the normal and skew-hermitian splitting (NSS) iteration technique for large sparse non-hermitian and positive definite linear systems, a two-parameter preconditioned NSS iteration, which gives the actually generalized form of the preconditioned NSS method is proposed. Theoretical analysis shows that the new iterative method converges to the unique solution of the linear system. Moreover, the optimal choice of two parameters involved in the new method and the corresponding imum value for the upper bound of the iterative spectrum are derived and computed. For the actual implementation of this method, the incomplete LU (ILU) decomposition and the incremental unknowns (IUs) are chosen as two types of the preconditioners. Numerical results confirm the analysis of the convergence theory and the effectiveness of the proposed method. Key words normal and skew-hermitian splitting; positive definite linear system; incremental unknown; incomplete LU (ILU) decomposition; preconditioner 010 Mathematics Subject Classification 65F10; 65F08; 65N Chinese Library Classification O41.6 Hermite Đ Ð Þ Ý ß NSS 1, ( ;. ¹Ö Ä ¹Ö ) ( ÔÓŲ) Received ; Revised Project supported by the National Basic Research Program of China (973 Program, 011CB706903) and the Natural Science Foundation of Jilin Province of China (01115) Corresponding author WU Yu-jiang, research interests are mathematical theory and applications of scientific computing. myjaw@lzu.edu.cn
2 No. 3 WANG Yang, et al.: Two-parameter preconditioned NSS method 33 Ê Hermite Ì Ø Hermite (normal and skew-hermitian splitting, NSS) ÃÅ Õ½ NSS  ± NSS Å» É Ï ¼ Ì Ø Ç µ ÅÆ ÅË Ï Ô ½ Ù À ÙÍ Ò Ï ± Ô ³ Æ LU µ ¾ÈÑ Ú ½º Ò Á ¼» Î Ð Hermite Ì Ø ¾ÈÑ Æ LU µ 010 «65F10; 65F08; 65N O41.6 Æ Ü Å A Æ Û (013) Introduction Consider the following large sparse non-hermitian and positive definite system of linear equations: Ax = b, (1) where A C n n, and x, b C n. This system comes from the spatial discretization of a class of partial differential equations (see, e.g., [1-] and references therein). Based on the Hermitian and skew-hermitian splitting (HSS), A = H + S, where H = 1 (A + A ), and S = 1 (A A ), Bai, et al. [3] established a class of HSS iteration methods for solving the non-hermitian system of linear equations (1). They proved that the HSS iteration converges unconditionally to the exact solution of (1). In order to accelerate the HSS iteration method, Li, et al. [4] presented the asymmetric Hermitian and skew-hermitian splitting (AHSS) iteration method which introduced two parameters α and β in the HSS method. The AHSS iteration method can converge to the unique solution of (1) with any given nonnegative α, if β is restricted in an appropriate region. The generalized preconditioned HSS (GPHSS) method in [] gave us a more detailed convergence analysis about the AHSS method. Moreover, they used the AHSS iteration scheme to solve a preconditioned system and gave us the exact computation of the parameters α and β. Furthermore, to make the HSS method more attractive, based on the normal and skew- Hermitian splitting (NSS) of A, i.e., A = N + S, () where N C n n is a normal matrix, and S C n n is a skew-hermitian matrix, Bai, et al. [5] proposed also an iterative method called the NSS method based on this particular splitting, (αi + N)x k+ 1 = (αi S)x k + b, (3) (αi + S)x k+1 = (αi N)x k+ 1 + b,
3 34 Communication on Applied Mathematics and Computation Vol. 7 where α is a given positive constant. The NSS method can be viewed as a generalized version of the HSS iteration [3,6]. The theoretical analysis shows that the NSS iterative scheme converges unconditionally to the unique solution of the linear system (1). The numerical result of the NSS scheme is very effective and robust when it is used to solve the large sparse positive definite system of linear equations (1). However, with different properties of the matrices N and S, there is no reason to use one same parameter α in the iteration. In order to optimize the NSS method [,4], we introduce two different parameters α and β in the NSS method (3). This produces a new method which is called the generalized NSS (GNSS) method. GNSS method Given an initial guess x 0 for k = 0, 1,, until {x k } converges, compute (αi + N)x k+ 1 = (αi S)x k + b, (4) (βi + S)x k+1 = (βi N)x k+ 1 + b, where α is a given nonnegative constant, and β is a given positive constant. Obviously, the GNSS method is a generalized form of the NSS method since GNSS reduces to NSS when α = β. In view of [,7-8], the GNSS method can be considered to be designed for solving another preconditioned linear system  x = b with  = R AR 1, x = Rx, and b = R b, where R C n n is a prescribed nonsingular matrix, and R = (R 1 ) is the conjugate transpose of R 1. We usually take an Hermitian positive definite matrix P = R R for preconditioning. Finally, a kind of generalized preconditioned NSS (GPNSS) method is defined. GPNSS method Given an initial guess x 0 for k = 0, 1,, until {x k } converges, compute (αp + N)x k+ 1 = (αp S)x k + b, (5) (βp + S)x k+1 = (βp N)x k+ 1 + b, where α is a given nonnegative constant, and β is a given positive constant. Since HSS is a special version of NSS, the new method GPNSS (5) is actually the generalization of the GPHSS method. It preserves all properties of HSS, AHSS, NSS, and GPHSS iteration methods. One can also refer to [-5] for details. The new method GPNSS has the preconditioned NSS (PNSS) method as its special case when α = β. Moreover, the NSS method is evidently a trivial case with α = β and without preconditioner. In the following part, we will prove that the GPNSS method is convergent under certain domain conditions for the two parameters. This will generalize essentially what exists for the NSS and PNSS methods. The convergence analysis for GPNSS is, in particular, consistent with those for GPHSS if one uses HSS. Optimal choice of parameters α, β in GPNSS and imum upper bound for the spectral radius of the iterative matrix are derived and computed by two steps in accordance with two independent spectral conditions.
4 No. 3 WANG Yang, et al.: Two-parameter preconditioned NSS method 35 By using incremental unknowns (IUs) [9-1] and ILU decomposition [13-15] as our preconditioners, respectively, we perform the numerical tests with NSS, GNSS, and GPNSS methods. Numerical results not only confirm the theoretical analysis of the new method, but also show us the advantages of the IU preconditioner over other methods. The structure of the paper is as follows. In Section 1, a theorem for the convergence of the GPNSS method is established and proved. In Section, optimal parameters and imum values of the upper bound of the iterative spectrum radius are derived. Numerical experiments with the IUs preconditioner and the ILU decomposition preconditioner are presented in Section 3. Here, we apply the numerical results for comparison with many other existing methods to show the efficiency of the new methods. 1 Convergence analysis To simplify notations in the proof process for convergence, we rewrite equivalently the GPNSS method as a one-step iteration, i.e., where x k+1 = M(α, β)x k + N(α, β)b, M(α, β) = (βp + S) 1 (βp N)(αP + N) 1 (αp S), N(α, β) = (α + β)(βp + S) 1 P(αP + N) 1. Here, M(α, β) stands for the iterative matrix of the GPNSS iteration. The standard theory of iteration indicates that, if the spectral radius of the iteration matrix M(α, β) is strictly less than 1, then the GPNSS method converges. Since S is skew-hermitian, we know that all eigenvalues of P 1 S are imaginary. In particular, the jth eigenvalues of P 1 S are of the form ie j (j = 1,,, n) with i = 1. As for the eigenvalues of P 1 N, they are usually complex numbers. The following theorem demonstrates the convergence property of the GPNSS iteration. Theorem 1 Let A C n n be a positive definite matrix, P C n n be a Hermitian positive definite matrix, and Θ 1, Θ be spectral sets of matrices P 1 N and P 1 S, respectively. For any eigenvalue λ k = γ k + iη k Θ 1 with its real part γ k, imaginary part η k, and i = 1, k = 1,,, n, we denote γ = η = For any eigenvalue in Θ, we denote also {γ k}, γ = {γ k}, k=1,,,n k=1,,,n { η k }, η = { η k }. k=1,,,n k=1,,,n e = ie j Θ { e j }, e = ie j Θ { e j }.
5 36 Communication on Applied Mathematics and Computation Vol. 7 Then, the spectral radius ρ(m(α, β)) of the GPNSS iteration is bounded by (β γ k ) σ(α, β) = + η + e k j γ k +iη k Θ 1 (α + γ k ) + ηk ie j Θ β + e. (6) j Furthermore, the GPNSS method (5) converges to the unique solution x C n of the linear system (1) if the parameters α and β satisfy either of the following two conditions. (i) If η < 4 γ γ, then (α, β) Ω i with i=1 Ω 1 = {(α, β) α β < β(α)}, Ω = {(α, β) β < {α, β(α)}, Ψ 1 (α, β) < 0}, Ω 3 = {(α, β) β(α) β α, Ψ (α, β) < 0}, Ω 4 = {(α, β) β {α, β(α)}}, where functions Ψ 1 (α, β), Ψ (α, β), and β(α) are defined by Ψ 1 (α, β) = (γ e )(α β) αβγ e γ + (α β)η, Ψ (α, β) = (γ e )(α β) αβγ e γ + (α β)η, (7) β(α) = γ γ + α(γ + γ ) η α + γ + γ. (ii) If η γ γ, then (α, β) Π 1 = {(α, β) α β}, 3 Π i with i=1 Π = {(α, β) α > β β(α), Ψ (α, β) < 0}, Π 3 = {(α, β) β < {α, β(α)}, Ψ 1 (α, β) < 0}, where β(α), Ψ 1 (α, β), and Ψ (α, β) are the same as in (7). Proof The spectral radius ρ(m(α, β)) of the iterative matrix M(α, β) is evidently bounded by a multiplicative product of two quantities, i.e., ρ((βp + S)M(α, β)(βp + S) 1 ) = ρ((βp N)(αP + N) 1 (αp S)(βP + S) 1 ) = ρ((βi P 1 N)(αI + P 1 N) 1 (αi P 1 S)(βI + P 1 S) 1 ) (βi P 1 N)(αI + P 1 N) 1 (αi P 1 S)(βI + P 1 S) 1 = λ k Θ 1 β λ k α + λ k ie j Θ α + e j β + e j
6 No. 3 WANG Yang, et al.: Two-parameter preconditioned NSS method 37 = γ k +iη k Θ 1 (β γ k ) + ηk (α + γ k ) + ηk ie j Θ α + e j β + e. (8) j Since α β + γ > 0, it is easy to verify that ((β γ) + η )/((α + γ) + η ) is an increasing function with respect to the variable η. This leads γ k +iη k Θ 1 (β γ k ) + η k (α + γ k ) + η k = γ γ k γ (β γ k ) + η (α + γ k ) + η { (β γ ) = + η, } (β γ ) + η (α + γ ) + η. (9) Similarly, we can obtain ie j Θ α + e j β + e j α + e β + e, α β, = α + e β + e, α > β. (10) In the following process of the proof, we will consider two cases. Case 1 η < γ γ. Due to the definition of β(α), it follows that the right-hand side of (9) is equal to (β γ ) + η (α + γ ) + η, β < β(α), (β γ ) + η, β β(α). (11) Now, let us divide the region D = {(α, β) α > 0, β > 0} into four subregions, i.e., D = 4 D i (see Fig. 1 with α 0 = γ γ η), where i=1 D 1 = {(α, β) α β < β(α)}, D = {(α, β) β < {β(α), α}}, D 3 = {(α, β) β(α) β < α}, D 4 = {(α, β) β {β(α), α}}. (1)
7 38 Communication on Applied Mathematics and Computation Vol. 7 Fig. 1 Four subregions of D Our observation is that, there are four different bounds for the spectral radius ρ(m(α, β)) when (α, β) in the four different subregions D 1, D, D 3, and D 4. Actually, the following facts are deduced. (a) For (α, β) D 1, by (8), (10), and (11), we have directly the following inequality: (β γ ) ρ(m(α, β)) < + η (α + γ ) + η + e β + e < 1. (b) For (α, β) D, the spectral radius ρ(m(α, β)) satisfies (β γ ) ρ(m(α, β)) < + η (α + γ ) + η + e β + e. The right-hand side is strictly less than 1, if and only if Ψ 1 (α, β) = (γ e )(α β) αβγ e γ + (α β)η < 0. (c) For (α, β) D 3, it follows that if and only if ρ(m(α, β)) < (β γ ) + η α + e β + e < 1, Ψ (α, β) = (γ e )(α β) αβγ e γ + (α β)η < 0. (d) For (α, β) D 4, we have the following inequality: (β γ ) ρ(m(α, β)) < + η + e β + e < 1. Therefore, we obtain in Case 1 ρ(m(α, β)) < 1, 4 (α, β) Ω i. i=1
8 No. 3 WANG Yang, et al.: Two-parameter preconditioned NSS method 39 Case η γ γ. Making use of the definition of β(α) and (10), we find that the right-hand side of (8) is equal to (β γ ) + η + e β + e, α β, (β γ ) + η + e β + e, α > β β(α), (13) (β γ ) + η (α + γ ) + η + e β + e, β < {α, β(α)}. It is natural to divide the region D = {(α, β) α > 0, β > 0} into three other subregions D = 3 (see Fig. ), where Di i=1 D1 = {(α, β) α β}, D = {(α, β) α > β β(α)}, (14) D3 = {(α, β) β < {α, β(α)}}. Fig. Three subregions of D (a) For (α, β) D1, the spectral radius satisfies (β γ ) ρ(m(α, β)) < + η + e β + e < 1. (b) For (α, β) D, the spectral radius satisfies (β γ ) ρ(m(α, β)) < + η + e β + e < 1, if and only if Ψ (α, β) < 0 holds true. (c) For (α, β) D3, the spectral radius satisfies (β γ ) ρ(m(α, β)) < + η (α + γ ) + η + e β + e < 1,
9 330 Communication on Applied Mathematics and Computation Vol. 7 if and only if Ψ 1 (α, β) < 0 holds true. Therefore, we obtain in Case, ρ(m(α, β)) < 1, 3 (α, β) Π i. i=1 Remark 1 When P = I, the identity matrix, the GPNSS iteration reduces to the GNSS iteration. The convergence property of the GPNSS method also reduces to the GNSS s. Remark When α = β, the GPNSS iteration reduces to the PNSS iteration, which is unconditionally convergent. Remark 3 The GPHSS method is one of the special forms of GPNSS with η = 0. We can check that the convergence conclusion here is consistent with that for GPHSS in []. Optimality Let us denote (α, β ) = arg {σ(α, β)}. α,β The optimal parameters (α, β ) to the GPNSS iteration and the imum upper bound of ρ(m(α, β)) are described in the following two theorems. Theorem In the case η < γ γ, let Ψ 3 (α, β) > 0 and Ψ 4 (α, β) > 0. Then, the optimal parameters are (α 1, β(α 1 )), γ γ η e, (α, β ) = (α 0, β(α 0 )), e < γ γ η < e, (15) (α, β(α )), γ γ η e, where Ψ 3 (α, β) = e γ βη + β γ βγ + βe, Ψ 4 (α, β) = e γ βη + β γ βγ + βe, α 1 = η + e γ γ + 1, γ + γ α = η + e γ γ +, γ + γ 1 = (e + γ )(e + γ ) + η (η + e γ γ ), = (e + γ )(e + γ ) + η (η + e γ γ ). (16)
10 No. 3 WANG Yang, et al.: Two-parameter preconditioned NSS method 331 Furthermore, the imum value of σ(α, β) is given by σ(α 1 ), γ γ η e, σ(α, β ) = σ(α 0 ), e < γ γ η < e, σ(α ), γ γ η e, where the function σ(α) will be specified in the proof process (see (19)). Proof From (11) and (10), we obtain that (β γ ) + η (α + γ ) + η + e β + e, (α, β) D 1, (β γ ) + η (α + γ ) + η + e β + e, (α, β) D, σ(α, β) = (β γ ) + η + e β + e, (α, β) D 3, (β γ ) + η + e β + e, (α, β) D 4. (17) (18) By straightforward computation, we find that the partial derivative of the function σ(α, β) with respect to β satisfies σ β (α, β) < 0 for (α, β) D 1 D. By using Ψ 3 (α, β) > 0 and Ψ 4 (α, β) > 0, we find that σ β (α, β) > 0 for (α, β) D 3 D 4. Thus, the imum values of the function σ(α, β) are exactly on the curve β = β(α). Now, we turn to look for imum points of σ(α) instead of looking for imum points of σ(α, β), where (β(α) γ ) + η (α + γ ) + η + e β(α) + e, α > α 0, σ(α) := σ(α, β(α)) = (β(α) γ ) + η + e β(α) + e, α α 0. (19) Evidently, the derivative of σ(α) has the forms c σ 1 (α)η 1 (α), α > α 0, (α) = c (α)η (α), α α 0, where c 1 (α) and c (α) are two positive functions, and η 1 (α) = (γ + γ )α + (γ γ e η)α e (γ + γ ), η (α) = (γ + γ )α + (γ γ e η )α e (γ + γ ). (0) (1) Note that η 1 (α) has both a negative root and a positive root. So has η (α). Let us denote the two positive roots of η 1 (α) and η (α) by α 1 and α, respectively. Since the values of the
11 33 Communication on Applied Mathematics and Computation Vol. 7 two functions at α 0 are η 1 (α 0 ) = (γ + γ + γ γ )(γ γ η e ), η (α 0 ) = (γ + γ + γ γ )(γ γ η e ), () we observe the following facts. (a) If γ γ η e, then the unique imum of σ(α, β) is σ(α 1), which is σ(α 1, β(α 1 )) for α 1 > α 0. (b) If e > γ γ η > e, then the unique imum of σ(α, β) is σ(α 0), which is σ(α 0, β(α 0 )). (c) If γ γ η e, then the unique imum of σ(α, β) is σ(α ), which is σ(α, β(α )) for α < α 0. Remark 4 One can check the evaluations of the parameters here which are absolutely the same as in the GPHSS method when GPNSS reduces to GPHSS. Theorem 3 In the case η γ γ, the optimal parameters are (α, β ), γ + η e, (α, β ) = (µ 0, µ 0 ), e < γ + η < e, (3) (α 1, β 1 ), γ + η e, where α 1 = (γ + η ) + e + ((η + e ) + γ )((η e ) + γ ), γ α = (γ + η ) + e + ((η + e ) + γ )((η e ) + γ ), γ β 1 = (γ + η ) e + ((η + e ) + γ )((η e ) + γ ), γ β = (γ + η ) e + ((η + e ) + γ )((η e ) + γ ). γ (4) Furthermore, the imum value of σ(α, β) is given by σ(α, β ), γ + η e, σ(α, β) = σ(µ 0, µ 0 ), e < γ + η < e, σ(ᾱ 1, β 1 ), γ + η e, (5) where µ 0 = γ + η.
12 No. 3 WANG Yang, et al.: Two-parameter preconditioned NSS method 333 Proof From (13), we have (β γ ) + η (α + γ ) + η + e β + e, (α, β) D1, (β γ σ(α, β) = ) + η + e β + e, (α, β) D, (β γ ) + η (α + γ ) + η + e β + e, (α, β) D3. (6) It is evident that σ β (α, β) < 0 for (α, β) D3. In order to find the imum value of σ(α, β), we need only to find the imum value of the following two equations: (β γ ) + η + e β + e, (α, β) D1, σ(α, β) = (β γ ) + η α + e β + e, (α, β) D. Two partial derivatives σ α (α, β) and σ β (α, β) of the function σ(α, β) are needed in the following. In fact, we have c 1 (α, β)η 1 (α), (α, β) D1, σ α (α, β) = c (α, β)η (α), (α, β) D, (8) where c 1 (α, β) and c (α, β) are two positive functions. Moreover, both η 1 and η are two functions with respect to α, η 1 (α) = γ α + (η + γ e )α γ e, η (α) = γ α + (η + γ e )α γ e. (7) (9) Similarly, we have also c 3 (α, β)η 3 (β), (α, β) D1, σ β (α, β) = c 4 (α, β)η 4 (β), (α, β) D, (30) where c 3 (α, β) and c 4 (α, β) are also two positive functions. Moreover, both η 3 and η 4 are two functions with respect to β, η 3 (β) = γ β + (e (η + γ ))β γ e, (31) η 4 (β) = γ β + (e (η + γ))β γ e. Note that the four functions η 1 (α), η (α), η 3 (β), and η 4 (β) have the same property. Each of them has both a negative root and a positive root. We denote the four positive roots of
13 334 Communication on Applied Mathematics and Computation Vol. 7 them by α 1, α, β 1, and β, respectively. Moreover, we are definite to observe the following facts. (a) If γ + η e, then α 1 > β 1, α > β. Therefore, the function σ(α, β) does not have its imum value in D 1. While in the region {(α, β) α > β}, the function σ(α, β) has its imum value at the point (α, β ). As a matter of fact, σ(α, β ) is the imum (β γ) value of the function +η (α+γ ) +η follows, then, σ(α, β ) α +e β +e in the region {(α, β) α > 0, β > 0}. It (β γ ) + η + e β + e, (β γ ) + η + e β + e, α β. Finally, please note that the point (α, β ) is in D because β > β(α ). Therefore, under the condition of γ +η e, the imum value of σ(α, β) in the region {(α, β) α > 0, β > 0} is exactly σ(α, β ). (b) If e < γ +η < e, then α 1 > β 1, α < β. It is easy to see that (α i, β i ) is not in Di for i = 1,. Hence, the function σ(α, β) has its imum value at the line α = β. The imum point, which we denote by µ 0, is just the zero of the derivative of σ(α, α). We find µ 0 = γ + η. Therefore, the imum value of σ(α, β) is σ(µ 0, µ 0 ). (c) If γ + η e, then α 1 < β 1, α < β. Therefore, the function σ(α, β) does not have its imum value in D. While in D 1, the function σ(α, β) has its imum value at the point (α 1, β 1 ). As a matter of fact, σ(α 1, β 1 ) is the imum value of the function (β γ) +η (α+γ ) +η α +e β +e in the region {(α, β) α > 0, β > 0}. It follows, then, (β γ ) σ(α 1, β 1 ) + η + e, (β γ ) + η β + e α + e β + e, α > β. Therefore, under the condition of γ + η e, the imum value of σ(α, β) in the region {(α, β) α > 0, β > 0} is σ(α 1, β 1 ). 3 Numerical results Example 1 Consider the following convection-diffusion equation: (u xx + u yy ) + bu x = f in Ω, u = 0 on Ω,
14 No. 3 WANG Yang, et al.: Two-parameter preconditioned NSS method 335 where b > 0 is a constant, and Ω = [0, 1]. After using the five-point discretization with the mesh size h [16], 1 h (4u ij u i 1,j u i+1,j u i,j 1 u i,j+1 ) + b h (u i+1,j u i 1,j ) = f ij, where u ij and f ij are the approximate values of u and f, we get a linear system AU = b. (3) Unlike the splitting HSS, the splitting NSS is not unique for a given matrix A. We use the NSS (see, e.g., [5]) N = 1 (A + A ) + S r, S = 1 (A A ) S r, S r = ici with i = 1 and c a real number. Let H = 1 (A+A ). Then, HS r = S r H. One can check that H + S r is a normal matrix. 3.1 Incremental unknowns preconditioner It is well known that the IUs method can effectively reduce the condition number of the coefficient matrix (see [,9-1]). We choose here IUs as our preconditioner at first. Let U be the vector corresponding to the IUs and R be the transfer matrix, i.e., U = RU. Then, the system (3) becomes AU = b, where A = R T AR and b = R T b. The preconditioner matrix P is chosen to be P = (RR T ) ILU factorization preconditioner For a non-symmetric matrix A, especially when A is banded, another preconditioning strategy is based on the ILU decomposition (see [13-15]). We compute the LU decomposition of A but drop any fill-in in L or U outside of the original structure of A. Higher accuracy incomplete decompositions are also used as follows: ILU(p) allows for p additional diagonals in L and U. One can refer to [17] for more details. In our numerical experiments, we use only p = 0. Remark 5 Here for the ILU preconditioner, the matrix P is only positive but not symmetric. One has not yet had efficiently theoretical analysis for this non-symmetric positive preconditioner up to now. It will become our future work to do this. However, the algorithm and numerical tests of computation are available for our problem. 3.3 Spectral radius and convergence We will exae the spectral radius and convergence region of the GPNSS method in this part. In order to be clear, we perform numerical tests in two cases.
15 336 Communication on Applied Mathematics and Computation Vol. 7 Case 1 We take b = 1 in the model equation and c = 1 in the splitting NSS. One can check that for NSS, GNSS, and GPNSS (IU) methods, the spectral conditions are η < γ γ and γ γ η e. While for the GPNSS (ILU) method, the conditions are η γ γ and η + γ e. By Theorem 1, we obtain the convergence region C of GPNSS (IU) C = {(α, β) α > 0, β > β 1 (α)} = 4 Ω i, where 45.71α 1.55 β 1 (α) = 13.47α , and the parameter (α, β) is (α, β(α )). See the convergence region in Fig. 3. The value of (α, β) can be detered according to the conclusions of Theorems and 3. The comparison of the spectral radius is given in Table 1, where n 0 is the number of the coarsest grid in the discretization of IUs. It shows that the spectral radii of the GPNSS (IU) method are much smaller than those of NSS, GNSS, and GPNSS (ILU) methods. i=1 Fig. 3 Convergence region of GPNSS (IU) method NSS Table 1 Comparison of radius with b=1 n α ρ(m(α)) α GNSS β ρ(m(α, β)) α GPNSS (ILU) β ρ(m(α, β)) α GPNSS (IU) β ρ(m(α, β))
16 No. 3 WANG Yang, et al.: Two-parameter preconditioned NSS method 337 Case We take b = 10 in the model equation and c = 3 in the NS splitting. One can also check that the spectral conditions are η γ γ and e < γ +η < e. By Theorems 1 and 3, we obtain the convergence region C of GPNSS (IU) (see also Fig. 4) where C = {(α, β) α > 0, β > β (α)} = β (α) = 8.13α α , 3 Π i, and the parameter (α, β) is (µ 0, µ 0 ). For our example here, the set Π 3 is empty. Table also gives us a comparison of the spectral radius. Note that in this case, the GNSS method is reduced to the NSS method. i=1 Fig. 4 Convergence region of GPNSS(IU) method NSS (GNSS) Table Comparison of radius with b=10 n α ρ(m(α)) α GPNSS (ILU) β ρ(m(α, β)) α GPNSS (IU) β ρ(m(α, β)) Convergence speed For the given differential equation, we perform also numerical experiments to compare the convergence speed of NSS, GNSS, GPNSS (ILU), and GPNSS (IU) for two cases. With different number n 0, we list the number of iteration and the CPU time of the numerical computations for b = 1 and b = 10 in Tables 3 and 4, respectively. Given the tolerance r k < 10 7, we find that GPNSS (IU) is better than other three methods for both IT
17 338 Communication on Applied Mathematics and Computation Vol. 7 (iteration) and the CPU (time) as N increases. It shows also that using the IU preconditioner in GPNSS is more efficient than using the ILU preconditioner in GPNSS when n 0 becomes large. NSS GNSS GPNSS (ILU) GPNSS (IU) NSS (GNSS) GPNSS (ILU) GPNSS (IU) Table 3 Comparison of iterations and CPU time with b=1 n IT CPU IT CPU IT CPU IT CPU Table 4 Comparison of iterations and CPU time with b=10 n IT CPU IT CPU IT CPU Example Consider the system of linear equations Ax = b with the coefficient matrix [ ] B E A =, E T 0.5I where [ I T + T I 0 B = 0 I T + T I ] [ R m m I F, E = F I ] R m m, and T = tridiag( 1,, 1) R m m, F = δh tridiag( 1, 1, 0) R m m with h = 1 m+1 the mesh size of discretization (see also [18]). Since HSS is a special and specific splitting of NSS, we choose N = 1 (A + A ) and S = 1 (A A) in our numerical test. From the actual computation, we find that η < γ γ and e < γ γ < e. By Theorems 1 and, we can easily conclude that the GPNSS iteration method is convergent unconditionally, and the two parameters α and β are identical. Actually, one can deduce that α = β = γ γ. The experimental
18 No. 3 WANG Yang, et al.: Two-parameter preconditioned NSS method 339 optimal parameters α, β and the corresponding spectral radii ρ(m(α, β)) are listed in Table 5, and the number of iterations and the CPU time in seconds are listed in Table 6. NSS (GNSS) Table 5 Comparison of radius with δ=10 m α ρ(m(α)) α GPNSS (ILU) β ρ(m(α, β)) NSS (GNSS) GPNSS (ILU) Table 6 Comparison of iterations and CPU time with δ=10 m IT CPU IT CPU Remark 6 The splitting NSS is not unique for a given matrix A. For the sake of simplicity, our NSS here is specifically the same as HSS in our numerical test. It is still a problem to be solved whether other types of splitting NSS may result in better convergence analysis. Remark 7 The coefficient matrix of the linear system in our test is just a special case of generalized saddle-point problems. When A is a non-hermitian positive semidefinite matrix in linear systems, for example, A = [ B E E 0 the GPNSS iteration method may not be particularly suitable. However, this will be another important topic. New work of research on it may appear elsewhere in the future. ], References [1] Golub G H, Van L C. Matrix Computations [M]. 3rd ed. Baltimore: The Johns Hopkins University Press, [] Yang A L, An J, Wu Y J. A generalized preconditioned HSS method for non-hermitian positive definite linear systems [J]. Appl Math Comput, 010, 16: [3] Bai Z Z, Golub G H, Ng M K. Hermitian and skew-hermitian splitting methods for non- Hermitian positive definite linear systems [J]. SIAM J Matrix Anal Appl, 003, 4: [4] Li L, Huang T Z, Liu X P. Asymmetric Hermitian and skew-hermitian splitting methods for positive definite linear systems [J]. Comput Math Appl, 007, 54: [5] Bai Z Z, Golub G H, Ng M K. On successive-overrelaxation acceleration of the Hermitian and skew-hermitian splitting iterations [J]. Numer Linear Algebra Appl, 007, 14:
19 340 Communication on Applied Mathematics and Computation Vol. 7 [6] Bai Z Z, Golub G H, Lu L Z, Yin J F. Block triangular and skew-hermitian splitting methods for positive definite linear systems [J]. SIAM J Sci Comput, 005, 6(3): [7] Bai Z Z, Golub G H, Li C K. Convergence properties of preconditioned Hermitian and skew- Hermitian splitting methods for non-hermitian positive semidefinite matrices [J]. Math Comput, 007, 76: [8] Bai Z Z, Golub G H, Pan J Y. Preconditioned Hermitian and skew-hermitian splitting methods for non-hermitian positive semidefinite linear systems [J]. Numer Math, 004, 98: 1-3. [9] Chen M, Temam R. Incremental unknowns for solving partial differential equations [J]. Numer Math, 1991, 59: [10] Chen M, Temam R. Incremental unknowns in finite differences: condition number of the matrix [J]. SIAM J Matrix Anal Appl, 1993, 14: [11] Song L J, Wu Y J. A modified Crank-Nicolson scheme with incremental unknowns for convection doated diffusion equations [J]. Appl Math Comput, 010, 15: [1] Wu Y J, Wang Y, Zeng M L, Yang A L. Implementation of modified Marder-Weitzner method for solving nonlinear eigenvalue problems [J]. J Comput Appl Math, 009, 6: [13] Greenbaum A. Iterative Methods for Solving Linear Systems [M]. Philadelphia: SIAM, [14] Quarteroni A, Valli A. Numerical Approximation of Partial Differential Equations [M]. Berlin: Springer-Verlag, [15] Saad Y. Iterative Methods for Sparse Linear Systems [M]. nd ed. Philadelphia: SIAM, 003. [16] Thomas J W. Numerical Partial Differential Equations: Finite Difference Methods [M]. New York: Springer-Verlag, [17] Evans D J. Preconditioning Methods: Analysis and Applications [M]. New York: Gordon and Breach Science Publishers, [18] Bai Z Z, Golub G H, Li C K. Optimal parameter in Hermitian and skew-hermitian splitting methods for certain two-by-two block matrix [J]. SIAM J Sci Comput, 006, 8:
2 Composition. Invertible Mappings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,
Διαβάστε περισσότεραExample Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Διαβάστε περισσότεραOptimal Parameter in Hermitian and Skew-Hermitian Splitting Method for Certain Two-by-Two Block Matrices
Optimal Parameter in Hermitian and Skew-Hermitian Splitting Method for Certain Two-by-Two Block Matrices Chi-Kwong Li Department of Mathematics The College of William and Mary Williamsburg, Virginia 23187-8795
Διαβάστε περισσότεραCongruence Classes of Invertible Matrices of Order 3 over F 2
International Journal of Algebra, Vol. 8, 24, no. 5, 239-246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ija.24.422 Congruence Classes of Invertible Matrices of Order 3 over F 2 Ligong An and
Διαβάστε περισσότεραChapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Διαβάστε περισσότεραMatrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Διαβάστε περισσότερα4.6 Autoregressive Moving Average Model ARMA(1,1)
84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this
Διαβάστε περισσότεραCHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS
CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =
Διαβάστε περισσότεραPartial Differential Equations in Biology The boundary element method. March 26, 2013
The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet
Διαβάστε περισσότεραConcrete Mathematics Exercises from 30 September 2016
Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)
Διαβάστε περισσότεραEE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3
Διαβάστε περισσότεραTridiagonal matrices. Gérard MEURANT. October, 2008
Tridiagonal matrices Gérard MEURANT October, 2008 1 Similarity 2 Cholesy factorizations 3 Eigenvalues 4 Inverse Similarity Let α 1 ω 1 β 1 α 2 ω 2 T =......... β 2 α 1 ω 1 β 1 α and β i ω i, i = 1,...,
Διαβάστε περισσότεραEvery set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
Διαβάστε περισσότεραHomework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
Διαβάστε περισσότεραOrdinal Arithmetic: Addition, Multiplication, Exponentiation and Limit
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal
Διαβάστε περισσότεραforms This gives Remark 1. How to remember the above formulas: Substituting these into the equation we obtain with
Week 03: C lassification of S econd- Order L inear Equations In last week s lectures we have illustrated how to obtain the general solutions of first order PDEs using the method of characteristics. We
Διαβάστε περισσότερα6.3 Forecasting ARMA processes
122 CHAPTER 6. ARMA MODELS 6.3 Forecasting ARMA processes The purpose of forecasting is to predict future values of a TS based on the data collected to the present. In this section we will discuss a linear
Διαβάστε περισσότεραSection 8.3 Trigonometric Equations
99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.
Διαβάστε περισσότεραChapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Διαβάστε περισσότεραHOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
Διαβάστε περισσότεραNew bounds for spherical two-distance sets and equiangular lines
New bounds for spherical two-distance sets and equiangular lines Michigan State University Oct 8-31, 016 Anhui University Definition If X = {x 1, x,, x N } S n 1 (unit sphere in R n ) and x i, x j = a
Διαβάστε περισσότεραPhys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)
Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts
Διαβάστε περισσότεραES440/ES911: CFD. Chapter 5. Solution of Linear Equation Systems
ES440/ES911: CFD Chapter 5. Solution of Linear Equation Systems Dr Yongmann M. Chung http://www.eng.warwick.ac.uk/staff/ymc/es440.html Y.M.Chung@warwick.ac.uk School of Engineering & Centre for Scientific
Διαβάστε περισσότερα6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
Διαβάστε περισσότερα3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
Διαβάστε περισσότεραExercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1.
Exercises 0 More exercises are available in Elementary Differential Equations. If you have a problem to solve any of them, feel free to come to office hour. Problem Find a fundamental matrix of the given
Διαβάστε περισσότεραC.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
Διαβάστε περισσότεραStatistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραFourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Fourier Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Not all functions can be represented by Taylor series. f (k) (c) A Taylor series f (x) = (x c)
Διαβάστε περισσότεραSCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions
SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)
Διαβάστε περισσότεραNumerical Analysis FMN011
Numerical Analysis FMN011 Carmen Arévalo Lund University carmen@maths.lth.se Lecture 12 Periodic data A function g has period P if g(x + P ) = g(x) Model: Trigonometric polynomial of order M T M (x) =
Διαβάστε περισσότεραSOME PROPERTIES OF FUZZY REAL NUMBERS
Sahand Communications in Mathematical Analysis (SCMA) Vol. 3 No. 1 (2016), 21-27 http://scma.maragheh.ac.ir SOME PROPERTIES OF FUZZY REAL NUMBERS BAYAZ DARABY 1 AND JAVAD JAFARI 2 Abstract. In the mathematical
Διαβάστε περισσότεραST5224: Advanced Statistical Theory II
ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραSecond Order Partial Differential Equations
Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y
Διαβάστε περισσότεραProblem Set 3: Solutions
CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C
Διαβάστε περισσότεραk A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +
Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b
Διαβάστε περισσότεραSection 7.6 Double and Half Angle Formulas
09 Section 7. Double and Half Angle Fmulas To derive the double-angles fmulas, we will use the sum of two angles fmulas that we developed in the last section. We will let α θ and β θ: cos(θ) cos(θ + θ)
Διαβάστε περισσότεραOn Numerical Radius of Some Matrices
International Journal of Mathematical Analysis Vol., 08, no., 9-8 HIKARI Ltd, www.m-hikari.com https://doi.org/0.988/ijma.08.75 On Numerical Radius of Some Matrices Shyamasree Ghosh Dastidar Department
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.
Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action
Διαβάστε περισσότεραLecture 21: Properties and robustness of LSE
Lecture 21: Properties and robustness of LSE BLUE: Robustness of LSE against normality We now study properties of l τ β and σ 2 under assumption A2, i.e., without the normality assumption on ε. From Theorem
Διαβάστε περισσότεραOther Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Διαβάστε περισσότεραSection 9.2 Polar Equations and Graphs
180 Section 9. Polar Equations and Graphs In this section, we will be graphing polar equations on a polar grid. In the first few examples, we will write the polar equation in rectangular form to help identify
Διαβάστε περισσότεραFinite difference method for 2-D heat equation
Finite difference method for 2-D heat equation Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in/~praveen
Διαβάστε περισσότεραThe Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
Διαβάστε περισσότεραHomework 8 Model Solution Section
MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx
Διαβάστε περισσότεραMath221: HW# 1 solutions
Math: HW# solutions Andy Royston October, 5 7.5.7, 3 rd Ed. We have a n = b n = a = fxdx = xdx =, x cos nxdx = x sin nx n sin nxdx n = cos nx n = n n, x sin nxdx = x cos nx n + cos nxdx n cos n = + sin
Διαβάστε περισσότεραInverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------
Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin
Διαβάστε περισσότερα( ) 2 and compare to M.
Problems and Solutions for Section 4.2 4.9 through 4.33) 4.9 Calculate the square root of the matrix 3!0 M!0 8 Hint: Let M / 2 a!b ; calculate M / 2!b c ) 2 and compare to M. Solution: Given: 3!0 M!0 8
Διαβάστε περισσότεραderivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
Διαβάστε περισσότεραApproximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
Διαβάστε περισσότερα2. THEORY OF EQUATIONS. PREVIOUS EAMCET Bits.
EAMCET-. THEORY OF EQUATIONS PREVIOUS EAMCET Bits. Each of the roots of the equation x 6x + 6x 5= are increased by k so that the new transformed equation does not contain term. Then k =... - 4. - Sol.
Διαβάστε περισσότεραReminders: linear functions
Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U
Διαβάστε περισσότεραLecture 34 Bootstrap confidence intervals
Lecture 34 Bootstrap confidence intervals Confidence Intervals θ: an unknown parameter of interest We want to find limits θ and θ such that Gt = P nˆθ θ t If G 1 1 α is known, then P θ θ = P θ θ = 1 α
Διαβάστε περισσότεραLecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all
Διαβάστε περισσότεραA Note on Intuitionistic Fuzzy. Equivalence Relation
International Mathematical Forum, 5, 2010, no. 67, 3301-3307 A Note on Intuitionistic Fuzzy Equivalence Relation D. K. Basnet Dept. of Mathematics, Assam University Silchar-788011, Assam, India dkbasnet@rediffmail.com
Διαβάστε περισσότεραLecture 13 - Root Space Decomposition II
Lecture 13 - Root Space Decomposition II October 18, 2012 1 Review First let us recall the situation. Let g be a simple algebra, with maximal toral subalgebra h (which we are calling a CSA, or Cartan Subalgebra).
Διαβάστε περισσότεραw o = R 1 p. (1) R = p =. = 1
Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:
Διαβάστε περισσότεραLecture 26: Circular domains
Introductory lecture notes on Partial Differential Equations - c Anthony Peirce. Not to be copied, used, or revised without eplicit written permission from the copyright owner. 1 Lecture 6: Circular domains
Διαβάστε περισσότεραSCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018
Journal of rogressive Research in Mathematics(JRM) ISSN: 2395-028 SCITECH Volume 3, Issue 2 RESEARCH ORGANISATION ublished online: March 29, 208 Journal of rogressive Research in Mathematics www.scitecresearch.com/journals
Διαβάστε περισσότεραCoefficient Inequalities for a New Subclass of K-uniformly Convex Functions
International Journal of Computational Science and Mathematics. ISSN 0974-89 Volume, Number (00), pp. 67--75 International Research Publication House http://www.irphouse.com Coefficient Inequalities for
Διαβάστε περισσότεραLecture 2. Soundness and completeness of propositional logic
Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness
Διαβάστε περισσότεραSecond Order RLC Filters
ECEN 60 Circuits/Electronics Spring 007-0-07 P. Mathys Second Order RLC Filters RLC Lowpass Filter A passive RLC lowpass filter (LPF) circuit is shown in the following schematic. R L C v O (t) Using phasor
Διαβάστε περισσότεραSOLVING CUBICS AND QUARTICS BY RADICALS
SOLVING CUBICS AND QUARTICS BY RADICALS The purpose of this handout is to record the classical formulas expressing the roots of degree three and degree four polynomials in terms of radicals. We begin with
Διαβάστε περισσότεραHigh order interpolation function for surface contact problem
3 016 5 Journal of East China Normal University Natural Science No 3 May 016 : 1000-564101603-0009-1 1 1 1 00444; E- 00030 : Lagrange Lobatto Matlab : ; Lagrange; : O41 : A DOI: 103969/jissn1000-56410160300
Διαβάστε περισσότερα= λ 1 1 e. = λ 1 =12. has the properties e 1. e 3,V(Y
Stat 50 Homework Solutions Spring 005. (a λ λ λ 44 (b trace( λ + λ + λ 0 (c V (e x e e λ e e λ e (λ e by definition, the eigenvector e has the properties e λ e and e e. (d λ e e + λ e e + λ e e 8 6 4 4
Διαβάστε περισσότερα( y) Partial Differential Equations
Partial Dierential Equations Linear P.D.Es. contains no owers roducts o the deendent variables / an o its derivatives can occasionall be solved. Consider eamle ( ) a (sometimes written as a ) we can integrate
Διαβάστε περισσότεραPractice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1
Conceptual Questions. State a Basic identity and then verify it. a) Identity: Solution: One identity is cscθ) = sinθ) Practice Exam b) Verification: Solution: Given the point of intersection x, y) of the
Διαβάστε περισσότεραHomomorphism in Intuitionistic Fuzzy Automata
International Journal of Fuzzy Mathematics Systems. ISSN 2248-9940 Volume 3, Number 1 (2013), pp. 39-45 Research India Publications http://www.ripublication.com/ijfms.htm Homomorphism in Intuitionistic
Διαβάστε περισσότεραANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least
Διαβάστε περισσότεραProblem Set 9 Solutions. θ + 1. θ 2 + cotθ ( ) sinθ e iφ is an eigenfunction of the ˆ L 2 operator. / θ 2. φ 2. sin 2 θ φ 2. ( ) = e iφ. = e iφ cosθ.
Chemistry 362 Dr Jean M Standard Problem Set 9 Solutions The ˆ L 2 operator is defined as Verify that the angular wavefunction Y θ,φ) Also verify that the eigenvalue is given by 2! 2 & L ˆ 2! 2 2 θ 2 +
Διαβάστε περισσότεραQuadratic Expressions
Quadratic Expressions. The standard form of a quadratic equation is ax + bx + c = 0 where a, b, c R and a 0. The roots of ax + bx + c = 0 are b ± b a 4ac. 3. For the equation ax +bx+c = 0, sum of the roots
Διαβάστε περισσότεραLanczos and biorthogonalization methods for eigenvalues and eigenvectors of matrices
Lanzos and iorthogonalization methods for eigenvalues and eigenvetors of matries rolem formulation Many prolems are redued to solving the following system: x x where is an unknown numer А a matrix n n
Διαβάστε περισσότεραCHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS
CHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS EXERCISE 01 Page 545 1. Use matrices to solve: 3x + 4y x + 5y + 7 3x + 4y x + 5y 7 Hence, 3 4 x 0 5 y 7 The inverse of 3 4 5 is: 1 5 4 1 5 4 15 8 3
Διαβάστε περισσότεραFractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
Διαβάστε περισσότεραMATRIX INVERSE EIGENVALUE PROBLEM
English NUMERICAL MATHEMATICS Vol.14, No.2 Series A Journal of Chinese Universities May 2005 A STABILITY ANALYSIS OF THE (k) JACOBI MATRIX INVERSE EIGENVALUE PROBLEM Hou Wenyuan ( ΛΠ) Jiang Erxiong( Ξ)
Διαβάστε περισσότεραSolution Series 9. i=1 x i and i=1 x i.
Lecturer: Prof. Dr. Mete SONER Coordinator: Yilin WANG Solution Series 9 Q1. Let α, β >, the p.d.f. of a beta distribution with parameters α and β is { Γ(α+β) Γ(α)Γ(β) f(x α, β) xα 1 (1 x) β 1 for < x
Διαβάστε περισσότεραMath 446 Homework 3 Solutions. (1). (i): Reverse triangle inequality for metrics: Let (X, d) be a metric space and let x, y, z X.
Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequalit for metrics: Let (X, d) be a metric space and let x,, z X. Prove that d(x, z) d(, z) d(x, ). (ii): Reverse triangle inequalit for norms:
Διαβάστε περισσότεραACTA MATHEMATICAE APPLICATAE SINICA Nov., ( µ ) ( (
35 Þ 6 Ð Å Vol. 35 No. 6 2012 11 ACTA MATHEMATICAE APPLICATAE SINICA Nov., 2012 È ÄÎ Ç ÓÑ ( µ 266590) (E-mail: jgzhu980@yahoo.com.cn) Ð ( Æ (Í ), µ 266555) (E-mail: bbhao981@yahoo.com.cn) Þ» ½ α- Ð Æ Ä
Διαβάστε περισσότεραSrednicki Chapter 55
Srednicki Chapter 55 QFT Problems & Solutions A. George August 3, 03 Srednicki 55.. Use equations 55.3-55.0 and A i, A j ] = Π i, Π j ] = 0 (at equal times) to verify equations 55.-55.3. This is our third
Διαβάστε περισσότεραb. Use the parametrization from (a) to compute the area of S a as S a ds. Be sure to substitute for ds!
MTH U341 urface Integrals, tokes theorem, the divergence theorem To be turned in Wed., Dec. 1. 1. Let be the sphere of radius a, x 2 + y 2 + z 2 a 2. a. Use spherical coordinates (with ρ a) to parametrize.
Διαβάστε περισσότεραJ. of Math. (PRC) Banach, , X = N(T ) R(T + ), Y = R(T ) N(T + ). Vol. 37 ( 2017 ) No. 5
Vol. 37 ( 2017 ) No. 5 J. of Math. (PRC) 1,2, 1, 1 (1., 225002) (2., 225009) :. I +AT +, T + = T + (I +AT + ) 1, T +. Banach Hilbert Moore-Penrose.. : ; ; Moore-Penrose ; ; MR(2010) : 47L05; 46A32 : O177.2
Διαβάστε περισσότεραCommutative Monoids in Intuitionistic Fuzzy Sets
Commutative Monoids in Intuitionistic Fuzzy Sets S K Mala #1, Dr. MM Shanmugapriya *2 1 PhD Scholar in Mathematics, Karpagam University, Coimbatore, Tamilnadu- 641021 Assistant Professor of Mathematics,
Διαβάστε περισσότεραNowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that
Διαβάστε περισσότεραThe ε-pseudospectrum of a Matrix
The ε-pseudospectrum of a Matrix Feb 16, 2015 () The ε-pseudospectrum of a Matrix Feb 16, 2015 1 / 18 1 Preliminaries 2 Definitions 3 Basic Properties 4 Computation of Pseudospectrum of 2 2 5 Problems
Διαβάστε περισσότεραD Alembert s Solution to the Wave Equation
D Alembert s Solution to the Wave Equation MATH 467 Partial Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Objectives In this lesson we will learn: a change of variable technique
Διαβάστε περισσότεραUniform Convergence of Fourier Series Michael Taylor
Uniform Convergence of Fourier Series Michael Taylor Given f L 1 T 1 ), we consider the partial sums of the Fourier series of f: N 1) S N fθ) = ˆfk)e ikθ. k= N A calculation gives the Dirichlet formula
Διαβάστε περισσότεραOn a four-dimensional hyperbolic manifold with finite volume
BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Numbers 2(72) 3(73), 2013, Pages 80 89 ISSN 1024 7696 On a four-dimensional hyperbolic manifold with finite volume I.S.Gutsul Abstract. In
Διαβάστε περισσότεραFinite Field Problems: Solutions
Finite Field Problems: Solutions 1. Let f = x 2 +1 Z 11 [x] and let F = Z 11 [x]/(f), a field. Let Solution: F =11 2 = 121, so F = 121 1 = 120. The possible orders are the divisors of 120. Solution: The
Διαβάστε περισσότεραΜηχανική Μάθηση Hypothesis Testing
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Μηχανική Μάθηση Hypothesis Testing Γιώργος Μπορμπουδάκης Τμήμα Επιστήμης Υπολογιστών Procedure 1. Form the null (H 0 ) and alternative (H 1 ) hypothesis 2. Consider
Διαβάστε περισσότεραEcon 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1
Eon : Fall 8 Suggested Solutions to Problem Set 8 Email questions or omments to Dan Fetter Problem. Let X be a salar with density f(x, θ) (θx + θ) [ x ] with θ. (a) Find the most powerful level α test
Διαβάστε περισσότεραThe challenges of non-stable predicates
The challenges of non-stable predicates Consider a non-stable predicate Φ encoding, say, a safety property. We want to determine whether Φ holds for our program. The challenges of non-stable predicates
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότεραPARTIAL NOTES for 6.1 Trigonometric Identities
PARTIAL NOTES for 6.1 Trigonometric Identities tanθ = sinθ cosθ cotθ = cosθ sinθ BASIC IDENTITIES cscθ = 1 sinθ secθ = 1 cosθ cotθ = 1 tanθ PYTHAGOREAN IDENTITIES sin θ + cos θ =1 tan θ +1= sec θ 1 + cot
Διαβάστε περισσότεραAppendix S1 1. ( z) α βc. dβ β δ β
Appendix S1 1 Proof of Lemma 1. Taking first and second partial derivatives of the expected profit function, as expressed in Eq. (7), with respect to l: Π Π ( z, λ, l) l θ + s ( s + h ) g ( t) dt λ Ω(
Διαβάστε περισσότεραFigure A.2: MPC and MPCP Age Profiles (estimating ρ, ρ = 2, φ = 0.03)..
Supplemental Material (not for publication) Persistent vs. Permanent Income Shocks in the Buffer-Stock Model Jeppe Druedahl Thomas H. Jørgensen May, A Additional Figures and Tables Figure A.: Wealth and
Διαβάστε περισσότεραMath 6 SL Probability Distributions Practice Test Mark Scheme
Math 6 SL Probability Distributions Practice Test Mark Scheme. (a) Note: Award A for vertical line to right of mean, A for shading to right of their vertical line. AA N (b) evidence of recognizing symmetry
Διαβάστε περισσότεραGeneral 2 2 PT -Symmetric Matrices and Jordan Blocks 1
General 2 2 PT -Symmetric Matrices and Jordan Blocks 1 Qing-hai Wang National University of Singapore Quantum Physics with Non-Hermitian Operators Max-Planck-Institut für Physik komplexer Systeme Dresden,
Διαβάστε περισσότεραOptimal Parameter in Hermitian and Skew-Hermitian Splitting Method for Certain Two-by-Two Block Matrices
Optimal Parameter in Hermitian Skew-Hermitian Splitting Method for Certain Two-by-Two Block Matrices Zhong-Zhi Bai 1 Department of Mathematics, Fudan University Shanghai 200433, P.R. China State Key Laboratory
Διαβάστε περισσότερα