DOCSLIB.ORG

Power Iteration Clustering

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Power Iteration Clustering Power Iteration Clustering Frank Lin [email protected] William W. Cohen [email protected] Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA 15213 USA Abstract malized similarity matrix. This embedding turns out to be very e®ective for clustering, and in comparison We present a simple and scalable graph clus- to spectral clustering, the cost (in space and time) of tering method called power iteration cluster- explicitly calculating eigenvectors is replaced by that ing (PIC). PIC ¯nds a very low-dimensional of a small number of matrix-vector multiplications. embedding of a dataset using truncated power iteration on a normalized pair-wise We test PIC on a number of di®erent types of datasets similarity matrix of the data. This em- and obtain comparable or better clusters than existing bedding turns out to be an e®ective cluster spectral methods. However, the highlights of PIC are indicator, consistently outperforming widely its simplicity and scalability | we demonstrate that used spectral methods such as NCut on real a basic implementation of this method is able to par- datasets. PIC is very fast on large datasets, tition a network dataset of 100 million edges within running over 1,000 times faster than an NCut a few seconds on a single machine, without sampling, implementation based on the state-of-the-art grouping, or other preprocessing of the data. IRAM eigenvector computation technique. This work is presented as follows: we begin by describ- ing power iteration and how its convergence property indicates cluster membership and how we can use it 1. Introduction to cluster data (Section 2). Then we show experimen- We present a simple and scalable clustering method tal results of PIC on a number of real and synthetic called power iteration clustering (hereafter PIC). In datasets and compare them to those of spectral cluster- essence, it ¯nds a very low-dimensional data embed- ing, both in cluster quality (Section 3) and scalability ding using truncated power iteration on a normalized (Section 4). Next, we survey related work (Section 5), pair-wise similarity matrix of the data points, and this di®erentiating PIC from clustering methods that em- embedding turns out to be an e®ective cluster indica- ploy matrix powering and from methods that modi¯es tor. the \traditional" spectral clustering to improve on ac- curacy or scalability. Finally, we conclude with why In presenting PIC, we make connections to and make we believe this simple and scalable clustering method comparisons with spectral clustering, a well-known, el- is very practical | easily implemented, parallelized, egant and e®ective clustering method. PIC and spec- and well-suited to very large datasets. tral clustering methods are similar in that both em- bed data points in a low-dimensional subspace derived 2. Power Iteration Clustering from the similarity matrix, and this embedding pro- vides clustering results directly or through a k-means 2.1. Notation and Background algorithm. They are di®erent in what this embedding is and how it is derived. In spectral clustering the Given a dataset X = fx1; x2; :::; xng, a similarity func- embedding is formed by the bottom eigenvectors of tion s(xi; xj) is a function where s(xi; xj) = s(xj; xi) the Laplacian of an similarity matrix. In PIC the em- and s ¸ 0 if i 6= j, and following previous work bedding is an approximation to a eigenvalue-weighted (Shi & Malik, 2000), s = 0 if i = j. An a±nity matrix n£n linear combination of all the eigenvectors of an nor- A 2 R is de¯ned by Aij = s(xi; xj). The de- gree matrixPD associated with A is a diagonal matrix th Appearing in Proceedings of the 27 International Confer- with dii = j Aij: A normalized a±nity matrix W is ence on Machine Learning, Haifa, Israel, 2010. Copyright de¯ned as D¡1A. Below we will view W interchange- 2010 by the author(s)/owner(s). ably as a matrix, and an undirected graph with nodes Power Iteration Clustering (a) 3Circles PIC result (b) t = 50, scale = 0:01708 (c) t = 400, scale = 0:01066 (d) t = 1000, scale = 0:00786 Figure 1. Clustering result and the embedding provided by vt for the 3Circles dataset. In (b) through (d), the value of each component of vt is plotted against its index. Plots (b) through (d) are re-scaled so the largest value is always at the very top and the minimum value at the very bottom, and scale is the maximum value minus the minimum value. X and the edge from xi to xj weighted by s(xi; xj). PI during the convergence process are extremely inter- esting. This is best illustrated by example. Figure 1(a) W is closely related to the normalized random-walk 2 shows a simple dataset|i.e., each x³i is a point´ in R Laplacian matrix L of Meil¸aand Shi (2001), de¯ned ¡jjx ¡x jj2 ¡1 i j as L = I ¡D A. L has a number of useful properties: space, with s(xi; xj) de¯ned as exp 2σ2 . Fig- most importantly to this paper, the second-smallest ures 1(b) to 1(d) shows vt at various values of t, each t eigenvector of L (the eigenvector with the second- illustrated by plotting v (i) for each xi. For purposes smallest eigenvalue) de¯nes a partition of the graph of visualization, the instances x in the \bulls-eye" are W that approximately maximizes the Normalized Cut ordered ¯rst, followed by instances in the central ring, criteria. More generally, the k smallest eigenvectors then by those in the outer ring. We have also re-scaled de¯ne a subspace where the clusters are often well- the plots to span the same vertical distance|the scale separated. Thus the second-smallest, third-smallest, is shown below each plot; as we can see the di®erences ..., kth smallest eigenvectors of L are often well-suited between the distinct values of the vt's become smaller for clustering the graph W into k components. as t increases. Qualitatively, PI ¯rst converges locally within a cluster: by t = 400 the points from each clus- Note that the k smallest eigenvectors of L are also the ter have approximately the same value in vt, leading to k largest eigenvectors of W . One simple method for three disjoint line segments in the visualization. Then, computing the largest eigenvector of a matrix is power after local convergence, the line segments draw closer iteration (PI), also called the power method. PI is an together more slowly. iterative method, which starts with an arbitrary vector v0 6= 0 and repeatedly performs the update 2.3. Further Analysis of PI's Convergence vt+1 = cW vt Let us assume that W has eigenvectors e1;:::; en where c is a normalizing constant to keep vt from get- with eigenvalues ¸1; : : : ; ¸n, where ¸1 = 1 and e1 t is constant. Given W , we de¯ne the spectral repre- ting too large (here c = 1=jjW v jj1). Unfortunately, PI does not seem to be particularly useful in this setting. sentation of a value a 2 f1; : : : ; ng to be the vector While the k smallest eigenvectors of L (equivalently, sa = he1(a);:::; ek(a)i, and de¯ne the spectral dis- tance between a and b as the largest eigenvectors of W ) are in general interest- v u ing (Meil¸a& Shi, 2001), the very smallest eigenvector uXk t 2 of L (the largest of W ) is not|in fact, it is a constant spec(a; b) ´ jjsa ¡ sbjj2 = (ei(a) ¡ ei(b)) vector: since the sum of each row of W is 1, a constant i=2 vector transformed by W will never change in direc- tion or magnitude, and is hence a constant eigenvector Usually in spectral clustering it is assumed that the eigenvalues ¸2; : : : ; ¸k are larger than the remaining of W with eigenvalue ¸1 = 1. ones. We de¯ne W to have an (®; ¯)-eigengap between the kth and (k + 1)th eigenvector if ¸ =¸ ¸ ® and 2.2. Power Iteration Convergence k 2 ¸k+1=¸2 · ¯. We will also say that W is γe-bounded The central observation of this paper is that, while if 8i; a; b 2 f1; : : : ; ng, jei(a) ¡ ei(b)j · γe; note that t running PI to convergence on W does not lead to an every W is γe-bounded for some γe. Letting v be interesting result, the intermediate vectors obtained by the result of of the tth iteration of PI, we de¯ne the Power Iteration Clustering (t; v0)-distance between a and b as Note that the size of the radius is of no importance in clustering, since most clustering methods (e.g., k- t 0 t t pic (v ; a; b) ´ jv (a) ¡ v (b)j means) are based on the relative distance between points, not the absolute distance. Furthermore, if the For brevity, we will usually drop v0 from our notation c 's are not too large or too small, the distorting fac- (e.g., writing pict(a; b)). Our goal is to relate pict(a; b) i tors are dominated by the factors of (¸ =¸ )t, which and spec(a; b). Let us ¯rst de¯ne i 2 implies that the importance of the dimension associ- Xk ated with the i-th eigenvector is downweighted by (a t t signal (a; b) ´ [ei(a) ¡ ei(b)]ci¸i power of) its eigenvalue; in Section 3.2 we will show i=2 that experimentally, this weighting scheme often im- Xn proves performance for spectral methods.
Load more

Recommended publications
  • Efficient Algorithms for High-Dimensional Eigenvalue
    Efficient Algorithms for High-dimensional Eigenvalue Problems by Zhe Wang Department of Mathematics Duke University Date: Approved: Jianfeng Lu, Advisor Xiuyuan Cheng Jonathon Mattingly Weitao Yang Dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Mathematics in the Graduate School of Duke University 2020 ABSTRACT Efficient Algorithms for High-dimensional Eigenvalue Problems by Zhe Wang Department of Mathematics Duke University Date: Approved: Jianfeng Lu, Advisor Xiuyuan Cheng Jonathon Mattingly Weitao Yang An abstract of a dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Mathematics in the Graduate School of Duke University 2020 Copyright © 2020 by Zhe Wang All rights reserved Abstract The eigenvalue problem is a traditional mathematical problem and has a wide appli- cations. Although there are many algorithms and theories, it is still challenging to solve the leading eigenvalue problem of extreme high dimension. Full configuration interaction (FCI) problem in quantum chemistry is such a problem. This thesis tries to understand some existing algorithms of FCI problem and propose new efficient algorithms for the high-dimensional eigenvalue problem. In more details, we first es- tablish a general framework of inexact power iteration and establish the convergence theorem of full configuration interaction quantum Monte Carlo (FCIQMC) and fast randomized iteration (FRI). Second, we reformulate the leading eigenvalue problem as an optimization problem, then compare the show the convergence of several coor- dinate descent methods (CDM) to solve the leading eigenvalue problem. Third, we propose a new efficient algorithm named Coordinate descent FCI (CDFCI) based on coordinate descent methods to solve the FCI problem, which produces some state-of- the-art results.
    [Show full text]
  • Implicitly Restarted Arnoldi/Lanczos Methods for Large Scale Eigenvalue Calculations
    https://ntrs.nasa.gov/search.jsp?R=19960048075 2020-06-16T03:31:45+00:00Z NASA Contractor Report 198342 /" ICASE Report No. 96-40 J ICA IMPLICITLY RESTARTED ARNOLDI/LANCZOS METHODS FOR LARGE SCALE EIGENVALUE CALCULATIONS Danny C. Sorensen NASA Contract No. NASI-19480 May 1996 Institute for Computer Applications in Science and Engineering NASA Langley Research Center Hampton, VA 23681-0001 Operated by Universities Space Research Association National Aeronautics and Space Administration Langley Research Center Hampton, Virginia 23681-0001 IMPLICITLY RESTARTED ARNOLDI/LANCZOS METHODS FOR LARGE SCALE EIGENVALUE CALCULATIONS Danny C. Sorensen 1 Department of Computational and Applied Mathematics Rice University Houston, TX 77251 sorensen@rice, edu ABSTRACT Eigenvalues and eigenfunctions of linear operators are important to many areas of ap- plied mathematics. The ability to approximate these quantities numerically is becoming increasingly important in a wide variety of applications. This increasing demand has fu- eled interest in the development of new methods and software for the numerical solution of large-scale algebraic eigenvalue problems. In turn, the existence of these new methods and software, along with the dramatically increased computational capabilities now avail- able, has enabled the solution of problems that would not even have been posed five or ten years ago. Until very recently, software for large-scale nonsymmetric problems was virtually non-existent. Fortunately, the situation is improving rapidly. The purpose of this article is to provide an overview of the numerical solution of large- scale algebraic eigenvalue problems. The focus will be on a class of methods called Krylov subspace projection methods. The well-known Lanczos method is the premier member of this class.
    [Show full text]
  • Accelerated Stochastic Power Iteration
    Accelerated Stochastic Power Iteration CHRISTOPHER DE SAy BRYAN HEy IOANNIS MITLIAGKASy CHRISTOPHER RE´ y PENG XU∗ yDepartment of Computer Science, Stanford University ∗Institute for Computational and Mathematical Engineering, Stanford University cdesa,bryanhe,[email protected], [email protected], [email protected] July 11, 2017 Abstract Principal component analysis (PCA) is one of the most powerful tools in machine learning. The simplest method for PCA, the power iteration, requires O(1=∆) full-data passes to recover the principal component of a matrix withp eigen-gap ∆. Lanczos, a significantly more complex method, achieves an accelerated rate of O(1= ∆) passes. Modern applications, however, motivate methods that only ingest a subset of available data, known as the stochastic setting. In the online stochastic setting, simple 2 2 algorithms like Oja’s iteration achieve the optimal sample complexity O(σ =p∆ ). Unfortunately, they are fully sequential, and also require O(σ2=∆2) iterations, far from the O(1= ∆) rate of Lanczos. We propose a simple variant of the power iteration with an added momentum term, that achieves both the optimal sample and iteration complexity.p In the full-pass setting, standard analysis shows that momentum achieves the accelerated rate, O(1= ∆). We demonstrate empirically that naively applying momentum to a stochastic method, does not result in acceleration. We perform a novel, tight variance analysis that reveals the “breaking-point variance” beyond which this acceleration does not occur. By combining this insight with modern variance reduction techniques, we construct stochastic PCAp algorithms, for the online and offline setting, that achieve an accelerated iteration complexity O(1= ∆).
    [Show full text]
  • Numerical Linear Algebra Program Lecture 4 Basic Methods For
    Program Lecture 4 Numerical Linear Algebra • Basic methods for eigenproblems. Basic iterative methods • Power method • Shift-and-invert Power method • QR algorithm • Basic iterative methods for linear systems • Richardson’s method • Jacobi, Gauss-Seidel and SOR • Iterative refinement Gerard Sleijpen and Martin van Gijzen • Steepest decent and the Minimal residual method October 5, 2016 1 October 5, 2016 2 National Master Course National Master Course Delft University of Technology Basic methods for eigenproblems The Power method The eigenvalue problem The Power method is the classical method to compute in modulus largest eigenvalue and associated eigenvector of a Av = λv matrix. can not be solved in a direct way for problems of order > 4, since Multiplying with a matrix amplifies strongest the eigendirection the eigenvalues are the roots of the characteristic equation corresponding to the in modulus largest eigenvalues. det(A − λI) = 0. Successively multiplying and scaling (to avoid overflow or underflow) yields a vector in which the direction of the largest Today we will discuss two iterative methods for solving the eigenvector becomes more and more dominant. eigenproblem. October 5, 2016 3 October 5, 2016 4 National Master Course National Master Course Algorithm Convergence (1) The Power method for an n × n matrix A. Let the n eigenvalues λi with eigenvectors vi, Avi = λivi, be n ordered such that |λ1| ≥ |λ2|≥ . ≥ |λn|. u0 ∈ C is given • Assume the eigenvectors v ,..., vn form a basis. for k = 1, 2, ... 1 • Assume |λ1| > |λ2|. uk = Auk−1 Each arbitrary starting vector u0 can be written as: uk = uk/kukk2 e(k) ∗ λ = uk−1uk u0 = α1v1 + α2v2 + ..
    [Show full text]
  • Arxiv:1105.1185V1 [Math.NA] 5 May 2011 Ento 2.2
    ITERATIVE METHODS FOR COMPUTING EIGENVALUES AND EIGENVECTORS MAYSUM PANJU Abstract. We examine some numerical iterative methods for computing the eigenvalues and eigenvectors of real matrices. The five methods examined here range from the simple power iteration method to the more complicated QR iteration method. The derivations, procedure, and advantages of each method are briefly discussed. 1. Introduction Eigenvalues and eigenvectors play an important part in the applications of linear algebra. The naive method of finding the eigenvalues of a matrix involves finding the roots of the characteristic polynomial of the matrix. In industrial sized matrices, however, this method is not feasible, and the eigenvalues must be obtained by other means. Fortunately, there exist several other techniques for finding eigenvalues and eigenvectors of a matrix, some of which fall under the realm of iterative methods. These methods work by repeatedly refining approximations to the eigenvectors or eigenvalues, and can be terminated whenever the approximations reach a suitable degree of accuracy. Iterative methods form the basis of much of modern day eigenvalue computation. In this paper, we outline five such iterative methods, and summarize their derivations, procedures, and advantages. The methods to be examined are the power iteration method, the shifted inverse iteration method, the Rayleigh quotient method, the simultaneous iteration method, and the QR method. This paper is meant to be a survey over existing algorithms for the eigenvalue computation problem. Section 2 of this paper provides a brief review of some of the linear algebra background required to understand the concepts that are discussed. In section 3, the iterative methods are each presented, in order of complexity, and are studied in brief detail.
    [Show full text]
  • Lecture 12 — February 26 and 28 12.1 Introduction
    EE 381V: Large Scale Learning Spring 2013 Lecture 12 | February 26 and 28 Lecturer: Caramanis & Sanghavi Scribe: Karthikeyan Shanmugam and Natalia Arzeno 12.1 Introduction In this lecture, we focus on algorithms that compute the eigenvalues and eigenvectors of a real symmetric matrix. Particularly, we are interested in finding the largest and smallest eigenvalues and the corresponding eigenvectors. We study two methods: Power method and the Lanczos iteration. The first involves multiplying the symmetric matrix by a randomly chosen vector, and iteratively normalizing and multiplying the matrix by the normalized vector from the previous step. The convergence is geometric, i.e. the `1 distance between the true and the computed largest eigenvalue at the end of every step falls geometrically in the number of iterations and the rate depends on the ratio between the second largest and the largest eigenvalue. Some generalizations of the power method to compute the largest k eigenvalues and the eigenvectors will be discussed. The second method (Lanczos iteration) terminates in n iterations where each iteration in- volves estimating the largest (smallest) eigenvalue by maximizing (minimizing) the Rayleigh coefficient over vectors drawn from a suitable subspace. At each iteration, the dimension of the subspace involved in the optimization increases by 1. The sequence of subspaces used are Krylov subspaces associated with a random initial vector. We study the relation between Krylov subspaces and tri-diagonalization of a real symmetric matrix. Using this connection, we show that an estimate of the extreme eigenvalues can be computed at each iteration which involves eigen-decomposition of a tri-diagonal matrix.
    [Show full text]
  • AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 16: Rayleigh Quotient Iteration
    AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 16: Rayleigh Quotient Iteration Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 10 Solving Eigenvalue Problems All eigenvalue solvers must be iterative Iterative algorithms have multiple facets: 1 Basic idea behind the algorithms 2 Convergence and techniques to speed-up convergence 3 Efficiency of implementation 4 Termination criteria We will focus on first two aspects Xiangmin Jiao Numerical Analysis I 2 / 10 Simplification: Real Symmetric Matrices We will consider eigenvalue problems for real symmetric matrices, i.e. T m×m m A = A 2 R , and Ax = λx for x 2 R p ∗ T T I Note: x = x , and kxk = x x A has real eigenvalues λ1,λ2, ::: , λm and orthonormal eigenvectors q1, q2, ::: , qm, where kqj k = 1 Eigenvalues are often also ordered in a particular way (e.g., ordered from large to small in magnitude) In addition, we focus on symmetric tridiagonal form I Why? Because phase 1 of two-phase algorithm reduces matrix into tridiagonal form Xiangmin Jiao Numerical Analysis I 3 / 10 Rayleigh Quotient m The Rayleigh quotient of x 2 R is the scalar xT Ax r(x) = xT x For an eigenvector x, its Rayleigh quotient is r(x) = xT λx=xT x = λ, the corresponding eigenvalue of x For general x, r(x) = α that minimizes kAx − αxk2. 2 x is eigenvector of A() rr(x) = x T x (Ax − r(x)x) = 0 with x 6= 0 r(x) is smooth and rr(qj ) = 0 for any j, and therefore is quadratically accurate: 2 r(x) − r(qJ ) = O(kx − qJ k ) as x ! qJ for some J Xiangmin Jiao Numerical Analysis I 4 / 10 Power
    [Show full text]
  • Math 504 (Fall 2011)
    Instructor: Emre Mengi Math 504 (Fall 2011) Study Guide for Weeks 11-14 This homework concerns the following topics. • Basic definitions and facts about eigenvalues and eigenvectors (Trefethen&Bau, Lecture 24) • Similarity transformations (Trefethen&Bau, Lecture 24) • Power, inverse and Rayleigh iterations (Trefethen&Bau, Lecture 27) • QR algorithm with and without shifts (Trefethen&Bau, Lecture 28&29) • Simultaneous power iteration and its equivalence with the QR algorithm (Trefethen&Bau, Lectures 28&29) • The implicit QR algorithm • The Arnoldi Iteration (Trefethen&Bau, Lectures 33&34) • GMRES (Trefethen&Bau, Lecture 35) Homework 5 (Assigned on Dec 26th, Mon; Due on Jan 10th, Tue by 11:00) Please turn in the solutions only to the questions marked with (*). The rest is to practice on your own. Attach Matlab output, m-files, print-outs whenever they are necessary. The Dec 10, 11:00 deadline is tight. 1. (*) Consider the matrices 2 2 4 −5 3 1 7 A = and A = 0 1 3 1 3 5 2 4 5 0 0 1 (a) Find the eigenvalues of A1 and the eigenspace associated with each of its eigenvalues. (b) Find the eigenvalues of A2 together with their algebraic and geometric multiplicities. (c) Find a Schur factorization for A1. (d) Let v0 and v1 be two linearly independent eigenvectors of A1. Suppose also that fqkg denotes the sequence of vectors generated by the inverse iteration with shift σ = 2 and 2 starting with an initial vector q0 = α0v0 + α1v1 2 C where α0; α1 are nonzero scalars. Determine the subspace that spanfqkg is approaching as k ! 1.
    [Show full text]
  • Comparison of Numerical Methods and Open-Source Libraries for Eigenvalue Analysis of Large-Scale Power Systems
    applied sciences Article Comparison of Numerical Methods and Open-Source Libraries for Eigenvalue Analysis of Large-Scale Power Systems Georgios Tzounas , Ioannis Dassios * , Muyang Liu and Federico Milano School of Electrical and Electronic Engineering, University College Dublin, Belfield, Dublin 4, Ireland; [email protected] (G.T.); [email protected] (M.L.); [email protected] (F.M.) * Correspondence: [email protected] Received: 30 September 2020; Accepted: 24 October 2020; Published: 28 October 2020 Abstract: This paper discusses the numerical solution of the generalized non-Hermitian eigenvalue problem. It provides a comprehensive comparison of existing algorithms, as well as of available free and open-source software tools, which are suitable for the solution of the eigenvalue problems that arise in the stability analysis of electric power systems. The paper focuses, in particular, on methods and software libraries that are able to handle the large-scale, non-symmetric matrices that arise in power system eigenvalue problems. These kinds of eigenvalue problems are particularly difficult for most numerical methods to handle. Thus, a review and fair comparison of existing algorithms and software tools is a valuable contribution for researchers and practitioners that are interested in power system dynamic analysis. The scalability and performance of the algorithms and libraries are duly discussed through case studies based on real-world electrical power networks. These are a model of the All-Island Irish Transmission System with 8640 variables; and, a model of the European Network of Transmission System Operators for Electricity, with 146,164 variables. Keywords: eigenvalue analysis; large non-Hermitian matrices; numerical methods; open-source libraries 1.
    [Show full text]
  • Eigenvalue Problems Last Time …
    Eigenvalue Problems Last Time … Social Network Graphs Betweenness Girvan-Newman Algorithm Graph Laplacian Spectral Bisection 휆2, 푤2 Today … Small deviation into eigenvalue problems … Formulation Standard eigenvalue problem: Given a 푛 × 푛 matrix 퐴, find scalar 휆 and a nonzero vector 푥 such that 퐴푥 = 휆푥 휆 is a eigenvalue, and 푥 is the corresponding eigenvector Spectrum = 휆(퐴) = set of eigenvalues of 퐴 Spectral radius = 퐴 = max 휆 ∶ 휆 ∈ 휆 퐴 Characteristic Polynomial Equation 퐴푥 = 휆푥 is equivalent to 퐴 − 휆퐼 푥 = 0 Eigenvalues of 퐴 are roots of the characteristic polynomial det 퐴 − 휆퐼 = 0 The characteristic polynomial is a powerful theoretical tool but usually not useful computationally Considerations Properties of eigenvalue problem affecting choice of algorithm Are all eigenvalues needed, or only a few? Are only eigenvalues needed, or are corresponding eigenvectors also needed? Is matrix real or complex? Is matrix relatively small and dense, or large and sparse? Does matrix have any special properties, such as symmetry? Problem Transformations Shift: If 퐴푥 = 휆푥 and is any scalar, then 퐴 − 퐼 푥 = 휆 − 푥 1 Inversion: If 퐴 is nonsingular and 퐴푥 = 휆푥, then 휆 ≠ 0 and 퐴−1푥 = 푥 휆 Powers: If 퐴푥 = 휆푥, then 퐴푘푥 = 휆푘푥 Polynomial: If 퐴푥 = 휆푥 and 푝(푡) is a polynomial, then 푝 퐴 푥 = 푝 휆 푥 Similarity Transforms 퐵 is similar to 퐴 if there is a nonsingular matrix 푇, such that 퐵 = 푇−1퐴푇 Then, 퐵푦 = 휆푦 ⇒ 푇−1퐴푇푦 = 휆푦 ⇒ 퐴 푇푦 = 휆 푇푦 Similarity transformations preserve eigenvalues and eigenvectors are easily recovered Diagonal form Eigenvalues
    [Show full text]
  • Parallel Numerical Algorithms Chapter 5 – Eigenvalue Problems Section 5.2 – Eigenvalue Computation
    Basics Power Iteration QR Iteration Krylov Methods Other Methods Parallel Numerical Algorithms Chapter 5 – Eigenvalue Problems Section 5.2 – Eigenvalue Computation Michael T. Heath and Edgar Solomonik Department of Computer Science University of Illinois at Urbana-Champaign CS 554 / CSE 512 Michael T. Heath and Edgar Solomonik Parallel Numerical Algorithms 1 / 42 Basics Power Iteration QR Iteration Krylov Methods Other Methods Outline 1 Basics 2 Power Iteration 3 QR Iteration 4 Krylov Methods 5 Other Methods Michael T. Heath and Edgar Solomonik Parallel Numerical Algorithms 2 / 42 Basics Power Iteration Definitions QR Iteration Transformations Krylov Methods Parallel Algorithms Other Methods Eigenvalues and Eigenvectors Given n × n matrix A, find scalar λ and nonzero vector x such that Ax = λx λ is eigenvalue and x is corresponding eigenvector A always has n eigenvalues, but they may be neither real nor distinct May need to compute only one or few eigenvalues, or all n eigenvalues May or may not need corresponding eigenvectors Michael T. Heath and Edgar Solomonik Parallel Numerical Algorithms 3 / 42 Basics Power Iteration Definitions QR Iteration Transformations Krylov Methods Parallel Algorithms Other Methods Problem Transformations Shift : for scalar σ, eigenvalues of A − σI are eigenvalues of A shifted by σ, λi − σ Inversion : for nonsingular A, eigenvalues of A−1 are reciprocals of eigenvalues of A, 1/λi Powers : for integer k > 0, eigenvalues of Ak are kth k powers of eigenvalues of A, λi Polynomial : for polynomial p(t), eigenvalues
    [Show full text]
  • Dynamical Systems and Non-Hermitian Iterative Eigensolvers∗
    SIAM J. NUMER. ANAL. c 2009 Society for Industrial and Applied Mathematics Vol. 47, No. 2, pp. 1445–1473 DYNAMICAL SYSTEMS AND NON-HERMITIAN ITERATIVE EIGENSOLVERS∗ MARK EMBREE† AND RICHARD B. LEHOUCQ‡ Abstract. Simple preconditioned iterations can provide an efficient alternative to more elabo- rate eigenvalue algorithms. We observe that these simple methods can be viewed as forward Euler discretizations of well-known autonomous differential equations that enjoy appealing geometric prop- erties. This connection facilitates novel results describing convergence of a class of preconditioned eigensolvers to the leftmost eigenvalue, provides insight into the role of orthogonality and biorthog- onality, and suggests the development of new methods and analyses based on more sophisticated discretizations. These results also highlight the effect of preconditioning on the convergence and stability of the continuous-time system and its discretization. Key words. eigenvalues, dynamical systems, inverse iteration, preconditioned eigensolvers, geometric invariants AMS subject classifications. 15A18, 37C10, 65F15, 65L20 DOI. 10.1137/07070187X 1. Introduction. Suppose we seek a small number of eigenvalues (and the asso- ciated eigenspace) of the non-Hermitian matrix A ∈ Cn×n, having at our disposal a n×n n nonsingular matrix N ∈ C that approximates A. Given a starting vector p0 ∈ C , compute −1 (1.1) pj+1 = pj + N (θj − A)pj, where θj − A is shorthand for Iθj − A,and (Apj, pj) θj = (pj, pj) for some inner product (·, ·). Knyazev, Neymeyr, and others have studied this iteration for Hermitian positive definite A; see [21, 22] and references therein for convergence analysis and numerical experiments. Clearly the choice of N will influence the behavior of this iteration.
    [Show full text]