GCG-type Methods for Nonsymmetric Linear Systems
|
|
- Ἠλύσια Δελή
- 6 χρόνια πριν
- Προβολές:
Transcript
1 GCG-type Methods for Nonsymmetric Linear Systems Tsung-Ming Huang Department of Mathematics National Taiwan Normal University December 6, 2011 T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
2 Outline 1 GCG method(generalized Conjugate Gradient) 2 BCG method (A: unsymmetric) 3 The polynomial equivalent method of the CG method 4 Squaring the CG algorithm 5 Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
3 Recall: A is s.p.d. Consider the quadratic functional F (x) = 1 2 xt Ax x T b Consider Ax = b min x R n F (x) = F (x ) ϕ(x) = 1 2 (b Ax)T A 1 (b Ax) = F (x) bt A 1 b, (1) where 1 2 bt A 1 b is a constant. Then Ax = b ϕ(x ) = min ϕ(x) = [ min F (x)] + 1 x Rn x R n 2 bt A 1 b T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
4 Algorithm: Conjugate Gradient method (CG-method) Input: Given s.p.d. A, b R n and x 0 R n and r 0 = b Ax 0 = p 0. 1: Set k = 0. 2: repeat 3: Compute α k = pt k r k p T k Ap ; k 4: Compute x k+1 = x k + α k p k ; 5: Compute r k+1 = r k α k Ap k = b Ax k+1 ; 6: Compute β k = rt k+1 Ap k p T k Ap ; k 7: Compute p k+1 = r k+1 + β k p k ; 8: Set k = k + 1; 9: until r k = 0 Numerator: r T k+1 ((r k r k+1 )/α k ) = ( r T k+1 r k+1)/α k Denominator: p T k Ap k = (r T k + β k 1p T k 1 )((r k r k+1 )/α k ) = (r T k r k)/α k. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
5 Remark 1 CG method does not need to compute any parameters. It only needs matrix vector and inner product of vectors. Hence it can not destroy the sparse structure of the matrix A. The vectors r k and p k generated by CG-method satisfy: p T i r k = (p i, r k ) = 0, r T i r j = (r i, r j ) = 0, p T i Ap j = (p i, Ap j ) = 0, i < k i j i j x k+1 = x 0 + k i=0 α ip i minimizes F (x) over x = x 0 + < p 0,, p k >. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
6 GCG method(generalized Conjugate Gradient) GCG method is developed to minimize the residual of the linear equation under some special functional. In conjugate gradient method we take ϕ(x) = 1 2 (b Ax)T A 1 (b Ax) = 1 2 rt A 1 r = 1 2 r 2 A 1, where x A 1 = x T A 1 x. Let A be a unsymmetric matrix. Consider the functional f(x) = 1 2 (b Ax)T P (b Ax), where P is s.p.d. Thus f(x) > 0, unless x = A 1 b f(x ) = 0, so x minimizes the functional f(x). T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
7 Different choices of P: (i) P = A 1 (A is s.p.d.) CG method (classical) (ii) P = I GCR method (Generalized Conjugate Residual). Here {r i } forms A-conjugate. f(x) = 1 2 (b Ax)T (b Ax) = 1 2 r 2 2 (iii) Consider M 1 Ax = M 1 b. Take P = M T M > 0 GCGLS method (Generalized Conjugate Gradient Least Square). (iv) Similar to (iii), take P = (A + A T )/2 (note: P is not positive definite) and M = (A + A T )/2 we get GCG method (by Concus, Golub and Widlund). In general, P is not necessary to be taken positive definite, but it must be symmetric (P T = P ). Therefore, the minimality property does not hold. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
8 Let (x, y) o = x T P y = (x, y) o = (y, x) o. Algorithm: GCG method Input: Given A, b R n and x 0 R n and r 0 = b Ax 0 = p 0. 1: Set k = 0. 2: repeat 3: Compute α k = (r k, Ap k ) o /(Ap k, Ap k ) o ; 4: Compute x k+1 = x k + α k p k ; 5: Compute r k+1 = r k α k Ap k = b Ax k+1 ; 6: Compute β k = (Ar k+1, Ap i ) o /(Ap i, Ap i ) o, for i = 0, 1,..., k; 7: Compute p k+1 = r k+1 + k i=0 β(k) i p i ; 8: Set k = k + 1; 9: until r k = 0 T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
9 In GCG method, the choice of {β (k) i } k i=1 satisfy: (r k+1, Ap i ) o = 0, i k (2a) (r k+1, Ar i ) o = 0, i k (2b) (Ap i, Ap j ) o = 0, i j (2c) Theorem 1 x k+1 = x 0 + k i=0 α kp i minimizes f(x) = 1 2 (b Ax)T P (b Ax) over x = x 0 + < p 0,, p k >, where P is s.p.d. (The proof is the same as that of classical CG method). If P is indefinite, which is allowed in GCG method, then the minimality property does not hold. x k+1 is the critical point of f(x) over x = x 0 + < p 0,, p k >. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
10 Question Can the GCG method break down? i.e., Can α k in GCG method be zero? Consider the numerator of α k : (r k, Ap k ) o = (r k, Ar k ) o [by Line 7 in GCG Algorithm and (2a) ] = r T k P Ar k = r T k AT P r k [Take transpose] = r T k (P A + A T P ) r k. (3) 2 From (3), if (P A + A T P ) is positive definite, then α k 0 unless r k = 0. Hence if the matrix A satisfies (P A + A T P ) positive definite, then GCG method can not break down. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
11 From Lines 5 and 7 in GCG Algorithm, r k and p k can be rewritten by r k = ψ k (A)r 0, p k = ϕ k (A)r 0, (4a) (4b) where ψ k and ϕ k are polynomials of degree k with ψ k (0) = 1. From (4a) and (2b) follows that (r k+1, A i+1 r 0 ) o = 0, i = 0, 1,..., k. (5) From (4b) and Line 6 in GCG Algorithm, the numerator of β (k) i expressed by can be (Ar k+1, Ap i ) o = r T k+1 AT P Ap i = r T k+1 AT P Aϕ i (A)r 0. (6) T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
12 If A T P can be expressed by A T P = P θ s (A), (7) where θ s is some polynomial of degree s. Then (6) can be written by (Ar k+1, Ap i ) o = rk+1 T AT P Aϕ i (A)r 0 = rk+1 T P θ s(a)aϕ i (A)r 0 = (r k+1, Aθ s (A)ϕ i (A)r 0 ) o. (8) From (5) we know that if s + i k, then (8) is zero, i.e.,(ar k+1, Ap i ) o = 0. Hence β (k) i = 0, i = 0, 1,..., k s. But only in the special case s will be small. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
13 For instance : (i) In classical CG method, A is s.p.d, P is taking by A 1. Then A T P = AA 1 = I = A 1 A = A 1 θ 1 (A), where θ 1 (x) = x, s = 1. So, β (k) i = 0, for all i + 1 k, it is only β (k) k 0. (ii) Concus, Golub and Widlund proposed GCG method, it solves M 1 Ax = M 1 b. (A: unsymmetric), where M = (A + A T )/2 and P = (A + A T )/2 (P may be indefinite). Check condition (7): (M 1 A) T P = A T M 1 M = A T = M(2I M 1 A) = P (2I M 1 A). Then θ s (M 1 A) = 2I M 1 A, where θ 1 (x) = 2 x, s = 1. Thus β (k) i = 0, i = 0, 1,..., k 1. Therefore we only use r k+1 and p k to construct p k+1. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
14 Check condition A T P + P A: (M 1 A) T M + MM 1 A = A T + A indefinite The method can possibly break down. (iii) The other case s = 1 is BCG (BiCG) (See next paragraph). Remark 2 Except the above three cases, the degree s is usually very large. That is, we need to save all directions p i (i = 0, 1,..., k) in order to construct p k+1 satisfying the conjugate orthogonalization condition (2c). In GCG method, each iteration step needs to save 2k + 5 vectors (x k+1, r k+1, p k+1, {Ap i } k i=0, {p i} k i=0 ), k + 3 inner products (Here k is the iteration number). Hence, if k is large, then the space of storage and the computation cost can become very large and can not be acceptable. So, GCG method, in general, has some practical difficulty. Such as GCR, GMRES (by SAAD) methods, they preserve the optimality (P > 0), but it is too expensive (s is very large). T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
15 Modification: (i) Restarted: If GCG method does not converge after m + 1 iterations, then we take x k+1 as x 0 and restart GCG method. There are at most 2m + 5 saving vectors. (ii) Truncated: The most expensive step of GCG method is to compute β (k) i, i = 0, 1,..., k so that p k+1 satisfies (2c). We now release the condition (2c) to require that p k+1 and the nearest m direction {p i } k i=k m+1 satisfy the conjugate orthogonalization condition. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
16 BCG method (A: unsymmetric) BCG is similar to the CG, it does not need to save the search direction. But the norm of the residual by BCG does not preserve the minimal property. Solve Ax = b by considering A T y = c (phantom). Let à = [ A 0 0 A T ], x = [ x y ], b = [ b c ]. Consider [ Take P = 0 A T A 1 0 ] à x = b. (P = P T ). This implies à T P = P Ã. From (7) we know that s = 1 for à x = b. Hence it only needs to save one direction p k as in the classical CG method. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
17 Apply GCG method to à x = b [ ] x0 1: Given x 0 =, compute p ˆx 0 = r 0 = b à x 0 = 0 2: Set k = 0. 3: repeat 4: Compute α k = ( r k, à p k) o /(à p k, à p k) o ; 5: Compute x k+1 = x k + α k p k ; 6: Compute r k+1 = r k α k à p k ; 7: Compute β k = (à r k+1, à p k) o /(à p k, à p k) o ; 8: Compute p k+1 = r k+1 + β k p k ; 9: Set k = k + 1; 10: until r k = 0 [ r0 ˆr 0 ]. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
18 Simplification (BCG method) 1: Given x 0, compute p 0 = r 0 = b Ax 0. 2: Choose ˆr 0, ˆp 0 = ˆr 0. 3: Set k = 0. 4: repeat 5: Compute α k = (ˆr k, r k )/(ˆp k, Ap k ); 6: Compute x k+1 = x k + α k p k ; 7: Compute r k+1 = r k α k Ap k, ˆr k+1 = ˆr k α k A T ˆp k ; 8: Compute β k = (ˆr k+1, r k+1 )/(ˆr k, r k ); 9: Compute p k+1 = r k+1 + β k p k, ˆp k+1 = ˆr k+1 + β k ˆp k ; 10: Set k = k + 1; 11: until r k = 0 From above we have (Ã p k, Ã p k) o = [ p T k AT, ˆp T k A] [ 0 A T A 1 0 ] [ Apk A T ˆp k ] = 2(ˆp k, Ap k ). T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
19 BCG method satisfies the following relations: rk T ˆp i = ˆr k T p i = 0, i < k (9a) p T k AT ˆp i = ˆp T k Ap i = 0, i < k (9b) rk T ˆr i = ˆr k T r i = 0, i < k (9c) Definition 2 (9c) and (9b) are called biorthogonality and biconjugacy condition, respectively. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
20 Property: (i) In BCG method, the residual of the linear equation does not satisfy the minimal property, because P is taken by ( ) 0 A T P = A 1 0 and P is symmetric, but not positive definite. The minimal value of the functional f(x) may not exist. (ii) BCG method can break down, because Z = (ÃT P + P Ã)/2 is not positive definite. From above discussion, α k can be zero. But this case occurs very few. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
21 GCG GCR, GCR(k) BCG Orthomin(k) CGS Orthodir BiCGSTAB Orthores QMR GMRES(m) TFQMR FOM Axelsson LS T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
22 The polynomial equivalent method of the CG method Consider first A is s.p.d. CG-method 1: r 0 = b Ax 0 = p 0. 2: Set k = 0. 3: repeat 4: α k = (r k,p k ) (p k,ap k ) = (r k,r k ) (p k,ap k ) ; 5: x k+1 = x k + α k p k ; 6: r k+1 = r k α k Ap k ; 7: β k = (r k+1,ap k ) (p k,ap k ) = (r k+1,r k+1 ) (r k,r k ) ; 8: p k+1 = r k+1 + β k p k ; 9: k = k + 1; 10: until r k = 0 Equivalent CG-method 1: r 0 = b Ax 0 = p 0, p 1 = 1, ρ 1 = 1. 2: Set k = 0. 3: repeat 4: ρ k = rk T r k, β k = ρ k ρ k 1 ; 5: p k = r k + β k p k 1 ; 6: σ k = p T k Ap k, α k = ρ k σ k ; 7: x k+1 = x k + α k p k ; 8: r k+1 = r k α k Ap k ; 9: k = k + 1; 10: until r k = 0 T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
23 Remark 3 1. E k = r T k A 1 r k = min x x0 +K k b Ax 2 A 1 2. r T i r j = 0, p T i Ap j = 0, i j. From the structure of the new form of the CG method, we write r k = ϕ k (A)r 0, p k = ψ k (A)r 0 where ϕ k and ψ k are polynomial of degree k. Define ϕ 0 (τ) 1 and ϕ 1 (τ) 0. Then we find with and with p k = ϕ k (A)r 0 + β k ψ k 1 (A)r 0 ψ k (A)r 0 ψ k (τ) ϕ k (τ) + β k ψ k 1 (τ), r k+1 = ϕ k (A)r 0 α k Aψ k (A)r 0 ϕ k+1 (A)r 0 ϕ k+1 (τ) ϕ k (τ) α k τψ k (τ). (10a) (10b) (11a) (11b) T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
24 The polynomial equivalent method of the CG method : 1: ϕ 0 1, ϕ 1 0, ρ 1 = 1. 2: for k = 0, 1, 2,... do 3: ρ k = (ϕ k, ϕ k ), β k = ρ k ρ k 1 ; 4: ψ k = ϕ k + β k ψ k 1 ; 5: σ k = (ψ k, θψ k ), α k = ρ k σ k ; 6: ϕ k+1 = ϕ k α k θψ k ; 7: end for where θ(τ) = τ. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
25 The minimization property reads We also have E k = (ϕ k, θ 1 ϕ k ) = min ϕ P N (ϕ, θ 1 ϕ) ϕ(0) 2. (ϕ i, ϕ j ) = 0, i j from (r i, r j ) = 0, i j. (ψ i, θψ j ) = 0, i j from (p i, Ap j ) = 0, i j. Theorem 3 Let [, ] be any symmetric bilinear form satisfying [ϕχ, ψ] = [ϕ, χψ] ϕ, ψ, χ P N. Let the sequence of ϕ i and ψ i be constructed according to PE algorithm, but using [, ] instead (, ). Then as long as the algorithm does not break down by zero division, then ϕ i and ψ i satisfy with θ(τ) τ. [ϕ i, ϕ j ] = ρ i δ ij, [ψ i, θψ j ] = σ i δ ij T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
26 Bi-Conjugate Gradient algorithm 1: Given r 0 = b Ax 0, p 1 = ˆp 1 and ˆr 0 arbitrary. 2: for k = 0, 1, 2,... do 3: ρ k = ˆr k T r k, β k = ρ k /ρ k 1 ; 4: p k = r k + β k p k 1, ˆp k = ˆr k + β k ˆp k 1 ; 5: σ k = ˆp T k Ap k, α k = ρ k /σ k ; 6: r k+1 = r k α k Ap k, ˆr k+1 = ˆr k α k A T ˆp k ; 7: x k+1 = x k + α k p k ; 8: end for Property: r k = b Ax k, r T i ˆr j = 0, i j and p T i AT ˆp j = 0, i j. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
27 Consider Ax = b, A : nonsymmetric. Given x 0, r 0 = b Ax 0, let ˆr 0 be a suitably chosen vector. Define [, ] by [ϕ, ψ] = ˆr T 0 ϕ(a)ψ(a)r 0 = (ϕ(a T )ˆr 0 ) T ψ(a)r 0 and define p 1 = ˆp 1 = 0. (If A symmetric : (ϕ, ψ) = r T 0 ϕ(a)ψ(a)r 0). Then we have r k = ϕ k (A)r 0, ˆr k = ϕ k (A T )ˆr 0, p k = ψ k (A)r 0, ˆp k = ψ k (A T )ˆr 0 with ϕ k and ψ k according to (10b) and (11b). Indeed, these vectors can be produced by the Bi-Conjugate Gradient algorithm: T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
28 Squaring the CG algorithm: CGS Algorithm (SISC, 1989, Sonneveld) Assume that Bi-CG is converging well. Then r k 0 as k. Because r k = ϕ k (A)r 0, ϕ k (A) behaves like contracting operators. Expect: ϕ k (A T ) behaves like contracting operators (i.e., ˆr k 0). But quasi-residuals ˆr k is not exploited, they need to be computed for the ρ k and σ k. Disadvantage: Work of Bi-CG is twice the work of CG and in general A T v is not easy to compute. Especially if A is stored with a general data structure. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
29 Improvement: Using Polynomial equivalent algorithm to CG. Since ρ k = [ϕ k, ϕ k ] and σ k = [ψ k, θψ k ], [, ] has the property [ϕχ, ψ] = [ϕ, χψ]. Let ϕ 0 = 1. Then ρ k = [ϕ 0, ϕ 2 k ], σ k = [ϕ 0, θψ 2 k ]. Remark 4 { ϕk+1 = ϕ k α k θψ k, ψ k = ϕ k + β k ψ k 1. ρ k = ˆr T k r k = (ϕ k (A T )ˆr 0 ) T (ϕ k (A)r 0 ) = ˆr T 0 ϕ 2 k (A)r 0, σ k = ˆp T k Ap k = (ψ k (A T )ˆr 0 ) T A(ψ k (A)r 0 ) = ˆr T 0 Aψ 2 k (A)r 0. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
30 Purpose: 1 Find an algorithm that generates the polynomial ϕ 2 k and ψ2 k rather than ϕ k and ψ k. 2 Compute approximated solution x k with r k = ϕ 2 k (A)r 0 as residuals (try to interpret). Because ρ k = ˆr T 0 r k with r k = ϕ 2 k (A)r 0, ˆr k and ˆp k need not to be computed. How to compute ϕ 2 k and ψ2 k? ψ 2 k = [ϕ k + β k ψ k 1 ] 2 = ϕ 2 k + 2β kϕ k ψ k 1 + β 2 k ψ2 k 1, ϕ 2 k+1 = [ϕ k α k θψ k ] 2 = ϕ 2 k 2α kθϕ k ψ k + α 2 k θ2 ψ 2 k. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
31 Since ϕ k ψ k = ϕ k [ϕ k + β k ψ k 1 ] = ϕ 2 k + β k ϕ k ψ k 1, we only need to compute ϕ k ψ k 1, ϕ 2 k and ψ2 k. Now define for k 0 : From Φ k = ϕ 2 k, Θ k = ϕ k ψ k 1, Ψ k 1 = ψ 2 k 1. ψ 2 k = ϕ 2 k + 2β k ϕ k ψ k 1 + β 2 kψ 2 k 1, ϕ k+1 ψ k = (ϕ k α k θψ k )ψ k = ϕ k ψ k α k θψ 2 k, ϕ 2 k+1 = ϕ 2 k 2α k θϕ k ψ k + α 2 kθ 2 ψ 2 k = ϕ 2 k α k θ(ϕ k ψ k α k θψ 2 k) α k θϕ k ψ k = ϕ 2 k α k θ(ϕ k+1 ψ k + ϕ k ψ k ), we have Y k = ϕ k ψ k = Φ k + β k Θ k, Ψ k = Φ k + 2β k Θ k + βkψ 2 k 1 = Y k + β k (Θ k + β k Ψ k 1 ), Θ k+1 = Y k α k θψ k, Φ k+1 = Φ k α k θ(y k + Θ k+1 ). T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
32 Bi-Conjugate Gradient 1: Given r 0 = b Ax 0, p 1 = ˆp 1 and arbitrary ˆr 0. 2: for k = 0, 1, 2,... do 3: ρ k = ˆr T k r k, β k = ρ k /ρ k 1 ; 4: p k = r k + β k p k 1, ˆp k = ˆr k + β k ˆp k 1 ; 5: σ k = ˆp T k Ap k, α k = ρ k /σ k ; 6: r k+1 = r k α k Ap k, ˆr k+1 = ˆr k α k A T ˆp k ; 7: x k+1 = x k + α k p k ; 8: end for CGS 1: Φ 0 1, Θ 0 Ψ 1 0, ρ 1 = 1. 2: for k = 0, 1, 2,... do 3: ρ k = [1, Φ k ], β k = ρ k /ρ k 1 ; 4: Y k = Φ k + β k Θ k ; 5: Ψ k = Y k + β k (Θ k + β k Ψ k 1 ); 6: σ k = [1, θψ k ], α k = ρ k /σ k ; 7: Θ k+1 = Y k α k θψ k ; 8: Φ k+1 = Φ k α k θ(y k + Θ k+1 ); 9: end for T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
33 CGS 1: Φ 0 1, Θ 0 Ψ 1 0, ρ 1 = 1. 2: for k = 0, 1, 2,... do 3: ρ k = [1, Φ k ], β k = ρ k /ρ k 1 ; 4: Y k = Φ k + β k Θ k ; 5: Ψ k = Y k + β k (Θ k + β k Ψ k 1 ); 6: σ k = [1, θψ k ], α k = ρ k /σ k ; 7: Θ k+1 = Y k α k θψ k ; 8: Φ k+1 = Φ k α k θ(y k + Θ k+1 ); 9: end for CGS Variant 1: Given r 0 = b Ax 0, q 0 = p 1 = 0, ρ 1 = 1. 2: for k = 0, 1, 2,... do 3: ρ k = ˆr 0 T r k, β k = ρ k /ρ k 1 ; 4: u k = r k + β k q k ; 5: p k = u k + β k (q k + β k p k 1 ); 6: v k = Ap k ; 7: σ k = ˆr 0 T v k, α k = ρ k /σ k ; 8: q k+1 = u k α k v k ; 9: r k+1 = r k α k A(u k +q k+1 ); 10: x k+1 = x k + α k (u k + q k+1 ); 11: end for Define r k = Φ k (A)r 0, q k = Θ k (A)r 0, p k = Ψ k (A)r 0 and u k = Y k (A)r 0. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
34 Since r 0 = b Ax 0, r k+1 r k = A(x k x k+1 ), we have that r k = b Ax k. So this algorithm produces x k of which the residual satisfy r k = ϕ 2 k (A)r 0. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
35 Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems (SISC, 1992, Van der Vorst) Bi-CG method 1: Given r 0 = b Ax 0, (ˆr 0, r 0 ) 0, ρ 0 = 1, ˆp 0 = p 0 = 0. 2: for k = 1, 2,... do 3: ρ k = (ˆr k 1, r k 1 ); 4: β k = ρ k /ρ k 1 ; 5: p k = r k 1 + β k p k 1, ˆp k = ˆr k 1 + β k ˆp k 1 ; 6: v k = Ap k ; 7: α k = ρ k /(ˆp k, v k ); 8: x k = x k 1 + α k p k ; 9: Stop here, if x k is accurate enough. 10: r k = r k 1 α k v k = r k 1 α k Ap k ; 11: ˆr k = ˆr k 1 α k A T ˆp k ; 12: end for T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
36 Property: (i) r k ˆr 0,..., ˆr k 1 and ˆr k r 0,..., r k 1. (ii) three-term recurrence relations between {r k } and {ˆr k }. (iii) It terminates within n steps, but no minimal property. Since it implies that r Bi CG k = ϕ k (A)r 0, ˆr Bi CG k = ϕ k (A T )ˆr 0, (r k, ˆr i ) = ( ϕ k (A)r 0, ϕ i (A T )ˆr 0 ) = (ϕi (A)ϕ k (A)r 0, ˆr 0 ) = 0, i < k. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
37 CGS Method 1: Given x 0, r 0 = b Ax 0, (r 0, ˆr 0 ) 0, ˆr 0 = r 0, ρ 0 = 1, p 0 = q 0 = 0. 2: for k = 1, 2,... do 3: ρ k = (ˆr 0, r k 1 ), β k = ρ k /ρ k 1 ; 4: u k = r k 1 + β k q k 1 ; 5: p k = u k + β k (q k 1 + β k p k 1 ); 6: v k = Ap k ; 7: α k = ρ k /(ˆr 0, v k ); 8: q k = u k α k v k ; 9: w k = u k + q k ; 10: x k = x k 1 + α k w k ; 11: Stop here, if x k is accurate enough. 12: r k = r k 1 α k Aw k ; 13: end for We have r CGS k = ϕ k (A) 2 r 0. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
38 From Bi-CG method we have r Bi CG k = ϕ k (A)r 0 and p k+1 = ψ k (A)r 0. Thus we get ψ k (A)r 0 = (ϕ k (A) + β k ψ k 1 (A)) r 0, and ϕ k (A)r 0 = (ϕ k 1 (A) α k Aψ k 1 (A)) r 0, where ψ k = ϕ k + β k ψ k 1 and ϕ k = ϕ k 1 α k θψ k 1. Since ( ϕk (A)r 0, ϕ j (A T )ˆr 0 ) = 0, j < k, it holds that if and only if ϕ k (A)r 0 ˆr 0, A T ˆr 0,..., (A T ) k 1ˆr 0 ( ϕ j (A)ϕ k (A)r 0, ˆr 0, ) = 0 for some polynomial ϕ j of degree j < k for j = 0, 1,..., k 1. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
39 In Bi-CG method, we take ϕ j = ϕ j, ˆr k = ϕ k (A T )ˆr 0 and exploit it in CGS to get rk CGS = ϕ 2 k (A)r 0. Now r k = ϕ k (A)ϕ k (A)r 0. How to choose ϕ k polynomial of degree k so that r k satisfies the minimum. Like polynomial, we can determine the optimal parameters of ϕ k so that r k satisfies the minimum. But the optimal parameters for the Chebychev polynomial are in general not easily obtainable. Now we take where ϕ k η k (x), η k (x) = (1 ω 1 x)(1 ω 2 x) (1 ω k x). Here ω j are suitable constants to be selected. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
40 Define r k = η k (A)ϕ k (A)r 0. Then r k = η k (A)ϕ k (A)r 0 = (1 ω k A)η k 1 (A) (ϕ k 1 (A) α k Aψ k 1 (A)) r 0 = {(η k 1 (A)ϕ k 1 (A) α k Aη k 1 (A)ψ k 1 (A))} r 0 ω k A {(η k 1 (A)ϕ k 1 (A) α k Aη k 1 (A)ψ k 1 (A))} r 0 = r k 1 α k Ap k ω k A(r k 1 α k Ap k ) T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
41 and p k+1 = η k (A)ψ k (A)r 0 = η k (A) (ϕ k (A) + β k ψ k 1 (A)) r 0 = η k (A)ϕ k (A)r 0 + β k (1 ω k A)η k 1 (A)ψ k 1 (A)r 0 = η k (A)ϕ k (A)r 0 + β k η k 1 (A)ψ k 1 (A)r 0 β k ω k Aη k 1 (A)ψ k 1 (A)r 0 = r k + β k (p k ω k Ap k ). Recover the constants ρ k, β k, and α k in Bi-CG method. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
42 We now compute β k : Let ˆρ k+1 = (ˆr 0, η k (A)ϕ k (A)r 0 ) = ( η k (A T )ˆr 0, ϕ k (A)r 0 ). From Bi-CG we have ϕ k (A)r 0 all vectors µ k 1 (A T )ˆr 0, where µ k 1 is an arbitrary polynomial of degree k 1. Consider the highest order term of η k (A T ) (when computing ˆρ k+1 ) is ( 1) k ω 1 ω 2 ω k (A T ) k. From Bi-CG method, we also have ρ k+1 = ( ϕ k (A T )ˆr 0, ϕ k (A)r 0 ). The highest order term of ϕ k (A T ) is ( 1) k α 1 α k (A T ) k. Thus β k = (ˆρ k /ˆρ k 1 ) (α k 1 /ω k 1 ), T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
43 because β k = ρ ( k α1 α k 1 (A T ) k 1ˆr ) 0, ϕ k 1 (A)r 0 = ρ k 1 (α 1 α k 2 (A T ) k 2ˆr 0, ϕ k 2 (A)r 0 ) ( α1 α k 1 ω 1 ω ω k 1 1 ω k 1 (A T ) k 1ˆr ) 0, ϕ k 1 (A)r 0 = ( α1 α k 2 ω 1 ω ω k 2 1 ω k 2 (A T ) k 2ˆr ) 0, ϕ k 2 (A)r 0 = (ˆρ k /ˆρ k 1 ) (α k 1 /ω k 1 ). Similarly, we can compute ρ k and α k. Let r k = r k 1 γay, x k = x k 1 + γy (side product). Compute ω k so that r k = η k (A)ϕ k (A)r 0 is minimized in 2-norm as a function of ω k. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
44 Bi-CGSTAB Method 1: Given x 0, r 0 = b Ax 0, ˆr 0 arbitrary, such that (r 0, ˆr 0 ) 0, e.g. ˆr 0 = r 0, ρ 0 = α = ω 0 = 1, v 0 = p 0 = 0. 2: for k = 1, 2,... do 3: ρ k = (ˆr 0, r k 1 ), β = (ρ k /ρ k 1 )(α/ω k 1 ); 4: p k = r k 1 + β(p k 1 ω k 1 v k 1 ); 5: v k = Ap k ; 6: α = ρ k /(ˆr 0, v k ); 7: s = r k 1 αv k ; 8: t = As; 9: ω k = (t, s)/(t, t); 10: x k = x k 1 + αp k + ω k s (= x k 1 + αp k + ω k (r k 1 αap k )); 11: Stop here, if x k is accurate enough. 12: r k = s ω k t (= r k 1 αap k ω k A(r k 1 αap k ) = r k 1 A(αp k + ω k (r k 1 αap k )); 13: end for T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
45 Preconditioned Bi-CGSTAB-P: Rewrite Ax = b as à x = b with à = K 1 1 AK 1 2, where x = K2 1 x and b = K1 1 b. Then p k := K1 1 p k, ṽ k := K1 1 v k, r k := K1 1 r k, s := K1 1 s, t := K1 1 t, x k := K 2 x k, r 0 := K T 1 ˆr 0. T.M. Huang (NTNU) GCG-type Methods for Nonsymmetric LS December 6, / 45
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,
Διαβάστε περισσότερα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) =
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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) =
Διαβάστε περισσότερα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 :
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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.
Διαβάστε περισσότερα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)
Διαβάστε περισσότερα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)
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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,...,
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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)
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραw o = R 1 p. (1) R = p =. = 1
Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραORDINAL ARITHMETIC JULIAN J. SCHLÖDER
ORDINAL ARITHMETIC JULIAN J. SCHLÖDER Abstract. We define ordinal arithmetic and show laws of Left- Monotonicity, Associativity, Distributivity, some minor related properties and the Cantor Normal Form.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραSpace-Time Symmetries
Chapter Space-Time Symmetries In classical fiel theory any continuous symmetry of the action generates a conserve current by Noether's proceure. If the Lagrangian is not invariant but only shifts by a
Διαβάστε περισσότερα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
Διαβάστε περισσότεραSolutions to Exercise Sheet 5
Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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 α
Διαβάστε περισσότερα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
Διαβάστε περισσότεραPg The perimeter is P = 3x The area of a triangle is. where b is the base, h is the height. In our case b = x, then the area is
Pg. 9. The perimeter is P = The area of a triangle is A = bh where b is the base, h is the height 0 h= btan 60 = b = b In our case b =, then the area is A = = 0. By Pythagorean theorem a + a = d a a =
Διαβάστε περισσότερα( 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
Διαβάστε περισσότερα( ) 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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p)
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 2005-03-08 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότερα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
Διαβάστε περισσότερα5. Choice under Uncertainty
5. Choice under Uncertainty Daisuke Oyama Microeconomics I May 23, 2018 Formulations von Neumann-Morgenstern (1944/1947) X: Set of prizes Π: Set of probability distributions on X : Preference relation
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραDurbin-Levinson recursive method
Durbin-Levinson recursive method A recursive method for computing ϕ n is useful because it avoids inverting large matrices; when new data are acquired, one can update predictions, instead of starting again
Διαβάστε περισσότεραBounding Nonsplitting Enumeration Degrees
Bounding Nonsplitting Enumeration Degrees Thomas F. Kent Andrea Sorbi Università degli Studi di Siena Italia July 18, 2007 Goal: Introduce a form of Σ 0 2-permitting for the enumeration degrees. Till now,
Διαβάστε περισσότερα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(θ + θ)
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα= λ 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
Διαβάστε περισσότεραSOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr (T t N n) Pr (max (X 1,..., X N ) t N n) Pr (max
Διαβάστε περισσότερα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,
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (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
Διαβάστε περισσότεραBiCG CGS BiCGStab BiCG CGS 5),6) BiCGStab M Minimum esidual part CGS BiCGStab BiCGStab 2 PBiCG PCGS α β 3 BiCGStab PBiCGStab PBiCG 4 PBiCGStab 5 2. Bi
BiCGStab 1 1 2 3 1 4 2 BiCGStab PBiCGStab BiCG CGS CGS PBiCGStab BiCGStab M PBiCGStab An improvement in preconditioned algorithm of BiCGStab method Shoji Itoh, 1 aahiro Katagiri, 1 aao Saurai, 2 Mitsuyoshi
Διαβάστε περισσότερα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).
Διαβάστε περισσότερα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.
Διαβάστε περισσότερα6. MAXIMUM LIKELIHOOD ESTIMATION
6 MAXIMUM LIKELIHOOD ESIMAION [1] Maximum Likelihood Estimator (1) Cases in which θ (unknown parameter) is scalar Notational Clarification: From now on, we denote the true value of θ as θ o hen, view θ
Διαβάστε περισσότερα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
Διαβάστε περισσότερα9.09. # 1. Area inside the oval limaçon r = cos θ. To graph, start with θ = 0 so r = 6. Compute dr
9.9 #. Area inside the oval limaçon r = + cos. To graph, start with = so r =. Compute d = sin. Interesting points are where d vanishes, or at =,,, etc. For these values of we compute r:,,, and the values
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραDESIGN OF MACHINERY SOLUTION MANUAL h in h 4 0.
DESIGN OF MACHINERY SOLUTION MANUAL -7-1! PROBLEM -7 Statement: Design a double-dwell cam to move a follower from to 25 6, dwell for 12, fall 25 and dwell for the remader The total cycle must take 4 sec
Διαβάστε περισσότερα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
Διαβάστε περισσότεραHigher Derivative Gravity Theories
Higher Derivative Gravity Theories Black Holes in AdS space-times James Mashiyane Supervisor: Prof Kevin Goldstein University of the Witwatersrand Second Mandelstam, 20 January 2018 James Mashiyane WITS)
Διαβάστε περισσότεραTMA4115 Matematikk 3
TMA4115 Matematikk 3 Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet Trondheim Spring 2010 Lecture 12: Mathematics Marvellous Matrices Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραStrain gauge and rosettes
Strain gauge and rosettes Introduction A strain gauge is a device which is used to measure strain (deformation) on an object subjected to forces. Strain can be measured using various types of devices classified
Διαβάστε περισσότεραOrbital angular momentum and the spherical harmonics
Orbital angular momentum and the spherical harmonics March 8, 03 Orbital angular momentum We compare our result on representations of rotations with our previous experience of angular momentum, defined
Διαβάστε περισσότεραParametrized Surfaces
Parametrized Surfaces Recall from our unit on vector-valued functions at the beginning of the semester that an R 3 -valued function c(t) in one parameter is a mapping of the form c : I R 3 where I is some
Διαβάστε περισσότερα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
Διαβάστε περισσότερα1 String with massive end-points
1 String with massive end-points Πρόβλημα 5.11:Θεωρείστε μια χορδή μήκους, τάσης T, με δύο σημειακά σωματίδια στα άκρα της, το ένα μάζας m, και το άλλο μάζας m. α) Μελετώντας την κίνηση των άκρων βρείτε
Διαβάστε περισσότερα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
Διαβάστε περισσότεραBlock Ciphers Modes. Ramki Thurimella
Block Ciphers Modes Ramki Thurimella Only Encryption I.e. messages could be modified Should not assume that nonsensical messages do no harm Always must be combined with authentication 2 Padding Must be
Διαβάστε περισσότεραLecture 15 - Root System Axiomatics
Lecture 15 - Root System Axiomatics Nov 1, 01 In this lecture we examine root systems from an axiomatic point of view. 1 Reflections If v R n, then it determines a hyperplane, denoted P v, through the
Διαβάστε περισσότεραJesse Maassen and Mark Lundstrom Purdue University November 25, 2013
Notes on Average Scattering imes and Hall Factors Jesse Maassen and Mar Lundstrom Purdue University November 5, 13 I. Introduction 1 II. Solution of the BE 1 III. Exercises: Woring out average scattering
Διαβάστε περισσότεραdim(u) = n 1 and {v j } j i
SOLUTIONS Math B4900 Homework 1 2/7/2018 Unless otherwise specified, U, V, and W denote vector spaces over a common field F ; ϕ and ψ denote linear transformations; A, B, and C denote bases; A, B, and
Διαβάστε περισσότεραMATH423 String Theory Solutions 4. = 0 τ = f(s). (1) dτ ds = dxµ dτ f (s) (2) dτ 2 [f (s)] 2 + dxµ. dτ f (s) (3)
1. MATH43 String Theory Solutions 4 x = 0 τ = fs). 1) = = f s) ) x = x [f s)] + f s) 3) equation of motion is x = 0 if an only if f s) = 0 i.e. fs) = As + B with A, B constants. i.e. allowe reparametrisations
Διαβάστε περισσότερα