# SOLVING MESH EIGENPROBLEMS WITH MULTIGRID EFFICIENCY

Size: px
Start display at page:

## Transcription

1 SOLVING MESH EIGENPROBLEMS WITH MULTIGRID EFFICIENCY KLAUS NEYMEYR ABSTRACT. Multigrid techniques can successfully be applied to mesh eigenvalue problems for elliptic differential operators. They allow to compute a few of the smallest eigenvalues and the eigenfunctions within optimal or quasi-optimal computational complexity. A review is given on three multigrid solvers for elliptic eigenproblems. Numerical results are presented for a simple model problem. 1. INTRODUCTION Consider the eigenvalue problem for an elliptic partial differential operator. Numerical approximations of its eigenvalues and eigenfunctions can be gained by a finite element discretization of the variational problem associated with the differential operator. The discretization results in a generalized matrix eigenvalue problem of the form (1.1) Ax = λmx. The discretization matrix A and the mass matrix M are sparse with only a small number of nonzero elements per row. In typical applications, the dimension of these matrices may exceed and, at the same time, only a few of the smallest eigenvalues (in modulus) together with the eigenvectors are to be determined. These smallest eigenvalues characterize, for example, the base frequencies of a vibrating mechanical structure modeled by an eigenvalue problem for an elliptic partial differential operator. Most of the classical methods of numerical linear algebra for solving a generalized matrix eigenvalue problem cannot be applied to (1.1) because typically, the computer storage for a full representation of A and M or any factorization of these matrices is not available. The QR method, the Rayleigh quotient iteration or inverse iteration, for example, would all demand to generate matrix factorizations and to store the more dense matrix factors. In any case, none of these iterations would allow to determine an eigenpair within O(n) floating point operations for A and M being n n matrices. In contrast to this, boundary value problems for the same elliptic partial differential operators can be solved with optimal complexity or quasi-optimal computational complexity (i.e. O(n) or O(n log n)) by means of multigrid or domain decomposition methods. The aim of this paper is to rivet on eigensolvers for elliptic eigenvalue problems with multigrid efficiency, i.e. with optimal or quasi-optimal complexity. In Section 2 we first point out common elements of eigensolvers for mesh eigenvalue problems and then we briefly review and classify the following eigensolvers: (I) The Rayleigh quotient multigrid minimization, [4, 5, 16], (II) Direct multigrid eigensolvers, [3, 7, 8, 10], (III) Eigensolvers using multigrid as a linear solver, [14, 19]. Finally, Section 3 contains numerical results for the Laplacian in 2D. 1

2 2 KLAUS NEYMEYR 2. MULTIGRID EIGENSOLVERS In order to give a concise description of multigrid eigensolvers we first separate those parts which are common to any such iteration: (1) Subspace extension: Any eigensolver for computing only a single eigenvalue/eigenvector pair (typically the smallest eigenvalue), can simply be extended to a subspace iteration in order to determine a modest number of the smallest eigenvalues and eigenvectors. One can implement a subspace eigensolver by applying a given vector iteration to each of the Ritz vectors spanning an actual approximating subspace. Subsequent application of the Rayleigh-Ritz procedure serves to compute the new Ritz values and Ritz vectors. Alternatively, subspace computations can be realized by using the less stable deflation technique. (2) Nested iteration and adaptivity: The concepts of nested iteration and adaptivity, which are well known from boundary value problem solvers, can be transferred to the eigenvalue problem. Then nested iteration starts with the solution of a coarse grid eigenproblem. The following steps are successive prolongations of the actual eigenvector approximations to refined grids in combination with sufficiently many iterations of the eigensolver on each grid level. Nested iteration can be combined with the concept of adaptivity. By means of adaptively generated grids, numerical approximation of eigenvalues and eigenvectors within a prescribed tolerance can often be gained with only a small portion of the work necessary if uniform grid refinement is employed. An adaptive algorithm requires appropriate error estimators for the iteration error and for the discretization error. The first estimator is used to define a stopping criterion for the iterative eigensolver on the actual grid whereas the second estimator controls the mesh refinement. Realizations of such estimators are, for example, suggested in [5, 11, 20]. Let us turn to the multigrid eigensolvers I III, whose discussion because of (1) can be restricted to a single-vector iteration. I. Rayleigh quotient multigrid minimization (RQMG): We consider the eigenvalue problem for a self-adjoint elliptic partial differential operator. Then the discrete eigenproblem (1.1) can be treated as an optimization problem for the Rayleigh quotient (2.1) λ(x) = (x, Ax) (x, Mx). By the Courant-Fischer principle the minimum of (2.1) equals the smallest eigenvalue of (A, M) and is taken in the corresponding eigenvector. Hence iterative minimization of (2.1) can serve as an eigensolver. This minimization can be realized by means of a multigrid procedure. One applies a coordinate relaxation scheme, i.e. for each coordinate direction d k i (which is associated with the i-th finite element function on a certain grid level k) one computes the minimum (2.2) λ(x + ϑ d k (x + ϑd k i i ) = min, A(x + ϑdk i )) ϑ R (x + ϑd k i, M(x + ϑdk i )), which is at the same time the smallest Ritz value of (A, M) in the 2D space span{x, d k i }. The new iterate is x+ϑ d k i. A multigrid cycle of RQMG consists in a successive minimization of λ(x) for all finite element functions on all grid levels [4, 16, 18]. Grid independent convergence estimates for RQMG have been presented in [18]. For a generalization of RQMG to non-selfadjoint elliptic operators see [5].

3 SOLVING MESH EIGENPROBLEMS WITH MULTIGRID EFFICIENCY 3 II. Direct multigrid eigensolvers: Direct multigrid eigensolvers and the third class of eigensolvers (see III) are related to approximate variants of classical iterative eigensolvers, namely inverse iteration and the Rayleigh quotient iteration [23]. Inverse iteration applied to (1.1) generates a sequence of iterates x (k) by solving the linear systems (2.3) (A σm)x (k+1) = Mx (k), k = 0, 1, 2,..., where σ denotes an eigenvalue approximation. In practice, the iterates are normalized after each step. The main hurdle emerging from (2.3) is that if σ is near to an eigenvalue, then A σm is almost singular, cf. [17]. For instance, for the Rayleigh quotient iteration it holds σ = λ(x (k) ). Solving such equations with multigrid methods is a hard task [21, 25, 26]. To overcome this difficulty, one can either bound away σ from the eigenvalues of (A, M), see [1]. Alternatively, one can solve (instead of (2.3)) a non-singular coarse grid correction equation within the orthogonal complement of the actual eigenvector approximation. The latter approach provides the basis for the direct multigrid eigensolver introduced in [7, 8]. In order to realize such a coarse grid projection on the orthogonal complement, the algorithm is closely related to nested iteration which serves to provide sufficiently accurate eigenfunctions for building reliable coarse grid projections. The resulting two-grid method maps a given iterate x having the Rayleigh quotient λ(x) to the new eigenvector approximations x. It is given by (2.4) x = Sx, (Smoothing step), d c = R(A λ(x)m) x, (Coarse grid projection of the residual), d c = Q c d c, (M-orthogonal projection), v c = (A c λ(x)m c ) 1 d c, (Solution of correction equation), x = x P Q c v c, (Prolongation and correction). Therein, the index c denotes coarse grid quantities. R is a restriction operator, P is a prolongation and Q c is the orthogonal projection operator to the M-orthogonal complement of the actual eigenvector approximation. The coarse grid problem (2.4) in the orthogonal complement is quite different from (2.3) and can be solved by a multigrid scheme for singular equations [8]. III. Eigensolvers using multigrid as a linear solver: Let us consider an alternative way of solving (2.3) without getting into trouble due to singularity of A σm. We can do this by ignoring the shift parameter, i.e. σ = 0. Additionally, we assume an eigenproblem for a coercive and self-adjoint partial differential operator so that A and M are symmetric positive definite matrices. Now we apply multigrid preconditioning for A in order to determine an approximate solution of the linear system (2.5) Ax (k+1) = λ(x (k) )Mx (k), k = 0, 1, 2,.... In comparison to (2.3), we have introduced the scaling constant λ(x (k) ) on the right hand side of (2.5) in order to achieve its stationarity in eigenvectors. Such a scaling prepares the approximate solution of (2.5) by means of preconditioning. The multigrid preconditioner B 1 is an approximate inverse of A which is assumed to be a symmetric positive definite operator and which is characterized by a spectral equivalence γ 0 (x, Bx) (x, Ax) γ 1 (x, Bx), x R n,

4 4 KLAUS NEYMEYR for positive constants γ 0 and γ 1. It is often more convenient to assume a properly scaled preconditioner in such a way that (2.6) I B 1 A A γ, for a constant γ [0, 1); therein A denotes the operator norm induced by A. This assumption is typical of multigrid and domain decomposition preconditioners. The best preconditioners satisfy (2.6) with γ bounded away from 1 independently of the mesh size and hence the number of unknowns [2]. The approximate solution of (2.5) for x = x (k) and by using B 1 as a preconditioner yields a new iterate x approximating x (k+1) (2.7) x = x B 1 (Ax λ(x)mx). The iteration (2.7) can be considered as the most simple eigensolver embodying the idea of multigrid as a linear solver. It can be interpreted as a (multigrid) preconditioned variant of inverse iteration (PINVIT) [19]. In principle, its behavior can be understood by the associated error propagation equation (2.8) x λ(x)a 1 Mx = (I B 1 A)(x λ(x)a 1 Mx), which maps the error of the initial iterate x λ(x)a 1 Mx to the error of the new iterate x λ(x)a 1 Mx by premultiplying the error propagation matrix I B 1 A. We can also derive from (2.8) that x λ(x)a 1 Mx r A 1 B 1, which shows the Lipschitz continuity in A 1 of the mapping from the set of admissible preconditioners, as characterized by (2.6), to the set of possible new iterates. The Lipschitz constant r equals the norm of the residual vector Ax λ(x)mx. Keeping these interpretations in mind, it is not surprising that the convergence estimates for (2.7) are closely related to inverse iteration. Sharp convergence estimates in terms of the Rayleigh quotients of the iterates are available. If the Rayleigh quotient λ(x) is located between the smallest eigenvalue λ 1 and the next larger eigenvalue λ 2 then it holds (2.9) λ(x ) λ 1 λ 2 λ(x ) ( γ + (1 γ) λ 1 λ 2 ) 2 λ(x) λ 1 λ 2 λ(x), see [14, 19]. This estimate can be applied recursively and guarantees linear convergence of the eigenvalue approximations λ(x (k) ) to the eigenvalue λ 1. The case γ = 0 corresponding to an exact solution of (2.5) leads to the convergence factor (λ 1 /λ 2 ) 2 of inverse iteration. For the other extreme case of poorest preconditioning, i.e. γ 1, the convergence factor tends to 1. We have assumed in (2.7) a symmetric positive definite preconditioner B 1. But there is no consent in the literature whether positive definite or indefinite preconditioners lead to more efficient eigensolvers, cf. [12]. This has also opened the question of how accurately (2.5) is to be solved in order to achieve reasonable convergence estimates [6, 15, 22, 24]. In any way the cubic convergence of the Rayleigh quotient iteration cannot be transferred to the preconditioned multigrid case. A significant acceleration of (2.7) can be achieved by minimizing the Rayleigh quotient with respect to a certain search subspace. The idea of the Locally Optimal Block Preconditioned Conjugate Gradient method (LOBPCG, [13]) is to determine the new eigenvalue/vector approximation as the smallest Ritz value/vector with respect to the threedimensional space (2.10) span{x, B 1 (Ax λ(x)mx), x },

5 SOLVING MESH EIGENPROBLEMS WITH MULTIGRID EFFICIENCY 5 where x denotes the iterate preceding x. To implement the latter iteration only one additional vector (compared to (2.7)) is to be stored (i.e. the old iterate) and few additional inner products are to be computed to determine the Rayleigh-Ritz projections. It has been observed that these additional costs are more than compensated by a characteristic speedup of convergence. Practically, the LOBPCG scheme behaves like a preconditioned conjugate gradient iteration for boundary value problems [13]. 3. NUMERICAL EXPERIMENTS All numerical experiments covered in this section treat the eigenproblem for the Laplacian on [0, 1] 2 with homogeneous Dirichlet boundary conditions as a simple model problem. See [5, 20] for adaptive multigrid eigensolvers on non-convex domains and with discontinuous coefficient functions. The eigenproblem is discretized by using linear finite elements on uniform triangle meshes with mesh sizes h l = 2 l. The initial grid consists of 9 interior nodes for l = 2. Computations are presented up to l = 12 corresponding to a grid with interior nodes. Table 1 lists the convergence history of RQMG, PINVIT and LOBPCG for the smallest eigenvalue and the corresponding residuals for l = 6 (3969 inner nodes). We use a unigrid version of RQMG, which is easy to code but which is computationally expensive, see [16] for the details. The coordinate relaxation scheme is applied to a black-white ordering of the finite element functions. The preconditioned eigensolvers are equipped with a multigrid V (2, 2)-cycle preconditioner working on the sequence of grids for l = 2,..., 6. Pre- and postsmooting is done by each 2 steps of the weighted Jacobi method. For all computations the initial function in each node (x 1, x 2 ) is given by x x 2 2. Table 1 contains the eigenvalue approximations, i.e. the Rayleigh quotients of the iterates, and the corresponding Euclidean norms of the residuals Ax λ(x)mx with x M = 1. RQMG and LOBPCG converge within 5 iterations to a six-digit accuracy, whereas more than 10 iterations of PINVIT are required to reach the same accuracy. All these iterations are guaranteed to generate a sequence of monotone decreasing Rayleigh quotients. Rayleigh quotients λ(x (k) ) Residuals Ax (k) λ(x (k) )Mx (k) k RQMG PINVIT LOBPCG RQMG PINVIT LOBPCG TABLE 1. RQMG, PINVIT and LOBPCG convergence history for l = 6. Mesh independence of the convergence of (2.7) is illustrated by Table 2. On each grid with h = 1/2 l, l = 4,..., 12, the iteration is started with the restriction of x x 2 2 to the nodes. Then 25 iterations of (2.7) with V (2, 2)-Jacobi preconditioning have been applied resulting in a final iterate x h. The final eigenvalue approximations λ(x h ) are listed in Table 2. They reflect that λ(x h ) λ 1 = O(h 2 ), whereas λ 1 denotes the smallest eigenvalue of the continuous problem. Moreover, the norms of the residuals (defined as above) are shown, too. Note that the M 1 norm of the residual is an upper estimate for the error of the eigenvalue approximations. As the condition number of M is bounded independently of h, the last column of Table 2 indicates the mesh independent convergence, since the final

6 6 KLAUS NEYMEYR Level l Grid Inner nodes λ(x h ) Ax h λ(x h )Mx h TABLE 2. Eigenvalues and residuals after 25 iterations of (2.7) for h l = 2 l, l = 4,..., 12. residuals do not deteriorate as the mesh size gets smaller. Let us finally mention that it is a nontrivial task to give a fair comparison (in terms of total computational costs and efficiency) of the direct multigrid eigensolver [7, 8] with those eigensolvers discussed above. This is the case since the direct multigrid scheme is inseparably connected with nested iteration in order to generate the required projection operators. Therefore, we only refer to [9], where the direct multigrid eigensolver is applied to the biharmonic plate equation. 4. SUMMARY A review has been given on three quite different multigrid techniques for solving the eigenvalue problem for a (coercive and self-adjoint) elliptic partial differential operator. Each of these solvers achieves optimal or quasi-optimal complexity for the partial eigenproblem, i.e. to compute only a small number of eigenpairs. These multigrid eigensolvers can be considered as the eigenproblem-counterparts of the celebrated, highly efficient multigrid solvers for boundary value problems. Eigensolvers using multigrid as a linear solver are conceptually very simple, and recent results allow a new theoretical understanding. They can be implemented easily: For the multigrid part one can adopt any existing program code realizing multigrid preconditioning. The remaining task is only to implement the linear algebra of (2.7) or (2.10). REFERENCES [1] R.E. Bank. Analysis of a multilevel inverse iteration procedure for eigenvalue problems. SIAM J. Numer. Anal., 19: , [2] J.H. Bramble, J.E. Pasciak, and J. Xu. Parallel multilevel preconditioners. Math. Comp., 55(191):1 22, [3] A. Brandt, S. McCormick, and J. Ruge. Multigrid methods for differential eigenproblems. SIAM J. Sci. Statist. Comput., 4(2): , [4] Z. Cai, J. Mandel, and S. McCormick. Multigrid methods for nearly singular linear equations and eigenvalue problems. SIAM J. Numer. Anal., 34: , [5] T. Friese, P. Deuflhard, and F. Schmidt. A multigrid method for the complex Helmholtz eigenvalue problem. In Eleventh International Conference on Domain Decomposition Methods (London, 1998), pages (electronic). DDM.org, Augsburg, [6] G.H. Golub and Q. Ye. Inexact inverse iteration for generalized eigenvalue problems. BIT, 40(4): , [7] W. Hackbusch. On the computation of approximate eigenvalues and eigenfunctions of elliptic operators by means of a multi-grid method. SIAM J. Numer. Anal., 16: , 1979.

7 SOLVING MESH EIGENPROBLEMS WITH MULTIGRID EFFICIENCY 7 [8] W. Hackbusch. Multi-grid methods and applications. Springer series in computational mathematics 4. Springer, Berlin, [9] W. Hackbusch and G. Hofmann. Results of the eigenvalue problem for the plate equation. Z. Angew. Math. Phys., 31(6): , [10] V. Heuveline and C. Bertsch. On multigrid methods for the eigenvalue computation of nonselfadjoint elliptic operators. East-West J. Numer. Math., 8(4): , [11] V. Heuveline and R. Rannacher. A posteriori error control for finite element approximations of elliptic eigenvalue problems. Adv. Comput. Math., 15(1-4): , [12] A.V. Knyazev. Preconditioned eigensolvers an oxymoron? Electron. Trans. Numer. Anal., 7: , [13] A.V. Knyazev. Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method. SIAM J. Sci. Comp., 23: , [14] A.V. Knyazev and K. Neymeyr. A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems. Accepted for Linear Algebra Appl., [15] Y. Lai, K. Lin, and W. Lin. An inexact inverse iteration for large sparse eigenvalue problems. Numer. Linear Algebra Appl., 4: , [16] J. Mandel and S.F. McCormick. A multilevel variational method for Au = λbu on composite grids. J. Comput. Phys., 80: , [17] S.F. McCormick. A mesh refinement method for Ax = λbx. Math. Comp., 36(154): , [18] S.F. McCormick. Multilevel adaptive methods for elliptic eigenproblems: a two-level convergence theory. SIAM J. Numer. Anal., 31: , [19] K. Neymeyr. A geometric theory for preconditioned inverse iteration. I: Extrema of the Rayleigh quotient. Linear Algebra Appl., 322:61 85, [20] K. Neymeyr. A posteriori error estimation for elliptic eigenproblems. Numer. Linear Algebra Appl., 9: , [21] M.G. Neytcheva and P.S. Vassilevski. Preconditioning of indefinite and almost singular finite element elliptic equations. SIAM J. Sci. Comput., 19(5): , [22] Y. Notay. Convergence analysis of inexact Rayleigh quotient iterations. Technical report, Service de Métrologie Nucléaire, Université Libre de Bruxelles, [23] B.N. Parlett. The symmetric eigenvalue problem. Prentice Hall, Englewood Cliffs New Jersey, [24] P. Smit and M. Paardekooper. The effects of inexact solvers in algorithms for symmetric eigenvalue problems. Linear Algebra Appl., 287: , [25] J. Xu. A new class of iterative methods for nonselfadjoint or indefinite problems. SIAM J. Numer. Anal., 29: , [26] H. Yserentant. Preconditioning indefinite discretization matrices. Numer. Math., 54(6): , MATHEMATISCHES INSTITUT DER UNIVERSITÄT TÜBINGEN, AUF DER MORGENSTELLE 10, TÜBINGEN, GERMANY. address:

### A Note on Inverse Iteration

A Note on Inverse Iteration Klaus Neymeyr Universität Rostock, Fachbereich Mathematik, Universitätsplatz 1, 18051 Rostock, Germany; SUMMARY Inverse iteration, if applied to a symmetric positive definite

### A GEOMETRIC THEORY FOR PRECONDITIONED INVERSE ITERATION I: EXTREMA OF THE RAYLEIGH QUOTIENT

A GEOMETRIC THEORY FOR PRECONDITIONED INVERSE ITERATION I: EXTREMA OF THE RAYLEIGH QUOTIENT KLAUS NEYMEYR ABSTRACT. The discretization of eigenvalue problems for partial differential operators is a major

### A GEOMETRIC THEORY FOR PRECONDITIONED INVERSE ITERATION APPLIED TO A SUBSPACE

A GEOMETRIC THEORY FOR PRECONDITIONED INVERSE ITERATION APPLIED TO A SUBSPACE KLAUS NEYMEYR ABSTRACT. The aim of this paper is to provide a convergence analysis for a preconditioned subspace iteration,

### Preconditioned Locally Minimal Residual Method for Computing Interior Eigenpairs of Symmetric Operators

Preconditioned Locally Minimal Residual Method for Computing Interior Eigenpairs of Symmetric Operators Eugene Vecharynski 1 Andrew Knyazev 2 1 Department of Computer Science and Engineering University

### A geometric theory for preconditioned inverse iteration II: Convergence estimates

Linear Algebra and its Applications 322 (2001) 87 104 www.elsevier.com/locate/laa A geometric theory for preconditioned inverse iteration II: Convergence estimates Klaus Neymeyr Mathematisches Institut,

### ETNA Kent State University

Electronic Transactions on Numerical Analysis. Volume 15, pp. 38-55, 2003. Copyright 2003,. ISSN 1068-9613. ETNA EFFICIENT SOLUTION OF SYMMETRIC EIGENVALUE PROBLEMS USING MULTIGRID PRECONDITIONERS IN THE

### A Hierarchy of Preconditioned Eigensolvers for Elliptic Differential Operators

A Hierarchy of Preconditioned Eigensolvers for Elliptic Differential Operators Habilitationsschrift von Dr. Klaus Neymeyr Mathematische Fakultät Universität Tübingen September 2001 V02/02WWW CONTENTS

### Max Planck Institute Magdeburg Preprints

Thomas Mach Computing Inner Eigenvalues of Matrices in Tensor Train Matrix Format MAX PLANCK INSTITUT FÜR DYNAMIK KOMPLEXER TECHNISCHER SYSTEME MAGDEBURG Max Planck Institute Magdeburg Preprints MPIMD/11-09

### c 2006 Society for Industrial and Applied Mathematics

SIAM J. MATRIX ANAL. APPL. Vol. 28, No. 4, pp. 1069 1082 c 2006 Society for Industrial and Applied Mathematics INEXACT INVERSE ITERATION WITH VARIABLE SHIFT FOR NONSYMMETRIC GENERALIZED EIGENVALUE PROBLEMS

### c 2009 Society for Industrial and Applied Mathematics

SIAM J. MATRIX ANAL. APPL. Vol.??, No.?, pp.?????? c 2009 Society for Industrial and Applied Mathematics GRADIENT FLOW APPROACH TO GEOMETRIC CONVERGENCE ANALYSIS OF PRECONDITIONED EIGENSOLVERS ANDREW V.

### 1. Introduction. In this paper we consider the large and sparse eigenvalue problem. Ax = λx (1.1) T (λ)x = 0 (1.2)

A NEW JUSTIFICATION OF THE JACOBI DAVIDSON METHOD FOR LARGE EIGENPROBLEMS HEINRICH VOSS Abstract. The Jacobi Davidson method is known to converge at least quadratically if the correction equation is solved

### Is there life after the Lanczos method? What is LOBPCG?

1 Is there life after the Lanczos method? What is LOBPCG? Andrew V. Knyazev Department of Mathematics and Center for Computational Mathematics University of Colorado at Denver SIAM ALA Meeting, July 17,

### EIGIFP: A MATLAB Program for Solving Large Symmetric Generalized Eigenvalue Problems

EIGIFP: A MATLAB Program for Solving Large Symmetric Generalized Eigenvalue Problems JAMES H. MONEY and QIANG YE UNIVERSITY OF KENTUCKY eigifp is a MATLAB program for computing a few extreme eigenvalues

### An Algebraic Multigrid Method for Eigenvalue Problems

An Algebraic Multigrid Method for Eigenvalue Problems arxiv:1503.08462v1 [math.na] 29 Mar 2015 Xiaole Han, Yunhui He, Hehu Xie and Chunguang You Abstract An algebraic multigrid method is proposed to solve

### Incomplete Cholesky preconditioners that exploit the low-rank property

anapov@ulb.ac.be ; http://homepages.ulb.ac.be/ anapov/ 1 / 35 Incomplete Cholesky preconditioners that exploit the low-rank property (theory and practice) Artem Napov Service de Métrologie Nucléaire, Université

### MULTIGRID METHODS FOR NEARLY SINGULAR LINEAR EQUATIONS AND EIGENVALUE PROBLEMS

SIAM J. NUMER. ANAL. c 997 Society for Industrial and Applied Mathematics Vol. 34, No., pp. 78 200, February 997 008 MULTIGRID METHODS FOR NEARLY SINGULAR LINEAR EQUATIONS AND EIGENVALUE PROBLEMS ZHIQIANG

### Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method

Andrew Knyazev Department of Mathematics University of Colorado at Denver P.O. Box 173364, Campus Box 170 Denver, CO 80217-3364 Time requested: 45 Andrew.Knyazev@cudenver.edu http://www-math.cudenver.edu/~aknyazev/

### Using the Karush-Kuhn-Tucker Conditions to Analyze the Convergence Rate of Preconditioned Eigenvalue Solvers

Using the Karush-Kuhn-Tucker Conditions to Analyze the Convergence Rate of Preconditioned Eigenvalue Solvers Merico Argentati University of Colorado Denver Joint work with Andrew V. Knyazev, Klaus Neymeyr

### Multigrid and Domain Decomposition Methods for Electrostatics Problems

Multigrid and Domain Decomposition Methods for Electrostatics Problems Michael Holst and Faisal Saied Abstract. We consider multigrid and domain decomposition methods for the numerical solution of electrostatics

### A MULTIGRID ALGORITHM FOR. Richard E. Ewing and Jian Shen. Institute for Scientic Computation. Texas A&M University. College Station, Texas SUMMARY

A MULTIGRID ALGORITHM FOR THE CELL-CENTERED FINITE DIFFERENCE SCHEME Richard E. Ewing and Jian Shen Institute for Scientic Computation Texas A&M University College Station, Texas SUMMARY In this article,

### A SHORT NOTE COMPARING MULTIGRID AND DOMAIN DECOMPOSITION FOR PROTEIN MODELING EQUATIONS

A SHORT NOTE COMPARING MULTIGRID AND DOMAIN DECOMPOSITION FOR PROTEIN MODELING EQUATIONS MICHAEL HOLST AND FAISAL SAIED Abstract. We consider multigrid and domain decomposition methods for the numerical

### Arnoldi Methods in SLEPc

Scalable Library for Eigenvalue Problem Computations SLEPc Technical Report STR-4 Available at http://slepc.upv.es Arnoldi Methods in SLEPc V. Hernández J. E. Román A. Tomás V. Vidal Last update: October,

### INTERGRID OPERATORS FOR THE CELL CENTERED FINITE DIFFERENCE MULTIGRID ALGORITHM ON RECTANGULAR GRIDS. 1. Introduction

Trends in Mathematics Information Center for Mathematical Sciences Volume 9 Number 2 December 2006 Pages 0 INTERGRID OPERATORS FOR THE CELL CENTERED FINITE DIFFERENCE MULTIGRID ALGORITHM ON RECTANGULAR

The Conjugate Gradient Method Classical Iterations We have a problem, We assume that the matrix comes from a discretization of a PDE. The best and most popular model problem is, The matrix will be as large

### A 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

### Recent advances in approximation using Krylov subspaces. V. Simoncini. Dipartimento di Matematica, Università di Bologna.

Recent advances in approximation using Krylov subspaces V. Simoncini Dipartimento di Matematica, Università di Bologna and CIRSA, Ravenna, Italy valeria@dm.unibo.it 1 The framework It is given an operator

### Solving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners

Solving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners Eugene Vecharynski 1 Andrew Knyazev 2 1 Department of Computer Science and Engineering University of Minnesota 2 Department

### Numerical Methods in Matrix Computations

Ake Bjorck Numerical Methods in Matrix Computations Springer Contents 1 Direct Methods for Linear Systems 1 1.1 Elements of Matrix Theory 1 1.1.1 Matrix Algebra 2 1.1.2 Vector Spaces 6 1.1.3 Submatrices

### Spectral element agglomerate AMGe

Spectral element agglomerate AMGe T. Chartier 1, R. Falgout 2, V. E. Henson 2, J. E. Jones 4, T. A. Manteuffel 3, S. F. McCormick 3, J. W. Ruge 3, and P. S. Vassilevski 2 1 Department of Mathematics, Davidson

### The Nullspace free eigenvalue problem and the inexact Shift and invert Lanczos method. V. Simoncini. Dipartimento di Matematica, Università di Bologna

The Nullspace free eigenvalue problem and the inexact Shift and invert Lanczos method V. Simoncini Dipartimento di Matematica, Università di Bologna and CIRSA, Ravenna, Italy valeria@dm.unibo.it 1 The

### Multigrid absolute value preconditioning

Multigrid absolute value preconditioning Eugene Vecharynski 1 Andrew Knyazev 2 (speaker) 1 Department of Computer Science and Engineering University of Minnesota 2 Department of Mathematical and Statistical

### STEEPEST DESCENT AND CONJUGATE GRADIENT METHODS WITH VARIABLE PRECONDITIONING

SIAM J. MATRIX ANAL. APPL. Vol.?, No.?, pp.?? c 2007 Society for Industrial and Applied Mathematics STEEPEST DESCENT AND CONJUGATE GRADIENT METHODS WITH VARIABLE PRECONDITIONING ANDREW V. KNYAZEV AND ILYA

### Domain decomposition on different levels of the Jacobi-Davidson method

hapter 5 Domain decomposition on different levels of the Jacobi-Davidson method Abstract Most computational work of Jacobi-Davidson [46], an iterative method suitable for computing solutions of large dimensional

### Local Mesh Refinement with the PCD Method

Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 8, Number 1, pp. 125 136 (2013) http://campus.mst.edu/adsa Local Mesh Refinement with the PCD Method Ahmed Tahiri Université Med Premier

### Comparison of V-cycle Multigrid Method for Cell-centered Finite Difference on Triangular Meshes

Comparison of V-cycle Multigrid Method for Cell-centered Finite Difference on Triangular Meshes Do Y. Kwak, 1 JunS.Lee 1 Department of Mathematics, KAIST, Taejon 305-701, Korea Department of Mathematics,

### Constrained Minimization and Multigrid

Constrained Minimization and Multigrid C. Gräser (FU Berlin), R. Kornhuber (FU Berlin), and O. Sander (FU Berlin) Workshop on PDE Constrained Optimization Hamburg, March 27-29, 2008 Matheon Outline Successive

### MULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* Dedicated to Professor Jim Douglas, Jr. on the occasion of his seventieth birthday.

MULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* DOUGLAS N ARNOLD, RICHARD S FALK, and RAGNAR WINTHER Dedicated to Professor Jim Douglas, Jr on the occasion of his seventieth birthday Abstract

### APPLIED NUMERICAL LINEAR ALGEBRA

APPLIED NUMERICAL LINEAR ALGEBRA James W. Demmel University of California Berkeley, California Society for Industrial and Applied Mathematics Philadelphia Contents Preface 1 Introduction 1 1.1 Basic Notation

### Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit VII Sparse Matrix

Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit VII Sparse Matrix Computations Part 1: Direct Methods Dianne P. O Leary c 2008

### Multilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses

Multilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses P. Boyanova 1, I. Georgiev 34, S. Margenov, L. Zikatanov 5 1 Uppsala University, Box 337, 751 05 Uppsala,

### arxiv: v1 [math.na] 11 Jul 2011

Multigrid Preconditioner for Nonconforming Discretization of Elliptic Problems with Jump Coefficients arxiv:07.260v [math.na] Jul 20 Blanca Ayuso De Dios, Michael Holst 2, Yunrong Zhu 2, and Ludmil Zikatanov

### A geometric theory for preconditioned inverse iteration III: A short and sharp convergence estimate for generalized eigenvalue problems

Linear Algebra and its Applications 358 (2003) 95 114 www.elsevier.com/locate/laa A geometric theory for preconditioned inverse iteration III: A short and sharp convergence estimate for generalized eigenvalue

### Multilevel Methods for Eigenspace Computations in Structural Dynamics

Multilevel Methods for Eigenspace Computations in Structural Dynamics Ulrich Hetmaniuk & Rich Lehoucq Sandia National Laboratories, Computational Math and Algorithms, Albuquerque, NM Joint work with Peter

### Key words. conjugate gradients, normwise backward error, incremental norm estimation.

Proceedings of ALGORITMY 2016 pp. 323 332 ON ERROR ESTIMATION IN THE CONJUGATE GRADIENT METHOD: NORMWISE BACKWARD ERROR PETR TICHÝ Abstract. Using an idea of Duff and Vömel [BIT, 42 (2002), pp. 300 322

### 10.6 ITERATIVE METHODS FOR DISCRETIZED LINEAR EQUATIONS

10.6 ITERATIVE METHODS FOR DISCRETIZED LINEAR EQUATIONS 769 EXERCISES 10.5.1 Use Taylor expansion (Theorem 10.1.2) to give a proof of Theorem 10.5.3. 10.5.2 Give an alternative to Theorem 10.5.3 when F

### A GEOMETRIC THEORY FOR PRECONDITIONED INVERSE ITERATION APPLIED TO A SUBSPACE

MATHEMATICS OF COMPUTATION Volume 71, Number 237, Pages 197 216 S 0025-5718(01)01357-6 Article electronically published on September 17, 2001 A GEOMETRIC THEORY FOR PRECONDITIONED INVERSE ITERATION APPLIED

### Geometric Multigrid Methods

Geometric Multigrid Methods Susanne C. Brenner Department of Mathematics and Center for Computation & Technology Louisiana State University IMA Tutorial: Fast Solution Techniques November 28, 2010 Ideas

### The Algebraic Multigrid Projection for Eigenvalue Problems; Backrotations and Multigrid Fixed Points. Sorin Costiner and Shlomo Ta'asan

The Algebraic Multigrid Projection for Eigenvalue Problems; Backrotations and Multigrid Fixed Points Sorin Costiner and Shlomo Ta'asan Department of Applied Mathematics and Computer Science The Weizmann

### Local Inexact Newton Multilevel FEM for Nonlinear Elliptic Problems

Konrad-Zuse-Zentrum für Informationstechnik Berlin Heilbronner Str. 10, D-10711 Berlin-Wilmersdorf Peter Deuflhard Martin Weiser Local Inexact Newton Multilevel FEM for Nonlinear Elliptic Problems Preprint

### University of Illinois at Urbana-Champaign. Multigrid (MG) methods are used to approximate solutions to elliptic partial differential

Title: Multigrid Methods Name: Luke Olson 1 Affil./Addr.: Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801 email: lukeo@illinois.edu url: http://www.cs.uiuc.edu/homes/lukeo/

### Preconditioned inverse iteration and shift-invert Arnoldi method

Preconditioned inverse iteration and shift-invert Arnoldi method Melina Freitag Department of Mathematical Sciences University of Bath CSC Seminar Max-Planck-Institute for Dynamics of Complex Technical

### A Model-Trust-Region Framework for Symmetric Generalized Eigenvalue Problems

A Model-Trust-Region Framework for Symmetric Generalized Eigenvalue Problems C. G. Baker P.-A. Absil K. A. Gallivan Technical Report FSU-SCS-2005-096 Submitted June 7, 2005 Abstract A general inner-outer

### Iterative 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

### Preface to the Second Edition. Preface to the First Edition

n page v Preface to the Second Edition Preface to the First Edition xiii xvii 1 Background in Linear Algebra 1 1.1 Matrices................................. 1 1.2 Square Matrices and Eigenvalues....................

### Inexact inverse iteration with preconditioning

Department of Mathematical Sciences Computational Methods with Applications Harrachov, Czech Republic 24th August 2007 (joint work with M. Robbé and M. Sadkane (Brest)) 1 Introduction 2 Preconditioned

### AMS526: 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

### The Deflation Accelerated Schwarz Method for CFD

The Deflation Accelerated Schwarz Method for CFD J. Verkaik 1, C. Vuik 2,, B.D. Paarhuis 1, and A. Twerda 1 1 TNO Science and Industry, Stieltjesweg 1, P.O. Box 155, 2600 AD Delft, The Netherlands 2 Delft

### A HARMONIC RESTARTED ARNOLDI ALGORITHM FOR CALCULATING EIGENVALUES AND DETERMINING MULTIPLICITY

A HARMONIC RESTARTED ARNOLDI ALGORITHM FOR CALCULATING EIGENVALUES AND DETERMINING MULTIPLICITY RONALD B. MORGAN AND MIN ZENG Abstract. A restarted Arnoldi algorithm is given that computes eigenvalues

### Last Time. Social Network Graphs Betweenness. Graph Laplacian. Girvan-Newman Algorithm. Spectral Bisection

Eigenvalue Problems Last Time Social Network Graphs Betweenness Girvan-Newman Algorithm Graph Laplacian Spectral Bisection λ 2, w 2 Today Small deviation into eigenvalue problems Formulation Standard eigenvalue

### M.A. Botchev. September 5, 2014

Rome-Moscow school of Matrix Methods and Applied Linear Algebra 2014 A short introduction to Krylov subspaces for linear systems, matrix functions and inexact Newton methods. Plan and exercises. M.A. Botchev

### Journal of Computational and Applied Mathematics. Multigrid method for solving convection-diffusion problems with dominant convection

Journal of Computational and Applied Mathematics 226 (2009) 77 83 Contents lists available at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elsevier.com/locate/cam

### Course Notes: Week 1

Course Notes: Week 1 Math 270C: Applied Numerical Linear Algebra 1 Lecture 1: Introduction (3/28/11) We will focus on iterative methods for solving linear systems of equations (and some discussion of eigenvalues

### CONTROLLING INNER ITERATIONS IN THE JACOBI DAVIDSON METHOD

CONTROLLING INNER ITERATIONS IN THE JACOBI DAVIDSON METHOD MICHIEL E. HOCHSTENBACH AND YVAN NOTAY Abstract. The Jacobi Davidson method is an eigenvalue solver which uses the iterative (and in general inaccurate)

### A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases

Linear Algebra and its Applications 415 (2006) 114 139 www.elsevier.com/locate/laa A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases Klaus Neymeyr Universität

### MATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors.

MATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors. Orthogonal sets Let V be a vector space with an inner product. Definition. Nonzero vectors v 1,v

### Incomplete 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,

### Contents. Preface... xi. Introduction...

Contents Preface... xi Introduction... xv Chapter 1. Computer Architectures... 1 1.1. Different types of parallelism... 1 1.1.1. Overlap, concurrency and parallelism... 1 1.1.2. Temporal and spatial parallelism

### High order, finite volume method, flux conservation, finite element method

FLUX-CONSERVING FINITE ELEMENT METHODS SHANGYOU ZHANG, ZHIMIN ZHANG, AND QINGSONG ZOU Abstract. We analyze the flux conservation property of the finite element method. It is shown that the finite element

### Preconditioned Eigenvalue Solvers for electronic structure calculations. Andrew V. Knyazev. Householder Symposium XVI May 26, 2005

1 Preconditioned Eigenvalue Solvers for electronic structure calculations Andrew V. Knyazev Department of Mathematics and Center for Computational Mathematics University of Colorado at Denver Householder

### AN AGGREGATION MULTILEVEL METHOD USING SMOOTH ERROR VECTORS

AN AGGREGATION MULTILEVEL METHOD USING SMOOTH ERROR VECTORS EDMOND CHOW Abstract. Many algebraic multilevel methods for solving linear systems assume that the slowto-converge, or algebraically smooth error

### arxiv: v2 [math.na] 16 Nov 2016

BOOTSTRAP MULTIGRID FOR THE SHIFTED LAPLACE-BELTRAMI EIGENVALUE PROBLEM JAMES BRANNICK AND SHUHAO CAO arxiv:1511.07042v2 [math.na] 16 Nov 2016 Abstract. This paper introduces bootstrap two-grid and multigrid

### Davidson Method CHAPTER 3 : JACOBI DAVIDSON METHOD

Davidson Method CHAPTER 3 : JACOBI DAVIDSON METHOD Heinrich Voss voss@tu-harburg.de Hamburg University of Technology The Davidson method is a popular technique to compute a few of the smallest (or largest)

### Computational Methods. Eigenvalues and Singular Values

Computational Methods Eigenvalues and Singular Values Manfred Huber 2010 1 Eigenvalues and Singular Values Eigenvalues and singular values describe important aspects of transformations and of data relations

### Eigenvalue Problems CHAPTER 1 : PRELIMINARIES

Eigenvalue Problems CHAPTER 1 : PRELIMINARIES Heinrich Voss voss@tu-harburg.de Hamburg University of Technology Institute of Mathematics TUHH Heinrich Voss Preliminaries Eigenvalue problems 2012 1 / 14

### AA242B: MECHANICAL VIBRATIONS

AA242B: MECHANICAL VIBRATIONS 1 / 17 AA242B: MECHANICAL VIBRATIONS Solution Methods for the Generalized Eigenvalue Problem These slides are based on the recommended textbook: M. Géradin and D. Rixen, Mechanical

### AMG for a Peta-scale Navier Stokes Code

AMG for a Peta-scale Navier Stokes Code James Lottes Argonne National Laboratory October 18, 2007 The Challenge Develop an AMG iterative method to solve Poisson 2 u = f discretized on highly irregular

### MICHIEL E. HOCHSTENBACH

VARIATIONS ON HARMONIC RAYLEIGH RITZ FOR STANDARD AND GENERALIZED EIGENPROBLEMS MICHIEL E. HOCHSTENBACH Abstract. We present several variations on the harmonic Rayleigh Ritz method. First, we introduce

### Controlling inner iterations in the Jacobi Davidson method

Controlling inner iterations in the Jacobi Davidson method Michiel E. Hochstenbach and Yvan Notay Service de Métrologie Nucléaire, Université Libre de Bruxelles (C.P. 165/84), 50, Av. F.D. Roosevelt, B-1050

### Numerical Solution I

Numerical Solution I Stationary Flow R. Kornhuber (FU Berlin) Summerschool Modelling of mass and energy transport in porous media with practical applications October 8-12, 2018 Schedule Classical Solutions

### 1. Fast Iterative Solvers of SLE

1. Fast Iterative Solvers of crucial drawback of solvers discussed so far: they become slower if we discretize more accurate! now: look for possible remedies relaxation: explicit application of the multigrid

### A Generalized Eigensolver Based on Smoothed Aggregation (GES-SA) for Initializing Smoothed Aggregation Multigrid (SA)

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2007; 07: 6 [Version: 2002/09/8 v.02] A Generalized Eigensolver Based on Smoothed Aggregation (GES-SA) for Initializing Smoothed Aggregation

### ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS

ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS LONG CHEN In this chapter we discuss iterative methods for solving the finite element discretization of semi-linear elliptic equations of the form: find

### CONTROLLING INNER ITERATIONS IN THE JACOBI DAVIDSON METHOD

CONTROLLING INNER ITERATIONS IN THE JACOBI DAVIDSON METHOD MICHIEL E. HOCHSTENBACH AND YVAN NOTAY Abstract. The Jacobi Davidson method is an eigenvalue solver which uses an inner-outer scheme. In the outer

### Multigrid finite element methods on semi-structured triangular grids

XXI Congreso de Ecuaciones Diferenciales y Aplicaciones XI Congreso de Matemática Aplicada Ciudad Real, -5 septiembre 009 (pp. 8) Multigrid finite element methods on semi-structured triangular grids F.J.

### Applied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic

Applied Mathematics 205 Unit V: Eigenvalue Problems Lecturer: Dr. David Knezevic Unit V: Eigenvalue Problems Chapter V.4: Krylov Subspace Methods 2 / 51 Krylov Subspace Methods In this chapter we give

### CONVERGENCE 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

### Optimal multilevel preconditioning of strongly anisotropic problems.part II: non-conforming FEM. p. 1/36

Optimal multilevel preconditioning of strongly anisotropic problems. Part II: non-conforming FEM. Svetozar Margenov margenov@parallel.bas.bg Institute for Parallel Processing, Bulgarian Academy of Sciences,

### DELFT UNIVERSITY OF TECHNOLOGY

DELFT UNIVERSITY OF TECHNOLOGY REPORT -09 Computational and Sensitivity Aspects of Eigenvalue-Based Methods for the Large-Scale Trust-Region Subproblem Marielba Rojas, Bjørn H. Fotland, and Trond Steihaug

### A Least-Squares Finite Element Approximation for the Compressible Stokes Equations

A Least-Squares Finite Element Approximation for the Compressible Stokes Equations Zhiqiang Cai, 1 Xiu Ye 1 Department of Mathematics, Purdue University, 1395 Mathematical Science Building, West Lafayette,

### XIAO-CHUAN CAI AND MAKSYMILIAN DRYJA. strongly elliptic equations discretized by the nite element methods.

Contemporary Mathematics Volume 00, 0000 Domain Decomposition Methods for Monotone Nonlinear Elliptic Problems XIAO-CHUAN CAI AND MAKSYMILIAN DRYJA Abstract. In this paper, we study several overlapping

### A Tuned Preconditioner for Inexact Inverse Iteration for Generalised Eigenvalue Problems

A Tuned Preconditioner for for Generalised Eigenvalue Problems Department of Mathematical Sciences University of Bath, United Kingdom IWASEP VI May 22-25, 2006 Pennsylvania State University, University

### ITERATIVE PROJECTION METHODS FOR SPARSE LINEAR SYSTEMS AND EIGENPROBLEMS CHAPTER 11 : JACOBI DAVIDSON METHOD

ITERATIVE PROJECTION METHODS FOR SPARSE LINEAR SYSTEMS AND EIGENPROBLEMS CHAPTER 11 : JACOBI DAVIDSON METHOD Heinrich Voss voss@tu-harburg.de Hamburg University of Technology Institute of Numerical Simulation

### Efficient smoothers for all-at-once multigrid methods for Poisson and Stokes control problems

Efficient smoothers for all-at-once multigrid methods for Poisson and Stoes control problems Stefan Taacs stefan.taacs@numa.uni-linz.ac.at, WWW home page: http://www.numa.uni-linz.ac.at/~stefant/j3362/

### Multilevel and Adaptive Iterative Substructuring Methods. Jan Mandel University of Colorado Denver

Multilevel and Adaptive Iterative Substructuring Methods Jan Mandel University of Colorado Denver The multilevel BDDC method is joint work with Bedřich Sousedík, Czech Technical University, and Clark Dohrmann,

### Alternative correction equations in the Jacobi-Davidson method

Chapter 2 Alternative correction equations in the Jacobi-Davidson method Menno Genseberger and Gerard Sleijpen Abstract The correction equation in the Jacobi-Davidson method is effective in a subspace

### Algebraic Multigrid Preconditioners for Computing Stationary Distributions of Markov Processes

Algebraic Multigrid Preconditioners for Computing Stationary Distributions of Markov Processes Elena Virnik, TU BERLIN Algebraic Multigrid Preconditioners for Computing Stationary Distributions of Markov

### Convergence Behavior of a Two-Level Optimized Schwarz Preconditioner

Convergence Behavior of a Two-Level Optimized Schwarz Preconditioner Olivier Dubois 1 and Martin J. Gander 2 1 IMA, University of Minnesota, 207 Church St. SE, Minneapolis, MN 55455 dubois@ima.umn.edu

### An Arnoldi Method for Nonlinear Symmetric Eigenvalue Problems

An Arnoldi Method for Nonlinear Symmetric Eigenvalue Problems H. Voss 1 Introduction In this paper we consider the nonlinear eigenvalue problem T (λ)x = 0 (1) where T (λ) R n n is a family of symmetric