# Arnoldi Methods in SLEPc

Size: px
Start display at page:

## Transcription

1 Scalable Library for Eigenvalue Problem Computations SLEPc Technical Report STR-4 Available at Arnoldi Methods in SLEPc V. Hernández J. E. Román A. Tomás V. Vidal Last update: October, 2006 (slepc 2.3.2) Previous updates: slepc About SLEPc Technical Reports: These reports are part of the documentation of slepc, the Scalable Library for Eigenvalue Problem Computations. They are intended to complement the Users Guide by providing technical details that normal users typically do not need to know but may be of interest for more advanced users.

2 Arnoldi Methods in SLEPc STR-4 Contents 1 Introduction 2 2 Description of the Method Basic Arnoldi Algorithm Explicit Restart Other Strategies for Restart Other Variants Available Implementations The slepc Implementation User Options Known Issues and Applicability Introduction The method of Arnoldi [1951] was proposed as a means of reducing a matrix to Hessenberg form, but Arnoldi already suggested that the process could provide good approximations to some eigenvalues if stopped before completion. This idea was fully developed in later work by Saad [1980] and other authors, making the method evolve into one of the most successful ones for non-hermitian eigenproblems. Many variants of the method have been proposed. This report provides a general description of the algorithm (section 2) and then focuses on the particular variant implemented in slepc (section 3). 2 Description of the Method This section provides an overview of the Arnoldi method and some of its variations. For more detailed background material the reader is referred to [Saad, 1992] or [Bai et al., 2000]. 2.1 Basic Arnoldi Algorithm Given a square matrix A of order n, if n steps of Arnoldi s method are carried out then an orthogonal reduction to Hessenberg form is achieved, AV = V H, where H is an upper Hessenberg matrix of order n with positive subdiagonal elements and V is an orthogonal matrix. V and H are uniquely determined by the first column of V, a unit-norm vector v 1 = V e 1 that is called the initial vector. For some initial vectors, Arnoldi s method fails after m steps, and in that case the algorithm produces an n m matrix V m with orthogonal columns and an upper 2

3 STR-4 Arnoldi Methods in SLEPc Hessenberg matrix of order m, H m, that satisfy AV m V m H m = 0, (1) that is, the columns of V m span an invariant subspace of matrix A. In the general case in which the algorithm does not break down, after m steps the following relation holds AV m V m H m = fe m, (2) where vector f is usually called the residual of the m-step Arnoldi factorization. Algorithm 1 (Basic Arnoldi) Input: Matrix A, number of steps m, and initial vector v 1 of norm 1 Output: (V m, H m, f, β) so that AV m V m H m = fe m, β = f 2 For j = 1, 2,..., m 1 w = Av j Orthogonalize w with respect to V j (obtaining h 1:j,j ) h j+1,j = w 2 If h j+1,j = 0, stop v j+1 = w/h j+1,j end f = Av m Orthogonalize f with respect to V m (obtaining h 1:m,m ) β = f 2 It can be shown that Algorithm 1 builds an orthogonal basis of the Krylov subspace K m (A, v 1 ). In order to maintain a good level of orthogonality, an iterative Gram-Schmidt procedure must be used for orthogonalization (for details, see slepc Technical Report STR-1, Orthogonalization Routines in slepc ). The computed basis vectors are the columns of V m, which are called Arnoldi vectors. If some w is zero after orthogonalization then the algorithm breaks down before completing m steps and, in that case, the residual of the Arnoldi factorization is zero and K j (A, v 1 ), j < m, is an exact invariant subspace of A, as mentioned above. However, this situation is very unlikely in practice due to finite precision arithmetic. Since Vmf = 0 by construction, then by premultiplying equation (2) by Vm V mav m = H m, (3) that is, matrix H m represents the orthogonal projection of A onto the Krylov subspace, and this fact allows us to compute Rayleigh-Ritz approximations of the eigenpairs of A. Let (λ i, y i ) be an eigenpair of matrix H m, then the Ritz value, λ i, and the Ritz vector, x i = V m y i, can be taken as approximations of an eigenpair of A. Typically, only a small percentage of the m approximations are good. This can be assessed by means of the residual norm for the Ritz pair, which turns out to be very easy to compute: Ax i λ i x i 2 = AV m y i λ i V m y i 2 = (AV m V m H m )y i 2 = β e my i. (4) 3

4 Arnoldi Methods in SLEPc STR-4 In practical situations, the number of steps, m, required to obtain good approximations may be too large. The problem with a large m is not only storage but also the computational cost that grows in every step. For this reason, a restarted version of the algorithm is necessary in practice. The general idea of restarting is that after V m has been computed, for a fixed value of m, a new Arnoldi process is started, trying to benefit from the previously computed information. In the sequel, m will denote the maximum number of vectors allowed for the basis (ncv in the slepc terminology). 2.2 Explicit Restart The idea of explicit restart is to iteratively compute different m-step Arnoldi factorizations with successively better initial vectors. The initial vector for the next Arnoldi run is computed from the information available in the most recent factorization. The simplest way to select the new initial vector is to take the Ritz vector (or Schur vector) associated to the dominant eigenvalue, v 1 = V m y 1. This strategy is described below whereas more sophisticated approaches are postponed until next subsection. In order for a restarted method to be effective in computing more than one eigenpair, it is necessary to keep track of already converged eigenpairs and perform some form of deflation. This is done by a technique usually called locking, in which vectors associated to converged eigenvalues are not modified in successive runs. Suppose that after certain Arnoldi run, the first k eigenpairs have already converged to the desired accuracy, and write V m as [ ] V m = V (l) 1:k V (a), (5) k+1:m where the (l) superscript indicates locked vectors and the (a) superscript indicates active vectors. In the next Arnoldi run, only m k Arnoldi vectors must be computed, the active ones, and in doing this the first k vectors have to be deflated. This can be done simply by orthogonalizing every new Arnoldi vector also with respect to the locked ones, as illustrated in Algorithm 2. Algorithm 2 (Arnoldi with Deflation) Input: Matrix A, number of steps m, V 1:k, H 1:k with k < m, and initial vector v k+1 of norm 1 Output: (V m, H m, f, β) so that AV m V m H m = fe m, β = f 2 For j = k + 1,..., m 1 w = Av j Orthogonalize w with respect to V j (obtaining h 1:j,j ) h j+1,j = w 2 if h j+1,j = 0, stop v j+1 = w/h j+1,j end f = Av m Orthogonalize f with respect to V m (obtaining h 1:m,m ) β = f 2 4

5 STR-4 Arnoldi Methods in SLEPc Note that Algorithm 2 only modifies the last m k columns of V m and H m, the active part of the factorization. All the operations of the algorithm are performed on this active part. These operations are the computation of the Arnoldi factorization with initial vector v k+1 and then the computation of the Schur form, see Algorithm 3. Algorithm 3 (Explicitly Restarted Arnoldi) Input: Matrix A, initial vector v 1, and dimension of the subspace m Output: A partial Schur decomposition AV 1:k = V 1:k H 1:k,1:k Normalize v 1 Initialize V m = [v 1 ], k = 0 Restart loop Perform m k steps of Arnoldi with deflation (Algorithm 2) Reduce H m to (quasi-)triangular form, H m U 1 H m U 1 Sort the 1 1 or 2 2 diagonal blocks: H m U 2 H m U 2 U = U 1 U 2 Compute eigenvectors of H m, H m y i = y i θ i Compute residual norm estimates, τ i = β e my i Lock converged eigenpairs V m V m U end Algorithm 3 is based on the (real) Schur form instead of the eigendecomposition in order to be more robust. If we partition H m conforming to (5), then after the computation of the Arnoldi factorization, H m has the following form H m =, (6) that is, the leading submatrix of order k is upper (quasi-)triangular and the bottom right block is upper Hessenberg. As the algorithm progresses, the lines in (6) descend as soon as new eigenvalues converge. At the end, when the number of converged eigenvalues is sufficient (k nev), V 1:k and H 1:k,1:k constitute an approximate partial Schur decomposition of matrix A. The transformation from Arnoldi vectors to Schur vectors is realized by the operation V m = V m U, which needs to be performed only on the newly converged vectors and also on the 5

6 Arnoldi Methods in SLEPc STR-4 next initial vector. Note that the initial vector for the next restart is then the Schur vector of the first non-converged eigenvalue. Note also the sorting operation needed to guarantee that eigenvalues always converge in the required order. 2.3 Other Strategies for Restart In the restarting strategy described above, the Arnoldi algorithm is rerun using as initial vector the approximate Schur vector associated to the first not-yet-converged eigenvalue. This has the effect that in the next Arnoldi run that particular eigenvalue will converge fast because the initial vector already points in a direction close to the corresponding eigenvector. (Note that this is not the case if the eigenvalue is complex and the algorithm runs in real arithmetic.) However, when several eigenpairs have to be computed, this approach is not the best one, because the other nearly converged eigenpairs are not represented in the initial vector. So a better approach would be to set the initial vector as a linear combination of all the eigenvectors (or Schur vectors). But in doing this, we might be including some directions which are not of interest, so care must be taken to remove from the initial vector the directions associated to unwanted eigenvalues. This more elaborate strategy is usually called filtering since in the initial vector the directions corresponding to wanted eigenvalues are amplified whereas those corresponding to unwanted ones are damped. Polynomial filtering. One possibility for achieving the filtering effect is to take the initial vector to be v k+1 = z/ z 2 where z = p(a)z 0, being p a polynomial of degree d and z 0 a linear combination of the approximate eigenvectors (or Schur vectors). As stated above, this polynomial has to be defined in such a way that the new initial vector is rich in the directions of wanted eigenvectors while other directions are removed. This goal can be achieved by adapting the optimality properties of Chebyshev polynomials [Saad, 1984; Sadkane, 1993]. In this approach, p is a Chebyshev polynomial of the first kind of degree d, T d [(A σi)/ρ], where σ and ρ give a translation and scaling of the part of the spectrum one wants to suppress. In the case of non-hermitian problems, this part of the spectrum is represented by an ellipse containing all the unwanted eigenvalues. Since these eigenvalues are unknown and the optimal ellipse is difficult to define, other alternative approaches have been proposed based on other types of polynomials, such as least-squares polynomials, [Saad, 1987], or Faber polynomials, [Heuveline and Sadkane, 1997]. Polynomial filtering as described here has several drawbacks. One of them is that it is difficult, in general, to choose a linear combination z 0 of the eigenvectors that leads to balanced convergence because it is hard to represent a whole subspace by a single vector. A cure for this could be to apply the filtering in all the steps of the Arnoldi method and not just at the restart, that is, replace matrix A by p(a). This is usually called polynomial preconditioning. Another disadvantage is the wide variation in performance depending on the choice of the parameters of the polynomial, making it difficult to implement a robust solver that works well in many situations. 6

7 STR-4 Arnoldi Methods in SLEPc Implicit restart. The restarting schemes discussed so far are explicit in the sense that an initial vector is computed and then a new Arnoldi process is started from scratch. Implicit restart is an alternative in which the Arnoldi process is combined with the implicitly shifted QR algorithm. An m-step Arnoldi factorization is compacted into an (m d)-step Arnoldi factorization, which is then extended again to an m-step one. The key point is that the small factorization retains the relevant eigeninformation of the large factorization, and this is accomplished by applying several steps of the QR iteration. This process is more efficient and numerically stable than explicit restart, and can be interpreted as an implicit application of a polynomial in A of degree d to the initial vector, [Sorensen, 1992]. This technique has been implemented in the arpack software, [Lehoucq et al., 1998]. The implicit QR approach is generally superior to explicit restart, because the effect is that the subspace generated by the algorithm contains the Krylov subspace associated to all the approximate Schur vectors and not just one. For a more detailed discussion see [Morgan, 1996]. Krylov-Schur. Implementing the implicit restart technique in a numerically stable way is difficult. A simpler way of achieving the same effect is by the so-called Krylov-Schur method, [Stewart, 2001]. Since this method is also implemented in slepc, its description is provided separately (see slepc Technical Report STR-7, Krylov-Schur Methods in slepc ). 2.4 Other Variants This subsection describes very briefly some variations of the algorithm that may be of interest in some situations. B -Arnoldi. When addressing a generalized eigenvalue problem, Ax = λbx, usually a spectral transformation is used. In this case, it is sometimes useful to replace the standard Hermitian inner product, x, y = y x, by the B-inner product, x, y B = y B x. In the context of Algorithm 2, this can be accomplished by doing B-orthogonalization and replacing the 2-norm with the B-norm, w B = w, w B. This modified algorithm is usually referred to as the B-Arnoldi process. In the case of Hermitian positive-definite pencils, symmetry is recovered in the transformed operator, e.g. (A σb) 1 B, when the B-inner product is used. Of course, this property is relevant only for solvers that exploit symmetry, such as Lanczos (see slepc Technical Report STR-5, Lanczos Methods in slepc ). However, the B-Arnoldi process is still useful in the case that B is singular, even when A is not symmetric. If B is singular, then the bilinear form x, y B is a semi-inner product, but the B-Arnoldi process is still well defined and can provide a solution to the problem of eigenvector corruption due to infinite eigenvalues, see [Meerbergen and Spence, 1997]. Block Methods. A block method tries to extract approximate spectral information from a block Krylov subspace K m (A, V 1 ) = span{v 1, AV 1, A 2 V 1,..., A m 1 V 1 }, (7) 7

8 Arnoldi Methods in SLEPc STR-4 where V 1 has b columns. This kind of method has two main advantages. First, the convergence behavior can be less problematic in cases with multiple or clustered eigenvalues, provided that b is sufficiently large. Second, computational efficiency may be better in some situations, because access to the elements of matrix A is amortized by multiplying several vectors and not just one. On the other hand, one drawback is that in order for the algorithm to work with polynomials of degree m, the required dimension of the subspace is m b, which can be quite large. Another drawback is that issues such as deflation, which are relatively simple to implement in unblocked algorithms, become severe complications in the block variants. Two approaches are generally possible for developing the above ideas. For distinguishing them, they are sometimes referred to as block and band versions, respectively. The first one is a straightforward block generalization of the simple algorithm, using block Gram-Schmidt orthogonalization. In this case, matrix H m is no longer Hessenberg but block Hessenberg. In the other alternative, vectors are orthogonalized one at a time, with the usual Gram-Schmidt procedure, resulting in a band Hessenberg matrix. 2.5 Available Implementations arncheb [Braconnier, 1993] is a Fortran software that implements the Arnoldi method with explicit restart, via the Chebyshev polynomial technique described in section 2.3. As mentioned above, arpack [Lehoucq et al., 1998] provides a Fortran implementation of the Implicitly Restarted Arnoldi method, for both real and complex arithmetic. The software can be downloaded from A parallel version is also available, based on blacs or mpi message passing. 3 The slepc Implementation The variant of the Arnoldi method provided by slepc is based on explicit restart with locking. The corresponding solver is EPSARNOLDI (or -eps_type arnoldi from the command-line). The algorithm actually implemented is Algorithm 3. Currently, the only restarting strategy available is the simplest one of those described above, that is, the new initial vector is the Schur vector of the first eigenvalue that has not converged yet. Krylov-Schur restart is implemented in slepc as a separate eigensolver (see slepc Technical Report STR-7, Krylov-Schur Methods in slepc ). Implicit restart is indirectly available in slepc via wrapper code to interface to arpack (solver EPSARPACK, see the slepc Users Manual for details on how to enable external software). Currently, block versions of the algorithms have not been considered in slepc. One of the reasons is the limited support for multi-vectors in petsc. 3.1 User Options The only parameters that can be adjusted by the user are those related to the orthogonalization technique used e.g. in the third line of Algorithm 2. Apart from the general orthogonalization 8

9 STR-4 Arnoldi Methods in SLEPc options described in slepc Technical Report STR-1 ( Orthogonalization Routines in slepc ), a specific option is available for the Arnoldi eigensolver, namely the activation of delayed variants, which is a rather advanced feature. EPSArnoldiSetDelayed(EPS eps,petsctruth delayed) This function activates (or deactivates) delayed Arnoldi variants, which are off by default. Delayed variants can also be activated with the command-line option -eps_arnoldi_delayed. The delayed variants introduce either delayed normalization or delayed refinement. These are somewhat aggressive optimizations than may provide better scalability, but sometimes make the solver converge less than the default algorithm. If the delayed flag is activated with the above function, then either delayed normalization (if refinement is equal to never) or delayed refinement (if refinement is equal to always) is carried out (see slepc Technical Report STR-1 for instructions on how to change the parameter refinement). Full details about delayed variants, including numerical results and performance analysis, can be found in [Hernandez et al., 2007]. 3.2 Known Issues and Applicability Arnoldi is probably the most robust slepc eigensolver. However, its simple restart mechanism makes it converge generally slower compared to other solvers such as Krylov-Schur. Large errors may appear in the computed eigenvectors in the case of a generalized eigenproblem with singular B. With respect to delayed variants, Arnoldi with delayed refinement may suffer from convergence stagnation in some cases. For this reason, it is not used by default. Supported problem types Allowed portion of the spectrum Support for complex numbers All All Yes References Arnoldi, W. E. (1951). The Principle of Minimized Iterations in the Solution of the Matrix Eigenvalue Problem. Quart. Appl. Math., 9: Bai, Z., J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst (eds.) (2000). Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide. Society for Industrial and Applied Mathematics, Philadelphia, PA. Braconnier, T. (1993). The Arnoldi-Tchebycheff Algorithm for Solving Large Nonsymmetric Eigenproblems. Technical Report TR/PA/93/25, CERFACS, Toulouse, France. Hernandez, V., J. E. Roman, and A. Tomas (2007). Parallel Arnoldi Eigensolvers with Enhanced Scalability via Global Communications Rearrangement. Parallel Comput., 33(7 8):

10 Arnoldi Methods in SLEPc STR-4 Heuveline, V. and M. Sadkane (1997). Arnoldi-Faber Method for Large non Hermitian Eigenvalue Problems. Electron. Trans. Numer. Anal., 5: Lehoucq, R. B., D. C. Sorensen, and C. Yang (1998). ARPACK Users Guide, Solution of Large-Scale Eigenvalue Problems by Implicitly Restarted Arnoldi Methods. Society for Industrial and Applied Mathematics, Philadelphia, PA. Meerbergen, K. and A. Spence (1997). Implicitly Restarted Arnoldi with Purification for the Shift- Invert Transformation. Math. Comp., 66(218): Morgan, R. B. (1996). On Restarting the Arnoldi Method for Large Nonsymmetric Eigenvalue Problems. Math. Comp., 65: Saad, Y. (1980). Variations of Arnoldi s Method for Computing Eigenelements of Large Unsymmetric Matrices. Linear Algebra Appl., 34: Saad, Y. (1984). Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems. Math. Comp., 42: Saad, Y. (1987). Least Squares Polynomials in the Complex Plane and their Use for Solving Nonsymmetric Linear Systems. SIAM J. Numer. Anal., 24(1): Saad, Y. (1992). Numerical Methods for Large Eigenvalue Problems: Theory and Algorithms. John Wiley and Sons, New York. Sadkane, M. (1993). A Block Arnoldi-Chebyshev Method for Computing Leading Eigenpairs of Large Sparse Unsymmetric Matrices. Numer. Math., 64: Sorensen, D. C. (1992). Implicit Application of Polynomial Filters in a k-step Arnoldi Method. SIAM J. Matrix Anal. Appl., 13: Stewart, G. W. (2001). A Krylov Schur Algorithm for Large Eigenproblems. SIAM J. Matrix Anal. Appl., 23(3):

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

### Matrix Algorithms. Volume II: Eigensystems. G. W. Stewart H1HJ1L. University of Maryland College Park, Maryland

Matrix Algorithms Volume II: Eigensystems G. W. Stewart University of Maryland College Park, Maryland H1HJ1L Society for Industrial and Applied Mathematics Philadelphia CONTENTS Algorithms Preface xv xvii

### Iterative methods for symmetric eigenvalue problems

s Iterative s for symmetric eigenvalue problems, PhD McMaster University School of Computational Engineering and Science February 11, 2008 s 1 The power and its variants Inverse power Rayleigh quotient

### Solution of eigenvalue problems. Subspace iteration, The symmetric Lanczos algorithm. Harmonic Ritz values, Jacobi-Davidson s method

Solution of eigenvalue problems Introduction motivation Projection methods for eigenvalue problems Subspace iteration, The symmetric Lanczos algorithm Nonsymmetric Lanczos procedure; Implicit restarts

### Solution of eigenvalue problems. Subspace iteration, The symmetric Lanczos algorithm. Harmonic Ritz values, Jacobi-Davidson s method

Solution of eigenvalue problems Introduction motivation Projection methods for eigenvalue problems Subspace iteration, The symmetric Lanczos algorithm Nonsymmetric Lanczos procedure; Implicit restarts

### Index. for generalized eigenvalue problem, butterfly form, 211

Index ad hoc shifts, 165 aggressive early deflation, 205 207 algebraic multiplicity, 35 algebraic Riccati equation, 100 Arnoldi process, 372 block, 418 Hamiltonian skew symmetric, 420 implicitly restarted,

### A Parallel Implementation of the Davidson Method for Generalized Eigenproblems

A Parallel Implementation of the Davidson Method for Generalized Eigenproblems Eloy ROMERO 1 and Jose E. ROMAN Instituto ITACA, Universidad Politécnica de Valencia, Spain Abstract. We present a parallel

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

### ECS231 Handout Subspace projection methods for Solving Large-Scale Eigenvalue Problems. Part I: Review of basic theory of eigenvalue problems

ECS231 Handout Subspace projection methods for Solving Large-Scale Eigenvalue Problems Part I: Review of basic theory of eigenvalue problems 1. Let A C n n. (a) A scalar λ is an eigenvalue of an n n A

### An Asynchronous Algorithm on NetSolve Global Computing System

An Asynchronous Algorithm on NetSolve Global Computing System Nahid Emad S. A. Shahzadeh Fazeli Jack Dongarra March 30, 2004 Abstract The Explicitly Restarted Arnoldi Method (ERAM) allows to find a few

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

### EVALUATION OF ACCELERATION TECHNIQUES FOR THE RESTARTED ARNOLDI METHOD

EVALUATION OF ACCELERATION TECHNIQUES FOR THE RESTARTED ARNOLDI METHOD AKIRA NISHIDA AND YOSHIO OYANAGI Abstract. We present an approach for the acceleration of the restarted Arnoldi iteration for the

### LARGE SPARSE EIGENVALUE PROBLEMS. General Tools for Solving Large Eigen-Problems

LARGE SPARSE EIGENVALUE PROBLEMS Projection methods The subspace iteration Krylov subspace methods: Arnoldi and Lanczos Golub-Kahan-Lanczos bidiagonalization General Tools for Solving Large Eigen-Problems

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

### c 2009 Society for Industrial and Applied Mathematics

SIAM J. MATRIX ANAL. APPL. Vol. 3, No., pp. c 29 Society for Industrial and Applied Mathematics THE ARNOLDI EIGENVALUE ITERATION WITH EXACT SHIFTS CAN FAIL MARK EMBREE Abstract. The restarted Arnoldi algorithm,

### The quadratic eigenvalue problem (QEP) is to find scalars λ and nonzero vectors u satisfying

I.2 Quadratic Eigenvalue Problems 1 Introduction The quadratic eigenvalue problem QEP is to find scalars λ and nonzero vectors u satisfying where Qλx = 0, 1.1 Qλ = λ 2 M + λd + K, M, D and K are given

### LARGE SPARSE EIGENVALUE PROBLEMS

LARGE SPARSE EIGENVALUE PROBLEMS Projection methods The subspace iteration Krylov subspace methods: Arnoldi and Lanczos Golub-Kahan-Lanczos bidiagonalization 14-1 General Tools for Solving Large Eigen-Problems

### PERTURBED ARNOLDI FOR COMPUTING MULTIPLE EIGENVALUES

1 PERTURBED ARNOLDI FOR COMPUTING MULTIPLE EIGENVALUES MARK EMBREE, THOMAS H. GIBSON, KEVIN MENDOZA, AND RONALD B. MORGAN Abstract. fill in abstract Key words. eigenvalues, multiple eigenvalues, Arnoldi,

### Application of Lanczos and Schur vectors in structural dynamics

Shock and Vibration 15 (2008) 459 466 459 IOS Press Application of Lanczos and Schur vectors in structural dynamics M. Radeş Universitatea Politehnica Bucureşti, Splaiul Independenţei 313, Bucureşti, Romania

### 4.8 Arnoldi Iteration, Krylov Subspaces and GMRES

48 Arnoldi Iteration, Krylov Subspaces and GMRES We start with the problem of using a similarity transformation to convert an n n matrix A to upper Hessenberg form H, ie, A = QHQ, (30) with an appropriate

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

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

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

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

### Structured Krylov Subspace Methods for Eigenproblems with Spectral Symmetries

Structured Krylov Subspace Methods for Eigenproblems with Spectral Symmetries Fakultät für Mathematik TU Chemnitz, Germany Peter Benner benner@mathematik.tu-chemnitz.de joint work with Heike Faßbender

### Krylov Subspaces. Lab 1. The Arnoldi Iteration

Lab 1 Krylov Subspaces Lab Objective: Discuss simple Krylov Subspace Methods for finding eigenvalues and show some interesting applications. One of the biggest difficulties in computational linear algebra

### AMS526: Numerical Analysis I (Numerical Linear Algebra)

AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 19: More on Arnoldi Iteration; Lanczos Iteration Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical Analysis I 1 / 17 Outline 1

### A Parallel Implementation of the Trace Minimization Eigensolver

A Parallel Implementation of the Trace Minimization Eigensolver Eloy Romero and Jose E. Roman Instituto ITACA, Universidad Politécnica de Valencia, Camino de Vera, s/n, 4622 Valencia, Spain. Tel. +34-963877356,

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

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

### Krylov subspace projection methods

I.1.(a) Krylov subspace projection methods Orthogonal projection technique : framework Let A be an n n complex matrix and K be an m-dimensional subspace of C n. An orthogonal projection technique seeks

### ARPACK. Dick Kachuma & Alex Prideaux. November 3, Oxford University Computing Laboratory

ARPACK Dick Kachuma & Alex Prideaux Oxford University Computing Laboratory November 3, 2006 What is ARPACK? ARnoldi PACKage Collection of routines to solve large scale eigenvalue problems Developed at

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

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

### Math 504 (Fall 2011) 1. (*) Consider the matrices

Math 504 (Fall 2011) Instructor: Emre Mengi Study Guide for Weeks 11-14 This homework concerns the following topics. Basic definitions and facts about eigenvalues and eigenvectors (Trefethen&Bau, Lecture

### The Lanczos and conjugate gradient algorithms

The Lanczos and conjugate gradient algorithms Gérard MEURANT October, 2008 1 The Lanczos algorithm 2 The Lanczos algorithm in finite precision 3 The nonsymmetric Lanczos algorithm 4 The Golub Kahan bidiagonalization

### Solving large sparse eigenvalue problems

Solving large sparse eigenvalue problems Mario Berljafa Stefan Güttel June 2015 Contents 1 Introduction 1 2 Extracting approximate eigenpairs 2 3 Accuracy of the approximate eigenpairs 3 4 Expanding the

### Algorithms that use the Arnoldi Basis

AMSC 600 /CMSC 760 Advanced Linear Numerical Analysis Fall 2007 Arnoldi Methods Dianne P. O Leary c 2006, 2007 Algorithms that use the Arnoldi Basis Reference: Chapter 6 of Saad The Arnoldi Basis How to

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

### 6.4 Krylov Subspaces and Conjugate Gradients

6.4 Krylov Subspaces and Conjugate Gradients Our original equation is Ax = b. The preconditioned equation is P Ax = P b. When we write P, we never intend that an inverse will be explicitly computed. P

### PROJECTED GMRES AND ITS VARIANTS

PROJECTED GMRES AND ITS VARIANTS Reinaldo Astudillo Brígida Molina rastudillo@kuaimare.ciens.ucv.ve bmolina@kuaimare.ciens.ucv.ve Centro de Cálculo Científico y Tecnológico (CCCT), Facultad de Ciencias,

### A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line

A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line Karl Meerbergen en Raf Vandebril Karl Meerbergen Department of Computer Science KU Leuven, Belgium

### problem Au = u by constructing an orthonormal basis V k = [v 1 ; : : : ; v k ], at each k th iteration step, and then nding an approximation for the e

A Parallel Solver for Extreme Eigenpairs 1 Leonardo Borges and Suely Oliveira 2 Computer Science Department, Texas A&M University, College Station, TX 77843-3112, USA. Abstract. In this paper a parallel

### Krylov Subspace Methods for Large/Sparse Eigenvalue Problems

Krylov Subspace Methods for Large/Sparse Eigenvalue Problems Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan April 17, 2012 T.-M. Huang (Taiwan Normal University) Krylov

### On the Ritz values of normal matrices

On the Ritz values of normal matrices Zvonimir Bujanović Faculty of Science Department of Mathematics University of Zagreb June 13, 2011 ApplMath11 7th Conference on Applied Mathematics and Scientific

### eciency. In many instances, the cost of computing a few matrix-vector products

IMPLEMENTATION OF AN IMPLICITLY RESTARTED BLOCK ARNOLDI METHOD R. B. LEHOUCQ y AND K. J. MASCHHOFF z Abstract. Although block Arnoldi methods and their symmetric Lanczos counterparts are not new, studies

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

### Exponentials of Symmetric Matrices through Tridiagonal Reductions

Exponentials of Symmetric Matrices through Tridiagonal Reductions Ya Yan Lu Department of Mathematics City University of Hong Kong Kowloon, Hong Kong Abstract A simple and efficient numerical algorithm

### of dimension n 1 n 2, one defines the matrix determinants

HARMONIC RAYLEIGH RITZ FOR THE MULTIPARAMETER EIGENVALUE PROBLEM MICHIEL E. HOCHSTENBACH AND BOR PLESTENJAK Abstract. We study harmonic and refined extraction methods for the multiparameter eigenvalue

### Block Krylov-Schur Method for Large Symmetric Eigenvalue Problems

Block Krylov-Schur Method for Large Symmetric Eigenvalue Problems Yunkai Zhou (yzhou@smu.edu) Department of Mathematics, Southern Methodist University, Dallas, TX 75275, USA Yousef Saad (saad@cs.umn.edu)

### ON RESTARTING THE ARNOLDI METHOD FOR LARGE NONSYMMETRIC EIGENVALUE PROBLEMS

MATHEMATICS OF COMPUTATION Volume 65, Number 215 July 1996, Pages 1213 1230 ON RESTARTING THE ARNOLDI METHOD FOR LARGE NONSYMMETRIC EIGENVALUE PROBLEMS RONALD B. MORGAN Abstract. The Arnoldi method computes

### On the influence of eigenvalues on Bi-CG residual norms

On the influence of eigenvalues on Bi-CG residual norms Jurjen Duintjer Tebbens Institute of Computer Science Academy of Sciences of the Czech Republic duintjertebbens@cs.cas.cz Gérard Meurant 30, rue

### A comparison of solvers for quadratic eigenvalue problems from combustion

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS [Version: 2002/09/18 v1.01] A comparison of solvers for quadratic eigenvalue problems from combustion C. Sensiau 1, F. Nicoud 2,, M. van Gijzen 3,

### ABSTRACT OF DISSERTATION. Ping Zhang

ABSTRACT OF DISSERTATION Ping Zhang The Graduate School University of Kentucky 2009 Iterative Methods for Computing Eigenvalues and Exponentials of Large Matrices ABSTRACT OF DISSERTATION A dissertation

### Inexactness and flexibility in linear Krylov solvers

Inexactness and flexibility in linear Krylov solvers Luc Giraud ENSEEIHT (N7) - IRIT, Toulouse Matrix Analysis and Applications CIRM Luminy - October 15-19, 2007 in honor of Gérard Meurant for his 60 th

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

### Eigenvalue Problems. Eigenvalue problems occur in many areas of science and engineering, such as structural analysis

Eigenvalue Problems Eigenvalue problems occur in many areas of science and engineering, such as structural analysis Eigenvalues also important in analyzing numerical methods Theory and algorithms apply

### Computation of eigenvalues and singular values Recall that your solutions to these questions will not be collected or evaluated.

Math 504, Homework 5 Computation of eigenvalues and singular values Recall that your solutions to these questions will not be collected or evaluated 1 Find the eigenvalues and the associated eigenspaces

### Scientific Computing: An Introductory Survey

Scientific Computing: An Introductory Survey Chapter 4 Eigenvalue Problems Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction

### HARMONIC RAYLEIGH RITZ EXTRACTION FOR THE MULTIPARAMETER EIGENVALUE PROBLEM

HARMONIC RAYLEIGH RITZ EXTRACTION FOR THE MULTIPARAMETER EIGENVALUE PROBLEM MICHIEL E. HOCHSTENBACH AND BOR PLESTENJAK Abstract. We study harmonic and refined extraction methods for the multiparameter

### Universiteit-Utrecht. Department. of Mathematics. Jacobi-Davidson algorithms for various. eigenproblems. - A working document -

Universiteit-Utrecht * Department of Mathematics Jacobi-Davidson algorithms for various eigenproblems - A working document - by Gerard L.G. Sleipen, Henk A. Van der Vorst, and Zhaoun Bai Preprint nr. 1114

### On prescribing Ritz values and GMRES residual norms generated by Arnoldi processes

On prescribing Ritz values and GMRES residual norms generated by Arnoldi processes Jurjen Duintjer Tebbens Institute of Computer Science Academy of Sciences of the Czech Republic joint work with Gérard

### Alternative correction equations in the Jacobi-Davidson method. Mathematical Institute. Menno Genseberger and Gerard L. G.

Universiteit-Utrecht * Mathematical Institute Alternative correction equations in the Jacobi-Davidson method by Menno Genseberger and Gerard L. G. Sleijpen Preprint No. 173 June 1998, revised: March 1999

### FEM and sparse linear system solving

FEM & sparse linear system solving, Lecture 9, Nov 19, 2017 1/36 Lecture 9, Nov 17, 2017: Krylov space methods http://people.inf.ethz.ch/arbenz/fem17 Peter Arbenz Computer Science Department, ETH Zürich

### Research Matters. February 25, The Nonlinear Eigenvalue Problem. Nick Higham. Part III. Director of Research School of Mathematics

Research Matters February 25, 2009 The Nonlinear Eigenvalue Problem Nick Higham Part III Director of Research School of Mathematics Françoise Tisseur School of Mathematics The University of Manchester

### RANA03-02 January Jacobi-Davidson methods and preconditioning with applications in pole-zero analysis

RANA03-02 January 2003 Jacobi-Davidson methods and preconditioning with applications in pole-zero analysis by J.Rommes, H.A. van der Vorst, EJ.W. ter Maten Reports on Applied and Numerical Analysis Department

### Topics. The CG Algorithm Algorithmic Options CG s Two Main Convergence Theorems

Topics The CG Algorithm Algorithmic Options CG s Two Main Convergence Theorems What about non-spd systems? Methods requiring small history Methods requiring large history Summary of solvers 1 / 52 Conjugate

### Numerical Methods I Eigenvalue Problems

Numerical Methods I Eigenvalue Problems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 2nd, 2014 A. Donev (Courant Institute) Lecture

### DELFT UNIVERSITY OF TECHNOLOGY

DELFT UNIVERSITY OF TECHNOLOGY REPORT 10-12 Large-Scale Eigenvalue Problems in Trust-Region Calculations Marielba Rojas, Bjørn H. Fotland, and Trond Steihaug ISSN 1389-6520 Reports of the Department of

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

### Conjugate gradient method. Descent method. Conjugate search direction. Conjugate Gradient Algorithm (294)

Conjugate gradient method Descent method Hestenes, Stiefel 1952 For A N N SPD In exact arithmetic, solves in N steps In real arithmetic No guaranteed stopping Often converges in many fewer than N steps

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

### Rational Krylov methods for linear and nonlinear eigenvalue problems

Rational Krylov methods for linear and nonlinear eigenvalue problems Mele Giampaolo mele@mail.dm.unipi.it University of Pisa 7 March 2014 Outline Arnoldi (and its variants) for linear eigenproblems Rational

### MULTIGRID ARNOLDI FOR EIGENVALUES

1 MULTIGRID ARNOLDI FOR EIGENVALUES RONALD B. MORGAN AND ZHAO YANG Abstract. A new approach is given for computing eigenvalues and eigenvectors of large matrices. Multigrid is combined with the Arnoldi

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

### Section 4.5 Eigenvalues of Symmetric Tridiagonal Matrices

Section 4.5 Eigenvalues of Symmetric Tridiagonal Matrices Key Terms Symmetric matrix Tridiagonal matrix Orthogonal matrix QR-factorization Rotation matrices (plane rotations) Eigenvalues We will now complete

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

### SLEPc: overview, applications and some implementation details

SLEPc: overview, applications and some implementation details Jose E. Roman Universidad Politécnica de Valencia, Spain ETH Zürich - May, 2010 Arnoldi Method Computes a basis V m of K m (A, v 1 ) and H

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

### Computation of Smallest Eigenvalues using Spectral Schur Complements

Computation of Smallest Eigenvalues using Spectral Schur Complements Constantine Bekas Yousef Saad January 23, 2004 Abstract The Automated Multilevel Substructing method (AMLS ) was recently presented

### EECS 275 Matrix Computation

EECS 275 Matrix Computation Ming-Hsuan Yang Electrical Engineering and Computer Science University of California at Merced Merced, CA 95344 http://faculty.ucmerced.edu/mhyang Lecture 17 1 / 26 Overview

### Iterative methods for Linear System of Equations. Joint Advanced Student School (JASS-2009)

Iterative methods for Linear System of Equations Joint Advanced Student School (JASS-2009) Course #2: Numerical Simulation - from Models to Software Introduction In numerical simulation, Partial Differential

### Block Iterative Eigensolvers for Sequences of Dense Correlated Eigenvalue Problems

Mitglied der Helmholtz-Gemeinschaft Block Iterative Eigensolvers for Sequences of Dense Correlated Eigenvalue Problems Birkbeck University, London, June the 29th 2012 Edoardo Di Napoli Motivation and Goals

### ABSTRACT. Professor G.W. Stewart

ABSTRACT Title of dissertation: Residual Arnoldi Methods : Theory, Package, and Experiments Che-Rung Lee, Doctor of Philosophy, 2007 Dissertation directed by: Professor G.W. Stewart Department of Computer

### arxiv: v1 [hep-lat] 2 May 2012

A CG Method for Multiple Right Hand Sides and Multiple Shifts in Lattice QCD Calculations arxiv:1205.0359v1 [hep-lat] 2 May 2012 Fachbereich C, Mathematik und Naturwissenschaften, Bergische Universität

### A Chebyshev-based two-stage iterative method as an alternative to the direct solution of linear systems

A Chebyshev-based two-stage iterative method as an alternative to the direct solution of linear systems Mario Arioli m.arioli@rl.ac.uk CCLRC-Rutherford Appleton Laboratory with Daniel Ruiz (E.N.S.E.E.I.H.T)

### Key words. linear equations, polynomial preconditioning, nonsymmetric Lanczos, BiCGStab, IDR

POLYNOMIAL PRECONDITIONED BICGSTAB AND IDR JENNIFER A. LOE AND RONALD B. MORGAN Abstract. Polynomial preconditioning is applied to the nonsymmetric Lanczos methods BiCGStab and IDR for solving large nonsymmetric

### A CHEBYSHEV-DAVIDSON ALGORITHM FOR LARGE SYMMETRIC EIGENPROBLEMS

A CHEBYSHEV-DAVIDSON ALGORITHM FOR LARGE SYMMETRIC EIGENPROBLEMS YUNKAI ZHOU AND YOUSEF SAAD Abstract. A polynomial filtered Davidson-type algorithm is proposed for solving symmetric eigenproblems. The

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

### Charles University Faculty of Mathematics and Physics DOCTORAL THESIS. Krylov subspace approximations in linear algebraic problems

Charles University Faculty of Mathematics and Physics DOCTORAL THESIS Iveta Hnětynková Krylov subspace approximations in linear algebraic problems Department of Numerical Mathematics Supervisor: Doc. RNDr.

### Krylov Subspaces. The order-n Krylov subspace of A generated by x is

Lab 1 Krylov Subspaces Lab Objective: matrices. Use Krylov subspaces to find eigenvalues of extremely large One of the biggest difficulties in computational linear algebra is the amount of memory needed

### THE QR ALGORITHM REVISITED

THE QR ALGORITHM REVISITED DAVID S. WATKINS Abstract. The QR algorithm is still one of the most important methods for computing eigenvalues and eigenvectors of matrices. Most discussions of the QR algorithm

### Direct methods for symmetric eigenvalue problems

Direct methods for symmetric eigenvalue problems, PhD McMaster University School of Computational Engineering and Science February 4, 2008 1 Theoretical background Posing the question Perturbation theory

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

### Eigenvalue Problems and Singular Value Decomposition

Eigenvalue Problems and Singular Value Decomposition Sanzheng Qiao Department of Computing and Software McMaster University August, 2012 Outline 1 Eigenvalue Problems 2 Singular Value Decomposition 3 Software

### Approximating the matrix exponential of an advection-diffusion operator using the incomplete orthogonalization method

Approximating the matrix exponential of an advection-diffusion operator using the incomplete orthogonalization method Antti Koskela KTH Royal Institute of Technology, Lindstedtvägen 25, 10044 Stockholm,

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

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