Overlapping additive and multiplicative Schwarz iterations for H -matrices
|
|
- Stanley Roberts
- 6 years ago
- Views:
Transcription
1 Lnear Algebra and ts Applcatons 393 (2004) Overlappng addtve and multplcatve Schwarz teratons for H -matrces Rafael Bru a,1, Francsco Pedroche a, Danel B. Szyld b,,2 a Departament de Matemàtca Aplcada, Unverstat Poltècnca de Valènca, Camí de Vera s/n, Valènca, Span b Department of Mathematcs, Temple Unversty, 1805 N. Broad Street, Phladelpha, PA , USA Receved 7 June 2003; accepted 28 October 2003 Submtted by M. Tsatsomeros Abstract In recent years, an algebrac framework was ntroduced for the analyss of convergence of Schwarz methods for the soluton of lnear systems of the form Ax = b. Wthn ths framework, addtve and multplcatve Schwarz were shown to converge when the coeffcent matrx A s a nonsngular M-matrx, or a symmetrc postve defnte matrx. In ths paper, many of these results are extended to the case of A beng an H -matrx. The case of nexact local solves s also consdered. In addton, the two-level scheme s studed,.e., when a coarse grd correcton s used n conjuncton wth the addtve or the multplcatve Schwarz teratons Elsever Inc. All rghts reserved. AMS classfcaton: 65F10; 65F35; 65M55 Keywords: Lnear systems; Schwarz teratve methods; Block methods; Overlap; H -matrces Correspondng author. E-mal addresses: rbru@mat.upv.es (R. Bru), pedroche@mat.upv.es (F. Pedroche), szyld@math. temple.edu (D.B. Szyld). 1 Supported by Spansh DGI grant BFM Supported n part by the Natonal Scence Foundaton under grant DMS /$ - see front matter 2003 Elsever Inc. All rghts reserved. do: /j.laa
2 92 R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) Introducton We consder lnear systems of equatons of the form Ax = b, (1) where A R n n s an H -matrx (and thus nonsngular; see, e.g., [5] and the references theren) and x and b are vectors of V = R n ; we revew some defntons later n ths secton. We study the soluton of (1) by Schwarz teratons wth p overlappng blocks. These are teratve methods orgnally developed for operators A arsng from dscretzatons of partal dfferental equatons (p.d.e.). In these cases, Schwarz teratons correspond to doman decomposton methods; see, e.g., [12,13]. Schwarz methods are most often used as precondtoners, but n some nstances they are used as statonary teratve methods of the form x k+1 = Tx k + c, k = 0, 1,..., (2) where x 0 s an ntal guess, c s an approprate vector, and T s the teraton matrx; see, e.g., [3,8], and the references gven theren for such use. In our context, the convergence of the teraton (2), whch holds for any ntal vector x 0 f and only f ρ = ρ(t) < 1(ρ(T) denotng the spectral radus; see, e.g., [2]), ndcates that the spectrum of the precondtoned matrx I T (= B 1 A for some nonsngular matrx B),.e., ts set of egenvalues, s contaned n a ball centered at one wth radus ρ. In the rest of ths secton we revew the addtve and multplcatve teratons, each correspondng to a dfferent matrx T n (2). Our exposton s based on the algebrac formulaton presented n [6] and [1]. In these references, convergence of the Schwarz teratons was studed when the matrx A n (1) s ether a nonsngular M-matrx or symmetrc postve defnte. In ths paper, n Sectons 2 and 3 we study the convergence of these teratons when A s an H -matrx. The analyss for the case of nexact local solves s also ncluded. In Secton 4 we extend the convergence results to the two-level teratons,.e., when a coarse grd correcton s used. A nonsngular matrx A havng all nonpostve off-dagonal entres s called an M-matrx f the nverse s (entry-wse) nonnegatve,.e., A 1 O; see, e.g., [2,11]. For any matrx A = (a j ) R n n, ts comparson matrx A =(α j ) s defned by α = a, α j = a j, /= j. A matrx A s sad to be an H -matrx f A s an M-matrx. In partcular, A s an H -matrx f and only f t s generalzed dagonally domnant,.e., a u > a j u j, = 1,...,n (3) /=j for some postve vector u = (u 1,...,u n ) T. H -matrces were ntroduced n [11] as generalzaton of M-matrces. They appear n many applcatons, e.g., when dscretzng certan nonlnear parabolc operators usng hgh order fnte elements and suffcently small tme steps [4]. The characterzaton (3) also ndcates how general these matrces are; see further [15].
3 R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) As we have mentoned, n ths paper we study the soluton of (1) when A s an H - matrx, usng Schwarz teratve methods. These are block teratve methods n whch the blocks are overlappng,.e., some varables are common to more than one block. When there s no overlap, addtve Schwarz reduces to block Jacob, whle multplcatve Schwarz reduces to block Gauss Sedel. To formally descrbe the overlappng blocks, let V be subspaces of V = R n of dmenson n, = 1,...,p, (p > 1) such that the sum of these subspaces span the whole space. These subspaces are not parwse dsjont; on the contrary, ther ntersecton s precsely the overlap, and thus p n >n. The restrcton and prolongaton operators map vectors from V to V and vceversa. The restrcton operators used here are of the form R =[I O], = 1,...,p, (4) where I s the dentty on R n,and s a permutaton matrx on R n. The prolongaton operator consdered here s R T. We now defne the followng matrces E = R T R, = 1,...,p. (5) Note that the dagonal matrces E gven by (5) have nonzero dagonal elements (wth value one) only n the columns whch have a nonzero element the matrx R. We denote by q the measure of overlap,.e., the maxmum over all possble rows, of the number of matrces E wth a nonzero n the row. Thus E qi; (6) and usually q p. The restrcton of the matrx A to the subspace V s A = R AR T, (7) whch s a symmetrc permutaton of an n n prncpal submatrx of A, = 1,..., p. These are precsely the p overlappng blocks; see [6] for more detals. We are ready to descrbe the Schwarz teratons for the soluton of (1). The damped addtve Schwarz teraton has the followng form x k+1 = x k + θ R T A 1 R (b Ax k ), (8) where 0 <θ 1sthedampng factor. In practcal mplementatons of the addtve Schwarz teratons (8), for each teraton, the resdual vector r k = b Ax k s restrcted to each subspace V usng the operator R. Then, the local problem A e = r k = R r k (9)
4 94 R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) s solved, the obtaned local errors, e k = e, are prolongated, summng them (and dampng ts value) and fnally that correcton s added to x k yeldng the new approxmaton vector x k+1. It follows that the process (8) s (2) wth the teraton matrx T θ = I θ R T A 1 R A = I θ P, (10) where P = R TA 1 R A s a projecton onto V. In the case of A symmetrc and postve defnte, ths projecton s orthogonal wth respect to the A-nner product; see, e.g., [13]. The teraton matrx for the multplcatve Schwarz teratons s T µ = (I P p )(I P p 1 ) (I P 1 ) = (I P ). (11) In contrast to the addtve Schwarz teraton (8), here, the correcton n each subspace s followed by another correcton, untl all correctons have been made. When the local problem (9) s not solved exactly, but only approxmately, ts soluton can be consdered the exact soluton of another approxmate local problem, namely à e = r k. The matrx à could be, for example, an ncomplete factorzaton of A ; see, e.g., [13]. In ths case, the teraton matrx for the damped addtve Schwarz teraton wth nexact local solves s T θ = I θ R T à 1 R A = I θ P, (12) where P = R Tà 1 R A. Smlarly, the teraton matrx for the multplcatve Schwarz teratons wth nexact local solves s T µ = (I P p )(I P p 1 ) (I P 1 ) = (I P ). (13) We proceed n the next sectons to study the convergence of the teratons (10) (13). 2. Convergence of addtve Schwarz teratons We begn by establshng a dfferent algebrac representaton of the teraton matrx (10). Gven a matrx A = (a j ), we defne the matrx A =( a j ). It follows that A O and that AB A B for any two matrces A and B of compatble sze. Let A =[O I ] A T [O I ] T, (14)
5 R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) where I s the (n n ) (n n ) dentty matrx, and let [ ] M = T A O O H, (15) where H s some (n n ) (n n ) nonsngular matrx such that H A = H A. (16) In fact, ths condton gves us a lot of freedom n choosng H. In [1,6], dfferent choces were H = A or H = D = dag A. These choces clearly satsfy our condton (16). It follows then from the form of the matrces (5) and (15) that E M 1 = R T A 1 R. (17) Usng ths equalty, the teraton matrx T θ can be expressed as T θ = I θ E M 1 A. (18) Our proof of convergence conssts of showng that f θ 1/q, thenρ(t θ )<1; cf. [6]. Our strategy s to show that T θ T θ, for the matrx T θ = I θ R T A 1 R A, (19) whch we show n the next subsecton to be nonnegatve and to have spectral radus less than one Propertes of T θ Let us consder the followng lnear system assocated wth the orgnal problem (1), A x = b, (20) and apply the addtve Schwarz teratons wth the same p overlappng blocks that we consdered n Secton 1. Then, gven an ntal approxmaton x 0 for the soluton of (1), the damped addtve Schwarz teraton appled to (20) reads, for k = 0, 1,..., x k+1 = x k + θ R T A 1 R (b A x k ), (21) where the R are gven by (4), and n a way smlar to (7), A = R A R T, and the teraton matrx for ths scheme s precsely (19).
6 96 R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) It s not hard to see that A = A, and snce any prncpal submatrx of an M-matrx s also an M-matrx [2,11], we have the followng useful result. Lemma 1. If A R n n s an H -matrx, then any prncpal submatrx of A, and any symmetrc permutaton of t s an H -matrx. In partcular the matrx A gven by (7) s an H -matrx. We note that the coeffcent matrx of (20) s an M-matrx, and therefore, we can use the results n [6]. In partcular, we have that B = R T A 1 R = E M 1 s nonnegatve and nonsngular, where E s gven by (5). We also have that the teraton matrx (19) can be wrtten as T θ = I θ E M 1 A (22) and that f θ 1/q, T θ O, and the damped addtve Schwarz teraton (21) converges to the soluton of (20) for any ntal vector x 0. Therefore we have ρ( T θ )<1. (23) 2.2. Convergence for H -matrces Before proceedng wth the convergence analyss of (21) we prove an mportant result concernng the matrces M defned n (15). A splttng A = M N s called regular f M 1 O and N O [14];tscalledH-compatble f A = M N ; see [5]. Theorem 1. Let A R n n be an H -matrx and let the matrces M be of the form (15), satsfyng (16). Then, A= M N,= 1,...,p, are H -compatble splttngs. Proof. Frst, from the defnton of A notce that TA = T A snce the dagonal of the matrx TA s a permutaton of the dagonal of A. Let A be wrtten by blocks as [ ] A = T A U V A, where U and V are matrces of approprate sze. Then, we have that A = T [ ] A U V A (24)
7 and M = T R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) [ ] A O O H. From these expressons we may wrte, usng (16) [ ] [ ] M A = T A O O H T A U V A [ ] = T O U V H A. Consder now the splttngs A = M N, = 1,...,p. Then, [ ] [ ] N = M A = T A O O H T A U V A [ ] = T O U V H A. Hence, we have that N = M A and the proof s complete. We are ready now to prove the followng convergence result. Theorem 2. Let A R n n be an H -matrx. Let the matrces R be of the form (4). Then, f θ 1/q, the damped addtve Schwarz teraton (8) converges to the soluton of (1) for any ntal vector x 0. Proof. We frst show that T θ T θ. (25) From the expressons (22) and (18) we have [ ] T θ T θ = θ E A M 1 A M 1 and applyng Theorem 1, we have [ ] T θ T θ = θ E M 1 N M 1 N. (26) Let us recall that f A s an H -matrx, then A 1 A 1 [11]. Then, the rght hand sde of (26) s nonnegatve, snce M 1 N M 1 N M 1 N M 1 N (27) and thus T θ T θ. (28)
8 98 R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) Now, from the expressons (22) and (18), we also have [ ] T θ + T θ = 2I θ E M 1 A +M 1 A, usng agan Theorem 1 and smplfyng, we have [ ] [ ] T θ + T θ = 2 I θ E + θ E M 1 N +M 1 N. (29) Now, from (6), f θ 1/q,wehave I θqi θ E, and then the frst term of the rght hand sde of (29) s nonnegatve. Moreover, from (27), the second term of the rght hand sde of (29) s also nonnegatve. Therefore, we have that f θ 1/q, then T θ T θ. (30) Combnng (28) and (30) we have the desred result (25). To conclude the proof, we recall that f A, B R n n and A B then ρ(a) ρ(b); see, e.g., [10, 2.4.9]. Applyng ths to (25) we have, usng (23), that f θ 1/q, then ρ(t θ ) ρ( T θ ) ρ( T θ )< Inexact local solves Gven the matrces Ã, = 1,...,p, representng the nexact local solves, for the convergence analyss one consders the matrces ] [à M = T O O H, (31) cf. (15). We assume as before that H satsfes (16). As n (17) and (18), we have now E M 1 = R Tà 1 R, = 1,...,p,and T θ = I θ p E M 1 A. The condtons we mpose on the local solves to guarantee convergence of the addtve Schwarz methods are the followng: à 1 O and (32) à A = à A, = 1,...,p. (33) We note that condton (32) s satsfed automatcally f à s an H -matrx. Ths occurs, e.g., f à s an ncomplete factorzaton of A [9,14]. Condton (33) s equvalent to havng the splttng A = à (à A ) be H -compatble. Note also that under the condtons (32) (33), snce we have that ( à A ) O, we conclude that A = à ( à A ) s a regular splttng. These condtons also provde us wth the counterpart to Theorem 1. Its proof s analogous, and therefore t s omtted.
9 R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) Theorem 3. Let A be an H -matrx and let the matrces M be defned as n (31). Assume further that the nexact solves are such that the condton (33) holds. Then, the splttngs A = M Ñ,= 1,...,p,are H -compatble splttngs. The followng counterpart to the result (23) s obtaned by applyng [6, Theorem 3.5] to the M-matrx A. Theorem 4. Let A be an H -matrx and let the nexact solves be such that (32) holds and that à A O, = 1,...,p, whch hold f one mposes the condton (33) as well. Then, f θ 1/q, the damped addtve Schwarz teraton wth nexact local solves, defned by (2) wth the teraton matrx T θ = I θ R T à 1 R A converges to the soluton of A x = b for any ntal vector x 0,.e., we have that ρ( T θ )<1. We are now ready to show the convergence of the damped addtve Schwarz teraton matrx wth nexact local solves for H -matrces. Theorem 5. Let A be an H -matrx and let the nexact solves be such that the condtons (32) (33) hold. Then, f θ 1/q, the damped addtve Schwarz teraton wth nexact local solves, defned by (2) wth the teraton matrx (12) converges to the soluton of (1) for any ntal vector x 0. Proof. The proof s analogous to that of Theorem 2. Usng the same technques one shows that T θ T θ, and usng Theorem 4, we conclude that ρ( T θ ) ρ( T θ ) < Multplcatve Schwarz teratons We frst observe that usng (17), the teraton matrx for multplcatve Schwarz T µ gven n (11) can be wrtten as T µ = (I R T A 1 R A) = (I E M 1 A). (34) As was the case for addtve Schwarz, we consder the soluton of the lnear system (20) by multplcatve Schwarz teratons wth the same blocks as for the system (1). Then, the new teraton matrx for the multplcatve Schwarz teraton s now T µ = (I R T A 1 R A ).
10 100 R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) Usng the results of [1] appled to the system (20) (whose coeffcent matrx s an M-matrx), we have that T µ = (I E M 1 A ) O. and that ρ( T µ )<1. Furthermore, usng Theorem 1, we have that T µ = (I E + E M 1 N ). (35) We are ready to prove the convergence of multplcatve Schwarz teratons for H -matrces. Theorem 6. Let A R n n be an H -matrx. Let the matrces R be of the form (4). Then, the multplcatve Schwarz teraton (2) wth teraton matrx (11) converges to the soluton of (1) for any ntal vector x 0. Proof. As n the proof of Theorem 2, to prove that ρ(t µ )<1 we show that T µ T µ. To that end, we bound I E + E M 1 N I E + E M 1 N = I E + E M 1 N I E + E M 1 N, (36) where the last nequalty follows from E M 1 N E M 1 N E M 1 N =E M 1 N. From (34), usng that A = M N,wehave T µ = (I E M 1 A) I E M 1 A = I E + E M 1 N, and usng 36 and (35) we conclude that T µ (I E + E M 1 N ) = T µ. (37) The convergence of the multplcatve Schwarz teraton s proved.
11 3.1. Inexact local solves R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) In order to analyze the convergence of the multplcatve Schwarz teraton wth nexact local solves, we frst consder the soluton of the auxlary system (20), and apply [6, Theorem 4.5] to t. We thus obtan the followng result. Theorem 7. Let A be an H -matrx. Assume that à A O, = 1,...,p, whch hold f one mposes condton (33). Then the multplcatve Schwarz teraton matrx wth nexact local solves, defned by (2) wth the teraton matrx T µ = (I E M 1 A ) converges to the soluton of A x = b for any choce of the ntal vector x 0,.e., we have that ρ( T µ )<1. We proceed as n Theorem 6, usng Theorem 3 one can prove that T µ T µ mplyng that ρ( T µ ) ρ( T µ )<1. We have then the followng convergence result. Theorem 8. Let A be an H -matrx and let the nexact solves be such that condton (33) holds. Then, the multplcatve Schwarz teraton wth nexact local solves, defned by (2) wth the teraton matrx (13) converges to the soluton of (1) for any ntal vector x Coarse grd correctons for H -matrces In ths secton, we study the convergence of the addtve and multplcatve Schwarz teratons when a coarse grd correcton s appled. We follow the structure used n [1,6]. The coarse grd s represented algebracally by an addtonal subspace V 0 of dmenson n 0, wth p n 0 <n. For ths subspace, we defne a restrcton operator R 0 as before wth (4) ( = 0), A 0 as n (7), and E 0 as n (5), mplyng O E 0 I. (38) We also defne the correspondng matrx M 0 as n (15), and thus, by Theorem 1, the splttng A = M 0 N 0 s also H -compatble. In other words, Theorem 1 holds for = 0, 1,...,p, and ths s how we use t throughout ths secton. If the coarse grd equaton A 0 e 0 = r 0, s solved approxmately, we defned the matrx à 0 so that the approxmaton solves exactly à 0 e 0 = r 0. We assume that the condtons (32) (33) hold (for = 0). One can then defne a matrx M 0 as n (31). The analyss of the two-level methods presented n the sequel can be appled to the
12 102 R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) case of nexact local solves, and/or nexact correctons usng the same technques. We omt the detals Multplcatve Schwarz wth multplcatve correcton Followng [1], let the teraton matrx of the multplcatve Schwarz teraton wth a multplcatve coarse grd correcton be H µ = (I G 0 A)T µ, (39) where G 0 = R0 TA 1 0 R 0. It follows that (17) holds [1],.e., E 0 M 1 0 A = G 0A. (40) Let us consder the lnear system (20). Applyng the results of [1] to the M-matrx A, we have that the teraton matrx Ĥ µ = (I Ĝ 0 A ) T µ (41) s nonnegatve and has spectral radus less than one, where Ĝ 0 = R0 T A 1 0 R 0 = R0 T A 0 1 R 0 = E 0 M 0 1. By Theorem 1, we know that A = M 0 N 0 and thus we can rewrte the matrx (41) as Ĥ µ = (I E 0 + E 0 M 0 1 N 0 ) T µ. Theorem 9. Let A R n n be an H -matrx and consder the soluton of (1) by multplcatve Schwarz teratons wth multplcatve correcton,.e., the teraton (2) wth T = H µ as n (39). Then, the teratons converge to the soluton, for any ntal vector x 0. Proof. We can rewrte the teraton matrx (39) usng (40) and Theorem 1 as H µ = (I E 0 + E 0 M 1 0 N 0)T µ. (42) As n the proof of Theorem 6, we have I E 0 + E 0 M 1 0 N 0 I E 0 + E 0 M 0 1 N 0. (43) From (42) and (43), we have that H µ = (I E 0 + E 0 M 1 0 N 0)T µ I E 0 + E 0 M 1 0 N 0 T µ (I E 0 + E 0 M 0 1 N 0 ) T µ. We use now (37), whch says that T µ T µ, then we have that (I E 0 + E 0 M 0 1 N 0 ) T µ (I E 0 + E 0 M 0 1 N 0 ) T µ = Ĥ µ. Thus, H µ Ĥ µ and therefore ρ(h µ ) ρ(ĥ µ )<1.
13 R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) Addtve Schwarz wth multplcatve correcton The multplcatve correcton (I G 0 A) appled to the addtve Schwarz teratons gves rse to the followng teraton matrx [1] H θ = (I G 0 A)T θ. (44) As t can be apprecated, the structure of ths teraton matrx s the same as that of (39). Usng the same logc as n the prevous subsecton, and usng the fact that T θ T θ, one can compare (44) wth Ĥ θ = (I Ĝ 0 A ) T θ, the teraton matrx of addtve Schwarz teratons for the system (20), for whch ρ(ĥ θ )<1fθ 1/q; see [1]. Thus, we have the counterpart to Theorem 9. Theorem 10. Let A R n n be an H -matrx and consder the soluton of (1) by addtve Schwarz teratons wth multplcatve correcton,.e., the teraton (2) wth T = H θ as n (44). Then, f θ 1/q, the teratons converge to the soluton for any ntal vector x 0. We remark that unlke the stuaton n the M-matrx case [1], the coarse grd correcton not always leads to a decrease of the spectral radus of the teraton matrx. The followng smple example llustrates ths stuaton. Consder the followng H - matrx 14/15 1/15 7/90 1/20 A = 1/5 4/5 7/45 3/20 1/30 4/15 29/30 3/10, 1/10 1/45 1/10 89/90 and let [ ] R 1 =, R = , wth the coarse grd correcton gven by [ ] R 0 = The spectral rad of the teraton operators are ρ(t µ ) , ρ(h µ ) , ρ(t θ ) , ρ(h θ ) for the value θ = 1/3. On the other hand, for the case of A symmetrc postve defnte, one can say the followng. It holds that I G 0 A s an orthogonal projecton onto V 0 usng the A- nner product, and thus I G 0 A A = 1. Therefore H µ A = (I G 0 A)T µ A T µ A and H θ A = (I G 0 A)T θ A T θ A.
14 104 R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) Addtve Schwarz wth addtve coarse grd correcton Havng a coarse grd correcton addtvely conssts of havng an extra term n (10) correspondng to the correcton n the subspace V 0. The correspondng teraton matrx s thus T θ = I θ =0 R T A 1 R A. (45) In [6], ths teraton was shown to be convergent for systems where the coeffcent s an M-matrx, and θ 1/(q + 1). Thus, f we consder the soluton of system (20) by the addtve Schwarz wth addtve coarse grd correcton, we have that the matrx T θ = I θ =0 R T A 1 R A s nonnegatve and has spectral radus less than one, f θ 1/(q + 1). Usng Theorem 1 (for = 0, 1,...,p) we can rewrte t as T θ = I θ (E E M 1 N ) O. =0 Theorem 11. Let A R n n be an H -matrx. Then, f θ 1/(q + 1), the damped addtve Schwarz teraton wth addtve correcton defned by the teraton matrx T θ of (45) converges to the soluton of (1) for any ntal vector x 0. Proof. The proof s analogous to that of Theorem 2. On one sde we have that T θ T θ = θ =0 On the other, we wrte [ T θ + T θ = 2 I θ ( M 1 N M 1 N ) O. ] E + θ =0 =0 E [ M 1 N +M 1 N ], whch s nonnegatve snce from (6) and (38), for θ 1/(q + 1), I θ(q + 1)I θ E. =0 Then, we conclude that T θ T θ and thus ρ( T θ ) ρ( T θ )<1.
15 Acknowledgment R. Bru et al. / Lnear Algebra and ts Applcatons 393 (2004) We thank one of the referees for many suggestons whch have helped mprove our presentaton. References [1] M. Benz, A. Frommer, R. Nabben, D.B. Szyld, Algebrac theory of multplcatve Schwarz methods, Numer. Math. 89 (2001) [2] A. Berman, R.J. Plemmons, Nonnegatve Matrces n the Mathematcal Scences, Academc Press, New York, 1979 (Reprnted and updated, SIAM, Phladelpha, 1994). [3] T.F. Chan, T.Y. Hou, P.L. Lons, Geometry related convergence results for doman decomposton algorthms, SIAM J. Numer. Anal. 28 (1991) [4] B. Fscher, J. Moderstzk, Curvature based mage regstraton, JMIV 18 (2003). [5] A. Frommer, D.B. Szyld, H -Splttngs and two-stage teratve methods, Numer. Math. 63 (1992) [6] A. Frommer, D.B. Szyld, Weghted max norms, splttngs, and overlappng addtve Schwarz teratons, Numer. Math. 83 (1999) [7] G.H. Golub, C.F. Van Loan, Matrx Computatons, thrd ed., The Johns Hopkns Unversty Press, Baltmore, [8] T.P. Mathew, Unform convergence of the Schwarz alternatng method for solvng sngularly perturbed advecton dffuson equatons, SIAM J. Numer. Anal. 35 (1998) [9] J.A. Mejernk, H. van der Vorst, An teratve soluton method for lnear systems of whch the coeffcent matrx s a symmetrc M-matrx, Math. Comput. 31 (1977) [10] J.M. Ortega, W.C. Rhenboldt, Iteratve Soluton of Nonlnear Equatons n Several Varables, Academc Press, New York and London, 1970 (Reprnted, SIAM, Phladelpha, 2000). [11] A.M. Ostrowsk, Über de Determnanten mt überwegender Hauptdagonale, Coment. Math. Helv. 10 (1937) [12] A. Quarteron, A. Vall, Doman Decomposton Methods for Partal Dfferental Equatons, Oxford Scence Publcatons, Clarendon Press, Oxford, [13] B.F. Smth, P.E. Bjørstad, W.D. Gropp, Doman Decomposton: Parallel Multlevel Methods for Ellptc Partal Dfferental Equatons, Cambrdge Unversty Press, Cambrdge, [14] R.S. Varga, Factorzaton and normalzed teratve methods, n: R.E. Langer (Ed.), Boundary Problems n Dfferental Equatons, The Unversty of Wsconsn Press, Madson, 1960, pp [15] R.S. Varga, On recurrng theorems on dagonal domnance, Lnear Algebra Appl. 13 (1976) 1 9.
Deriving the X-Z Identity from Auxiliary Space Method
Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve
More informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationc 2006 Society for Industrial and Applied Mathematics
SIAM J. MARIX ANAL. APPL. Vol. 29, No. 1, pp. 98 116 c 2006 Socety for Industral and Appled Mathematcs SCHWARZ IERAIONS FOR SYMMERIC POSIIVE SEMIDEFINIE PROBLEMS REINHARD NABBEN AND DANIEL B. SZYLD Abstract.
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationSCHWARZ ITERATIONS FOR SYMMETRIC POSITIVE SEMIDEFINITE PROBLEMS
SCHWARZ ITERATIONS FOR SYMMETRIC POSITIVE SEMIDEFINITE PROBLEMS REINHARD NABBEN AND DANIEL B. SZYLD Abstract. Convergence propertes of addtve and multplcatve Schwarz teratons for solvng lnear systems of
More informationNumerische Mathematik
Numer. Math. 89: 605 639 (2001) Dgtal Object Identfer (DOI) 10.1007/s002110100275 Numersche Mathematk Algebrac theory of multplcatve Schwarz methods Mchele Benz 1,, Andreas Frommer 2, Renhard Nabben 3,
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,
More informationVector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.
Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationLinear Algebra and its Applications
Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationfor Linear Systems With Strictly Diagonally Dominant Matrix
MATHEMATICS OF COMPUTATION, VOLUME 35, NUMBER 152 OCTOBER 1980, PAGES 1269-1273 On an Accelerated Overrelaxaton Iteratve Method for Lnear Systems Wth Strctly Dagonally Domnant Matrx By M. Madalena Martns*
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationNumerische Mathematik
Numer. Math. (1999) 83: 259 278 Numersche Mathematk c Sprnger-Verlag 1999 Weghted max norms, splttngs, and overlappng addtve Schwarz teratons Andreas Frommer 1, Danel B. Szyld 2, 1 Fachberech Mathematk,
More informationNonlinear Overlapping Domain Decomposition Methods
Nonlnear Overlappng Doman Decomposton Methods Xao-Chuan Ca 1 Department of Computer Scence, Unversty of Colorado at Boulder, Boulder, CO 80309, ca@cs.colorado.edu Summary. We dscuss some overlappng doman
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to
THE INVERSE POWER METHOD (or INVERSE ITERATION) -- applcaton of the Power method to A some fxed constant ρ (whch s called a shft), x λ ρ If the egenpars of A are { ( λ, x ) } ( ), or (more usually) to,
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationTHE Hadamard product of two nonnegative matrices and
IAENG Internatonal Journal of Appled Mathematcs 46:3 IJAM_46_3_5 Some New Bounds for the Hadamard Product of a Nonsngular M-matrx and Its Inverse Zhengge Huang Lgong Wang and Zhong Xu Abstract Some new
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationMATH Homework #2
MATH609-601 Homework #2 September 27, 2012 1. Problems Ths contans a set of possble solutons to all problems of HW-2. Be vglant snce typos are possble (and nevtable). (1) Problem 1 (20 pts) For a matrx
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationA property of the elementary symmetric functions
Calcolo manuscrpt No. (wll be nserted by the edtor) A property of the elementary symmetrc functons A. Esnberg, G. Fedele Dp. Elettronca Informatca e Sstemstca, Unverstà degl Stud della Calabra, 87036,
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationAsymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation
Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationP A = (P P + P )A = P (I P T (P P ))A = P (A P T (P P )A) Hence if we let E = P T (P P A), We have that
Backward Error Analyss for House holder Reectors We want to show that multplcaton by householder reectors s backward stable. In partcular we wsh to show fl(p A) = P (A) = P (A + E where P = I 2vv T s the
More information[7] R.S. Varga, Matrix Iterative Analysis, Prentice-Hall, Englewood Clis, New Jersey, (1962).
[7] R.S. Varga, Matrx Iteratve Analyss, Prentce-Hall, Englewood ls, New Jersey, (962). [8] J. Zhang, Multgrd soluton of the convecton-duson equaton wth large Reynolds number, n Prelmnary Proceedngs of
More informationApplication of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems
Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &
More informatione - c o m p a n i o n
OPERATIONS RESEARCH http://dxdoorg/0287/opre007ec e - c o m p a n o n ONLY AVAILABLE IN ELECTRONIC FORM 202 INFORMS Electronc Companon Generalzed Quantty Competton for Multple Products and Loss of Effcency
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 17. a ij x (k) b i. a ij x (k+1) (D + L)x (k+1) = b Ux (k)
STAT 309: MATHEMATICAL COMPUTATIONS I FALL 08 LECTURE 7. sor method remnder: n coordnatewse form, Jacob method s = [ b a x (k) a and Gauss Sedel method s = [ b a = = remnder: n matrx form, Jacob method
More informationRelaxation Methods for Iterative Solution to Linear Systems of Equations
Relaxaton Methods for Iteratve Soluton to Lnear Systems of Equatons Gerald Recktenwald Portland State Unversty Mechancal Engneerng Department gerry@pdx.edu Overvew Techncal topcs Basc Concepts Statonary
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationform, and they present results of tests comparng the new algorthms wth other methods. Recently, Olschowka & Neumaer [7] ntroduced another dea for choo
Scalng and structural condton numbers Arnold Neumaer Insttut fur Mathematk, Unverstat Wen Strudlhofgasse 4, A-1090 Wen, Austra emal: neum@cma.unve.ac.at revsed, August 1996 Abstract. We ntroduce structural
More informationNON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS
IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc
More informationNew Method for Solving Poisson Equation. on Irregular Domains
Appled Mathematcal Scences Vol. 6 01 no. 8 369 380 New Method for Solvng Posson Equaton on Irregular Domans J. Izadan and N. Karamooz Department of Mathematcs Facult of Scences Mashhad BranchIslamc Azad
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationMEM 255 Introduction to Control Systems Review: Basics of Linear Algebra
MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationNorms, Condition Numbers, Eigenvalues and Eigenvectors
Norms, Condton Numbers, Egenvalues and Egenvectors 1 Norms A norm s a measure of the sze of a matrx or a vector For vectors the common norms are: N a 2 = ( x 2 1/2 the Eucldean Norm (1a b 1 = =1 N x (1b
More informationRepresentation theory and quantum mechanics tutorial Representation theory and quantum conservation laws
Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More informationOn the size of quotient of two subsets of positive integers.
arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationDUE: WEDS FEB 21ST 2018
HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant
More informationTR A BDDC ALGORITHM FOR PROBLEMS WITH MORTAR DISCRETIZATION. September 4, 2005
TR2005-873 A BDDC ALGORITHM FOR PROBLEMS WITH MORTAR DISCRETIZATION HYEA HYUN KIM, MAKSYMILIAN DRYJA, AND OLOF B WIDLUND September 4, 2005 Abstract A BDDC balancng doman decomposton by constrants algorthm
More informationTime-Varying Systems and Computations Lecture 6
Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy
More informationLecture 4: Constant Time SVD Approximation
Spectral Algorthms and Representatons eb. 17, Mar. 3 and 8, 005 Lecture 4: Constant Tme SVD Approxmaton Lecturer: Santosh Vempala Scrbe: Jangzhuo Chen Ths topc conssts of three lectures 0/17, 03/03, 03/08),
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationEigenvalues of Random Graphs
Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the
More informationMultigrid Methods and Applications in CFD
Multgrd Metods and Applcatons n CFD Mcael Wurst 0 May 009 Contents Introducton Typcal desgn of CFD solvers 3 Basc metods and ter propertes for solvng lnear systems of equatons 4 Geometrc Multgrd 3 5 Algebrac
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationThe Pseudoblocks of Endomorphism Algebras
Internatonal Mathematcal Forum, 4, 009, no. 48, 363-368 The Pseudoblocks of Endomorphsm Algebras Ahmed A. Khammash Department of Mathematcal Scences, Umm Al-Qura Unversty P.O.Box 796, Makkah, Saud Araba
More informationPh 219a/CS 219a. Exercises Due: Wednesday 23 October 2013
1 Ph 219a/CS 219a Exercses Due: Wednesday 23 October 2013 1.1 How far apart are two quantum states? Consder two quantum states descrbed by densty operators ρ and ρ n an N-dmensonal Hlbert space, and consder
More informationBounds for Spectral Radius of Various Matrices Associated With Graphs
45 5 Vol.45, No.5 016 9 AVANCES IN MATHEMATICS (CHINA) Sep., 016 o: 10.11845/sxjz.015015b Bouns for Spectral Raus of Varous Matrces Assocate Wth Graphs CUI Shuyu 1, TIAN Guxan, (1. Xngzh College, Zhejang
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationDeterminants Containing Powers of Generalized Fibonacci Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal
More informationREGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction
REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationRobust Norm Equivalencies and Preconditioning
Robust Norm Equvalences and Precondtonng Karl Scherer Insttut für Angewandte Mathematk, Unversty of Bonn, Wegelerstr. 6, 53115 Bonn, Germany Summary. In ths contrbuton we report on work done n contnuaton
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationAn Introduction to Morita Theory
An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory
More informationP.P. PROPERTIES OF GROUP RINGS. Libo Zan and Jianlong Chen
Internatonal Electronc Journal of Algebra Volume 3 2008 7-24 P.P. PROPERTIES OF GROUP RINGS Lbo Zan and Janlong Chen Receved: May 2007; Revsed: 24 October 2007 Communcated by John Clark Abstract. A rng
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationOn Finite Rank Perturbation of Diagonalizable Operators
Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable
More information