DOCSLIB.ORG

Crouzeix's Conjecture and Perturbed Jordan Blocks Anne Greenbaum

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Crouzeix's Conjecture and Perturbed Jordan Blocks Anne Greenbaum Crouzeix’s Conjecture and Perturbed Jordan Blocks Anne Greenbaum Applied Math Dept., University of Washington 42nd Annual Iranian Mathematics Conference Vali-e-Asr University Rafsanjan, Iran September 5-8, 2011 Notation • A an n × n matrix (bounded linear operator on a Hilbert space) • p a polynomial (analytic function) • kp(A)k≡ max kp(A)vk ≡ largest singular value of p(A). kvk2=1 2 • For S ⊂ C, kpkS ≡ supz∈S |p(z)|. • σ(A) ≡ spectrum of A. • W (A) ≡ {q∗Aq : kqk =1}⊂ C is the field of values (numerical range) of A. • r(A) ≡ maxz∈W (A) |z| is the numerical radius of A. Can kp(A)k be related to kpkS for some set S ⊂ C? • If A is diagonalizable, A = V ΛV −1, then p(A)= Vp(Λ)V −1 and −1 kpkσ(A) ≤ kp(A)k ≤ kV k · kV k · kpkσ(A). • If κ(V ) ≡ kV k · kV −1k is of moderate size, then σ(A) determines kp(A)k. What if κ(V ) is huge? Applications • ketAk determines stability of y′(t)= Ay(t), t > 0; k(I + ∆tA)kk determines stability of Euler’s method. • Even if κ(V ) is huge, eigenvalues still determine asymptotic behavior: tA limt→∞ ke k = 0 iff eigenvalues lie in the left half-plane. k limk→∞ kA k = 0 iff eigenvalues are less than 1 in magnitude. • However, if you know only σ(A), cannot distinguish: 6 10 15 10 5 10 10 10 4 10 5 10 3 10 0 2 10 10 1 || k −5 10 10 || A || exp(tA) || 0 10 −10 10 −1 10 −15 10 −2 10 −20 −3 10 10 −4 −25 10 10 0 10 20 30 40 50 60 70 80 90 100 0 10 20 30 40 50 60 70 80 90 100 t k The Field of Values or Numerical Range W (A)= {q∗Aq : q ∈ Cn, kqk =1} • W (αI + βA)= α + βW (A), since q∗(αI + βA)q = α + βq∗Aq. • For A finite dimensional, W (A) is closed (continuous image of compact unit ball in Cn); not necessarily so in infinite dimensions. • W (A) (W (A)) contains σ(A): Av = λv, kvk =1=⇒ v∗Av = λ. • Toeplitz-Hausdorff theorem (1919). W (A) is convex. Method of proof: Reduce to 2 × 2 case. • If A is normal (A = V ΛV −1 where V −1 = V ∗), then W (A) is just the convex hull of the eigenvalues. But if A is highly nonnormal (κ(V ) is huge), then W (A) may contain much more: 7 Eigenvalues x 10 Field of Values 400 1 200 0.5 0 0 −200 −0.5 −400 −1 −1500 −1000 −500 0 −1 −0.5 0 0.5 1 7 x 10 Crouzeix’s Conjecture (2004) For any square matrix A and any polynomial p: kp(A)k≤ 2kpkW (A). • 2 is best possible constant: 0 1 A = , W (A) = disk of radius 1 about 0, 0 0 2 kAk =1=2 max |z|. z∈W (A) • Crouzeix proved 11.08. Cases Where Result is Known to Hold • Obvious: Matrices whose eigenvectors have condition number at most 2, since A = V ΛV −1 =⇒ p(A)= Vp(Λ)V −1 so −1 kp(A)k ≤ kV k kV k max |p(z)|≤ κ(V )kpkW (A). z∈σ(A) • 2 × 2 matrices, 3 × 3 nilpotent matrices (Crouzeix). • Matrices whose field of values is a disk (Okubo and Ando / Badea). • Perturbed Jordan blocks (G. and Choi). λ 1 ... ... ... 1 ν λ • If p(z)= zk, k =1, 2,..., result follows from the power inequality (Berger and Pearcy, 1966): r(Ak) ≤ [r(A)]k. 1 Since 2kAk≤ r(A) ≤ kAk, k k k kA k≤ 2r(A ) ≤ 2[r(A)] =2kpkW (A). iθ j If z = r(A)e ∈ W (A) then statement holds for p(z) = j cjz if i(ϕ−jθ) coeffs cj have args ϕ − jθ: cj = |cj|e . Then P kp(A)k≤ |c | kAjk≤ 2 |c | [r(A)]j =2 c zj ≤ kpk . j j j W (A) Xj Xj Xj Related Results • Von Neumann’s inequality (1951): If A is a contraction (i.e. kAk≤ 1), then kp(A)k ≤ kpkD, D≡ unit disk. Proof: A has a unitary dilation, e.g., A (I − AA∗)1/2 −(I − A∗A)1/2 A∗ Also, A (I − AA∗)1/2 0 ... 0 0 0 I U = . ... 0 0 I −(I − A∗A)1/2 A∗ 0 ... 0 is a unitary dilation of A and p(U) is a dilation of p(A). Therefore kp(A)k ≤ kp(U)k = max |p(z)| ≤ kpkD. z∈σ(U) Corollary. kp(A)k ≤ kpkD(kAk,0), where D(kAk, 0) is the disk of radius kAk about the origin. Proof: Define q so that q(A/kAk)= p(A) and apply von Neumann to q. Corollary. If A˜ = A − αI, then kp(A)k ≤ kpkD(kA˜k,α). Proof: Define q so that q(A˜)= p(A), and apply previous Corollary to q. Related Results (Continued) Definition. Will say that A and B are 2-similar if A is similar to B via a similarity transformation with condition number at most 2; that is, A = XBX−1 where κ(X) ≡ kXk kX−1k≤ 2. • Okubo and Ando (1975): If r(A) ≤ 1, then A is 2-similar to a contraction. • Corollary. kp(A)k≤ 2kpkD(r(A),0). Proof: Define q so that q(A/r(A)) = p(A). By Okubo and Ando, kq(A/r(A))k ≤ 2kq(C)k. By von Neumann, kq(C)k ≤ kqkD = kpkD(r(A),0). • Corollary. kp(A)k≤ 2kpksmallest disk containing W (A) Proof: Translate center of smallest enclosing disk to origin and apply previous Corol- lary. • Corollary. If W (A) is a disk, then Crouzeix’s conjecture holds for A. A Stronger Conjecture For any square matrix A (whose field of values has nonempty interior), there is a bijective holomorphic mapping g : W (A) → D such that g(A) is 2-similar to a contraction. =⇒ Crouzeix’s conjecture: p(A) = (p ◦ g−1)(g(A)) = X(p ◦ g−1)(C)X−1, κ(X) ≤ 2, kCk≤ 1. Therefore kp(A)k≤ 2k(p ◦ g−1)(C)k and by von Neumann’s theorem −1 kp(A)k≤ 2k(p ◦ g )kD =2kpkW (A). Note: Result would follow from Okubo and Ando if r(g(A)) ≤ 1, but usually this is not the case. Perturbed Jordan Blocks λ 1 ... ... J = ν ... 1 ν λ n×n • Eigenvalues are λ + ν1/n. • For 2−n/(n−1) ≤ |ν|≤ 2n/(n−1), eigenvectors have condition number less than or equal to 2. • Most interesting case is |ν| < 2−n/(n−1). • Assume wlog λ = 0, ν ≥ 0. Field of Values of Perturbed Jordan Block 0 1 ... ... J = , ν ≥ 0. ν ... 1 ν 0 n×n • For ν = 0, W (Jν) is a disk about the origin of radius cos(π/(n + 1)). • For ν = 1, W (Jν) is a regular n-gon (convex hull of the eigenvalues). • For 0 < ν < 1, W (Jν) is like an n-gon with rounded corners. n = 3, nu = 0.3 n = 4, nu = 0.3 0.6 0.4 0.5 0.2 0 0 −0.2 −0.4 −0.5 −0.6 −0.5 0 0.5 1 −1 −0.5 0 0.5 1 n = 5, nu = 0.3 0.5 0 −0.5 −1 −0.5 0 0.5 1 • No simple formula for ∂W (Jν). ′ • No simple formula for g : W (Jν) →D, g(0) = 0, g (0) > 0. • But, by reflection, each eigenvalue is multiplied by the same constant cν, so g(Jν)= cνJν. Theorem. Assume 0 < ν < 2−n/(n−1). Crouzeix’s conjecture (and 1/(n−1) the stronger conjecture) holds for Jν if and only if cν ≤ 2 . 1/(n−1) −1 n 2 n−1 Proof: If cν ≤ 2 , then g(Jν) = D Jcν νD, where D = diag(1,cν,cν,...,cν ) n has condition number at most 2. Since kJcν νk = 1, the result follows. 1/(n−1) Conversely, if cν > 2 , then (n−1) n−1 n−1 n−1 n−1 kg(Jν) k = cν kJν k = cν > 2=2 kg kW (Jν). −1/(n−1) Theorem. If n ≥ 6, then W (Jν) contains a disk of radius 2 , 1/(n−1) so cν ≤ 2 . In fact, since W (Jν) contains a disk of radius cos(π/n), −(n−1) kp(Jν)k≤ cos(π/n) kpkW (Jν), −(n−1) and limn→∞ cos(π/n) = 1. • Conformal mapping from W (Jν) to D has the form n g(z)= cνz + (z − ν)zh(z), for some analytic function h. • Try a mapping of the form g˜(z)=21/(n−1)z + (zn − ν)zα, and see if you can find α such that this maps W (Jν) to a region 1/(n−1) containing the unit disk. Then cν ≤ 2 . • For the remaining cases n = 3, 4, 5, using Mathematica for symbol manipulation, we were able to find such mappings. Final Theorem Crouzeix’s conjecture holds for matrices of the form λ 1 ... ... J = , ν ... 1 ν λ n×n for all λ, ν, and n. Moreover, if g is the bijective conformal mapping ′ from W (Jν) to D with g(λ) =0, g (λ) > 0, then g(Jν) is 2-similar to a contraction. Future Work • Try to generalize to matrices A with the property that g(A) = cA. For example, 0 α1 ... ... A = . ... α n−1 αn 0 In this case, g(A) is 2-similar to a contraction if and only if A is 2- similar to a matrix with norm at most 1/c.
Load more

Recommended publications
  • Structured Eigenvalue Condition Numbers and Linearizations for Matrix Polynomials
    ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ Eidgen¨ossische Ecole polytechnique f´ed´erale de Zurich ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ Technische Hochschule Politecnico federale di Zurigo ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ Zu¨rich Swiss Federal Institute of Technology Zurich Structured eigenvalue condition numbers and linearizations for matrix polynomials B. Adhikari∗, R. Alam† and D. Kressner Research Report No. 2009-01 January 2009 Seminar fu¨r Angewandte Mathematik Eidgen¨ossische Technische Hochschule CH-8092 Zu¨rich Switzerland ∗Department of Mathematics, Indian Institute of Technology Guwahati, India, E-mail: [email protected] †Department of Mathematics, Indian Institute of Technology Guwahati, India, E-mail: rafi[email protected], rafi[email protected], Fax: +91-361-2690762/2582649. Structured eigenvalue condition numbers and linearizations for matrix polynomials Bibhas Adhikari∗ Rafikul Alam† Daniel Kressner‡. Abstract. This work is concerned with eigenvalue problems for structured matrix polynomials, including complex symmetric, Hermitian, even, odd, palindromic, and anti-palindromic matrix poly- nomials. Most numerical approaches to solving such eigenvalue problems proceed by linearizing the matrix polynomial into a matrix pencil of larger size. Recently, linearizations have been classified for which the pencil reflects the structure of the original polynomial. A question of practical impor- tance is whether this process of linearization increases the sensitivity of the eigenvalue with respect to structured perturbations. For all structures under consideration, we show that this is not the case: there is always a linearization for which the structured condition number of an eigenvalue does not differ significantly. This implies, for example, that a structure-preserving algorithm applied to the linearization fully benefits from a potentially low structured eigenvalue condition number of the original matrix polynomial. Keywords. Eigenvalue problem, matrix polynomial, linearization, structured condition num- ber.
    [Show full text]
  • Condition Number Bounds for Problems with Integer Coefficients*
    Condition Number Bounds for Problems with Integer Coefficients* Gregorio Malajovich Departamento de Matem´atica Aplicada, Universidade Federal do Rio de Janeiro. Caixa Postal 68530, CEP 21945-970, Rio de Janeiro, RJ, Brasil. E-mail: [email protected] An explicit a priori bound for the condition number associated to each of the following problems is given: general linear equation solving, least squares, non-symmetric eigenvalue problems, solving univariate polynomials, and solv- ing systems of multivariate polynomials. It is assumed that the input has integer coefficients and is not on the degeneracy locus of the respective prob- lem (i.e., the condition number is finite). Our bounds are stated in terms of the dimension and of the bit-size of the input. In the same setting, bounds are given for the speed of convergence of the following iterative algorithms: QR iteration without shift for the symmetric eigenvalue problem, and Graeffe iteration for univariate polynomials. Key Words: condition number, height, complexity 1. INTRODUCTION In most of the numerical analysis literature, complexity and stability of numerical algorithms are usually estimated in terms of the problem instance dimension and of a \condition number". For instance, the complexity of solving an n n linear system Ax = b is usually estimated in terms of the dimension n×(when the input actually consists of n(n + 1) real numbers) and the condition number κ(A) (see section 2.1 for the definition of the condition number). There is a set of problems instances with κ(A) = , and in most cases it makes no sense to solve these instances.
    [Show full text]
  • The Eigenvalue Problem: Perturbation Theory
    Jim Lambers MAT 610 Summer Session 2009-10 Lecture 13 Notes These notes correspond to Sections 7.2 and 8.1 in the text. The Eigenvalue Problem: Perturbation Theory The Unsymmetric Eigenvalue Problem Just as the problem of solving a system of linear equations Ax = b can be sensitive to pertur- bations in the data, the problem of computing the eigenvalues of a matrix can also be sensitive to perturbations in the matrix. We will now obtain some results concerning the extent of this sensitivity. Suppose that A is obtained by perturbing a diagonal matrix D by a matrix F whose diagonal entries are zero; that is, A = D + F . If is an eigenvalue of A with corresponding eigenvector x, then we have (D − I)x + F x = 0: If is not equal to any of the diagonal entries of A, then D − I is nonsingular and we have x = −(D − I)−1F x: Taking 1-norms of both sides, we obtain −1 −1 kxk1 = k(D − I) F xk1 ≤ k(D − I) F k1kxk1; which yields n −1 X jfijj k(D − I) F k1 = max ≥ 1: 1≤i≤n jdii − j j=1;j6=i It follows that for some i, 1 ≤ i ≤ n, satisfies n X jdii − j ≤ jfijj: j=1;j6=i That is, lies within one of the Gerschgorin circles in the complex plane, that has center aii and radius n X ri = jaijj: j=1;j6=i 1 This is result is known as the Gerschgorin Circle Theorem. Example The eigenvalues of the matrix 2 −5 −1 1 3 A = 4 −2 2 −1 5 1 −3 7 are (A) = f6:4971; 2:7930; −5:2902g: The Gerschgorin disks are D1 = fz 2 C j jz − 7j ≤ 4g;D2 = fz 2 C j jz − 2j ≤ 3g;D3 = fz 2 C j jz + 5j ≤ 2g: We see that each disk contains one eigenvalue.
    [Show full text]
  • Inverse Littlewood-Offord Theorems and the Condition Number Of
    Annals of Mathematics, 169 (2009), 595{632 Inverse Littlewood-Offord theorems and the condition number of random discrete matrices By Terence Tao and Van H. Vu* Abstract Consider a random sum η1v1 + ··· + ηnvn, where η1; : : : ; ηn are indepen- dently and identically distributed (i.i.d.) random signs and v1; : : : ; vn are inte- gers. The Littlewood-Offord problem asks to maximize concentration probabil- ities such as P(η1v1+···+ηnvn = 0) subject to various hypotheses on v1; : : : ; vn. In this paper we develop an inverse Littlewood-Offord theory (somewhat in the spirit of Freiman's inverse theory in additive combinatorics), which starts with the hypothesis that a concentration probability is large, and concludes that almost all of the v1; : : : ; vn are efficiently contained in a generalized arithmetic progression. As an application we give a new bound on the magnitude of the least singular value of a random Bernoulli matrix, which in turn provides upper tail estimates on the condition number. 1. Introduction Let v be a multiset (allowing repetitions) of n integers v1; : : : ; vn. Consider a class of discrete random walks Yµ,v on the integers Z, which start at the origin and consist of n steps, where at the ith step one moves backwards or forwards with magnitude vi and probability µ/2, and stays at rest with probability 1−µ. More precisely: Definition 1.1 (Random walks). For any 0 ≤ µ ≤ 1, let ηµ 2 {−1; 0; 1g denote a random variable which equals 0 with probability 1 − µ and ±1 with probability µ/2 each. In particular, η1 is a random sign ±1, while η0 is iden- tically zero.
    [Show full text]
  • Computing the Jordan Structure of an Eigenvalue∗
    SIAM J. MATRIX ANAL.APPL. c 2017 Society for Industrial and Applied Mathematics Vol. 38, No. 3, pp. 949{966 COMPUTING THE JORDAN STRUCTURE OF AN EIGENVALUE∗ NICOLA MASTRONARDIy AND PAUL VAN DOORENz Abstract. In this paper we revisit the problem of finding an orthogonal similarity transformation that puts an n × n matrix A in a block upper-triangular form that reveals its Jordan structure at a particular eigenvalue λ0. The obtained form in fact reveals the dimensions of the null spaces of i (A − λ0I) at that eigenvalue via the sizes of the leading diagonal blocks, and from this the Jordan structure at λ0 is then easily recovered. The method starts from a Hessenberg form that already reveals several properties of the Jordan structure of A. It then updates the Hessenberg form in an efficient way to transform it to a block-triangular form in O(mn2) floating point operations, where m is the total multiplicity of the eigenvalue. The method only uses orthogonal transformations and is backward stable. We illustrate the method with a number of numerical examples. Key words. Jordan structure, staircase form, Hessenberg form AMS subject classifications. 65F15, 65F25 DOI. 10.1137/16M1083098 1. Introduction. Finding the eigenvalues and their corresponding Jordan struc- ture of a matrix A is one of the most studied problems in numerical linear algebra. This structure plays an important role in the solution of explicit differential equations, which can be modeled as n×n (1.1) λx(t) = Ax(t); x(0) = x0;A 2 R ; where λ stands for the differential operator.
    [Show full text]
  • High Probability Analysis of the Condition Number of Sparse Polynomial Systems
    High Probability Analysis of the Condition Number of Sparse Polynomial Systems Gregorio Malajovich 1 Departamento de Matem´atica Aplicada, Universidade Federal do Rio de Janeiro, Caixa Postal 68530, CEP 21945-970, Rio de Janeiro, RJ, Brasil. J. Maurice Rojas 2 Department of Mathematics, Texas A&M University, TAMU 3368, College Station, Texas 77843-3368, USA. Abstract Let f := (f 1,...,f n) be a polynomial system with an arbitrary fixed n-tuple of supports and random coefficients. Our main result is an upper bound on the prob- ability that the condition number of f in a region U is larger than 1/ε. The bound depends on an integral of a differential form on a toric manifold and admits a simple explicit upper bound when the Newton polytopes (and underlying variances) are all identical. We also consider polynomials with real coefficients and give bounds for the ex- pected number of real roots and (restricted) condition number. Using a K¨ahler geometric framework throughout, we also express the expected number of roots of f inside a region U as the integral over U of a certain mixed volume form, thus n recovering the classical mixed volume when U = (C∗) . Key words: mixed volume, condition number, polynomial systems, sparse, random. Email addresses: [email protected] (Gregorio Malajovich), [email protected] (J. Maurice Rojas). URLs: http://www.labma.ufrj.br/~gregorio (Gregorio Malajovich), http://www.math.tamu.edu/~rojas (J. Maurice Rojas). 1 Partially supported by CNPq grant 303472/02-2, by CERG (Hong Kong) grants 9040393, 9040402, and 9040188, by FAPERJ and by Fundac˜a¸o Jos´ePel´ucio Ferreira.
    [Show full text]
  • Condition Number and Matrices
    Condition number and matrices Felipe Bottega Diniz March 16, 2017 Abstract It is well known the concept of the condition number κ(A)= A A−1 , where A is k kk k a n n real or complex matrix and the norm used is the spectral norm. Although it × is very common to think in κ(A) as “the” condition number of A, the truth is that condition numbers are associated to problems, not just instance of problems. Our goal is to clarify this difference. We will introduce the general concept of condition number and apply it to the particular case of real or complex matrices. After this, we will introduce the classic condition number κ(A) of a matrix and show some known results. Contents 1 Introduction 1 2 Condition number of matrix problems 3 3 Condition number and ill-posed problems 5 4 Componentwise condition number 6 5 Conclusions 12 1 Introduction arXiv:1703.04547v1 [math.GM] 13 Mar 2017 Let X,Y be normed vector spaces and let f : X Y be a function. We will consider → X as the input space, Y the output space and f the problem. For example, we can have X = Cn×n with any norm, Y = C with absolute value and f(A) = det(A) for all A X. ∈ Therefore, f models the problem of computing the determinant. For any input x X 0 and a perturbationx ˜ X of x, we define the absolute error ofx ˜ with respect to∈x by\{ } ∈ AbsError(˜x, x)= x˜ x k − k and the relative error by x˜ x RelError(˜x, x)= k − k.
    [Show full text]
  • 1 on the Condition of Numerical Problems and the Numbers That
    1 On the Condition of Numerical Problems and the Numbers that Measure It 1.1 The Size of Errors Since none of the numbers we take out from logarithmic or trigonometric tables admit of absolute precision, but are all to a certain extent approximate only, the results of all calculations performed by the aid of these numbers can only be approxi- mately true. [. ] It may happen, that in special cases the effect of the errors of the tables is so augmented that we may be obliged to reject a method, otherwise the best, and substitute another in its place. Carl Friedrich Gauss, Theoria Motus The heroes of numerical mathematics (Euler, Gauss, Lagrange, . ) developed a good number of the algorithmic procedures which make the essence of Numerical Analysis. At the core of these advances there was the invention of calculus. And underlying the latter, the field of real numbers. The dawn of the digital computer, in the decade of the 40s, allowed the execution of these procedures on increasingly large data, an advance which, however, made even more patent the fact that real numbers cannot be encoded with a finite number of bits and, therefore, that computers had to work with approximations only. With the increased length of the computations the sys- tematic rounding of all occurring quantities could now accumulate to a higher extend. Occasionally, as already remarked by Gauss, the errors affecting the outcome of a computation were so big as to make it irrelevant. Expressions like “the error is big” beg the question, how does one measure an error? To approach this question, let us first assume that the object whose error we are considering is a single number x encoding a quantity which may take values on an open real interval.
    [Show full text]
  • Chapter 9 PRECONDITIONING
    Chapter 9 PRECONDITIONING 9.1 Preconditioned Krylov Subspace Methods 9.2 Preconditioned Conjugate Gradient 9.3 Preconditioned Generalized Minimal Residual 9.4 Relaxation Method Preconditioners 9.5 Incomplete LU Factorization Preconditioners 9.6 Approximate Inverse Preconditioners 9.1 Preconditioned Krylov Subspace Methods Saad, Sections 9.0, 9.1 The rate of convergence of a Krylov subspace method for a linear system Ax = b depends on the condition number of the matrix A. Therefore, if we have a matrix M which is a crude approximation to A, M −1A is closer to the identity than is A and should have a smaller condition number, and it would be expected that a Krylov subspace method would converge faster for the “preconditioned” system M −1Ax = M −1b. For example, choosing M to be the diagonal part of A can be quite helpful. This is a useful approach only if computing M −1v for an arbitrary vector v is cheap. Such a matrix M is called a preconditioner or, more precisely, a left preconditioner. In the case of a right preconditioner,onesolves AM −1u = b where x = M −1u. 175 And if M is in factored form M = MLMR,onecanusethisasasplit preconditioner by solving −1 −1 −1 −1 ML AMR u = ML b where x = MR u. −1 −1 −1 −1 Note that M A, AM and ML AMR are similar matrices, so they have the same eigen- values. For convenience write the given system as A(x − x0)=r0 where r0 = b − Ax0, so that x − x0 is the unknown, and consider a split preconditioner M = MLMR.Aleft preconditioner is the case MR = I and a right preconditioner is the case ML = I.
    [Show full text]
  • CPSC 303: WHAT the CONDITION NUMBER DOES and DOES NOT TELL US Contents 1. Motivating Examples from Interpolation 2 1.1. an N
    CPSC 303: WHAT THE CONDITION NUMBER DOES AND DOES NOT TELL US JOEL FRIEDMAN Contents 1. Motivating Examples from Interpolation2 1.1. An n = 1 Example: the Tangent Line of Calculus2 1.2. Degeneracy in Interpolation is Not Degenerate and Yields Derivatives3 1.3. An n = 2 Example With One Derivative3 1.4. A Doubly Degenate Example and Taylor Series3 2. More Motivation (From General Linear Algebra) for the Condition Number5 2.1. Sensitivity in General n × n Systems5 2.2. Sensitivity in General Interpolation5 2.3. Optimal Sensitivity: Diagonal Systems6 2.4. Cancellation6 2.5. A Mixed Signs Example6 3. Cancellation, Awkwardness and Norms, and Relative Error7 3.1. Common Norms and Awkward Norms7 3.2. The Lp-Norm (or `p-Norm or p-Norm)8 3.3. Cancellation and the Triangle Inequality8 3.4. Relative Error9 3.5. Further Remarks on Norms9 4. The L2-Norm (or 2-Norm) of a Matrix 10 5. The Lp-Norm (or p-Norm) of a Matrix 12 6. Some 2 × 2 Matrix Norm Formulas 13 7. The (L2- and) Lp-Condition Number of a Matrix 14 8. Interpolation: What The Condition Number Does and Does Not Tell Us 15 8.1. Formulas for the Inverse 15 8.2. The 2 × 2 Interpolation for a Tangent Line 16 8.3. A 3 × 3, Doubly Degenerate Example 17 9. The Doubly-Normed Condition Number 18 Exercises 19 Copyright: Copyright Joel Friedman 2020. Not to be copied, used, or revised without explicit written permission from the copyright owner. Research supported in part by an NSERC grant.
    [Show full text]
  • Structured Eigenvalue Condition Numbers
    Structured Eigenvalue Condition Numbers Karow, Michael and Kressner, Daniel and Tisseur, Françoise 2006 MIMS EPrint: 2006.45 Manchester Institute for Mathematical Sciences School of Mathematics The University of Manchester Reports available from: http://eprints.maths.manchester.ac.uk/ And by contacting: The MIMS Secretary School of Mathematics The University of Manchester Manchester, M13 9PL, UK ISSN 1749-9097 STRUCTURED EIGENVALUE CONDITION NUMBERS MICHAEL KAROW∗, DANIEL KRESSNER∗, AND FRANC¸OISE TISSEUR† Abstract. This paper investigates the effect of structure-preserving perturbations on the eigen- values of linearly and nonlinearly structured eigenvalue problems. Particular attention is paid to structures that form Jordan algebras, Lie algebras, and automorphism groups of a scalar product. Bounds and computable expressions for structured eigenvalue condition numbers are derived for these classes of matrices, which include complex symmetric, pseudo symmetric, persymmetric, skew- symmetric, Hamiltonian, symplectic, and orthogonal matrices. In particular we show that under reasonable assumptions on the scalar product, the structured and unstructured eigenvalue condition numbers are equal for structures in Jordan algebras. For Lie algebras, the effect on the condition number of incorporating structure varies greatly with the structure. We identify Lie algebras for which structure does not affect the eigenvalue condition number. Key words. Structured eigenvalue problem, condition number, Jordan algebra, Lie algebra, automorphism group, symplectic,
    [Show full text]
  • 7.4 Matrix Norms and Condition Numbers This Section Considers the Accuracy of Computed Solutions to Linear Systems
    Ch 7: Numerical Linear Algebra 7.4 Matrix Norms and Condition Numbers This section considers the accuracy of computed solutions to linear systems. At every step, the computer will roundoff, and we would like to know how far the computer answer is from the real answer. 1. Let A be an m × n. Then (a) recall the Frobenius norm of an qPn Pm 2 jjAjjF = i=1 j=1 aij = p 2 2 2 2 2 2 2 2 a11 + a12 + a13 + ::: + a1n + a21 + a22 + ::: + a2n + ::: + amn (b) the 1-norm: m X jjAjj1 = max jaijj = 1≤j≤n i=1 = max (ja11j + ja21j + ja31j + ::: + jam1j); (ja12j + ja22j + ::: + jam2j);:::; (ja1nj + ja2nj + ::: + jamnj); i.e. it is the maximum among the sums of the absolute values of the elements of each column (c) the 1-norm: n X jjAjj1 = max jaijj = 1≤i≤m j=1 = max (ja11j + ja12j + ja13j + ::: + ja1nj); (ja21j + ja22j + ::: + ja2nj);:::; (jam1j + jam2j + ::: + jamnj); i.e. it is the maximum among the sums of the absolute values of the elements of each row (d) the 2-norm: jjAxjj2 jjAjj2 = max ; x6=0 jjxjj2 p 2 2 2 where jjxjj2 = x1 + x2 + : : : xn and similarly for jjAxjj2. or jjAjj2 = σ1; T where σ1 is the largest singular value in the SVD of A = UΣV . As a consequence −1 1 jjA jj2 = ; σn T where σn is the smallest nonzero singular value in the SVD of A = UΣV . 2. some properties of the Frobenius norm: q Pn 2 (a) jjAjjF = i=1 jjajjj2, i.e. it jjAjjF is the square root of the sums of the squares of the standard 2-norms of its columns (similarly it could be computed using rows instead of columns) 1 (b) jjAxjj2 ≤ jjAjjF jjxjj2 (c) jjABjjF ≤ jjAjjF jjBjjF n n (d) jjA jjF ≤ jjAjjF (this is a consequence of the property above) 3.
    [Show full text]