Bounds on eigenvalues of complex interval matrices

Similar documents
Global Optimization by Interval Analysis

arxiv: v1 [cs.na] 7 Jul 2017

Interval linear algebra

Optimal Preconditioning for the Interval Parametric Gauss Seidel Method

Solving Global Optimization Problems by Interval Computation

arxiv: v1 [math.na] 28 Jun 2013

Total Least Squares and Chebyshev Norm

Positive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix

A NOTE ON CHECKING REGULARITY OF INTERVAL MATRICES

Cheap and Tight Bounds: The Recent Result by E. Hansen Can Be Made More Efficient

Checking Properties of Interval Matrices 1

A filtering method for the interval eigenvalue problem

Bounds on the radius of nonsingularity

arxiv: v1 [math.na] 11 Sep 2018

AN IMPROVED THREE-STEP METHOD FOR SOLVING THE INTERVAL LINEAR PROGRAMMING PROBLEMS

REGULARITY RADIUS: PROPERTIES, APPROXIMATION AND A NOT A PRIORI EXPONENTIAL ALGORITHM

Separation of convex polyhedral sets with uncertain data

Institute of Computer Science. Compact Form of the Hansen-Bliek-Rohn Enclosure

Bounds on eigenvalues and singular values of interval matrices

NP-hardness results for linear algebraic problems with interval data

Lecture 10 - Eigenvalues problem

Interval Robustness in Linear Programming

Roberto Castelli Basque Center for Applied Mathematics

Representation for the generalized Drazin inverse of block matrices in Banach algebras

LINEAR INTERVAL INEQUALITIES

Computing the Norm A,1 is NP-Hard

Section 3.9. Matrix Norm

An Eigenvalue Symmetric Matrix Contractor

Math Introduction to Numerical Analysis - Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012.

Tight Enclosure of Matrix Multiplication with Level 3 BLAS

ELA INTERVAL SYSTEM OF MATRIX EQUATIONS WITH TWO UNKNOWN MATRICES

Nonlinear Programming Algorithms Handout

Calculus C (ordinary differential equations)

Nonlinear equations. Norms for R n. Convergence orders for iterative methods

Lecture 15 Review of Matrix Theory III. Dr. Radhakant Padhi Asst. Professor Dept. of Aerospace Engineering Indian Institute of Science - Bangalore

Markov Chains, Random Walks on Graphs, and the Laplacian

FIXED POINT ITERATIONS

Measuring transitivity of fuzzy pairwise comparison matrix

Determinants Chapter 3 of Lay

An interval-matrix branch-and-bound algorithm for bounding eigenvalues

On Delay-Independent Diagonal Stability of Max-Min Min Congestion Control

Lectures on Linear Algebra for IT

Spectral radius, symmetric and positive matrices

Some bounds for the spectral radius of the Hadamard product of matrices

A note on the unique solution of linear complementarity problem

Inverse interval matrix: A survey

Lecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?

On the Hermitian solutions of the

IAI If A= [au], then IAI = [laul] which is non-negative.

ADI iterations for. general elliptic problems. John Strain Mathematics Department UC Berkeley July 2013

TOLERANCE-CONTROL SOLUTIONS TO INTERVAL LINEAR EQUATIONS

LinGloss. A glossary of linear algebra

Performance of ensemble Kalman filters with small ensembles

Lectures on Linear Algebra for IT

Branch-and-Bound Algorithm. Pattern Recognition XI. Michal Haindl. Outline

arxiv: v1 [math.oc] 27 Feb 2018

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Here is an example of a block diagonal matrix with Jordan Blocks on the diagonal: J

On the spectra of striped sign patterns

Characterization of half-radial matrices

Perron Frobenius Theory

PERTURBATION ANAYSIS FOR THE MATRIX EQUATION X = I A X 1 A + B X 1 B. Hosoo Lee

Assignment 11 (C + C ) = (C + C ) = (C + C) i(c C ) ] = i(c C) (AB) = (AB) = B A = BA 0 = [A, B] = [A, B] = (AB BA) = (AB) AB

Some bounds for the spectral radius of the Hadamard product of matrices

The University of Texas at Austin Department of Electrical and Computer Engineering. EE381V: Large Scale Learning Spring 2013.

1 Last time: least-squares problems

Sophomoric Matrix Multiplication

Formal verification for numerical methods

Properties for the Perron complement of three known subclasses of H-matrices

Feshbach-Fano-R-matrix (FFR) method

Notes on Linear Algebra and Matrix Theory

Numerical Methods for Differential Equations Mathematical and Computational Tools

Linear Algebra Review (Course Notes for Math 308H - Spring 2016)

Institute of Computer Science. Verification of linear (in)dependence in finite precision arithmetic

Key words. GMRES method, convergence bounds, worst-case GMRES, ideal GMRES, field of values

VISUALIZING PSEUDOSPECTRA FOR POLYNOMIAL EIGENVALUE PROBLEMS. Adéla Klimentová *, Michael Šebek ** Czech Technical University in Prague

Generalization of Gracia's Results

QM1 Problem Set 1 solutions Mike Saelim

Ma/CS 6b Class 20: Spectral Graph Theory

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

A new upper bound for the eigenvalues of the continuous algebraic Riccati equation

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.

Short Review of Basic Mathematics

ON THE EXISTENCE OF HOPF BIFURCATION IN AN OPEN ECONOMY MODEL

COMPARISON OF EULER'S- AND TAYLOR'S EXPANSION METHODS FOR NUMERICAL SOLUTION OF NON-LINEAR SYSTEM OF DIFFERENTIAL EQUATION

Spectral inequalities and equalities involving products of matrices

Elementary linear algebra

Motivation: Sparse matrices and numerical PDE's

Determinants. Chia-Ping Chen. Linear Algebra. Professor Department of Computer Science and Engineering National Sun Yat-sen University 1/40

A global optimization method, αbb, for general twice-differentiable constrained NLPs I. Theoretical advances

On Linear Copositive Lyapunov Functions and the Stability of Switched Positive Linear Systems

det(ka) = k n det A.

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR

Properties of Matrices and Operations on Matrices

Componentwise perturbation analysis for matrix inversion or the solution of linear systems leads to the Bauer-Skeel condition number ([2], [13])

Efficient Solvers for Stochastic Finite Element Saddle Point Problems

General method for simulating laboratory tests with constitutive models for geomechanics

Lecture 7: Positive Semidefinite Matrices

July 21 Math 2254 sec 001 Summer 2015

11.10a Taylor and Maclaurin Series

Transcription:

Bounds on eigenvalues of complex interval matrices Milan Hladík Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic SWIM 20, Bourges, France June 4 5 M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 / 8

Introduction Interval matrix A := [A,A] = {A R n n A A A}, The corresponding center and radius matrices A c := (A + A), 2 A := (A A). 2 M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 2 / 8

Introduction Interval matrix A := [A,A] = {A R n n A A A}, The corresponding center and radius matrices A c := (A + A), 2 A := (A A). 2 Complex interval matrix A + ib. M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 2 / 8

Introduction Interval matrix A := [A,A] = {A R n n A A A}, The corresponding center and radius matrices A c := (A + A), 2 A := (A A). 2 Complex interval matrix A + ib. Eigenvalue set Λ(A + ib) = {λ + iµ A A B B x + iy 0 : (A + ib)(x + iy) = (λ + iµ)(x + iy)}. M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 2 / 8

Introduction Selected publications Deif, 99: exact bounds under strong assumptions Mayer, 994: enclosure for the complex case based on Taylor expansion Kolev and Petrakieva, 2005: enclosure for real parts by solving nonlinear system of equations Rohn, 998: a cheap formula for an enclosure Hertz, 2009: extension of Rohn s formula to the complex case M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 3 / 8

Introduction Selected publications Deif, 99: exact bounds under strong assumptions Mayer, 994: enclosure for the complex case based on Taylor expansion Kolev and Petrakieva, 2005: enclosure for real parts by solving nonlinear system of equations Rohn, 998: a cheap formula for an enclosure Hertz, 2009: extension of Rohn s formula to the complex case Other directions approximations Hurwitz / Schur stability checking M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 3 / 8

Introduction Notation ρ( ) spectral radius λ ( ) λ n ( ) eigenvalues of a symmetric matrix Theorem (Rohn, 998) For each eigenvalue λ + iµ Λ(A) we have ( ) ( ) λ λ 2 (A c + A T c ) + ρ 2 (A + A T ), ( ) ( ) λ λ n 2 (A c + A T c ) ρ 2 (A + A T ), ( 0 2 µ λ (A c A T c ) ) ( 0 2 + ρ (A + A T ) ) 2 (AT c A c ) 0 2 (AT + A, ) 0 ( 0 2 µ λ (A c A T c ) ) ( 0 2 n ρ (A + A T ) ) 2 (AT c A c ) 0 2 (AT + A. ) 0 M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 4 / 8

Introduction Theorem (Hertz, 2009) For each eigenvalue λ + iµ Λ(A + ib) we have ««λ λ 2 (Ac + AT c ) + ρ 2 (A + A T ) 0 + λ 2 (BT c Bc) «0 2 (Bc BT c ) 0 + ρ 2 (BT + B «) 2 (B + B T) 0, ««λ λ n 2 (Ac + AT c ) ρ 2 (A + A T ) «0 + λ n 2 (BT c B c) 0 2 (Bc ρ 2 (BT + B «) BT c ) 0 2 (B + B T ) 0, ««µ λ 2 (Bc + BT c ) + ρ 2 (B + B T ) 0 + λ 2 (Ac AT c ) «0 2 (AT c Ac) 0 + ρ 2 (A + A T ) «2 (AT + A, ) 0 ««µ λ n 2 (Bc + BT c ) ρ 2 (B + B T ) 0 + λ n 2 (Ac «AT c ) 0 ρ 2 (A + A T ) «2 (AT c A c) 0 2 (AT + A. ) 0 M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 5 / 8

Symmetric case Our approach Reduction to the symmetric case. M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 6 / 8

Symmetric case Our approach Reduction to the symmetric case. Symmetric interval matrix M S = {M M M = M T }. M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 6 / 8

Symmetric case Our approach Reduction to the symmetric case. Symmetric interval matrix M S = {M M M = M T }. Eigenvalue sets Let λ (M) λ 2 (M) λ n (M). be eigenvalues of a symmetric M R n n. Then λ i (M S ) = [λ i (M S ),λ i (M S )] := { λ i (M) M M S}, i =,...,n. M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 6 / 8

Enclosures for the symmetric case Theorem (Rohn, 2005) λ i (A S ) [λ i (A c ) ρ(a ),λ i (A c ) + ρ(a )], i =,...,n. M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 7 / 8

Enclosures for the symmetric case Theorem (Rohn, 2005) λ i (A S ) [λ i (A c ) ρ(a ),λ i (A c ) + ρ(a )], i =,...,n. Theorem (Hertz, 992) Define Z := {} {±} n = {(, ±,..., ±)} and for a z Z define A z,a z AS in this way: { { a ij if z i = z j, (a z ) ij = a ij if z i z j,, (a z ) a ij = ij if z i = z j, a ij if z i z j. Then λ (A S ) = max z Z λ (A z ), λ n (A S ) = min z Z λ n(a z ). M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 7 / 8

Enclosures for the symmetric case Theorem (Rohn, 2005) λ i (A S ) [λ i (A c ) ρ(a ),λ i (A c ) + ρ(a )], i =,...,n. Theorem (Hertz, 992) Define Z := {} {±} n = {(, ±,..., ±)} and for a z Z define A z,a z AS in this way: { { a ij if z i = z j, (a z ) ij = a ij if z i z j,, (a z ) a ij = ij if z i = z j, a ij if z i z j. Then λ (A S ) = max z Z λ (A z ), λ n (A S ) = min z Z λ n(a z ). Others Hladík, Daney and Tsigaridas, 200, 20: filtering,... M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 7 / 8

Main result Theorem For each eigenvalue λ + iµ Λ(A + ib) we have ( λ 2 (A + ) AT S ( ) 2 (BT B) n 2 (B BT ) 2 (A + λ λ 2 (A + ) AT S ) 2 (BT B) AT ) 2 (B BT ) 2 (A +, AT ) ( λ 2 (B + BT ) 2 (A ) S ( AT ) n 2 (AT A) 2 (B + µ λ 2 (B + BT ) 2 (A ) S AT ) BT ) 2 (AT A) 2 (B +. BT ) M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 8 / 8

Main result Corollary For each λ + iµ Λ(A + ib) we have 2 λ λ (Ac +! AT c ) 2 (BT c B c) 2 (Bc BT c ) 2 (Ac + + ρ AT c ) 2 λ λ (Ac +! AT c ) 2 (BT c B c) n 2 (Bc BT c ) 2 (Ac + ρ AT c ) 2 µ λ (Bc + BT c ) 2 (Ac! AT c ) 2 (AT c A c) 2 (Bc + + ρ BT c ) 2 µ λ (Bc + BT c ) 2 (Ac! AT c ) n 2 (AT c A c) 2 (Bc + ρ BT c ) (A 2 + A T ) (B 2 + B ) T (A 2 + A T ) (B 2 + B ) T (B 2 + B ) T 2 (AT + A ) (B 2 + B ) T 2 (AT + A )! 2 (BT + B ) (A 2 + A T, )! 2 (BT + B ) (A 2 + A T, ) (A! 2 + A T ) (B, 2 + B ) T (A! 2 + A T ) (B 2 + B ) T. M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 9 / 8

Main result Corollary For each λ + iµ Λ(A + ib) we have 2 λ λ (Ac +! AT c ) 2 (BT c B c) 2 (Bc BT c ) 2 (Ac + + ρ AT c ) 2 λ λ (Ac +! AT c ) 2 (BT c B c) n 2 (Bc BT c ) 2 (Ac + ρ AT c ) 2 µ λ (Bc + BT c ) 2 (Ac! AT c ) 2 (AT c A c) 2 (Bc + + ρ BT c ) 2 µ λ (Bc + BT c ) 2 (Ac! AT c ) n 2 (AT c A c) 2 (Bc + ρ BT c ) (A 2 + A T ) (B 2 + B ) T (A 2 + A T ) (B 2 + B ) T (B 2 + B ) T 2 (AT + A ) (B 2 + B ) T 2 (AT + A )! 2 (BT + B ) (A 2 + A T, )! 2 (BT + B ) (A 2 + A T, ) (A! 2 + A T ) (B, 2 + B ) T (A! 2 + A T ) (B 2 + B ) T. Others using simple bounds for the symmetric case, but: for B = 0 we have the same bounds as Rohn, 998, in general, the bouds are as good as Hertz, 2009 M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 9 / 8

Examples Example (Seyranian, Kirillov, and Mailybaev, 2005) Let 0 5 0 4 0 s i s 2 i s 3 B(s) = 0 0 + i 0 5 2 + 4i s + i s 2 0 s 3, 0 4 4 2 0 i s 3 s 3 0 where s s = ([0,0.2],[0.9797,],0). Hertz enclosure: λ [ 5.6732, 8.534], µ [ 7.43,.8843]. Our approach simple bounds: λ [ 4.6546, 7.646], µ [ 5.7632, 0.3387]. by filtering: λ [ 4.6546, 6.742], µ [ 5.407, 9.8787]. best bounds: λ [ 4.580, 6.303], µ [ 4.8237, 9.6227]. M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 0 / 8

Examples Example (con t) Monter Carlo simulation: M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 / 8

Examples Example (Petkovski, 99) Let 0 A = 2 [.399, 0.00] 0 0.5 Hertz enclosure: λ [.9068, 0.9702], µ [ 2.59, 2.59]. Our approach simple bounds: λ [.9068, 0.9702], µ [ 2.59, 2.59]. by filtering: λ [.6474, 0.5205], µ [ 2.934, 2.934]. best bounds: λ [.6474, 0.5205], µ [ 2.2, 2.2]. M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 2 / 8

Examples Example (con t) Monter Carlo simulation: M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 3 / 8

Examples Example (Xiao and Unbehauen, 2000) Let 0 [, ] A = 0 [, ] [, ] [, ] 0. Hertz enclosure: λ [ 2.443,.543], µ [.443,.443]. Our approach simple bounds: λ [ 2.443,.543], µ [.443,.443]. by filtering: λ [ 2.0532,.532], µ [.443,.443]. best bounds: λ [.9674,.0674], µ [.443,.443]. M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 4 / 8

Examples Example (con t) Monter Carlo simulation: M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 5 / 8

Examples Example (Wang, Michel and Liu, 994) Let [ 3, 2] [4, 5] [4, 6] [,.5] A = [ 4, 3] [ 4, 3] [ 4, 3] [, 2] [ 5, 4] [2, 3] [ 5, 4] [, 0] [, 0.] [0, ] [, 2] [ 4, 2.5] Hertz enclosure: λ [ 8.822, 3.4408], µ [ 0.7497, 0.7497]. Our approach simple bounds: λ [ 8.822, 3.4408], µ [ 0.7497, 0.7497]. by filtering: λ [ 7.4848, 3.384], µ [ 9.4224, 9.4224]. best bounds: λ [ 7.369, 3.2742], µ [ 8.7948, 8.7948]. M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 6 / 8

Examples Example (con t) Monter Carlo simulation: M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 7 / 8

Conclusion Conclusion reduction of the problem to real symmetric one cheap and tight enclosure outperforms Rohn (998) and Hertz (2009) formulae M. Hladík (CUNI) Eigenvalues of complex interval matrices June 4 5, 20 8 / 8