DOCSLIB.ORG

New Algorithms for the Iterative Refinement of Estimates of Invariant

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
New Algorithms for the Iterative Refinement of Estimates of Invariant Future Generation Computer Systems 19 (2003) 1231–1242 New algorithms for the iterative refinement of estimates of invariant subspaces K. Hüper a,∗, P. Van Dooren b a Department of Mathematics, Würzburg University, Am Hubland, D-97074 Würzburg, Germany b Department of Mathematical Engineering, Université Catholique de Louvain, B-1348 Louvain-la-Neuve, Belgium Abstract New methods for refining estimates of invariant subspaces of a non-symmetric matrix are presented. We use global analysis to show local quadratic convergence of our method under mild conditions on the spectrum of the matrix. © 2003 Elsevier B.V. All rights reserved. Keywords: Non-symmetric eigenvalue problem; Invariant subspace; Riccati equations; Sylvester equations; Global analysis; Local quadratic convergence 1. Refining estimates of invariant subspaces mations, which display local quadratic convergence to an upper block triangular form. The formulation The computation of invariant subspaces has re- of the algorithms and their convergence analysis are ceived a lot of attention in the numerical linear valid for different diagonal block sizes, as long as algebra literature. In this paper we present a new these blocks have disjoint spectrum, i.e., as long as algorithm that borrows ideas of two well established the corresponding invariant subspaces are well de- methods: the Riccati-/Sylvester-like iteration, and fined. An important special case is the computation the Jacobi-like iteration. Even though these tech- of the real Schur form, which groups complex con- niques are traditionally associated with very different jugate eigenvalues in 2 × 2 diagonal blocks. It can be eigenvalue algorithms, the algorithm that we de- obtained by our method, provided these eigenvalue rive in this paper makes a nice link between them. pairs are disjoint. We always work over R, but the Our method refines estimates of invariant subspaces generalization to C is immediate and we state with- of real non-symmetric matrices which are already out proof that all the results from this paper directly “nearly” upper block triangular, but not in condensed apply to the complex case. The outline of this paper form. It uses the Lie group of real unipotent lower is as follows. After introducing some notation we block triangular (n × n)-matrices as similarities on a will focus on an algorithm consisting of similarity nearly upper block triangular matrix. We develop a transformations by unipotent lower block triangular class of algorithms based on such similarity transfor- matrices. In order to improve numerical accuracy, we then use orthogonal transformations instead. The ∗ Corresponding author. convergence properties of the orthogonal algorithm is E-mail addresses: [email protected] shown to be an immediate consequence of the former (K. Hüper), [email protected] (P. Van Dooren). one. 0167-739X/$ – see front matter © 2003 Elsevier B.V. All rights reserved. doi:10.1016/S0167-739X(03)00048-7 1232 K. Hüper, P. Van Dooren / Future Generation Computer Systems 19 (2003) 1231–1242 2. Lower unipotent block triangular l ∈ ln and for arbitrary a ∈ V transformations Dσ(I, A) · (l, a) = lA − Al + a. (6) n×n Let V ⊂ Rn×n denote the vector space of real upper We show that for any h ∈ R the linear system (n × n) block triangular -matrices lA − Al + a = h (7) n×n V :={X ∈ R |Xij = 0ni×nj ∀1 ≤ j<i≤ r} (1) has a solution in terms of l ∈ ln and a ∈ V .By ni×ni with square diagonal sub-blocks Xii ∈ R , i = decomposing into upper block triangular and strictly r ,...,r n = n L h = h . + h . 1 and i=1 i . Let n denote the Lie lower block triangular parts upp bl str low bl group of real unipotent lower block triangular (n × and because a ∈ V is already upper block triangular it n)-matrices partitioned conformably with V : remains to show that the strictly lower block triangular part of (7) L ={X ∈ Rn×n|X = I ∀ ≤ k ≤ r, X n : kk nk 1 ij (lA − Al)str.low.bl. = hstr.low.bl. (8) = 0ni×nj ∀1 ≤ i<j≤ r}. (2) can be solved for l ∈ ln. We partition into “blocks of Given a real upper block triangular matrix A ∈ V ,we sub-blocks” consider the orbit MLn of A under similarity action σ L l 0 A A of n: l = 11 ,A= 11 12 , l l A n×n 21 22 0 22 σ : Ln × V → R , (h ) (L, X) → σ(L, X) = −1, 11 str.low.bl. 0 LXL (3) hstr.low.bl. = , h (h )str.low.bl. n×n −1 21 22 MLn :={X ∈ R |X = LAL ,L∈ Ln}. (4) n ×n A ∈ R 1 1 l = accordingly, i.e., 11 and 11 0n1 as be- The following (generic) assumption will be crucial in l l fore. Thus one has to solve for 21 and 22 . Considering our analysis. the (21)-block of (8) gives l A − A l = h . Assumption 2.1. Let A ∈ V , then its diagonal 21 11 22 21 21 (9) A i = ,... ,r sub-blocks ii, 1 have mutually disjoint By Assumption 2.1, the Sylvester equation (9) has spectra. l a unique solution 21 . In order to prove the result, we proceed analogously with the (22 )-block of (8), Our first result shows that any matrix lying in a i.e. l A − A l =−l A + (h )str.low.bl., and sufficiently small neighborhood of A which fulfils 22 22 22 22 21 12 22 continue inductively (l := l , A := A , etc.) by L 22 22 Assumption 2.1 is an element of an n-orbit of some partitioning the remaining diagonal blocks A , i = B ii other matrix, say , which also fulfils Assumption 2.1. 2,... ,r into smaller blocks of sub-blocks. ᮀ We first show that under Assumption 2.1 the smooth σ mapping satisfies the following lemma. Let A ∈ Rn×n fulfil Assumption 2.1, then the next lemma characterizes the Ln-orbit of the matrix A. Lemma 2.1. The mapping σ defined by (3) is locally surjective around (I, A). n×n −1 Lemma 2.2. MLn :={X ∈ R |X = LAL ,L ∈ Ln} is diffeomorphic to Ln. Proof. Let ln denote the Lie algebra of real lower block triangular (n × n)-matrices Proof. The set MLn is a smooth manifold because n×n it is the orbit of a semi-algebraic group action, see ln :={X ∈ R |X = 0n ∀1 ≤ k ≤ r, X kk k ij [10, p. 353]. We will show that the stabilizer subgroup = ∀ ≤ i<j≤ r}. 0ni×nj 1 (5) stab(A) ⊂ Ln equals the identity {I} in Ln, i.e. that the only solution in terms of L ∈ Ln for It is sufficient to show that the derivative Dσ(I, A) : n×n −1 ln × V → R is locally surjective. For arbitrary LAL = A ⇔ [L, A] = 0 (10) K. Hüper, P. Van Dooren / Future Generation Computer Systems 19 (2003) 1231–1242 1233 . is L = I. Partition L and A conformably as such that (for nα=n1 +···+nα−1): In 0 A A I L = 1 ,A= 11 12 , nα 00 L L 0 A (α) (α)−1 21 22 22 L XL = 0 Inα 0 X P(α) I where L ∈ Ln−n . The (21)-block of [L, A] = 0 0 n¯ α 22 1 L A − A L = L = yields 21 11 22 21 0, implying 21 0by In 00 Assumption 2.1 on the spectrum of A. By recursive α × 0 In 0 = Z, (15) application of this argument to the (22 )-block of (10) α −P(α) I the result follows. Therefore, L = I implies stab(A) = 0 n¯ α {I} M =∼ L / (A) = L ᮀ and hence Ln n stab n. where Z is of the form Z1,1 ··· ··· ··· ··· ··· Z1,r . 3. Algorithms, main ideas . .. . .Z. α−1,α−1 The algorithms presented in this section for the . Z = . , iterative refinement of invariant subspaces of non- . .Zα,α . symmetric real matrices are driven by the following . . 0 Zα+ ,α+ . ideas. Let the matrix A ∈ V satisfy Assumption 2.1 1 1 . .. and consider an X ∈ MLn sufficiently close to A, i.e., . Zr, ··· Zr,α− 0 Zr,α+ ··· Zr,r X − A <∆λ, (11) 1 1 1 (16) where Z := tr(ZZ ) and ∆λ denotes the absolute Z value of the smallest difference of any eigenvalues of i.e., the blocks below the diagonal block α,α are zero. two different diagonal sub-blocks of A. Obviously, For convenience we first assume without loss of gen- erality that r = 2. In this case we want to solve the In span 1 (12) (21)-block of 0(n2+···+nr)×n1 I X X I 0 · 11 12 · 0 is then a good approximation of an n1-dimensional (1) (1) P I X21 X22 −P I right invariant subspace of X, because by assumption Z Z (11) on X, the blocks Xji are small for all j>i. = 11 12 (α) Z (17) Consider an L ∈ Ln of the following partitioned 0 22 form: ( ) in terms of P 1 , i.e., we want to solve the matrix I n1 valued algebraic Riccati equation . .. (1) (1) (1) (1) P X11 + X21 − P X12P − X22P = 0. (18) I nα L(α) = . , Since (18) is in general not solvable in closed form, : (α+ ,α) . (13) p 1 . several authors have suggested different approaches to . . .. solve (18) iteratively; see [4] for Newton-type itera- p(r,α) I tions on the non-compact Stiefel manifold and [8,17] nr for iterations like where empty blocks are considered to be zero. We P X − X P = P X P − X ,P= .
Load more

Recommended publications
  • The Generalized Triangular Decomposition
    MATHEMATICS OF COMPUTATION Volume 77, Number 262, April 2008, Pages 1037–1056 S 0025-5718(07)02014-5 Article electronically published on October 1, 2007 THE GENERALIZED TRIANGULAR DECOMPOSITION YI JIANG, WILLIAM W. HAGER, AND JIAN LI Abstract. Given a complex matrix H, we consider the decomposition H = QRP∗,whereR is upper triangular and Q and P have orthonormal columns. Special instances of this decomposition include the singular value decompo- sition (SVD) and the Schur decomposition where R is an upper triangular matrix with the eigenvalues of H on the diagonal. We show that any diag- onal for R can be achieved that satisfies Weyl’s multiplicative majorization conditions: k k K K |ri|≤ σi, 1 ≤ k<K, |ri| = σi, i=1 i=1 i=1 i=1 where K is the rank of H, σi is the i-th largest singular value of H,andri is the i-th largest (in magnitude) diagonal element of R. Given a vector r which satisfies Weyl’s conditions, we call the decomposition H = QRP∗,whereR is upper triangular with prescribed diagonal r, the generalized triangular decom- position (GTD). A direct (nonrecursive) algorithm is developed for computing the GTD. This algorithm starts with the SVD and applies a series of permu- tations and Givens rotations to obtain the GTD. The numerical stability of the GTD update step is established. The GTD can be used to optimize the power utilization of a communication channel, while taking into account qual- ity of service requirements for subchannels. Another application of the GTD is to inverse eigenvalue problems where the goal is to construct matrices with prescribed eigenvalues and singular values.
    [Show full text]
  • CSE 275 Matrix Computation
    CSE 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 13 1 / 22 Overview Eigenvalue problem Schur decomposition Eigenvalue algorithms 2 / 22 Reading Chapter 24 of Numerical Linear Algebra by Llyod Trefethen and David Bau Chapter 7 of Matrix Computations by Gene Golub and Charles Van Loan 3 / 22 Eigenvalues and eigenvectors Let A 2 Cm×m be a square matrix, a nonzero x 2 Cm is an eigenvector of A, and λ 2 C is its corresponding eigenvalue if Ax = λx Idea: the action of a matrix A on a subspace S 2 Cm may sometimes mimic scalar multiplication When it happens, the special subspace S is called an eigenspace, and any nonzero x 2 S is an eigenvector The set of all eigenvalues of a matrix A is the spectrum of A, a subset of C denoted by Λ(A) 4 / 22 Eigenvalues and eigenvectors (cont'd) Ax = λx Algorithmically: simplify solutions of certain problems by reducing a coupled system to a collection of scalar problems Physically: give insight into the behavior of evolving systems governed by linear equations, e.g., resonance (of musical instruments when struck or plucked or bowed), stability (of fluid flows with small perturbations) 5 / 22 Eigendecomposition An eigendecomposition (eigenvalue decomposition) of a square matrix A is a factorization A = X ΛX −1 where X is a nonsingular and Λ is diagonal Equivalently, AX = X Λ 2 3 λ1 6 λ2 7 A x x ··· x = x x ··· x 6 7 1 2 m 1 2 m 6 .
    [Show full text]
  • The Schur Decomposition Week 5 UCSB 2014
    Math 108B Professor: Padraic Bartlett Lecture 5: The Schur Decomposition Week 5 UCSB 2014 Repeatedly through the past three weeks, we have taken some matrix A and written A in the form A = UBU −1; where B was a diagonal matrix, and U was a change-of-basis matrix. However, on HW #2, we saw that this was not always possible: in particular, you proved 1 1 in problem 4 that for the matrix A = , there was no possible basis under which A 0 1 would become a diagonal matrix: i.e. you proved that there was no diagonal matrix D and basis B = f(b11; b21); (b12; b22)g such that b b b b −1 A = 11 12 · D · 11 12 : b21 b22 b21 b22 This is a bit of a shame, because diagonal matrices (for reasons discussed earlier) are pretty fantastic: they're easy to raise to large powers and calculate determinants of, and it would have been nice if every linear transformation was diagonal in some basis. So: what now? Do we simply assume that some matrices cannot be written in a \nice" form in any basis, and that we should assume that operations like matrix exponentiation and finding determinants is going to just be awful in many situations? The answer, as you may have guessed by the fact that these notes have more pages after this one, is no! In particular, while diagonalization1 might not always be possible, there is something fairly close that is - the Schur decomposition. Our goal for this week is to prove this, and study its applications.
    [Show full text]
  • Finite-Dimensional Spectral Theory Part I: from Cn to the Schur Decomposition
    Finite-dimensional spectral theory part I: from Cn to the Schur decomposition Ed Bueler MATH 617 Functional Analysis Spring 2020 Ed Bueler (MATH 617) Finite-dimensional spectral theory Spring 2020 1 / 26 linear algebra versus functional analysis these slides are about linear algebra, i.e. vector spaces of finite dimension, and linear operators on those spaces, i.e. matrices one definition of functional analysis might be: “rigorous extension of linear algebra to 1-dimensional topological vector spaces” ◦ it is important to understand the finite-dimensional case! the goal of these part I slides is to prove the Schur decomposition and the spectral theorem for matrices good references for these slides: ◦ L. Trefethen & D. Bau, Numerical Linear Algebra, SIAM Press 1997 ◦ G. Strang, Introduction to Linear Algebra, 5th ed., Wellesley-Cambridge Press, 2016 ◦ G. Golub & C. van Loan, Matrix Computations, 4th ed., Johns Hopkins University Press 2013 Ed Bueler (MATH 617) Finite-dimensional spectral theory Spring 2020 2 / 26 the spectrum of a matrix the spectrum σ(A) of a square matrix A is its set of eigenvalues ◦ reminder later about the definition of eigenvalues ◦ σ(A) is a subset of the complex plane C ◦ the plural of spectrum is spectra; the adjectival is spectral graphing σ(A) gives the matrix a personality ◦ example below: random, nonsymmetric, real 20 × 20 matrix 6 4 2 >> A = randn(20,20); ) >> lam = eig(A); λ 0 >> plot(real(lam),imag(lam),’o’) Im( >> grid on >> xlabel(’Re(\lambda)’) -2 >> ylabel(’Im(\lambda)’) -4 -6 -6 -4 -2 0 2 4 6 Re(λ) Ed Bueler (MATH 617) Finite-dimensional spectral theory Spring 2020 3 / 26 Cn is an inner product space we use complex numbers C from now on ◦ why? because eigenvalues can be complex even for a real matrix ◦ recall: if α = x + iy 2 C then α = x − iy is the conjugate let Cn be the space of (column) vectors with complex entries: 2v13 = 6 .
    [Show full text]
  • The Non–Symmetric Eigenvalue Problem
    Chapter 4 of Calculus++: The Non{symmetric Eigenvalue Problem by Eric A Carlen Professor of Mathematics Georgia Tech c 2003 by the author, all rights reserved 1-1 Table of Contents Overview ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 1-3 Section 1: Schur factorization 1.1 The non{symmetric eigenvalue problem :::::::::::::::::::::::::::::::::::::: 1-4 1.2 What is the Schur factorization? ::::::::::::::::::::::::::::::::::::::::::::: 1-4 1.3 The 2 × 2 case ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 1-5 Section 2: Complex eigenvectors and the geometry of Cn 2.1 Why get complicated? ::::::::::::::::::::::::::::::::::::::::::::::::::::::: 1-8 2.2 Algebra and geometry in Cn ::::::::::::::::::::::::::::::::::::::::::::::::: 1-8 2.3 Unitary matrices :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 1-11 2.4 Schur factorization in general ::::::::::::::::::::::::::::::::::::::::::::::: 1-11 Section: 3 Householder reflections 3.1 Reflection matrices ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::1-15 3.2 The n × n case ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::1-17 3.3 Householder reflection matrices and the QR factorization :::::::::::::::::::: 1-19 3.4 The complex case ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 1-23 Section: 4 The QR iteration 4.1 What the QR iteration is ::::::::::::::::::::::::::::::::::::::::::::::::::: 1-25 4.2 When and how QR iteration works :::::::::::::::::::::::::::::::::::::::::: 1-28 4.3 What to do when QR iteration
    [Show full text]
  • Parallel Eigenvalue Reordering in Real Schur Forms∗
    Parallel eigenvalue reordering in real Schur forms∗ R. Granat,y B. K˚agstr¨om,z and D. Kressnerx May 12, 2008 Abstract A parallel algorithm for reordering the eigenvalues in the real Schur form of a matrix is pre- sented and discussed. Our novel approach adopts computational windows and delays multiple outside-window updates until each window has been completely reordered locally. By using multiple concurrent windows the parallel algorithm has a high level of concurrency, and most work is level 3 BLAS operations. The presented algorithm is also extended to the generalized real Schur form. Experimental results for ScaLAPACK-style Fortran 77 implementations on a Linux cluster confirm the efficiency and scalability of our algorithms in terms of more than 16 times of parallel speedup using 64 processor for large scale problems. Even on a single processor our implementation is demonstrated to perform significantly better compared to the state-of-the-art serial implementation. Keywords: Parallel algorithms, eigenvalue problems, invariant subspaces, direct reorder- ing, Sylvester matrix equations, condition number estimates 1 Introduction The solution of large-scale matrix eigenvalue problems represents a frequent task in scientific computing. For example, the asymptotic behavior of a linear or linearized dynamical system is determined by the right-most eigenvalue of the system matrix. Despite the advance of iterative methods { such as Arnoldi and Jacobi-Davidson algorithms [3] { there are problems where a transformation method { usually the QR algorithm [14] { is preferred, even in a large-scale setting. In the example quoted above, an iterative method may fail to detect the right-most eigenvalue and, in the worst case, misleadingly predict stability even though the system is unstable [33].
    [Show full text]
  • The Unsymmetric Eigenvalue Problem
    Jim Lambers CME 335 Spring Quarter 2010-11 Lecture 4 Supplemental Notes The Unsymmetric Eigenvalue Problem Properties and Decompositions Let A be an n × n matrix. A nonzero vector x is called an eigenvector of A if there exists a scalar λ such that Ax = λx: The scalar λ is called an eigenvalue of A, and we say that x is an eigenvector of A corresponding to λ. We see that an eigenvector of A is a vector for which matrix-vector multiplication with A is equivalent to scalar multiplication by λ. We say that a nonzero vector y is a left eigenvector of A if there exists a scalar λ such that λyH = yH A: The superscript H refers to the Hermitian transpose, which includes transposition and complex conjugation. That is, for any matrix A, AH = AT . An eigenvector of A, as defined above, is sometimes called a right eigenvector of A, to distinguish from a left eigenvector. It can be seen that if y is a left eigenvector of A with eigenvalue λ, then y is also a right eigenvector of AH , with eigenvalue λ. Because x is nonzero, it follows that if x is an eigenvector of A, then the matrix A − λI is singular, where λ is the corresponding eigenvalue. Therefore, λ satisfies the equation det(A − λI) = 0: The expression det(A−λI) is a polynomial of degree n in λ, and therefore is called the characteristic polynomial of A (eigenvalues are sometimes called characteristic values). It follows from the fact that the eigenvalues of A are the roots of the characteristic polynomial that A has n eigenvalues, which can repeat, and can also be complex, even if A is real.
    [Show full text]
  • Schur Triangularization and the Spectral Decomposition(S)
    Advanced Linear Algebra – Week 7 Schur Triangularization and the Spectral Decomposition(s) This week we will learn about: • Schur triangularization, • The Cayley–Hamilton theorem, • Normal matrices, and • The real and complex spectral decompositions. Extra reading and watching: • Section 2.1 in the textbook • Lecture videos 25, 26, 27, 28, and 29 on YouTube • Schur decomposition at Wikipedia • Normal matrix at Wikipedia • Spectral theorem at Wikipedia Extra textbook problems: ? 2.1.1, 2.1.2, 2.1.5 ?? 2.1.3, 2.1.4, 2.1.6, 2.1.7, 2.1.9, 2.1.17, 2.1.19 ??? 2.1.8, 2.1.11, 2.1.12, 2.1.18, 2.1.21 A 2.1.22, 2.1.26 1 Advanced Linear Algebra – Week 7 2 We’re now going to start looking at matrix decompositions, which are ways of writing down a matrix as a product of (hopefully simpler!) matrices. For example, we learned about diagonalization at the end of introductory linear algebra, which said that... While diagonalization let us do great things with certain matrices, it also raises some new questions: Over the next few weeks, we will thoroughly investigate these types of questions, starting with this one: Advanced Linear Algebra – Week 7 3 Schur Triangularization We know that we cannot hope in general to get a diagonal matrix via unitary similarity (since not every matrix is diagonalizable via any similarity). However, the following theorem says that we can get partway there and always get an upper triangular matrix. Theorem 7.1 — Schur Triangularization Suppose A ∈ Mn(C).
    [Show full text]
  • Introduction to QR-Method SF2524 - Matrix Computations for Large-Scale Systems
    Introduction to QR-method SF2524 - Matrix Computations for Large-scale Systems Introduction to QR-method 1 / 17 Inverse iteration I Computes eigenvalue closest to a target Rayleigh Quotient Iteration I Computes one eigenvalue with a starting guess Arnoldi method for eigenvalue problems I Computes extreme eigenvalue Now: QR-method Compute all eigenvalues Suitable for dense problems Small matrices in relation to other algorithms So far we have in the course learned about... Methods suitable for large sparse matrices Power method I Computes largest eigenvalue Introduction to QR-method 2 / 17 Rayleigh Quotient Iteration I Computes one eigenvalue with a starting guess Arnoldi method for eigenvalue problems I Computes extreme eigenvalue Now: QR-method Compute all eigenvalues Suitable for dense problems Small matrices in relation to other algorithms So far we have in the course learned about... Methods suitable for large sparse matrices Power method I Computes largest eigenvalue Inverse iteration I Computes eigenvalue closest to a target Introduction to QR-method 2 / 17 Arnoldi method for eigenvalue problems I Computes extreme eigenvalue Now: QR-method Compute all eigenvalues Suitable for dense problems Small matrices in relation to other algorithms So far we have in the course learned about... Methods suitable for large sparse matrices Power method I Computes largest eigenvalue Inverse iteration I Computes eigenvalue closest to a target Rayleigh Quotient Iteration I Computes one eigenvalue with a starting guess Introduction to QR-method 2 / 17 Now: QR-method Compute all eigenvalues Suitable for dense problems Small matrices in relation to other algorithms So far we have in the course learned about..
    [Show full text]
  • 10. Schur Decomposition
    L. Vandenberghe ECE133B (Spring 2020) 10. Schur decomposition • eigenvalues of nonsymmetric matrix • Schur decomposition 10.1 Eigenvalues and eigenvectors a nonzero vector x is an eigenvector of the n × n matrix A, with eigenvalue λ, if Ax = λx • the eigenvalues are the roots of the characteristic polynomial det¹λI − Aº = 0 • eigenvectors are nonzero vectors in the nullspace of λI − A for most of the lecture, we assume that A is a complex n × n matrix Schur decomposition 10.2 Linear indepence of eigenvectors suppose x1,..., xk are eigenvectors for k different eigenvalues: Ax1 = λ1x1;:::; Axk = λk xk then x1,..., xk are linearly independent • the result holds for k = 1 because eigenvectors are nonzero • suppose it holds for k − 1, and assume α1x1 + ··· + αk xk = 0; then 0 = A¹α1x1 + α2x2 + ··· + αk xkº = α1λ1x1 + α2λ2x2 + ··· + αkλk xk • subtracting λ1¹α1x1 + ··· + αk xkº = 0 shows that α2¹λ2 − λ1ºx2 + ··· + αk¹λk − λ1ºxk = 0 • since x2,..., xk are linearly independent, α2 = ··· = αk = 0 • hence α1 = ··· = αk = 0, so x1,..., xk are linearly independent Schur decomposition 10.3 Multiplicity of eigenvalues Algebraic multiplicity • the multiplicity of the eigenvalue as a root of the characteristic polynomial • the sum of the algebraic multiplicities of the eigenvalues of an n × n matrix is n Geometric multiplicity • the geometric multiplicity is the dimension of null¹λI − Aº • the maximum number of linearly independent eigenvectors with eigenvalue λ • sum is the maximum number of linearly independent eigenvectors of the matrix Defective eigenvalue
    [Show full text]
  • Section 6.1.2: the Schur Decomposition 6.1.3: Nonunitary Decompositions
    Section 6.1.2: The Schur Decomposition 6.1.3: Nonunitary Decompositions Jim Lambers March 22, 2021 • Now that we have answered the first of the two questions posed earlier, by identifying a class of matrices for which eigenvalues are easily obtained, we move to the second question: how can a general square matrix A be reduced to (block) triangular form, in such a way that its eigenvalues are preserved? • That is, we need to find a similarity transformation (that is, A P −1AP for some P ) that can bring A closer to triangular form, in some sense. n n×n • With this goal in mind, suppose that x 2 C is a normalized eigenvector of A 2 C (that is, kxk2 = 1), with eigenvalue λ. • Furthermore, suppose that P is a Householder reflection such that P x = e1. (this can be done based on Section 4.2) • Because P is complex, it is Hermitian, meaning that P H = P , and unitary, meaning that P H P = I. • This the generalization of a real Householder reflection being symmetric and orthogonal. • Therefore, P is its own inverse, so P e1 = x. • It follows that the matrix P H AP , which is a similarity transformation of A, satisfies H H H P AP e1 = P Ax = λP x = λP x = λe1: H H • That is, e1 is an eigenvector of P AP with eigenvalue λ, and therefore P AP has the block structure λ vH P H AP = : (1) 0 B • Therefore, λ(A) = fλg [ λ(B), which means that we can now focus on the (n − 1) × (n − 1) matrix B to find the rest of the eigenvalues of A.
    [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]