Deriving the X-Z Identity from Auxiliary Space Method
|
|
- Mitchell Garrett
- 5 years ago
- Views:
Transcription
1 Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA Iteratve Methods In ths paper we dscuss teratve methods to solve the lnear operator equaton Au = f, (1) posed on a fnte dmensonal Hlbert space V equpped wth an nner product (, ). Here A : V V s a symmetrc postve defnte (SPD) operator, f V s gven, and we are lookng for u V such that (1) holds. The X-Z dentty for the multplcatve subspace correcton method for solvng (1) s ntroduced and proved n Xu and Zkatanov [2002]. Alternatve proves can be found n Cho et al. [2008] and Vasslevsk [2008]. In ths paper we derve the X-Z dentty from the auxlary space method Nepomnyaschkh [1992], Xu [1996]. A basc lnear teratve method for solvng (1) can be wrtten n the followng form: startng from an ntal guess u 0, for k = 0, 1, 2, u k+1 = u k + B(f Au k ). (2) Here the non-sngular operator B A 1 wll be called terator. Let e k = u u k. The error equaton of the basc teratve method (2) s e k+1 = (I BA)e k = (I BA) k e 0. Thus the teratve method (2) converges f and only f the spectral radus of the error operator I BA s less than one,.e., ρ(i BA) < 1. Gven an terator B, we defne the mappng Φ B v = v +B(f Av) and ntroduce ts symmetrzaton Φ B = Φ B t Φ B. By defnton, we have the formula for the error operator I BA = (I B t A)(I BA), and thus The author s supported n part by NSF Grant DMS , and n part by NIH Grant P50GM76516 and R01GM Ths work s also partally supported by the Bejng Internatonal Center for Mathematcal Research.
2 2 Long Chen B = B t (B t + B 1 A)B. (3) Snce B s symmetrc, I BA s symmetrc wth respect to the A-nner product (u, v) A := (Au, v). Indeed, let ( ) be the adjont n the A-nner product (, ) A. It s easy to show I BA = (I BA) (I BA). (4) Consequently, I BA s postve sem-defnte and thus λ max (BA) 1. We get I BA A = max{ 1 λ mn (BA), 1 λ max (BA) } = 1 λ mn (BA). (5) From (5), we see that I BA s a contracton f and only f B s SPD whch s also equvalent to B t + B 1 A beng SPD n vew of (3). The convergence of the scheme Φ B and ts symmetrzaton Φ B s connected by the followng nequalty: ρ(i BA) 2 I BA 2 A = I BA A = ρ(i BA), (6) and the equalty holds f B = B t. Hence we shall focus on the analyss of the symmetrc scheme n the rest of ths paper. The terator B, when t s SPD, can be used as a precondtoner n the Precondtoned Conjugate Gradent (PCG) method, whch admts the followng estmate: ( ) k u u k A κ(ba) 1 u u 0 2 (k 1), A κ(ba) + 1 ( κ(ba) = λ ) max(ba). λ mn (BA) A good precondtoner should have the propertes that the acton of B s easy to compute and that the condton number κ(ba) s sgnfcantly smaller than κ(a). We shall also dscuss constructon of multlevel precondtoners n ths paper. 2 Auxlary Space Method In ths secton, we present a varaton of the fcttous space method Nepomnyaschkh [1992] and the auxlary space method Xu [1996]. Let Ṽ and V be two Hlbert spaces and let Π : Ṽ V be a surjectve map. Denoted by Π t : V Ṽ the adajont of Π wth respect to the default nner products (Π t u, ṽ) := (u, Πṽ) for all u V, ṽ Ṽ. Here, to save notaton, we use (, ) for nner products n both V and Ṽ. Snce Π s surjectve, ts transpose Π t s njectve. Theorem 1. Let Ṽ and V be two Hlbert spaces and let Π : Ṽ V be a surjectve map. Let B : Ṽ Ṽ be a symmetrc and postve defnte operator. Then B := Π BΠ t : V V s also symmetrc and postve defnte. Furthermore (B 1 v, v) = nf Πṽ=v ( B 1 ṽ, ṽ). (7)
3 Dervng the X-Z Identty from Auxlary Space Method 3 Proof. We adapt the proof gven by Xu and Zkatanov [2002] (Lemma 2.4). It s obvous that B s symmetrc and postve sem-defnte. Snce B s SPD and Π t s njectve, (Bv, v) = ( BΠ t v, Π t v) = 0 mples Π t v = 0 and consequently v = 0. Therefore B s postve defnte. Let ṽ = BΠ t B 1 v. Then Πṽ = v by the defnton of B. For any w Ṽ ( B 1 ṽ, w) = (Π t B 1 v, w) = (B 1 v, Π w). In partcular ( B 1 ṽ, ṽ ) = (B 1 v, Πṽ ) = (B 1 v, v). For any ṽ Ṽ, denoted by v = Πṽ, we wrte ṽ = ṽ + w wth Π w = 0. Then nf Πṽ=v ( B 1 ṽ, ṽ) = nf ( B 1 (ṽ + w), ṽ + w) Π w=0 = (B 1 v, v) + nf Π w=0 = (B 1 v, v) + nf Π w=0 ( B 1 w, w) = (B 1 v, v). ( 2( B 1 ṽ, w) + ( B 1 w, w) The symmetrc postve defnte operator B may be used as a precondtoner for solvng Au = f usng PCG. To estmate the condton number κ(ba), we only need to compare B 1 and A. Lemma 1. For two SPD operators A and B, f c 0 (Av, v) (B 1 v, v) c 1 (Av, v) for all v V, then κ(ba) c 1 /c 0. Proof. Note that BA s symmetrc wth respect to A. Therefore λ 1 mn (BA) = λ max((ba) 1 ((BA) 1 u, u) A (B 1 u, u) ) = sup = sup u V\{0} (u, u) A u V\{0} (Au, u). Therefore (B 1 v, v) c 1 (Av, v) mples λ mn (BA) c 1 1. Smlarly (B 1 v, v) c 0 (Av, v) mples λ max (BA) c 1 0. The estmate of κ(ba) then follows. By Lemma 1 and Theorem 1, we have the followng result. Corollary 1. Let B : Ṽ Ṽ be SPD and B = Π BΠ t. If c 0 (Av, v) then κ(ba) c 1 /c 0. nf ( B 1 ṽ, ṽ) c 1 (Av, v) for all v V, (8) Πṽ=v Remark 1. In lterature, e.g. the fcttous space lemma of Nepomnyaschkh [1992], the condton (8) s usually decomposed as the followng two condtons. 1. For any v V, there exsts a ṽ Ṽ, such that Πṽ = v and ṽ 2 B 1 c 1 v 2 A. 2. For any ṽ Ṽ, Πṽ 2 A c 1 0 ṽ 2 B 1. )
4 4 Long Chen 3 Auxlary Spaces of Product Type Let V V, = 0,..., J, be subspaces of V. If V = =0 V, then {V } J =0 s called a space decomposton of V. Then for any u V, there exsts a decomposton u = =0 u. Snce =0 V s not necessarly a drect sum, decompostons of u are n general not unque. We ntroduce the ncluson operator I : V V, the projecton operator Q : V V n the (, ) nner product, the projecton operator P : V V n the (, ) A nner product, and A = A V. It can be easly verfed Q A = A P and Q = I t. Gven a space decomposton V = =0 V, we construct an auxlary space of product type Ṽ = V 0 V 1... V J, wth the nner product (ũ, ṽ) := =0 (u, v ). We defne Π : Ṽ V as Πũ = =0 u. In operator form Π = (I 0, I 1,, I J ). Snce V = =0 V, the operator Π s surjectve. Let R : V V be nonsngular operators, often known as smoothers, approxmatng A 1. Defne a dagonal matrx of operators R = dag(r 0, R 1,, R J ) : Ṽ Ṽ whch s non-sngular. An addtve precondtoner s defned as B a = Π RΠ t = I R I t = =0 I R Q. (9) Applyng Theorem 1, we obtan the followng dentty for precondtoner B a. Theorem 2. If R s SPD on V for = 0,..., J, then B a defned by (9) s SPD on V. Furthermore (Ba 1 v, v) = nf (R 1 J =0 v=v v, v ). (10) To defne a multplcatve precondtoner, we ntroduce the operator à = Πt AΠ. By drect computaton, the entry ã j = Q AI j = A P I j. In partcular ã = A. The symmetrc operator à may be sngular wth nontrval kernel ker(π), but the dagonal of à s always non-sngular. Wrte à = D + L + D Ũ where = dag(a 0, A 1,, A j ), L and Ũ are lower and upper trangular matrx of operators, and L t = Ũ. Note that the operator R 1 + L s nvertble. We defne B m = ( R 1 + L) 1 and ts symmetrzaton as =0 =0 B m = B m t + B m B mã t B m = B m( t t B m + The symmetrzed multplcatve precondtoner s defned as B 1 m Ã) B m. (11) B m := Π B m Π t. (12) We defne the dagonal matrx of operators R = dag(r 0, R 1,, R J ), where, for each R, = 0,, J, ts symmetrzaton s R = R t (R t + R 1 A )R.
5 Dervng the X-Z Identty from Auxlary Space Method 5 Substtutng B 1 m = R 1 + L, and à = D + L + Ũ nto (11), we have B m = ( R t + L t ) 1 ( R t + R 1 D)( R L) = ( R t + L t ) 1 R t R R 1 ( R 1 + L) 1. (13) It s obvous that B m s symmetrc. To be postve defnte, from (13), t suffces to assume R,.e. each R, s symmetrc and postve defnte whch s equvalent to the operator I R A s a contracton and so s I R A. (A) I R A A < 1 for each = 0,, J. Theorem 3. Suppose (A) holds. Then B m defned by (12) s SPD, and (B 1 m v, v) = v 2 A + nf =0 v=v =0 In partcular, for R = A 1, we have Proof. Let (B 1 m v, v) = v 2 A + R(A t P nf =0 v=v =0 j= P v j R 1 j=+1 v ) 2. (14) R 1 v j 2 A. (15) M = R t + R 1 D = R t R R 1, U = D + Ũ R 1, L = U t. then R 1 + L = M + L and à = M + L + U. We then compute B 1 m = ( R 1 + L)( R t + R 1 D) 1 ( R t + L t ) = (M + L )M 1 (M + U ), = à + L M 1 U [ = à + Rt ( D + Ũ R R 1[ 1 )]t Rt ( D + Ũ R ] 1 ). For any ṽ V, denoted by v = Πṽ, we have (Ãṽ, ṽ) = (Πt AΠṽ, ṽ) = (AΠṽ, Πṽ) = v 2 A. Usng component-wse formula of Rt ( D + Ũ R 1 )ṽ, e.g. (( D + Ũ)ṽ) = j= ãjv j = j= A P v j, we get (M 1 U ṽ, U ṽ) = The dentty (14) then follows. R(A t P =0 j= v j R 1 v ) 2. R 1
6 6 Long Chen If we further ntroduce the operator T = R A P : V V, then T = R ta P, T := T + T T T = R A P, and (R 1 w, w ) = (A T 1 w, w ) = (T 1 w, w ) A. Here T 1 := (T V ) 1 : V V s well defned due to the assumpton (A). We then recovery the orgnal formulaton n Xu and Zkatanov [2002] (B 1 m v, v) = v 2 A + nf =0 v=v =0 (T 1 T w, T w ) A, wth w = j= v j T 1 v. Wth these notaton and w = k> v k, we can also use (13) to recovery the formula n Cho et al. [2008] (B 1 m v, v) = nf =0 v=v (T 1 (v + T w ), v + T w ) A. =0 4 Method of Subspace Correcton In ths secton, we vew the method of subspace correcton Xu [1992] as an auxlary space method and provde denttes for the convergence analyss. Let V = =0 V be a space decomposton of V. For a gven resdual r V, we let r = Q r be the restrcton of the resdual to the subspace V and solve the resdual equaton n the subspaces A e = r approxmately by ê = R r. Subspace correctons ê are assembled together to gve a correcton n the space V. There are two basc ways to assemble subspace correctons. Parallel Subspace Correcton (PSC) Ths method s to do the correcton on each subspace n parallel. In operator form, t reads u k+1 = u k + B a (f Au k ), (16) where B a = I R I t = =0 I R Q. (17) Thus PSC s also called addtve methods. Note that the formula (17) and (9) are dentcal and thus dentty (10) s useful to estmate κ(b a A). Successve Subspace Correcton (SSC) Ths method s to do the correcton n a successve way. In operator form, t reads v 0 = u k, v +1 = v + R Q (f Av ), = 0,..., N, u k+1 = v J+1. (18) =0
7 Dervng the X-Z Identty from Auxlary Space Method 7 For each subspace problem, we have the operator form v +1 = v +R (f Av ), but t s not easy to wrte out the terator for the space V. We defne B m such that the error operator I B m A = (I R J Q J A)(I R J 1 Q J 1 A)...(I R 0 Q 0 A). Therefore SSC s also called multplcatve method. We now derve a formulaton of B m from the auxlary space method. In the sequel, we consder the SSC appled to the space decomposton V = J =0 V wth smoothers R, = 0,, J. Recall that Ṽ = V 0 V 1... V J and à = Π t AΠ. Let f = Π t f. Followng Grebel and Oswald [1995], we vew SSC for solvng Au = f as a Gauss-Sedel type method for solvng Ãũ = f. Lemma 2. Let à = D + L + Ũ and B = ( R 1 + L) 1. Then SSC for Au = f wth smothers R s equvalent to the Gauss-Sedel type method for solvng Ãũ = f: ũ k+1 = ũ k + B( f Ãũk ). (19) Proof. By multplyng R 1 + L to (19) and rearrangng the term, we have Multplyng R, we obtan R 1 ũ k+1 = R 1 ũ k + f Lũ k+1 ( D + Ũ)ũk. ũ k+1 = ũ k + R( f Lũ k+1 ( D + Ũ)ũk ), and ts component-wse formula, for = 0,, J Let u k+1 1 = u k + R (f j=0 ã j u k+1 j 1 = u k + R Q (f A j=0 1 v 1 = u k+1 j + j=0 u k+1 j u k j. j= ã j u k j ) j= A u k j ). Notng that v v 1 = u k+1 u k, we then get, for = 1,, J + 1 v = v 1 + R Q (f Av 1 ), whch s exactly the correcton on V ; see (18). Lemma 3. For SSC, we have j= B m = Π B m Π t and B m = Π B m Π t.
8 8 Long Chen Proof. Let u k = Πũ k. Applyng Π to (19) and notng that we then get f = Π t f, and Ãũ k = Π t Au k, u k+1 = u k + Π BΠ t (f Au k ). Therefore B m = Π B m Π t. The formulae for B m s obtaned smlarly. Combnng Lemma 3, (5), (6), and Theorem 3, we obtan the X-Z dentty. Theorem 4 (X-Z dentty). Suppose assumpton (A) holds. Then where (I R J Q J A)(I R J 1 Q J 1 A)...(I R 0 Q 0 A) 2 A = c 0, (20) c 0 = sup nf v A =1 =0 v=v =0 In partcular, for R = A 1, where R(A t P j= v j R 1 v ) 2. R 1 (I P J )(I P J 1 ) (I P 0 ) 2 A = c 0, (21) c 0 = sup nf v A =1 =0 v=v =0 P j=+1 v j 2 A. References D. Cho, J. Xu, and L. Zkatanov. New estmates for the rate of convergence of the method of subspace correctons. Numer. Math. Theor. Meth. Appl., 1:44 56, M. Grebel and P. Oswald. On the abstract theory of addtve and multplcatve Schwarz methods. Numer. Math., 70: , S. V. Nepomnyaschkh. Decomposton and fcttous domans methods for ellptc boundary value problems. In Ffth Internatonal Symposum on Doman Decomposton Methods for Partal Dfferental Equatons (Norfolk, VA, 1991), pages SIAM, Phladelpha, PA, P. S. Vasslevsk. Multlevel Block Factorzaton Precondtoners: Matrx-based Analyss and Algorthms for Solvng Fnte Element Equatons. Sprnger Verlag, J. Xu. Iteratve methods by space decomposton and subspace correcton. SIAM Rev., 34: , J. Xu. The auxlary space method and optmal multgrd precondtonng technques for unstructured meshes. Computng, 56: , J. Xu and L. Zkatanov. The method of alternatng projectons and the method of subspace correctons n Hlbert space. J. Amer. Math. Soc., 15: , 2002.
Vector 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 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 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 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 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
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 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 informationOverlapping additive and multiplicative Schwarz iterations for H -matrices
Lnear Algebra and ts Applcatons 393 (2004) 91 105 www.elsever.com/locate/laa Overlappng addtve and multplcatve Schwarz teratons for H -matrces Rafael Bru a,1, Francsco Pedroche a, Danel B. Szyld b,,2 a
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 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 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 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 informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
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 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 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 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 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 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 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 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 informationThe Finite Element Method: A Short Introduction
Te Fnte Element Metod: A Sort ntroducton Wat s FEM? Te Fnte Element Metod (FEM) ntroduced by engneers n late 50 s and 60 s s a numercal tecnque for solvng problems wc are descrbed by Ordnary Dfferental
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 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 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 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 informationMatrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD
Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo
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 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 informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
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 information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
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 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 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 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 information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mt.edu 6.854J / 18.415J Advanced Algorthms Fall 2008 For nformaton about ctng these materals or our Terms of Use, vst: http://ocw.mt.edu/terms. 18.415/6.854 Advanced Algorthms
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
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 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 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 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 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 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 informationNOTES ON SIMPLIFICATION OF MATRICES
NOTES ON SIMPLIFICATION OF MATRICES JONATHAN LUK These notes dscuss how to smplfy an (n n) matrx In partcular, we expand on some of the materal from the textbook (wth some repetton) Part of the exposton
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 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 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 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 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 informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
More informationFixed points of IA-endomorphisms of a free metabelian Lie algebra
Proc. Indan Acad. Sc. (Math. Sc.) Vol. 121, No. 4, November 2011, pp. 405 416. c Indan Academy of Scences Fxed ponts of IA-endomorphsms of a free metabelan Le algebra NAIME EKICI 1 and DEMET PARLAK SÖNMEZ
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 informationBezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0
Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the
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 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 informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More information10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)
0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
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 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 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 informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
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 informationA MODIFIED METHOD FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS
Journal of Mathematcs and Statstcs 9 (1): 4-8, 1 ISSN 1549-644 1 Scence Publcatons do:1.844/jmssp.1.4.8 Publshed Onlne 9 (1) 1 (http://www.thescpub.com/jmss.toc) A MODIFIED METHOD FOR SOLVING SYSTEM OF
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
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 informationFall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede
Fall 0 Analyss of Expermental easurements B. Esensten/rev. S. Errede We now reformulate the lnear Least Squares ethod n more general terms, sutable for (eventually extendng to the non-lnear case, and also
More informationChapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of
Chapter 7 Generalzed and Weghted Least Squares Estmaton The usual lnear regresson model assumes that all the random error components are dentcally and ndependently dstrbuted wth constant varance. When
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationSUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)
SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationPreconditioning techniques in Chebyshev collocation method for elliptic equations
Precondtonng technques n Chebyshev collocaton method for ellptc equatons Zh-We Fang Je Shen Ha-We Sun (n memory of late Professor Benyu Guo Abstract When one approxmates ellptc equatons by the spectral
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 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 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 informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
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 informationApproximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
Approxmate D-optmal desgns of experments on the convex hull of a fnte set of nformaton matrces Radoslav Harman, Mára Trnovská Department of Appled Mathematcs and Statstcs Faculty of Mathematcs, Physcs
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 informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
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 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 informationAn Inequality for the trace of matrix products, using absolute values
arxv:1106.6189v2 [math-ph] 1 Sep 2011 An Inequalty for the trace of matrx products, usng absolute values Bernhard Baumgartner 1 Fakultät für Physk, Unverstät Wen Boltzmanngasse 5, A-1090 Venna, Austra
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 informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
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 informationAffine and Riemannian Connections
Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons
More informationON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction
ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES TAKASHI ITOH AND MASARU NAGISA Abstract We descrbe the Haagerup tensor product l h l and the extended Haagerup tensor product l eh l n terms of
More informationUniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity
Int. Journal of Math. Analyss, Vol. 6, 212, no. 22, 195-114 Unqueness of Weak Solutons to the 3D Gnzburg- Landau Model for Superconductvty Jshan Fan Department of Appled Mathematcs Nanjng Forestry Unversty
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 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 informationQuantum Mechanics for Scientists and Engineers. David Miller
Quantum Mechancs for Scentsts and Engneers Davd Mller Types of lnear operators Types of lnear operators Blnear expanson of operators Blnear expanson of lnear operators We know that we can expand functons
More informationORTHOGONALIZATION WITH A NON-STANDARD INNER PRODUCT WITH THE APPLICATION TO PRECONDITIONING
ORTHOGONALIZATION WITH A NON-STANDARD INNER PRODUCT WITH THE APPLICATION TO PRECONDITIONING Mroslav Rozložník jont work wth Jří Kopal, Alcja Smoktunowcz and Mroslav Tůma Insttute of Computer Scence, Czech
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationMath 101 Fall 2013 Homework #7 Due Friday, November 15, 2013
Math 101 Fall 2013 Homework #7 Due Frday, November 15, 2013 1. Let R be a untal subrng of E. Show that E R R s somorphc to E. ANS: The map (s,r) sr s a R-balanced map of E R to E. Hence there s a group
More informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationFeb 14: Spatial analysis of data fields
Feb 4: Spatal analyss of data felds Mappng rregularly sampled data onto a regular grd Many analyss technques for geophyscal data requre the data be located at regular ntervals n space and/or tme. hs s
More informationLeast-Squares Solutions of Generalized Sylvester Equation with Xi Satisfies Different Linear Constraint
Advances n Lnear Algebra & Matrx heory 6 6 59-7 Publshed Onlne June 6 n ScRes. http://www.scrp.org/journal/alamt http://dx.do.org/.6/alamt.6.68 Least-Squares Solutons of Generalzed Sylvester Equaton wth
More information