ON A GENERAL CLASS OF PRECONDITIONERS FOR NONSYMMETRIC GENERALIZED SADDLE POINT PROBLEMS
|
|
- Cory Richard
- 5 years ago
- Views:
Transcription
1 U..B. Sci. Bull., Series A, Vol. 78, Iss. 4, 06 ISSN ON A GENERAL CLASS OF RECONDIIONERS FOR NONSYMMERIC GENERALIZED SADDLE OIN ROBLE Fatemeh anjeh Ali BEIK his paper deals with applying a class of preconditioners for saddle point problems with nonsymmetric positive definite (,) part symmetric positive semidefinite (,) part. he examined class of preconditioners includes the generalized shift-splitting preconditioner their modified version. he offered class of preconditioner is induced from a stationary iterative method. Numerical experiments for a model Navier-Stokes problem are reported which illustrate the efficiency of the presented preconditioner. Keywords: Nonsymmetric saddle point problem, preconditioner, shift-splitting, iterative method. C00: 65F0, 65F50 65N.. Introduction Consider generalized saddle point problems of the form A B x f A u b, B C y g () such that A nn is nonsymmetric positive definite (i.e., the symmetric part ( A A ) is positive definite; B mn is of full row rank ( m n) C is symmetric positive semidefinite. In [, Lemma.], it has been shown that the preceding assumptions guarantee existence uniqueness of the solution of (). Linear systems of the form () arise in a variety of computational sciences engineering applications such as constrained optimization, computational fluid dynamics, mixed finite element discretization of the Navier-Stokes equations, the linear elasticity problem, elliptic parabolic interface problems, constrained least-squares problem so on; for more details see [,, 3, 9, 0] references therein. In the past few years, there has been a growing interest in saddle problems of the form () several types of iterative methods have been proposed; we refer the reader to [] for a comprehensive survey. More precisely, recently, some research works have focused on variants types of the Uzawa method for the case that (,)-block is zero; for more details see [4, 5, 6] references therein. Vali-e-Asr University of Rafsanjan, Iran, Islamic Republic Of, beik.fatemeh@gmail.com
2 Fatemeh anjeh Ali Beik More recently, Liang Zhang [] have presented a modified Uzawa method based on the skew-ermitian triangular splitting (SS) of the (,) part of the saddle-point coefficient matrix for solving non-ermitian saddle-point problems with non-ermitian positive definite skew-ermitian dominant (,) zero (,) part. It is well-known that the Krylov subspace methods are superior to the stationery iterative methods in general. Nevertheless, the Krylov subspace methods converge slowly for solving saddle point problems in practice. o overcome this drawback, several papers have applied different types of preconditioners till now. For instance, Cao et al. [4] have proposed a modified dimensional split preconditioner based on a splitting of the generalized saddle point matrix. In the case that the (,)-block C is zero the (,)-block is symmetric positive definite. In [5], Cao et al. have examined the shift-splitting preconditioner of the form I A B SS, 0. () B I which is obtained based on shift-splitting of the saddle point coefficient matrix. Also the application of a local preconditioner is studied A B LSS, 0. B I Recently, Chen Ma [7] have focused on the saddle point problems with the similar form mentioned in [5] developed a general class of preconditioners which incorporates (). More precisely, the following preconditioner has been offered I A B GSS, (3) B I where 0 0. Lately, Salkuyeh et al. [3] have applied a modified generalized shiftsplitting (MGSS) preconditioner I A B MGSS,, 0, (4) B I C for the saddle point problems of the form () so that the (,)-block is symmetric positive definite C 0. he MGSS preconditioner is based on a splitting of the saddle point coefficient matrix which results in an unconditionally convergent stationary iterative method. In addition, the following relaxed version of the MGSS preconditioner is examined
3 On a general class of preconditioners for nonsymmetric generalized saddle point problems 3 RMGSS A B, 0. B I C More recently, Cao et al. [6] have studied the application of the generalized shift-splitting preconditioner (3) for saddle point problem () whose (,)-block is zero (,)-block is a nonsymmetric positive definite matrix. In this paper, we introduce a class of general preconditioners which are obtained by splitting the diagonal blocks of the coefficient matrix A in (). o do this, first, the mixed splitting () iterative method is presented its convergence properties are discussed. he offered iterative method includes the modified generalized shift-splitting (MGSS) iterative method [3]. Notice that the convergence properties of the MGSS iterative method the application of the preconditioners of the form (4) have not been studied for the case that the (,)-block A in () is nonsymmetric. As seen, the induced preconditioner by the method incorporates the preconditioners (), (3) (4). he rest of this paper is organized as follows. Before ending this section, some notations are introduced which are exploited throughout the paper. In Section, first, we present the mixed splitting () iterative method give some sufficient conditions under which the method is convergent. hen based on the presented splitting, a general class of preconditioners is offered to improve the speed of convergence of the Krylov subspace methods to solve the saddle point problems of the form (). In Section 3, some numerical experiments are reported for a model of Navier-Stokes problem to illustrate the efficiency of the proposed new class of preconditioners. Finally the paper is finished with a brief conclusion in Section 4. Notations: he real conjugate parts of a complex number a are denoted by Re ( a) a, respectively. For a square matrix A, the symbol ( A) sts for the spectral radius of A. For two given symmetric positive definite matrices A B, the notation A B means that A B is positive definite.. Main results Consider the following mixed splitting for the coefficient matrix A, ˆ ˆ M B N B A Q, (5) B M B N in which ˆM M are both nonsingular matrices such that A Mˆ Nˆ C M N. Remark.. Assume that C 0. Consider a special case of (5) such that
4 4 Fatemeh anjeh Ali Beik ˆ ˆ M ( I A), N ( I A), M I N I, where ( )0 0. Evidently, in this case, the mixed splitting reduces to the generalized shift-splitting considered in [6]. Note that it is not difficult to verify that Mˆ Nˆ is symmetric (semi) positive definite, M N is nonsingular, M is symmetric positive definite ˆ ( M Nˆ) ( ). Remark.. Suppose that ( ) 0 0 are given A is symmetric. We comment here that setting ˆ ˆ M ( I A), N ( I A), M I C N I C, in (5), we obtain the modified generalized shift-splitting splitting discussed in [3]. Similar to the previous remark, we point out that here Mˆ Nˆ is symmetric (semi) positive definite, M N is nonsingular, M is symmetric positive definite ˆ ( M Nˆ) ( ). Mixed splitting () iterative method: Exploiting the mixed splitting (5), we may define the iterative scheme to solve () as follows: ( k) ( k) u u c, k 0,,,, (6) where Q is the iteration matrix, c b, u (( x ),( y ) ) ( k ) ( k ) ( k ) (0) the initial guess u is given. It is well-known that (6) is convergent for any (0) arbitrary initial guess u iff ; for further details one may refer to [, Chapter 4]. In the sequel we discuss the convergence of the method. Let be an arbitrary eigenvalue of u ( x, y ) be its corresponding eigenvector. u u Q which is equivalent to say that u hat is, Q u. ence, we obtain ˆ ˆ Nx B y Mx B y, (7) Bx Ny Bx My. (8) Lemma.. Suppose that M N is nonsingular. If is an eigenvalue of, then.
5 On a general class of preconditioners for nonsymmetric generalized saddle point problems 5 roof. Assume that u is the corresponding eigenvector of, hence u 0. In view of the fact that A is nonsingular then. Since implies that A u 0. From (8), we find that if then ( M N) u 0 which is a contradiction by our assumption that M N is nonsingular. Remark.3. In view of Remarks.., throughout this work, we assume that Mˆ Nˆ is symmetric positive semidefinite, M N is nonsingular, M is symmetric positive definite, M C ˆ ( M Nˆ). heorem.. Assume that denotes the iteration matrix of the method. Suppose that Mˆ Nˆ is symmetric positive semidefinite, M N is nonsingular, M is symmetric positive definite, M C ˆ ( M Nˆ). hen. roof. Let (, u) be an arbitrary eigenpair of so that 0 where u ( x, y ). We first show that x 0. If x 0 then from (7), it is seen that ( ) B y 0. Now Lemma. implies that y 0, hence u 0 which cannot be true invoking the fact that u is an eigenvector. Notice if y 0 then from (7), we have Nx ˆ Mx ˆ. hat is is an eigenvalue of Mˆ Nˆ. herefore, by the assumption. In the rest of the proof without loss of generality, it is assumed that x 0 y 0. From Eqs (7) (8), we have ˆ x B y x Mx x ( Mˆ Nˆ ) x, (9) y B x y My y Cy. (0) Note that the left h side of (9) is equal to the conjugate of the left h side of (0), hence ˆ ˆ ˆ x M x x ( M N ) x y My y Cy. Or equivalently, ˆ ˆ ˆ x M x x ( M N) x y My y Cy. For simplicity, we set ( ˆ ˆ q x M N) x, r y My s y Cy. Now from the above relation, it is seen that
6 6 Fatemeh anjeh Ali Beik Re ˆ x M x q s Re. () r s q We point out that by the assumptions, rs, q are positive r s. On the other h, straightforward computations reveal that ˆ Re Re ˆ x M x q x Mx x ( Mˆ Nˆ ) x Re( x Ax) 0. Consequently, from (), we deduce that Re 0. Now the result follows immediately from the following fact Re. Remark.4. As pointed earlier, Salkuyeh et al. [3] has developed the MGSS method for saddle point problems with symmetric positive definite (,)-block. It is pointed in Remark. that the MGSS method is a special case of the method. herefore, heorem. turns out that all of the results established by Salkuyeh et al. are valid when (,)-block A is nonsymmetric positive definite. Remark.5. Assume that Ais a nonsymmetric positive definite matrix. Let Q be two arbitrary symmetric positive definite matrices. If we set Mˆ A, Nˆ A, M ( Q C) N ( Q C), then it can be seen that all of the assumptions in heorem. hold. Our numerical experiments illustrate that the matrix can be served as an effective preconditioner to speed up the convergence of the Krylov subspace methods (e.g., restarted GMRES method) although its corresponding stationery iterative method may converge slowly. he same ideas are utilized in [5, 6, 7, 3] which focus on the shift-splitting types of preconditioners. o apply the preconditioner induced from the mixed splitting, in fact, we need to hle the Krylov subspace methods for solving the following linear system Au b. Remark.6. In view of Remark.5, in our numerical experiments, we set Mˆ A, Nˆ A, M ( I C) N ( I C), where are two given positive parameters is the symmetric part of A. hat is, we use the following preconditioner
7 On a general class of preconditioners for nonsymmetric generalized saddle point problems 7 * A B. () B I C he following proposition presents the eigenvalue distribution of the * ( ) A. * roposition.. Assume that is defined as in (). If A is nonsymmetric * positive definite, then the eigenvalues of ( ) A belongs to the following subset of, S { z iw z 0, z w 4 w z}. * roof. Let i be an arbitrary eigenvalue of ( ) A. herefore, * Au u, (3) so that u ( x, y ). It is not difficult to verify that 0 x 0. From (3), it can be observed that x Ax x B y x Ax x x x B y, y Bx y Cy y Bx y Cy y y, where /. Consequently, we have x B y x Ax x x, y Bx y Cy y y. For simplicity, assume that, x Ax p ip q y Cy r y y. he above two relations implies that ( p ip) p q r. Since A is positive definite ( p 0), it can be concluded that Re( ) he preceding relation shows that Re( ) Im( ), we deduce that p r p 0. Re( ). In view of the fact that Re( ) Im( ) which complete the proof.
8 8 Fatemeh anjeh Ali Beik 3. Numerical experiments In this section, we give an example to demonstrate the applicability of the proposed preconditioner (in the form given in Remark.6) compare its performance with the shift-splitting types. All of the reported experiments were performed on a 64-bit.45 Gz core i7 processor 8.00GB RAM using some matlab codes on MALAB version In matrices GSS, DSS, MGSS, RMGSS parameters, are taken to be Example 3.. Consider the Oseen equation as follows: w ( v. ) w p f in. w 0. *, the corresponding which is derived when the steady-state Navier-Stokes equation is linearized by icard iteration. ere the vector field v is the approximation of w from the previous icard iteration, the vector w represents the velocity, p denotes the pressure is a bounded domain. he parameter 0 sts for the viscosity. Conservative discretizations of the Oseen problem (4) leads to a generalized saddle point system of the form () with nonsymmetric positive definite (,)-block. Our examined test problems are constructed using IFISS software package written by Elman et al. [8]. he package is used to generate discretizations of leaky lid driven cavity problem using stabilized Q-0 (Q-Q) finite elements method (FEM) to study the performance of the offered preconditioner for the case that (,)-block in () is nonzero (zero). Four grids are exploited, 6 6, 3 3, which Q-Q FEM corresponds (578,8), (78,89), (8450,089) (338,45) to ( nm, ), respectively Q-0 FEM corresponds (578,89), (78,04), (8450, 4096) (338,6384) to ( nm, ), respectively. In all of the tests, we apply the GMRES(5) method such that the initial guess is taken to be zero the iterations are terminated as soon as ( k ) 6 b A u 0 b, or if the number of iterations exceeds from kmax 5000 where ( k ) u (4) denotes the k th approximate solution. he corresponding results are disclosed in ables. We end this section with a remark given as follows. Remark 3.. In [3], the application of the MGSS the relaxed MGSS (RMGSS) preconditioners only studied under the assumption that the (,)-block A is symmetric positive definite. Our numerical tests show that this
9 On a general class of preconditioners for nonsymmetric generalized saddle point problems 9 preconditioners are also effective when Ais nonsymmetrical positive definite. ere, we point out that the proposed MGSS iterative scheme is not convergence in the case that the parameter 0, i.e., when MGSS reduces to RMGSS. On the h, the RMGSS preconditioner outperforms the MGSS preconditioner which the reason can be expressed as in [3, Remark ]. As seen, is as effective as RMGSS this may be a motivation to study the other kind of preconditioners in the form of in the future works with details. able Numerical results for Oseen problem with ν = 0.0 (Q-Q FEM) reconditioner I MGSS RMGSS able Numerical results for Oseen problem with ν = 0.0 (Q-0 FEM) * * Grid I CU I CU I CU I CU reconditioner I GSS DSS * Grid I CU I CU I CU I CU Conclusions Recently, Cao et al. [Appl. Math. Lett. 49 (05), 0-7] Salkuyeh et al. [Appl. Math. Lett. 48 (05), 55-6] have focused on applying shift-splitting preconditioners for saddle point problems. his paper has been concerned with employing a general class of preconditioners incorporates shift-splitting preconditioners. Our established results have revealed that the results proved by Salkuyeh et al. are valid for the case that (,) part of the coefficient matrix of the saddle point problem is nonsymmetric. he reported numerical results by Cao et al. (Salkuyeh et al.) shown that the proposed DSS (RMGSS) preconditioner outperforms their other hled preconditioners although the corresponding
10 0 Fatemeh anjeh Ali Beik iterative method to DSS (RMGSS) preconditioner is not convergent. Our examined numerical experiments have demonstrated that a special preconditioner of the offered class is as effective as DSS RMGSS preconditioners. Further work can be focused on studying the performance of other possible instances of the introduced class of the preconditioners with detail. R E F E R E N C E S []. M. Benzi G.. Golub, A preconditioner for generalized saddle point problems, in SIAM J. Matrix Anal. Appl., vol. 6, no., 004, pp []. M. Benzi, G.. Golub J. Liesen, Numerical solution of saddle point problems, in Acta Numer. vol. 4, no., 005, pp [3]. F. Brezzi M. Fortin, Mixed ybrid Finite Element Methods, Springer-Verlag, New York, 99. [4]. Y. Cao, L. Q. Yao M. Q. Jiang, A modified dimensional split preconditioner for generalized saddle points problems, J. Appl. Math. Comput., vol. 50, Oct. 03, pp [5]. Y. Cao, J. Du Q. Niu, Shift-splitting preconditioners for saddle point problems, in J. Appl. Math. Comput., vol. 7, Dec. 05, pp [6]. Y. Cao, S. Li L. Q. Yao, A class of generalized shift-splitting preconditioners for nonsymmetric saddle point problems, in Appl. Math. Lett., vol. 49, Nov. 05, pp [7]. C. Chen C. Ma, A generalized shift-splitting preconditioners for nonsymmetric saddle point problems, in Appl. Math. Lett., vol. 43, May 05, pp [8]..C. Elman, A. Ramage, D.J. Silvester, IFISS: A Matlab toolbox for modelling incompressibe flow, in ACM rans. Math. Software., vol. 33, Jun. 007, Article 4. [9]. V. Girault. A. Raviart, Finite Element Methods for Navier Stokes Equations, Springer Verlag, Berlin, 986. [0]. R. Glowinski. Le allec, Augmented Lagrangian Operator-splitting Methods in Nonlinear Mechanics. SIAM, hiladelphia, 989. []. Z. Z. Liang G. F. Zhang, U-SS method for non-ermitian saddle-point problems, in Appl. Math. Lett., vol. 46, Aug. 05, pp. -6. []. Y. Saad, Iterative Methods for Sparse Linear Systems, SIAM, hiladelphia, 003. [3]. D. K. Salkuyeh, M. Masoudi D. ezari, On the generalized shift-splitting preconditioner for saddle point problems, in Appl. Math. Lett., vol. 48, Oct. 05, pp [4]. A. L. Yang Y. J. Wu, he Uzawa SS method for saddle-point problems, in Appl. Math. Lett., vol. 38, Dec. 04, pp [5]. J.. Yun, Variants of the Uzawa method for saddle point problem, in Comput. Math. Appl., vol. 65, Apr. 03, pp [6]. G. F. Zhang, J. L. Yang, S. S. Wang, On generalized parameterized inexact Uzawa method for a block two-by-two linear system, in J. Comput. Appl. Math., vol. 55, Jan. 04, pp
ON THE GENERALIZED DETERIORATED POSITIVE SEMI-DEFINITE AND SKEW-HERMITIAN SPLITTING PRECONDITIONER *
Journal of Computational Mathematics Vol.xx, No.x, 2x, 6. http://www.global-sci.org/jcm doi:?? ON THE GENERALIZED DETERIORATED POSITIVE SEMI-DEFINITE AND SKEW-HERMITIAN SPLITTING PRECONDITIONER * Davod
More informationON A SPLITTING PRECONDITIONER FOR SADDLE POINT PROBLEMS
J. Appl. Math. & Informatics Vol. 36(208, No. 5-6, pp. 459-474 https://doi.org/0.437/jami.208.459 ON A SPLITTING PRECONDITIONER FOR SADDLE POINT PROBLEMS DAVOD KHOJASTEH SALKUYEH, MARYAM ABDOLMALEKI, SAEED
More informationA Robust Preconditioned Iterative Method for the Navier-Stokes Equations with High Reynolds Numbers
Applied and Computational Mathematics 2017; 6(4): 202-207 http://www.sciencepublishinggroup.com/j/acm doi: 10.11648/j.acm.20170604.18 ISSN: 2328-5605 (Print); ISSN: 2328-5613 (Online) A Robust Preconditioned
More informationThe semi-convergence of GSI method for singular saddle point problems
Bull. Math. Soc. Sci. Math. Roumanie Tome 57(05 No., 04, 93 00 The semi-convergence of GSI method for singular saddle point problems by Shu-Xin Miao Abstract Recently, Miao Wang considered the GSI method
More informationBlock preconditioners for saddle point systems arising from liquid crystal directors modeling
Noname manuscript No. (will be inserted by the editor) Block preconditioners for saddle point systems arising from liquid crystal directors modeling Fatemeh Panjeh Ali Beik Michele Benzi Received: date
More informationarxiv: v1 [math.na] 26 Dec 2013
General constraint preconditioning iteration method for singular saddle-point problems Ai-Li Yang a,, Guo-Feng Zhang a, Yu-Jiang Wu a,b a School of Mathematics and Statistics, Lanzhou University, Lanzhou
More informationON AUGMENTED LAGRANGIAN METHODS FOR SADDLE-POINT LINEAR SYSTEMS WITH SINGULAR OR SEMIDEFINITE (1,1) BLOCKS * 1. Introduction
Journal of Computational Mathematics Vol.xx, No.x, 200x, 1 9. http://www.global-sci.org/jcm doi:10.4208/jcm.1401-cr7 ON AUGMENED LAGRANGIAN MEHODS FOR SADDLE-POIN LINEAR SYSEMS WIH SINGULAR OR SEMIDEFINIE
More informationON THE GLOBAL KRYLOV SUBSPACE METHODS FOR SOLVING GENERAL COUPLED MATRIX EQUATIONS
ON THE GLOBAL KRYLOV SUBSPACE METHODS FOR SOLVING GENERAL COUPLED MATRIX EQUATIONS Fatemeh Panjeh Ali Beik and Davod Khojasteh Salkuyeh, Department of Mathematics, Vali-e-Asr University of Rafsanjan, Rafsanjan,
More informationFast Iterative Solution of Saddle Point Problems
Michele Benzi Department of Mathematics and Computer Science Emory University Atlanta, GA Acknowledgments NSF (Computational Mathematics) Maxim Olshanskii (Mech-Math, Moscow State U.) Zhen Wang (PhD student,
More informationA Review of Preconditioning Techniques for Steady Incompressible Flow
Zeist 2009 p. 1/43 A Review of Preconditioning Techniques for Steady Incompressible Flow David Silvester School of Mathematics University of Manchester Zeist 2009 p. 2/43 PDEs Review : 1984 2005 Update
More informationPerformance Comparison of Relaxation Methods with Singular and Nonsingular Preconditioners for Singular Saddle Point Problems
Applied Mathematical Sciences, Vol. 10, 2016, no. 30, 1477-1488 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.6269 Performance Comparison of Relaxation Methods with Singular and Nonsingular
More informationSEMI-CONVERGENCE ANALYSIS OF THE INEXACT UZAWA METHOD FOR SINGULAR SADDLE POINT PROBLEMS
REVISTA DE LA UNIÓN MATEMÁTICA ARGENTINA Vol. 53, No. 1, 2012, 61 70 SEMI-CONVERGENCE ANALYSIS OF THE INEXACT UZAWA METHOD FOR SINGULAR SADDLE POINT PROBLEMS JIAN-LEI LI AND TING-ZHU HUANG Abstract. Recently,
More informationEfficient Solvers for the Navier Stokes Equations in Rotation Form
Efficient Solvers for the Navier Stokes Equations in Rotation Form Computer Research Institute Seminar Purdue University March 4, 2005 Michele Benzi Emory University Atlanta, GA Thanks to: NSF (MPS/Computational
More informationDepartment of Computer Science, University of Illinois at Urbana-Champaign
Department of Computer Science, University of Illinois at Urbana-Champaign Probing for Schur Complements and Preconditioning Generalized Saddle-Point Problems Eric de Sturler, sturler@cs.uiuc.edu, http://www-faculty.cs.uiuc.edu/~sturler
More informationMathematics and Computer Science
Technical Report TR-2007-002 Block preconditioning for saddle point systems with indefinite (1,1) block by Michele Benzi, Jia Liu Mathematics and Computer Science EMORY UNIVERSITY International Journal
More informationITERATIVE METHODS FOR DOUBLE SADDLE POINT SYSTEMS
IERAIVE MEHODS FOR DOULE SADDLE POIN SYSEMS FAEMEH PANJEH ALI EIK 1 AND MIHELE ENZI Abstract. We consider several iterative methods for solving a class of linear systems with double saddle point structure.
More informationNumerical behavior of inexact linear solvers
Numerical behavior of inexact linear solvers Miro Rozložník joint results with Zhong-zhi Bai and Pavel Jiránek Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic The fourth
More informationChebyshev semi-iteration in Preconditioning
Report no. 08/14 Chebyshev semi-iteration in Preconditioning Andrew J. Wathen Oxford University Computing Laboratory Tyrone Rees Oxford University Computing Laboratory Dedicated to Victor Pereyra on his
More informationFinding Rightmost Eigenvalues of Large, Sparse, Nonsymmetric Parameterized Eigenvalue Problems
Finding Rightmost Eigenvalues of Large, Sparse, Nonsymmetric Parameterized Eigenvalue Problems AMSC 663-664 Final Report Minghao Wu AMSC Program mwu@math.umd.edu Dr. Howard Elman Department of Computer
More informationON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH
ON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH V. FABER, J. LIESEN, AND P. TICHÝ Abstract. Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix
More informationJournal of Computational and Applied Mathematics. Optimization of the parameterized Uzawa preconditioners for saddle point matrices
Journal of Computational Applied Mathematics 6 (009) 136 154 Contents lists available at ScienceDirect Journal of Computational Applied Mathematics journal homepage: wwwelseviercom/locate/cam Optimization
More informationConvergence Properties of Preconditioned Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Semidefinite Matrices
Convergence Properties of Preconditioned Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Semidefinite Matrices Zhong-Zhi Bai 1 Department of Mathematics, Fudan University Shanghai
More informationAN ITERATIVE METHOD TO SOLVE SYMMETRIC POSITIVE DEFINITE MATRIX EQUATIONS
AN ITERATIVE METHOD TO SOLVE SYMMETRIC POSITIVE DEFINITE MATRIX EQUATIONS DAVOD KHOJASTEH SALKUYEH and FATEMEH PANJEH ALI BEIK Communicated by the former editorial board Let A : R m n R m n be a symmetric
More informationConvergence of a Class of Stationary Iterative Methods for Saddle Point Problems
Convergence of a Class of Stationary Iterative Methods for Saddle Point Problems Yin Zhang 张寅 August, 2010 Abstract A unified convergence result is derived for an entire class of stationary iterative methods
More informationPreconditioners for the incompressible Navier Stokes equations
Preconditioners for the incompressible Navier Stokes equations C. Vuik M. ur Rehman A. Segal Delft Institute of Applied Mathematics, TU Delft, The Netherlands SIAM Conference on Computational Science and
More informationANALYSIS OF AUGMENTED LAGRANGIAN-BASED PRECONDITIONERS FOR THE STEADY INCOMPRESSIBLE NAVIER-STOKES EQUATIONS
ANALYSIS OF AUGMENTED LAGRANGIAN-BASED PRECONDITIONERS FOR THE STEADY INCOMPRESSIBLE NAVIER-STOKES EQUATIONS MICHELE BENZI AND ZHEN WANG Abstract. We analyze a class of modified augmented Lagrangian-based
More informationSplitting Iteration Methods for Positive Definite Linear Systems
Splitting Iteration Methods for Positive Definite Linear Systems Zhong-Zhi Bai a State Key Lab. of Sci./Engrg. Computing Inst. of Comput. Math. & Sci./Engrg. Computing Academy of Mathematics and System
More informationEfficient Augmented Lagrangian-type Preconditioning for the Oseen Problem using Grad-Div Stabilization
Efficient Augmented Lagrangian-type Preconditioning for the Oseen Problem using Grad-Div Stabilization Timo Heister, Texas A&M University 2013-02-28 SIAM CSE 2 Setting Stationary, incompressible flow problems
More informationGeneralized AOR Method for Solving System of Linear Equations. Davod Khojasteh Salkuyeh. Department of Mathematics, University of Mohaghegh Ardabili,
Australian Journal of Basic and Applied Sciences, 5(3): 35-358, 20 ISSN 99-878 Generalized AOR Method for Solving Syste of Linear Equations Davod Khojasteh Salkuyeh Departent of Matheatics, University
More informationTHE solution of the absolute value equation (AVE) of
The nonlinear HSS-like iterative method for absolute value equations Mu-Zheng Zhu Member, IAENG, and Ya-E Qi arxiv:1403.7013v4 [math.na] 2 Jan 2018 Abstract Salkuyeh proposed the Picard-HSS iteration method
More informationBlock triangular preconditioner for static Maxwell equations*
Volume 3, N. 3, pp. 589 61, 11 Copyright 11 SBMAC ISSN 11-85 www.scielo.br/cam Block triangular preconditioner for static Maxwell equations* SHI-LIANG WU 1, TING-ZHU HUANG and LIANG LI 1 School of Mathematics
More informationFast solvers for steady incompressible flow
ICFD 25 p.1/21 Fast solvers for steady incompressible flow Andy Wathen Oxford University wathen@comlab.ox.ac.uk http://web.comlab.ox.ac.uk/~wathen/ Joint work with: Howard Elman (University of Maryland,
More informationIncomplete LU Preconditioning and Error Compensation Strategies for Sparse Matrices
Incomplete LU Preconditioning and Error Compensation Strategies for Sparse Matrices Eun-Joo Lee Department of Computer Science, East Stroudsburg University of Pennsylvania, 327 Science and Technology Center,
More informationOn the Preconditioning of the Block Tridiagonal Linear System of Equations
On the Preconditioning of the Block Tridiagonal Linear System of Equations Davod Khojasteh Salkuyeh Department of Mathematics, University of Mohaghegh Ardabili, PO Box 179, Ardabil, Iran E-mail: khojaste@umaacir
More informationThe antitriangular factorisation of saddle point matrices
The antitriangular factorisation of saddle point matrices J. Pestana and A. J. Wathen August 29, 2013 Abstract Mastronardi and Van Dooren [this journal, 34 (2013) pp. 173 196] recently introduced the block
More informationc 2004 Society for Industrial and Applied Mathematics
SIAM J. MATRIX ANAL. APPL. Vol. 6, No., pp. 377 389 c 004 Society for Industrial and Applied Mathematics SPECTRAL PROPERTIES OF THE HERMITIAN AND SKEW-HERMITIAN SPLITTING PRECONDITIONER FOR SADDLE POINT
More informationA SPARSE APPROXIMATE INVERSE PRECONDITIONER FOR NONSYMMETRIC LINEAR SYSTEMS
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING, SERIES B Volume 5, Number 1-2, Pages 21 30 c 2014 Institute for Scientific Computing and Information A SPARSE APPROXIMATE INVERSE PRECONDITIONER
More information1. Introduction. We consider the solution of systems of linear equations with the following block 2 2 structure:
SIAM J. MATRIX ANAL. APPL. Vol. 26, No. 1, pp. 20 41 c 2004 Society for Industrial and Applied Mathematics A PRECONDITIONER FOR GENERALIZED SADDLE POINT PROBLEMS MICHELE BENZI AND GENE H. GOLUB Abstract.
More informationDelayed Over-Relaxation in Iterative Schemes to Solve Rank Deficient Linear System of (Matrix) Equations
Filomat 32:9 (2018), 3181 3198 https://doi.org/10.2298/fil1809181a Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Delayed Over-Relaxation
More informationA stable variant of Simpler GMRES and GCR
A stable variant of Simpler GMRES and GCR Miroslav Rozložník joint work with Pavel Jiránek and Martin H. Gutknecht Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic miro@cs.cas.cz,
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 13-10 Comparison of some preconditioners for the incompressible Navier-Stokes equations X. He and C. Vuik ISSN 1389-6520 Reports of the Delft Institute of Applied
More informationMathematics and Computer Science
Technical Report TR-2010-026 On Preconditioned MHSS Iteration Methods for Complex Symmetric Linear Systems by Zhong-Zhi Bai, Michele Benzi, Fang Chen Mathematics and Computer Science EMORY UNIVERSITY On
More information1. Introduction. In this paper we consider iterative methods for solving large, sparse, linear systems of equations of the form
SIAM J. MARIX ANAL. APPL. Vol. 39, No. 2, pp. 902 921 c 2018 Society for Industrial and Applied Mathematics IERAIVE MEHODS FOR DOULE SADDLE POIN SYSEMS FAEMEH PANJEH ALI EIK AND MIHELE ENZI Abstract. We
More informationSchur Complements on Hilbert Spaces and Saddle Point Systems
Schur Complements on Hilbert Spaces and Saddle Point Systems Constantin Bacuta Mathematical Sciences, University of Delaware, 5 Ewing Hall 976 Abstract For any continuous bilinear form defined on a pair
More information9.1 Preconditioned Krylov Subspace Methods
Chapter 9 PRECONDITIONING 9.1 Preconditioned Krylov Subspace Methods 9.2 Preconditioned Conjugate Gradient 9.3 Preconditioned Generalized Minimal Residual 9.4 Relaxation Method Preconditioners 9.5 Incomplete
More informationRegularized HSS iteration methods for saddle-point linear systems
BIT Numer Math DOI 10.1007/s10543-016-0636-7 Regularized HSS iteration methods for saddle-point linear systems Zhong-Zhi Bai 1 Michele Benzi 2 Received: 29 January 2016 / Accepted: 20 October 2016 Springer
More informationAMS Mathematics Subject Classification : 65F10,65F50. Key words and phrases: ILUS factorization, preconditioning, Schur complement, 1.
J. Appl. Math. & Computing Vol. 15(2004), No. 1, pp. 299-312 BILUS: A BLOCK VERSION OF ILUS FACTORIZATION DAVOD KHOJASTEH SALKUYEH AND FAEZEH TOUTOUNIAN Abstract. ILUS factorization has many desirable
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 36, pp. 39-53, 009-010. Copyright 009,. ISSN 1068-9613. ETNA P-REGULAR SPLITTING ITERATIVE METHODS FOR NON-HERMITIAN POSITIVE DEFINITE LINEAR SYSTEMS
More informationLinear algebra issues in Interior Point methods for bound-constrained least-squares problems
Linear algebra issues in Interior Point methods for bound-constrained least-squares problems Stefania Bellavia Dipartimento di Energetica S. Stecco Università degli Studi di Firenze Joint work with Jacek
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 18 Outline
More informationJae Heon Yun and Yu Du Han
Bull. Korean Math. Soc. 39 (2002), No. 3, pp. 495 509 MODIFIED INCOMPLETE CHOLESKY FACTORIZATION PRECONDITIONERS FOR A SYMMETRIC POSITIVE DEFINITE MATRIX Jae Heon Yun and Yu Du Han Abstract. We propose
More informationfor j = 1, 2,..., q. Consequently, we may define the norm of X = (X 1, X 2,..., X q ) as follows:
A CYCLIC IERAIVE APPROACH AND IS MODIIED VERSION O SOLVE COUPLED SYLVESER-RANSPOSE MARIX EQUAIONS atemeh Panjeh Ali Beik and Davod Khojasteh Salkuyeh, Department of Mathematics, Vali-e-Asr University of
More informationIFISS: A computational laboratory for investigating incompressible flow problems. Elman, Howard C. and Ramage, Alison and Silvester, David J.
IFISS: A computational laboratory for investigating incompressible flow problems Elman, Howard C. and Ramage, Alison and Silvester, David J. 22 MIMS EPrint: 22.8 Manchester Institute for Mathematical Sciences
More informationThe solution of the discretized incompressible Navier-Stokes equations with iterative methods
The solution of the discretized incompressible Navier-Stokes equations with iterative methods Report 93-54 C. Vuik Technische Universiteit Delft Delft University of Technology Faculteit der Technische
More informationA Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation
A Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation Tao Zhao 1, Feng-Nan Hwang 2 and Xiao-Chuan Cai 3 Abstract In this paper, we develop an overlapping domain decomposition
More informationPreconditioners for reduced saddle point systems arising in elliptic PDE-constrained optimization problems
Zeng et al. Journal of Inequalities and Applications 205 205:355 DOI 0.86/s3660-05-0879-x RESEARCH Open Access Preconditioners for reduced saddle point systems arising in elliptic PDE-constrained optimization
More informationBlock-Triangular and Skew-Hermitian Splitting Methods for Positive Definite Linear Systems
Block-Triangular and Skew-Hermitian Splitting Methods for Positive Definite Linear Systems Zhong-Zhi Bai State Key Laboratory of Scientific/Engineering Computing Institute of Computational Mathematics
More information20. A Dual-Primal FETI Method for solving Stokes/Navier-Stokes Equations
Fourteenth International Conference on Domain Decomposition Methods Editors: Ismael Herrera, David E. Keyes, Olof B. Widlund, Robert Yates c 23 DDM.org 2. A Dual-Primal FEI Method for solving Stokes/Navier-Stokes
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 16-02 The Induced Dimension Reduction method applied to convection-diffusion-reaction problems R. Astudillo and M. B. van Gijzen ISSN 1389-6520 Reports of the Delft
More informationNew multigrid smoothers for the Oseen problem
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. (2010) Published online in Wiley InterScience (www.interscience.wiley.com)..707 New multigrid smoothers for the Oseen problem Steven
More informationA generalization of the Gauss-Seidel iteration method for solving absolute value equations
A generalization of the Gauss-Seidel iteration method for solving absolute value equations Vahid Edalatpour, Davod Hezari and Davod Khojasteh Salkuyeh Faculty of Mathematical Sciences, University of Guilan,
More informationc 2011 Society for Industrial and Applied Mathematics
SIAM J. SCI. COMPUT. Vol. 33, No. 5, pp. 2761 2784 c 2011 Society for Industrial and Applied Mathematics ANALYSIS OF AUGMENTED LAGRANGIAN-BASED PRECONDITIONERS FOR THE STEADY INCOMPRESSIBLE NAVIER STOKES
More informationJURJEN DUINTJER TEBBENS
Proceedings of ALGORITMY 005 pp. 40 49 GMRES ACCELERATION ANALYSIS FOR A CONVECTION DIFFUSION MODEL PROBLEM JURJEN DUINTJER TEBBENS Abstract. When we apply the GMRES method [4] to linear systems arising
More informationNewton additive and multiplicative Schwarz iterative methods
IMA Journal of Numerical Analysis (2008) 28, 143 161 doi:10.1093/imanum/drm015 Advance Access publication on July 16, 2007 Newton additive and multiplicative Schwarz iterative methods JOSEP ARNAL, VIOLETA
More informationA new iterative method for solving a class of complex symmetric system of linear equations
A new iterative method for solving a class of complex symmetric system of linear equations Davod Hezari Davod Khojasteh Salkuyeh Vahid Edalatpour Received: date / Accepted: date Abstract We present a new
More informationThe flexible incomplete LU preconditioner for large nonsymmetric linear systems. Takatoshi Nakamura Takashi Nodera
Research Report KSTS/RR-15/006 The flexible incomplete LU preconditioner for large nonsymmetric linear systems by Takatoshi Nakamura Takashi Nodera Takatoshi Nakamura School of Fundamental Science and
More informationSome Preconditioning Techniques for Saddle Point Problems
Some Preconditioning Techniques for Saddle Point Problems Michele Benzi 1 and Andrew J. Wathen 2 1 Department of Mathematics and Computer Science, Emory University, Atlanta, Georgia 30322, USA. benzi@mathcs.emory.edu
More informationIterative Methods for Solving A x = b
Iterative Methods for Solving A x = b A good (free) online source for iterative methods for solving A x = b is given in the description of a set of iterative solvers called templates found at netlib: http
More informationSpectral Properties of Saddle Point Linear Systems and Relations to Iterative Solvers Part I: Spectral Properties. V. Simoncini
Spectral Properties of Saddle Point Linear Systems and Relations to Iterative Solvers Part I: Spectral Properties V. Simoncini Dipartimento di Matematica, Università di ologna valeria@dm.unibo.it 1 Outline
More informationApproximation algorithms for nonnegative polynomial optimization problems over unit spheres
Front. Math. China 2017, 12(6): 1409 1426 https://doi.org/10.1007/s11464-017-0644-1 Approximation algorithms for nonnegative polynomial optimization problems over unit spheres Xinzhen ZHANG 1, Guanglu
More informationWHEN studying distributed simulations of power systems,
1096 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL 21, NO 3, AUGUST 2006 A Jacobian-Free Newton-GMRES(m) Method with Adaptive Preconditioner and Its Application for Power Flow Calculations Ying Chen and Chen
More information7.4 The Saddle Point Stokes Problem
346 CHAPTER 7. APPLIED FOURIER ANALYSIS 7.4 The Saddle Point Stokes Problem So far the matrix C has been diagonal no trouble to invert. This section jumps to a fluid flow problem that is still linear (simpler
More informationFINDING RIGHTMOST EIGENVALUES OF LARGE SPARSE NONSYMMETRIC PARAMETERIZED EIGENVALUE PROBLEMS
FINDING RIGHTMOST EIGENVALUES OF LARGE SPARSE NONSYMMETRIC PARAMETERIZED EIGENVALUE PROBLEMS Department of Mathematics University of Maryland, College Park Advisor: Dr. Howard Elman Department of Computer
More informationLecture 18 Classical Iterative Methods
Lecture 18 Classical Iterative Methods MIT 18.335J / 6.337J Introduction to Numerical Methods Per-Olof Persson November 14, 2006 1 Iterative Methods for Linear Systems Direct methods for solving Ax = b,
More informationTermination criteria for inexact fixed point methods
Termination criteria for inexact fixed point methods Philipp Birken 1 October 1, 2013 1 Institute of Mathematics, University of Kassel, Heinrich-Plett-Str. 40, D-34132 Kassel, Germany Department of Mathematics/Computer
More informationThe Mixed Finite Element Multigrid Preconditioned Minimum Residual Method for Stokes Equations
The Mixed Finite Element Multigrid Preconditioned Minimum Residual Method for Stokes Equations K. Muzhinji, S. Shateyi, and S, S. Motsa 2 University of Venda, Department of Mathematics, P Bag X5050, Thohoyandou
More informationPreconditioning for Nonsymmetry and Time-dependence
Preconditioning for Nonsymmetry and Time-dependence Andy Wathen Oxford University, UK joint work with Jen Pestana and Elle McDonald Jeju, Korea, 2015 p.1/24 Iterative methods For self-adjoint problems/symmetric
More informationThe iterative methods for solving nonlinear matrix equation X + A X 1 A + B X 1 B = Q
Vaezzadeh et al. Advances in Difference Equations 2013, 2013:229 R E S E A R C H Open Access The iterative methods for solving nonlinear matrix equation X + A X A + B X B = Q Sarah Vaezzadeh 1, Seyyed
More informationPARTITION OF UNITY FOR THE STOKES PROBLEM ON NONMATCHING GRIDS
PARTITION OF UNITY FOR THE STOES PROBLEM ON NONMATCHING GRIDS CONSTANTIN BACUTA AND JINCHAO XU Abstract. We consider the Stokes Problem on a plane polygonal domain Ω R 2. We propose a finite element method
More informationJordan Journal of Mathematics and Statistics (JJMS) 5(3), 2012, pp A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS
Jordan Journal of Mathematics and Statistics JJMS) 53), 2012, pp.169-184 A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS ADEL H. AL-RABTAH Abstract. The Jacobi and Gauss-Seidel iterative
More informationResearch Article Convergence of a Generalized USOR Iterative Method for Augmented Systems
Mathematical Problems in Engineering Volume 2013, Article ID 326169, 6 pages http://dx.doi.org/10.1155/2013/326169 Research Article Convergence of a Generalized USOR Iterative Method for Augmented Systems
More informationIN this paper, we investigate spectral properties of block
On the Eigenvalues Distribution of Preconditioned Block wo-by-two Matrix Mu-Zheng Zhu and a-e Qi Abstract he spectral properties of a class of block matrix are studied, which arise in the numercial solutions
More informationAn advanced ILU preconditioner for the incompressible Navier-Stokes equations
An advanced ILU preconditioner for the incompressible Navier-Stokes equations M. ur Rehman C. Vuik A. Segal Delft Institute of Applied Mathematics, TU delft The Netherlands Computational Methods with Applications,
More informationON THE ROLE OF COMMUTATOR ARGUMENTS IN THE DEVELOPMENT OF PARAMETER-ROBUST PRECONDITIONERS FOR STOKES CONTROL PROBLEMS
ON THE ROLE OF COUTATOR ARGUENTS IN THE DEVELOPENT OF PARAETER-ROBUST PRECONDITIONERS FOR STOKES CONTROL PROBLES JOHN W. PEARSON Abstract. The development of preconditioners for PDE-constrained optimization
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)
AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences) Lecture 19: Computing the SVD; Sparse Linear Systems Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical
More informationAN AUGMENTED LAGRANGIAN APPROACH TO LINEARIZED PROBLEMS IN HYDRODYNAMIC STABILITY
AN AUGMENTED LAGRANGIAN APPROACH TO LINEARIZED PROBLEMS IN HYDRODYNAMIC STABILITY MAXIM A. OLSHANSKII AND MICHELE BENZI Abstract. The solution of linear systems arising from the linear stability analysis
More informationMINIMUM NORM LEAST-SQUARES SOLUTION TO GENERAL COMPLEX COUPLED LINEAR MATRIX EQUATIONS VIA ITERATION
MINIMUM NORM LEAST-SQUARES SOLUTION TO GENERAL COMPLEX COUPLED LINEAR MATRIX EQUATIONS VIA ITERATION Davod Khojasteh Salkuyeh and Fatemeh Panjeh Ali Beik Faculty of Mathematical Sciences University of
More informationPRECONDITIONING TECHNIQUES FOR NEWTON S METHOD FOR THE INCOMPRESSIBLE NAVIER STOKES EQUATIONS
BIT Numerical Mathematics 43: 961 974, 2003. 2003 Kluwer Academic Publishers. Printed in the Netherlands. 961 PRECONDITIONING TECHNIQUES FOR NEWTON S METHOD FOR THE INCOMPRESSIBLE NAVIER STOKES EQUATIONS
More informationChap 3. Linear Algebra
Chap 3. Linear Algebra Outlines 1. Introduction 2. Basis, Representation, and Orthonormalization 3. Linear Algebraic Equations 4. Similarity Transformation 5. Diagonal Form and Jordan Form 6. Functions
More informationIndefinite Preconditioners for PDE-constrained optimization problems. V. Simoncini
Indefinite Preconditioners for PDE-constrained optimization problems V. Simoncini Dipartimento di Matematica, Università di Bologna, Italy valeria.simoncini@unibo.it Partly joint work with Debora Sesana,
More informationA Newton two-stage waveform relaxation method for solving systems of nonlinear algebraic equations
MATHEMATICAL COMMUNICATIONS Math. Commun. 2(25), 5 A Newton two-stage waveform relaxation method for solving systems of nonlinear algebraic equations Davod Khojasteh Salkuyeh, and Zeinab Hassanzadeh Faculty
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationUsing Python to Solve the Navier-Stokes Equations - Applications in the Preconditioned Iterative Methods
Journal of Scientific Research & Reports 7(3): 207-217 2015 Article no.jsrr.2015.202 ISSN: 2320-0227 SCIENCEDOMAIN international www.sciencedomain.org Using Python to Solve the Navier-Stokes Equations
More informationarxiv: v1 [math.ra] 11 Aug 2014
Double B-tensors and quasi-double B-tensors Chaoqian Li, Yaotang Li arxiv:1408.2299v1 [math.ra] 11 Aug 2014 a School of Mathematics and Statistics, Yunnan University, Kunming, Yunnan, P. R. China 650091
More informationPreconditioning the incompressible Navier-Stokes equations with variable viscosity
Preconditioning the incompressible Navier-Stokes equations with variable viscosity Xin He and Maya Neytcheva Abstract This paper deals with preconditioners for the iterative solution of the discrete Oseen
More informationConvergence of Inner-Iteration GMRES Methods for Least Squares Problems
ISSN 1346-5597 NII Technical Report Convergence of Inner-Iteration GMRES Methods for Least Squares Problems Keiichi Moriuni and Ken Hayami NII-212-5E Aug. 212 CONVERGENCE OF INNER-ITERATION GMRES METHODS
More informationCONVERGENCE BOUNDS FOR PRECONDITIONED GMRES USING ELEMENT-BY-ELEMENT ESTIMATES OF THE FIELD OF VALUES
European Conference on Computational Fluid Dynamics ECCOMAS CFD 2006 P. Wesseling, E. Oñate and J. Périaux (Eds) c TU Delft, The Netherlands, 2006 CONVERGENCE BOUNDS FOR PRECONDITIONED GMRES USING ELEMENT-BY-ELEMENT
More informationSolving the Stochastic Steady-State Diffusion Problem Using Multigrid
Solving the Stochastic Steady-State Diffusion Problem Using Multigrid Tengfei Su Applied Mathematics and Scientific Computing Advisor: Howard Elman Department of Computer Science Sept. 29, 2015 Tengfei
More informationEfficient iterative algorithms for linear stability analysis of incompressible flows
IMA Journal of Numerical Analysis Advance Access published February 27, 215 IMA Journal of Numerical Analysis (215) Page 1 of 21 doi:1.193/imanum/drv3 Efficient iterative algorithms for linear stability
More informationA mixed finite element approximation of the Stokes equations with the boundary condition of type (D+N)
wwwijmercom Vol2, Issue1, Jan-Feb 2012 pp-464-472 ISSN: 2249-6645 A mixed finite element approximation of the Stokes equations with the boundary condition of type (D+N) Jaouad El-Mekkaoui 1, Abdeslam Elakkad
More information