From nonnegative matrices to nonnegative tensors

Size: px
Start display at page:

Download "From nonnegative matrices to nonnegative tensors"

Transcription

1 From nonnegative matrices to nonnegative tensors Shmuel Friedland Univ. Illinois at Chicago 7 October, 2011 Hamilton Institute, National University of Ireland

2 Overview 1 Perron-Frobenius theorem for irreducible nonnegative matrices 2 Irreducibility and weak irreducibility for tensors 3 Perron-Frobenius for irreducible tensors 4 Kingman, Karlin-Ost and Friedland inequalities 5 Maxplus eigenvalues of tensors 6 Friedland-Karlin characterization of spectral radius 7 Diagonal scaling 8 Rank one approximation of tensors 9 Nonnegative multilinear forms

3 Nonnegative irreducible and primitive matrices A = [a ij ] R n n + induces digraph DG(A) = DG = (V, E) V = [n] := {1,..., n}, E [n] [n], (i, j) E a ij > 0 DG strongly connected, SC, if for each pair i j there exists a dipath from i to j Claim: DG SC iff for each I [n] j [n] \ I and i I s.t. (i, j) E A -primitive if A N > 0 for some N > 0 A N (R n + \ {0}) int R n + A primitive A irreducible and g.c.d of all cycles in DG(A) is one

4 Perron-Frobenius theorem PF: A R n + irreducible. Then 0 < ρ(a) spec (A) algebraically simple x, y > 0 Ax = ρ(a)x, A y = ρ(a)y. A R n n + primitive iff in addition to above λ < ρ(a) for λ spec (A) \ {ρ(a)} Collatz-Wielandt: ρ(a) = min x>0 max i [n] (Ax) i x i = max x>0 min i [n] (Ax) i x i

5 Irreducibility and weak irreducibility of nonnegative tensors F := [f i1,...,i d ] n i 1 =...=i d (C n ) d is called d-cube tensor, (d 3) F 0 if all entries are nonnegative F irreducible: for each I [n], there exists i I, j 2,..., j d J := [n] \ I s.t. f i,j2,...,j d > 0. D(F) digraph ([n], A): (i, j) A if there exists j 2,... j d [n] s.t. f i,j2,...,j d > 0 and j {j 2,..., j d }. F weakly irreducible if D(F) is strongly connected. Claim: irreducible implies weak irreducible For d = 2 irreducible and weak irreducible are equivalent Example of weak irreducible and not irreducible n = 2, d = 3, f 1,1,2, f 1,2,1, f 2,1,2, f 2,2,1 > 0 and all other entries of F are zero

6 Perron-Frobenius theorem for nonnegative tensors I F = [f i1,...,i d ] (C n ) d maps C n to itself (Fx) i = f i, x := i 2,...,i d [n] f i,i 2,...,i d x i2... x id, i [n] Note we can assume f i,i2,...,i d is symmetric in i 2,..., i d. F has eigenvector x = (x 1,..., x n ) C n with eigenvalue λ: (Fx) i = λx d 1 i for all i [n] Assume: F 0, (FR n + \ {0}) R n + \ {0} 1 F 1 : Π n Π n, x 1 (Fx) 1 d 1 n i=1 (Fx) d 1 i Brouwer fixed point: x 0 eigenvector with λ > 0 eigenvalue Problem When there is a unique positive eigenvector with maximal eigenvalue?

7 Perron-Frobenius theorem for nonnegative tensors II Theorem Chang-Pearson-Zhang 2009 [2] Assume F ((R n ) d ) + is irreducible. Then there exists a unique nonnegative eigenvector which is positive with the corresponding maximum eigenvalue λ. Furthermore the Collatz-Wielandt characterization holds λ = min x>0 max i [n] (Fx) i x d 1 i = max x>0 min i [n] (Fx) i x d 1 i Theorem Friedland-Gaubert-Han 2011 [5] Assume F ((R n ) d ) + is weakly irreducible. Then there exists a unique positive eigenvector with the corresponding maximum eigenvalue λ. Furthermore the Collatz-Wielandt characterization holds

8 Generalization of Kingman inequality: Friedland-Gaubert Kingman s inequality: D R m convex, A : D R n n +, A(t) = [a ij(t)], each log a ij (t) [, ) is convex, (entrywise logconvex) then log ρ(a) : D [, ) convex, (ρ(a( )) logconvex) Generalization: F : D ((R n ) d ) + entrywise logconvex then ρ(t ( )) is logconvex (L. Qi & collaborators) Proof Outline: F s = [f s i 1,...,i d ], (0 0 = 0), F G = [f i1,...,i d g i1,...,i d ] GKI: ρ(f α G β ) (ρ(f)) α (ρ(g)) β, α, β 0, α + β = 1 ( ) Assume F, G > 0, Fx = ρ(f)x (d 1), Gx = ρ(g)y (d 1) Hölder s inequality for p = α 1, q = β 1 yields ((F α G β )(x α y β )) i (Fx) α i (Gx) β i = (ρ(f)) α (ρ(g)) β (xi α y β i ) d 1 Collatz-Wielandt implies ( )

9 Karlin-Ost and Friedland inequalities-fg ρ(f s ) 1 s non-increasing on (0, ) ( ) Assume F > 0, s > 1 use y s non-increasing (F s x s ) 1 s i (Fx) i = ρ(f)x d 1 i use Collatz-Wielandt ρ trop (F) = lim s ρ(f s ) 1 s - the tropical eigenvalue of F. if F weakly irreducible then F has positive tropical eigenvector max i2,...,i d f i,i2,...,i d x i2... x id = ρ trop (F)x d 1 i, i [n], x > 0 Cor: ρ(f G) ρ(f 1 2 G 1 2 ) 2 ρ(f)ρ(g) ρ(f G) ρ(f p ) 1 p ρ(g q ) 1 q 1, p + 1 q = 1 p = 1, q = ρ(f G) ρ(f)ρ trop (G) pat(g) pattern of G, tensor with 0/1 entries obtained by replacing every non-zero entry of G by 1. F = pat(g) ρ(g) ρ(pat(g))ρ trop (G)

10 Characterization of ρ trop (F) I Friedland 1986: ρ trop (A) is the maximum geometric average of cycle products of A R n n +. D(F) := ([n], Arc), (i, j) Arc iff j 2,...,j d f i,j2,...,j d x j2... x jd contains x j. d 1 cycle on [m] vertices is d 1 outregular strongly connected subdigraph D = ([m], Arc) of D(F), i.e. the digraph adjacency matrix A(D) = [a ij ]) Z+ m m of subgraph is irreducible with each row sum d 1. A(D)1 = (d 1)1, v A(D) = (d 1)v, v = (v 1,..., v m ) > 0 probability vector Assume for simplicity d 1 cycle on [m] weighted-geometric average: m i=1 (f i,j 2 (i),...,j d (i)) v i Friedland-Gaubert: ρ trop (F) is the maximum weighted-geometric average of d 1 cycle products of F ((R n ) d ) + Cor. ρ trop (F) is logconvex in entries of T.

11 Characterization of ρ trop (F) II More general results Akian-Gaubert [1] Z = (z i1,...,i d ) ((R n ) d ) + occupation measure: i 1,...,i d z i1,...,i d = 1 and for all k [n] i,{j 2,...,j d } k z i,j 2,...,i d = (d 1) m 2,...,m d z k,m2,...,m d first sum is over i [n] and all j 2,..., j d [n] s. t. k {j 2,..., j d } Def: Z n,d all occupation measures Thm: log ρ trop (F) = max Z Zn,d j 1,...,j d [n] z j 1,...,j d log f i1,...,i d Proof: The extreme points of occupational measures correspond to geometric average

12 Diagonal similarity of nonnegative tensors F = [f i1,...,i d ] ((R n ) d ) + is diagonally similar to G = [g i1,...,i d ] ((R n ) d ) + if g i1,...,i d = e (d 1)t i 1 + d j=2 t i j f i1,...,i d for some t = (t 1,..., t n ) R n Diagonally similar tensors have the same eigenvalues and spectral radius generalization of Engel-Schneider [3], (Collatz-Wielandt) ρ trop (F) = inf (t1,...,t n) R n max i 1,...,i d e (d 1)t i 1 + d j=2 t i j f i1,...,i d

13 Generalized Friedland-Karlin inequality I Friedland-Karlin 1975: A R n n + irreducible, Au = ρ(a)u, A v = ρ(a)v, u v = (u 1 v 1,..., u n v n ) > 0 probability vector: log ρ(diag(e t )A) log ρ(a) + n i=1 u iv i t i (graph of convex function above its supporting hyperplane) (e t F) i1,...,i d = e t i 1 f i1,...,i d GFKI: F is weakly irreducible. A := D(u) (d 2) (Fx)(u), Au = ρ(a)u, A v = ρ(a)v and u v > 0 probability vector log ρ(diag(e t )F) log ρ(f) + n i=1 u iv i t i F super-symmetric: Fx = φ(x), φ homog. pol. degree d log ρ(diag(e t )F) log ρ(f) + n i=1 ud i t i, n i=1 ud i = 1

14 Generalized Friedland-Karlin inequality II min n x>0 i=1 u iv i log (Fx) i = log ρ(f) ( ) x d 1 i equality iff x the positive eigenvector of F. Gen. Donsker-Varadhan: ρ(f) = max p Πn inf n x>0 i=1 p i (Fx) i x d 1 i Prf: For x = u RHS ( ) ρ(t ). For p = u v ( ) RHS ( ) = ρ(f). Gen. Cohen: ρ(f) convex in (f 1,...,1,..., f n,...,n ): ρ(f + D) = max p Πn ( n i=1 p id i,...,i + inf n x>0 i=1 p i (Fx) i x d 1 i ) ( ) GFK: F weakly irreducible, positive diagonal, u, v > 0, u v Π n, t, s R n s.t. e t i 1 f i1,...,i d e s i s id with eigenvector u and v left eigenvector of D(u) (d 2) Fx(u) PRF: Strict convex function g(z) = n i=1 u iv i (log Fe z (d 1)z i ) achieves unique minimum for some z = log x, as g( (R n + \ {0}) = F super-symmetric and v = u d 1 then t = s

15 Scaling of nonnegative tensors to tensors with given row, column and depth sums 0 T = [t i,j,k ] R m n l has given row, column and depth sums: r = (r 1,..., r m ), c = (c 1,..., c n ), d = (d 1,..., d l ) > 0: j,k t i,j,k = r i > 0, i,k t i,j,k = c j > 0, i,j t i,j,k = d k > 0 m i=1 r i = n j=1 c j = lk=1 d k Find nec. and suf. conditions for scaling: T = [t i,j,k e x i +y j +z k ], x, y, z such that T has given row, column and depth sum Solution: Convert to the minimal problem: min r x=c y=d z=0 f T (x, y, z), f T (x, y, z) = i,j,k t i,j,ke x i +y j +z k Any critical point of f T on S := {r x = c y = d z = 0} gives rise to a solution of the scaling problem (Lagrange multipliers) f T is convex f T is strictly convex implies T is not decomposable: T T 1 T 2. For matrices indecomposability is equivalent to strict convexity

16 Scaling of nonnegative tensors II if f T is strictly convex and is on S, f T achieves its unique minimum Equivalent to: the inequalities x i + y j + z k 0 if t i,j,k > 0 and equalities r x = c y = d z = 0 imply x = 0 m, y = 0 n, z = 0 l. Fact: For r = 1 m, c = 1 n, d = 1 l Sinkhorn scaling algorithm works. Newton method works, since the scaling problem is equivalent finding the unique minimum of strict convex function Hence Newton method has a quadratic convergence versus linear convergence of Sinkhorn algorithm True for matrices too

17 Rank one approximations R m n l IPS: A, B = m,n,l i=j=k a i,j,kb i,j,k, T = T, T x y z, u v w = (u x)(v y)(w z) X subspace of R m n l, X 1,..., X d an orthonormal basis of X P X (T ) = d i=1 T, X i X i, P X (T ) 2 = d i=1 T, X i 2 T 2 = P X (T ) 2 + T P X (T ) 2 Best rank one approximation of T : min x,y,z T x y z = min x = y = z =1,a T a x y z Equivalent: max x = y = z =1 m,n,l i=j=k t i,j,kx i y j z k Lagrange multipliers: T y z := j=k=1 t i,j,ky j z k = λx T x z = λy, T x y = λz λ singular value, x, y, z singular vectors How many distinct singular values are for a generic tensor?

18 l p maximal problem and Perron-Frobenius (x 1,..., x n ) p := ( n i=1 x i p ) 1 p Problem: max m,n,l x p= y p= z p=1 i=j=k t i,j,kx i y j z k Lagrange multipliers: T y z := j=k=1 t i,j,ky j z k = λx p 1 T x z = λy p 1, T x y = λz p 1 (p = p = 3 is most natural in view of homogeneity Assume that T 0. Then x, y, z 0 2t 2s 1, t, s N) For which values of p we have an analog of Perron-Frobenius theorem? Yes, for p 3, No, for p < 3, Friedland-Gauber-Han [5]

19 Nonnegative multilinear forms Associate with T = [t i1,...,i d ] R m 1... m d + a multilinear form f (x 1,... x d ) : R m 1... m d R f (x 1,..., x d ) = i j [m j ],j [d] t i 1,...,i d x i1,1... x id,d, x i = (x 1,i,..., x mi,i R m i For u R m, p (0, ] let u p := ( m i=1 u i p ) 1 p and S m 1 p,+ := {0 u Rm, u p = 1} For p 1,..., p d (1, ) critical point (ξ 1,..., ξ d ) S m 1 1 p 1,+ of f S m 1 1 p 1,+... Sm d 1 p d,+ satisfies Lim [4]: ti1,...,i d x i1,1... x ij 1,j 1x ij+1,j+1... x id,d = λx p j 1 i j,j, i j [m j ], x j S p j 1 m j,+, j [d]... Sm d 1 p d,+

20 Perron-Frobenius theorem for nonnegative multilinear forms Theorem- Friedland-Gauber-Han [5] f : R m 1... R m d R, a nonnegative multilinear form, T weakly irreducible and p j d for j [d]. Then f has unique positive critical point on S m S m d 1 +. If F is irreducible then f has a unique nonnegative critical point which is necessarily positive

21 Eigenvectors of homogeneous monotone maps on R n + Hilbert metric on PR n >0 : for x = (x 1,..., x n ), y = (y 1,..., y n ) > 0. Then dist(x, y) = max i [n] log y i x i min i [n] log y i x i. F = (F 1,..., F n ) : R n >0 Rn >0 homogeneous: F(tx) = tf(x) for t > 0, x > 0, and monotone F(y) F(x) if y x > 0. F induces ˆF : PR n >0 PRn >0 F nonexpansive with respect to Hilbert metric dist(f(x), F(y)) dist(x, y). α max x y β min x α max F(x) = F(α max x) F(y) F(β min x) = β min F(x) dist(f(x), F(y)) log β min α max = dist(x, y) x > 0 eigenvector of F if F(x) = λf(x). So x PR n + fixed point of F PR n +.

22 Existence of positive eigenvectors of F 1. If F contraction: dist(f(x), F(y)) K dist(x, y) for K < 1, then F has unique fixed point in PR n + and power iterations converge to the fixed point 2. Use Brouwer fixed and irreducibility to deduce existence of positive eigenvector 3. Gaubert-Gunawardena 2004: for u (0, ), J [n] let u J = (u 1,..., u n ) > 0: u i = u if i J and u i = 1 if i J. F i (u J ) nondecreasing in u. di-graph G(F) [n] [n]: (i, j) G(F) iff lim u F i (u {j} ) =. Thm: F : R n >0 Rn >0 homogeneous and monotone. If G(F) strongly connected then F has positive eigenvector

23 Uniqueness and convergence of power method for F Thm 2.5, Nussbaum 88: F : R n >0 Rn >0 homogeneous and monotone. Assume; u > 0 eigenvector F with the eigenvalue λ > 0, F is C 1 in some open neighborhood of u, A = DF(u) R+ n n ρ(a)(= λ) a simple root of det(xi A). Then u is a unique eigenvector of F in R n >0. Cor 2.5, Nus88: In the above theorem assume A = DF(u) is primitive. Let ψ 0, ψ u = 1. Define G : R n >0 Rn >0 G(x) = 1 ψ F(x) F(x) Then lim m G m (x) = u for each x R n >0.

24 Outline of the uniqueness of pos. crit. point of f Define: F : R m + R n + R l + R m + R n + R l +: ( F((x, y, z)) i,1 = x p 3 p ( F((x, y, z)) j,2 = y p 3 p ( F((x, y, z)) k,3 = z p 3 p ) 1 n,l j=k=1 t p 1 i,j,ky j z k, i = 1,..., m ) 1 m,l i=k=1 t p 1 i,j,kx i z k, j = 1,..., n ) 1 m,n i=j=1 t p 1 i,j,kx i y j, k = 1,..., l Assume n,l j=k=1 t i,j,k > 0, i = 1,..., m, m,l i=k=1 t i,j,k > 0, j = 1,..., n, m,n i=j=1 t i,j,k > 0, k = 1,..., l F 1-homogeneous monotone, maps open positive cone R m + R n + R l + to itself. T = [t i,j,k ] induces tri-partite graph on m, n, l : i m connected to j n and k l iff t i,j,k > 0, sim. for j, k If tri-partite graph is connected then F has unique positive eigenvector If F completely irreducible, i.e. F N maps nonzero nonnegative vectors to positive, nonnegative eigenvector is unique and positive

25 References I M. Akian and S. Gaubert, Spectral theorem for convex monotone homogeneous maps, and ergodic control, Nonlinear Analysis 52 (2003), K.C. Chang, K. Pearson, and T. Zhang, Perron-Frobenius theorem for nonnegative tensors, Commun. Math. Sci. 6, (2008), G.M. Engel and H. Schneider, Diagonal similarity and equivalence for matrices over groups with 0, Czechoslovak Mathematical Journal 25 (1975), S. Friedland, Limit eigenvalues of nonnegative matrices, Linear Algebra Appl. 74 (1986), S. Friedland, S. Gaubert and L. Han, Perron-Frobenius theorem for nonnegative multilinear forms, arxiv: , to appear in LAA.

26 References II S. Friedland and S. Karlin, Some inequalities for the spectral radius of nonnegative matrices and applications, Duke Math. J. 42 (1975), S. Gaubert and J. Gunawardena, The Perron-Frobenius theorem for homogeneous, monotone functions, Trans. Amer. Math. Soc. 356 (2004), S. Karlin and F. Ost, Some monotonicity properties of Schur powers of matrice and related inequalities, Linear Algebra Appl. 68 (1985), L.H. Lim, Singular values and eigenvalues of tensors: a variational approach, CAMSAP 05, 1 (2005), M. Ng, L. Qi and G. Zhou, Finding the largest eigenvalue of a nonnegative tensor, SIAM J. Matrix Anal. Appl. 31 (2009),

27 References III R. Nussbaum, Hilbert s projective metric and iterated nonlinear maps, Memoirs Amer. Math. Soc., 1988, vol. 75. L. Qi, Eigenvalues of a real supersymmetric tensor, J. Symbolic Comput. 40 (2005),

Topics in Tensors III Nonnegative tensors

Topics in Tensors III Nonnegative tensors Topics in Tensors III Nonnegative tensors A Summer School by Shmuel Friedland 1 July 6-8, 2011 given in Department of Mathematics University of Coimbra, Portugal 1 Department of Mathematics, Statistics

More information

Perron-Frobenius theorem for nonnegative multilinear forms and extensions

Perron-Frobenius theorem for nonnegative multilinear forms and extensions Perron-Frobenius theorem for nonnegative multilinear forms and extensions Shmuel Friedland Univ. Illinois at Chicago ensors 18 December, 2010, Hong-Kong Overview 1 Perron-Frobenius theorem for irreducible

More information

Strictly nonnegative tensors and nonnegative tensor partition

Strictly nonnegative tensors and nonnegative tensor partition SCIENCE CHINA Mathematics. ARTICLES. January 2012 Vol. 55 No. 1: 1 XX doi: Strictly nonnegative tensors and nonnegative tensor partition Hu Shenglong 1, Huang Zheng-Hai 2,3, & Qi Liqun 4 1 Department of

More information

Permutation transformations of tensors with an application

Permutation transformations of tensors with an application DOI 10.1186/s40064-016-3720-1 RESEARCH Open Access Permutation transformations of tensors with an application Yao Tang Li *, Zheng Bo Li, Qi Long Liu and Qiong Liu *Correspondence: liyaotang@ynu.edu.cn

More information

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

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR WEN LI AND MICHAEL K. NG Abstract. In this paper, we study the perturbation bound for the spectral radius of an m th - order n-dimensional

More information

In particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with

In particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with Appendix: Matrix Estimates and the Perron-Frobenius Theorem. This Appendix will first present some well known estimates. For any m n matrix A = [a ij ] over the real or complex numbers, it will be convenient

More information

A SURVEY ON THE SPECTRAL THEORY OF NONNEGATIVE TENSORS

A SURVEY ON THE SPECTRAL THEORY OF NONNEGATIVE TENSORS A SURVEY ON THE SPECTRAL THEORY OF NONNEGATIVE TENSORS K.C. CHANG, LIQUN QI, AND TAN ZHANG Abstract. This is a survey paper on the recent development of the spectral theory of nonnegative tensors and its

More information

Z-Pencils. November 20, Abstract

Z-Pencils. November 20, Abstract Z-Pencils J. J. McDonald D. D. Olesky H. Schneider M. J. Tsatsomeros P. van den Driessche November 20, 2006 Abstract The matrix pencil (A, B) = {tb A t C} is considered under the assumptions that A is

More information

Eigenvalues of the Adjacency Tensor on Products of Hypergraphs

Eigenvalues of the Adjacency Tensor on Products of Hypergraphs Int. J. Contemp. Math. Sciences, Vol. 8, 201, no. 4, 151-158 HIKARI Ltd, www.m-hikari.com Eigenvalues of the Adjacency Tensor on Products of Hypergraphs Kelly J. Pearson Department of Mathematics and Statistics

More information

The number of singular vector tuples and approximation of symmetric tensors / 13

The number of singular vector tuples and approximation of symmetric tensors / 13 The number of singular vector tuples and approximation of symmetric tensors Shmuel Friedland Univ. Illinois at Chicago Colloquium NYU Courant May 12, 2014 Joint results with Giorgio Ottaviani and Margaret

More information

Spectrum and Pseudospectrum of a Tensor

Spectrum and Pseudospectrum of a Tensor Spectrum and Pseudospectrum of a Tensor Lek-Heng Lim University of California, Berkeley July 11, 2008 L.-H. Lim (Berkeley) Spectrum and Pseudospectrum of a Tensor July 11, 2008 1 / 27 Matrix eigenvalues

More information

Perron-Frobenius Theory and Positivity in Linear Algebra

Perron-Frobenius Theory and Positivity in Linear Algebra Perron-Frobenius Theory and Positivity in Linear Algebra Washington State University ALA - Novi Sad 2010 - In honour of Hans Schneider May 26, 2010 Oskar Perron (1880-1975) Georg Frobenius (1849-1917)

More information

Eigenvalues of tensors

Eigenvalues of tensors Eigenvalues of tensors and some very basic spectral hypergraph theory Lek-Heng Lim Matrix Computations and Scientific Computing Seminar April 16, 2008 Lek-Heng Lim (MCSC Seminar) Eigenvalues of tensors

More information

Chapter 2 Spectra of Finite Graphs

Chapter 2 Spectra of Finite Graphs Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n

More information

Eigenvalue analysis of constrained minimization problem for homogeneous polynomial

Eigenvalue analysis of constrained minimization problem for homogeneous polynomial J Glob Optim 2016) 64:563 575 DOI 10.1007/s10898-015-0343-y Eigenvalue analysis of constrained minimization problem for homogeneous polynomial Yisheng Song 1,2 Liqun Qi 2 Received: 31 May 2014 / Accepted:

More information

Invertibility and stability. Irreducibly diagonally dominant. Invertibility and stability, stronger result. Reducible matrices

Invertibility and stability. Irreducibly diagonally dominant. Invertibility and stability, stronger result. Reducible matrices Geršgorin circles Lecture 8: Outline Chapter 6 + Appendix D: Location and perturbation of eigenvalues Some other results on perturbed eigenvalue problems Chapter 8: Nonnegative matrices Geršgorin s Thm:

More information

ON THE LIMITING PROBABILITY DISTRIBUTION OF A TRANSITION PROBABILITY TENSOR

ON THE LIMITING PROBABILITY DISTRIBUTION OF A TRANSITION PROBABILITY TENSOR ON THE LIMITING PROBABILITY DISTRIBUTION OF A TRANSITION PROBABILITY TENSOR WEN LI AND MICHAEL K. NG Abstract. In this paper we propose and develop an iterative method to calculate a limiting probability

More information

R, 1 i 1,i 2,...,i m n.

R, 1 i 1,i 2,...,i m n. SIAM J. MATRIX ANAL. APPL. Vol. 31 No. 3 pp. 1090 1099 c 2009 Society for Industrial and Applied Mathematics FINDING THE LARGEST EIGENVALUE OF A NONNEGATIVE TENSOR MICHAEL NG LIQUN QI AND GUANGLU ZHOU

More information

FIXED POINT ITERATIONS

FIXED POINT ITERATIONS FIXED POINT ITERATIONS MARKUS GRASMAIR 1. Fixed Point Iteration for Non-linear Equations Our goal is the solution of an equation (1) F (x) = 0, where F : R n R n is a continuous vector valued mapping in

More information

Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming

Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming Shenglong Hu Guoyin Li Liqun Qi Yisheng Song September 16, 2012 Abstract Finding the maximum eigenvalue

More information

Nonlinear Programming Algorithms Handout

Nonlinear Programming Algorithms Handout Nonlinear Programming Algorithms Handout Michael C. Ferris Computer Sciences Department University of Wisconsin Madison, Wisconsin 5376 September 9 1 Eigenvalues The eigenvalues of a matrix A C n n are

More information

Affine iterations on nonnegative vectors

Affine iterations on nonnegative vectors Affine iterations on nonnegative vectors V. Blondel L. Ninove P. Van Dooren CESAME Université catholique de Louvain Av. G. Lemaître 4 B-348 Louvain-la-Neuve Belgium Introduction In this paper we consider

More information

Ma/CS 6b Class 20: Spectral Graph Theory

Ma/CS 6b Class 20: Spectral Graph Theory Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x

More information

Notes on Linear Algebra and Matrix Theory

Notes on Linear Algebra and Matrix Theory Massimo Franceschet featuring Enrico Bozzo Scalar product The scalar product (a.k.a. dot product or inner product) of two real vectors x = (x 1,..., x n ) and y = (y 1,..., y n ) is not a vector but a

More information

Approximation algorithms for nonnegative polynomial optimization problems over unit spheres

Approximation algorithms for nonnegative polynomial optimization problems over unit spheres Front. Math. China 2017, 12(6): 1409 1426 https://doi.org/10.1007/s11464-017-0644-1 Approximation algorithms for nonnegative polynomial optimization problems over unit spheres Xinzhen ZHANG 1, Guanglu

More information

Inverse Perron values and connectivity of a uniform hypergraph

Inverse Perron values and connectivity of a uniform hypergraph Inverse Perron values and connectivity of a uniform hypergraph Changjiang Bu College of Automation College of Science Harbin Engineering University Harbin, PR China buchangjiang@hrbeu.edu.cn Jiang Zhou

More information

Tensor Complementarity Problem and Semi-positive Tensors

Tensor Complementarity Problem and Semi-positive Tensors DOI 10.1007/s10957-015-0800-2 Tensor Complementarity Problem and Semi-positive Tensors Yisheng Song 1 Liqun Qi 2 Received: 14 February 2015 / Accepted: 17 August 2015 Springer Science+Business Media New

More information

MP 472 Quantum Information and Computation

MP 472 Quantum Information and Computation MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density

More information

An Even Order Symmetric B Tensor is Positive Definite

An Even Order Symmetric B Tensor is Positive Definite An Even Order Symmetric B Tensor is Positive Definite Liqun Qi, Yisheng Song arxiv:1404.0452v4 [math.sp] 14 May 2014 October 17, 2018 Abstract It is easily checkable if a given tensor is a B tensor, or

More information

Newcriteria for H-tensors and an application

Newcriteria for H-tensors and an application Wang and Sun Journal of Inequalities and Applications (016) 016:96 DOI 10.1186/s13660-016-1041-0 R E S E A R C H Open Access Newcriteria for H-tensors and an application Feng Wang * and De-shu Sun * Correspondence:

More information

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018 MATH 57: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 18 1 Global and Local Optima Let a function f : S R be defined on a set S R n Definition 1 (minimizers and maximizers) (i) x S

More information

TECHNISCHE UNIVERSITÄT BERLIN

TECHNISCHE UNIVERSITÄT BERLIN TECHNISCHE UNIVERSITÄT BERLIN On best rank one approximation of tensors S. Friedland V. Mehrmann R. Pajarola S.K. Suter Preprint 2012/07 Preprint-Reihe des Instituts für Mathematik Technische Universität

More information

Perron Frobenius Theory

Perron Frobenius Theory Perron Frobenius Theory Oskar Perron Georg Frobenius (1880 1975) (1849 1917) Stefan Güttel Perron Frobenius Theory 1 / 10 Positive and Nonnegative Matrices Let A, B R m n. A B if a ij b ij i, j, A > B

More information

An Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace

An Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace An Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace Takao Fujimoto Abstract. This research memorandum is aimed at presenting an alternative proof to a well

More information

Lecture 7: Positive Semidefinite Matrices

Lecture 7: Positive Semidefinite Matrices Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.

More information

Ma/CS 6b Class 20: Spectral Graph Theory

Ma/CS 6b Class 20: Spectral Graph Theory Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an

More information

Math 291-2: Final Exam Solutions Northwestern University, Winter 2016

Math 291-2: Final Exam Solutions Northwestern University, Winter 2016 Math 29-2: Final Exam Solutions Northwestern University, Winter 206 Determine whether each of the following statements is true or false f it is true, explain why; if it is false, give a counterexample

More information

A Tropical Extremal Problem with Nonlinear Objective Function and Linear Inequality Constraints

A Tropical Extremal Problem with Nonlinear Objective Function and Linear Inequality Constraints A Tropical Extremal Problem with Nonlinear Objective Function and Linear Inequality Constraints NIKOLAI KRIVULIN Faculty of Mathematics and Mechanics St. Petersburg State University 28 Universitetsky Ave.,

More information

Course Summary Math 211

Course Summary Math 211 Course Summary Math 211 table of contents I. Functions of several variables. II. R n. III. Derivatives. IV. Taylor s Theorem. V. Differential Geometry. VI. Applications. 1. Best affine approximations.

More information

Eigenvectors Via Graph Theory

Eigenvectors Via Graph Theory Eigenvectors Via Graph Theory Jennifer Harris Advisor: Dr. David Garth October 3, 2009 Introduction There is no problem in all mathematics that cannot be solved by direct counting. -Ernst Mach The goal

More information

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

Some bounds for the spectral radius of the Hadamard product of matrices Some bounds for the spectral radius of the Hadamard product of matrices Guang-Hui Cheng, Xiao-Yu Cheng, Ting-Zhu Huang, Tin-Yau Tam. June 1, 2004 Abstract Some bounds for the spectral radius of the Hadamard

More information

Hyperdeterminants, secant varieties, and tensor approximations

Hyperdeterminants, secant varieties, and tensor approximations Hyperdeterminants, secant varieties, and tensor approximations Lek-Heng Lim University of California, Berkeley April 23, 2008 Joint work with Vin de Silva L.-H. Lim (Berkeley) Tensor approximations April

More information

1 Overview. 2 A Characterization of Convex Functions. 2.1 First-order Taylor approximation. AM 221: Advanced Optimization Spring 2016

1 Overview. 2 A Characterization of Convex Functions. 2.1 First-order Taylor approximation. AM 221: Advanced Optimization Spring 2016 AM 221: Advanced Optimization Spring 2016 Prof. Yaron Singer Lecture 8 February 22nd 1 Overview In the previous lecture we saw characterizations of optimality in linear optimization, and we reviewed the

More information

The Perron-Frobenius Theorem and its Application to Population Dynamics

The Perron-Frobenius Theorem and its Application to Population Dynamics The Perron-Frobenius Theorem and its Application to Population Dynamics by Jerika Baldin A project submitted in partial fulfillment of the requirements for the degree of Mathematics (April 2017) Department

More information

Bounded uniformly continuous functions

Bounded uniformly continuous functions Bounded uniformly continuous functions Objectives. To study the basic properties of the C -algebra of the bounded uniformly continuous functions on some metric space. Requirements. Basic concepts of analysis:

More information

Perron-Frobenius theorem

Perron-Frobenius theorem Perron-Frobenius theorem V.S. Sunder Institute of Mathematical Sciences sunder@imsc.res.in Unity in Mathematics Lecture Chennai Math Institute December 18, 2009 Overview The aim of the talk is to describe

More information

Scaling of Symmetric Matrices by Positive Diagonal Congruence

Scaling of Symmetric Matrices by Positive Diagonal Congruence Scaling of Symmetric Matrices by Positive Diagonal Congruence Abstract Charles R. Johnson a and Robert Reams b a Department of Mathematics, College of William and Mary, P.O. Box 8795, Williamsburg, VA

More information

Primitive Digraphs with Smallest Large Exponent

Primitive Digraphs with Smallest Large Exponent Primitive Digraphs with Smallest Large Exponent by Shahla Nasserasr B.Sc., University of Tabriz, Iran 1999 A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE

More information

Mathematical foundations - linear algebra

Mathematical foundations - linear algebra Mathematical foundations - linear algebra Andrea Passerini passerini@disi.unitn.it Machine Learning Vector space Definition (over reals) A set X is called a vector space over IR if addition and scalar

More information

Markov Chains and Stochastic Sampling

Markov Chains and Stochastic Sampling Part I Markov Chains and Stochastic Sampling 1 Markov Chains and Random Walks on Graphs 1.1 Structure of Finite Markov Chains We shall only consider Markov chains with a finite, but usually very large,

More information

Lecture 1: Review of linear algebra

Lecture 1: Review of linear algebra Lecture 1: Review of linear algebra Linear functions and linearization Inverse matrix, least-squares and least-norm solutions Subspaces, basis, and dimension Change of basis and similarity transformations

More information

arxiv: v2 [math-ph] 3 Jun 2017

arxiv: v2 [math-ph] 3 Jun 2017 Elasticity M -tensors and the Strong Ellipticity Condition Weiyang Ding Jinjie Liu Liqun Qi Hong Yan June 6, 2017 arxiv:170509911v2 [math-ph] 3 Jun 2017 Abstract In this paper, we propose a class of tensors

More information

Minimizing the Laplacian eigenvalues for trees with given domination number

Minimizing the Laplacian eigenvalues for trees with given domination number Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School

More information

Properties of Solution Set of Tensor Complementarity Problem

Properties of Solution Set of Tensor Complementarity Problem Properties of Solution Set of Tensor Complementarity Problem arxiv:1508.00069v3 [math.oc] 14 Jan 2017 Yisheng Song Gaohang Yu Abstract The tensor complementarity problem is a specially structured nonlinear

More information

The Miracles of Tropical Spectral Theory

The Miracles of Tropical Spectral Theory The Miracles of Tropical Spectral Theory Emmanuel Tsukerman University of California, Berkeley e.tsukerman@berkeley.edu July 31, 2015 1 / 110 Motivation One of the most important results in max-algebra

More information

Spectral directed hypergraph theory via tensors

Spectral directed hypergraph theory via tensors Linear and Multilinear Algebra ISSN: 0308-1087 (Print) 1563-5139 (Online) Journal homepage: http://www.tandfonline.com/loi/glma20 Spectral directed hypergraph theory via tensors Jinshan Xie & Liqun Qi

More information

Eigenvalue comparisons in graph theory

Eigenvalue comparisons in graph theory Eigenvalue comparisons in graph theory Gregory T. Quenell July 1994 1 Introduction A standard technique for estimating the eigenvalues of the Laplacian on a compact Riemannian manifold M with bounded curvature

More information

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

Componentwise perturbation analysis for matrix inversion or the solution of linear systems leads to the Bauer-Skeel condition number ([2], [13]) SIAM Review 4():02 2, 999 ILL-CONDITIONED MATRICES ARE COMPONENTWISE NEAR TO SINGULARITY SIEGFRIED M. RUMP Abstract. For a square matrix normed to, the normwise distance to singularity is well known to

More information

arxiv: v1 [math.ra] 11 Aug 2014

arxiv: v1 [math.ra] 11 Aug 2014 Double B-tensors and quasi-double B-tensors Chaoqian Li, Yaotang Li arxiv:1408.2299v1 [math.ra] 11 Aug 2014 a School of Mathematics and Statistics, Yunnan University, Kunming, Yunnan, P. R. China 650091

More information

Analysis-3 lecture schemes

Analysis-3 lecture schemes Analysis-3 lecture schemes (with Homeworks) 1 Csörgő István November, 2015 1 A jegyzet az ELTE Informatikai Kar 2015. évi Jegyzetpályázatának támogatásával készült Contents 1. Lesson 1 4 1.1. The Space

More information

arxiv: v3 [math.na] 17 Jan 2013

arxiv: v3 [math.na] 17 Jan 2013 On best rank one approximation of tensors S. Friedland V. Mehrmann R. Pajarola S.K. Suter arxiv:1112.5914v3 [math.na] 17 Jan 2013 Abstract In this paper we suggest a new algorithm for the computation of

More information

Spectral Properties of Matrix Polynomials in the Max Algebra

Spectral Properties of Matrix Polynomials in the Max Algebra Spectral Properties of Matrix Polynomials in the Max Algebra Buket Benek Gursoy 1,1, Oliver Mason a,1, a Hamilton Institute, National University of Ireland, Maynooth Maynooth, Co Kildare, Ireland Abstract

More information

Review of Some Concepts from Linear Algebra: Part 2

Review of Some Concepts from Linear Algebra: Part 2 Review of Some Concepts from Linear Algebra: Part 2 Department of Mathematics Boise State University January 16, 2019 Math 566 Linear Algebra Review: Part 2 January 16, 2019 1 / 22 Vector spaces A set

More information

Section 1.7: Properties of the Leslie Matrix

Section 1.7: Properties of the Leslie Matrix Section 1.7: Properties of the Leslie Matrix Definition: A matrix A whose entries are nonnegative (positive) is called a nonnegative (positive) matrix, denoted as A 0 (A > 0). Definition: A square m m

More information

Scientific Computing WS 2018/2019. Lecture 9. Jürgen Fuhrmann Lecture 9 Slide 1

Scientific Computing WS 2018/2019. Lecture 9. Jürgen Fuhrmann Lecture 9 Slide 1 Scientific Computing WS 2018/2019 Lecture 9 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 9 Slide 1 Lecture 9 Slide 2 Simple iteration with preconditioning Idea: Aû = b iterative scheme û = û

More information

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

Math Introduction to Numerical Analysis - Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012. Math 5620 - Introduction to Numerical Analysis - Class Notes Fernando Guevara Vasquez Version 1990. Date: January 17, 2012. 3 Contents 1. Disclaimer 4 Chapter 1. Iterative methods for solving linear systems

More information

T.8. Perron-Frobenius theory of positive matrices From: H.R. Thieme, Mathematics in Population Biology, Princeton University Press, Princeton 2003

T.8. Perron-Frobenius theory of positive matrices From: H.R. Thieme, Mathematics in Population Biology, Princeton University Press, Princeton 2003 T.8. Perron-Frobenius theory of positive matrices From: H.R. Thieme, Mathematics in Population Biology, Princeton University Press, Princeton 2003 A vector x R n is called positive, symbolically x > 0,

More information

1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0

1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0 Numerical Analysis 1 1. Nonlinear Equations This lecture note excerpted parts from Michael Heath and Max Gunzburger. Given function f, we seek value x for which where f : D R n R n is nonlinear. f(x) =

More information

Lecture 15 Perron-Frobenius Theory

Lecture 15 Perron-Frobenius Theory EE363 Winter 2005-06 Lecture 15 Perron-Frobenius Theory Positive and nonnegative matrices and vectors Perron-Frobenius theorems Markov chains Economic growth Population dynamics Max-min and min-max characterization

More information

The following definition is fundamental.

The following definition is fundamental. 1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic

More information

A relative entropy characterization of the growth rate of reward in risk-sensitive control

A relative entropy characterization of the growth rate of reward in risk-sensitive control 1 / 47 A relative entropy characterization of the growth rate of reward in risk-sensitive control Venkat Anantharam EECS Department, University of California, Berkeley (joint work with Vivek Borkar, IIT

More information

Functional Analysis Review

Functional Analysis Review Outline 9.520: Statistical Learning Theory and Applications February 8, 2010 Outline 1 2 3 4 Vector Space Outline A vector space is a set V with binary operations +: V V V and : R V V such that for all

More information

MAA704, Perron-Frobenius theory and Markov chains.

MAA704, Perron-Frobenius theory and Markov chains. November 19, 2013 Lecture overview Today we will look at: Permutation and graphs. Perron frobenius for non-negative. Stochastic, and their relation to theory. Hitting and hitting probabilities of chain.

More information

Computational Problems in Tensors

Computational Problems in Tensors Shmuel Friedland Univ. Illinois at Chicago linear Algebra ICERM June 5, 2014 Overview Uniqueness of best approximation Primer on tensors Best rank one approximation of tensors Number of critical points

More information

Jordan Journal of Mathematics and Statistics (JJMS) 5(3), 2012, pp A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS

Jordan Journal of Mathematics and Statistics (JJMS) 5(3), 2012, pp A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS Jordan Journal of Mathematics and Statistics JJMS) 53), 2012, pp.169-184 A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS ADEL H. AL-RABTAH Abstract. The Jacobi and Gauss-Seidel iterative

More information

Symmetric Matrices and Eigendecomposition

Symmetric Matrices and Eigendecomposition Symmetric Matrices and Eigendecomposition Robert M. Freund January, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 Symmetric Matrices and Convexity of Quadratic Functions

More information

Tensors. Lek-Heng Lim. Statistics Department Retreat. October 27, Thanks: NSF DMS and DMS

Tensors. Lek-Heng Lim. Statistics Department Retreat. October 27, Thanks: NSF DMS and DMS Tensors Lek-Heng Lim Statistics Department Retreat October 27, 2012 Thanks: NSF DMS 1209136 and DMS 1057064 L.-H. Lim (Stat Retreat) Tensors October 27, 2012 1 / 20 tensors on one foot a tensor is a multilinear

More information

Markov Chains, Random Walks on Graphs, and the Laplacian

Markov Chains, Random Walks on Graphs, and the Laplacian Markov Chains, Random Walks on Graphs, and the Laplacian CMPSCI 791BB: Advanced ML Sridhar Mahadevan Random Walks! There is significant interest in the problem of random walks! Markov chain analysis! Computer

More information

The Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment

The Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment he Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment William Glunt 1, homas L. Hayden 2 and Robert Reams 2 1 Department of Mathematics and Computer Science, Austin Peay State

More information

Spectral radius of bipartite graphs

Spectral radius of bipartite graphs Linear Algebra and its Applications 474 2015 30 43 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Spectral radius of bipartite graphs Chia-an

More information

On the distance signless Laplacian spectral radius of graphs and digraphs

On the distance signless Laplacian spectral radius of graphs and digraphs Electronic Journal of Linear Algebra Volume 3 Volume 3 (017) Article 3 017 On the distance signless Laplacian spectral radius of graphs and digraphs Dan Li Xinjiang University,Urumqi, ldxjedu@163.com Guoping

More information

A SIMPLIFIED FORM FOR NEARLY REDUCIBLE AND NEARLY DECOMPOSABLE MATRICES D. J. HARTFIEL

A SIMPLIFIED FORM FOR NEARLY REDUCIBLE AND NEARLY DECOMPOSABLE MATRICES D. J. HARTFIEL A SIMPLIFIED FORM FOR NEARLY REDUCIBLE AND NEARLY DECOMPOSABLE MATRICES D. J. HARTFIEL Introduction and definitions. Nearly reducible and nearly decomposable matrices have been discussed in [4], [5], and

More information

Validated computation tool for the Perron-Frobenius eigenvalue using graph theory

Validated computation tool for the Perron-Frobenius eigenvalue using graph theory Validated computation tool for the Perron-Frobenius eigenvalue using graph theory Kaori Nagatou Kyushu University, JAPAN [ Joint work with Yutaka Ishii, Kyushu University ] AGA Seminar in INI, March 13,

More information

Notes on singular value decomposition for Math 54. Recall that if A is a symmetric n n matrix, then A has real eigenvalues A = P DP 1 A = P DP T.

Notes on singular value decomposition for Math 54. Recall that if A is a symmetric n n matrix, then A has real eigenvalues A = P DP 1 A = P DP T. Notes on singular value decomposition for Math 54 Recall that if A is a symmetric n n matrix, then A has real eigenvalues λ 1,, λ n (possibly repeated), and R n has an orthonormal basis v 1,, v n, where

More information

On the Solution of Linear Mean Recurrences

On the Solution of Linear Mean Recurrences On the Solution of Linear Mean Recurrences David Borwein Jonathan M. Borwein Brailey Sims October 6, 0 Abstract Motivated by questions of algorithm analysis, we provide several distinct approaches to determining

More information

1 Math 241A-B Homework Problem List for F2015 and W2016

1 Math 241A-B Homework Problem List for F2015 and W2016 1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let

More information

POSITIVE MAP AS DIFFERENCE OF TWO COMPLETELY POSITIVE OR SUPER-POSITIVE MAPS

POSITIVE MAP AS DIFFERENCE OF TWO COMPLETELY POSITIVE OR SUPER-POSITIVE MAPS Adv. Oper. Theory 3 (2018), no. 1, 53 60 http://doi.org/10.22034/aot.1702-1129 ISSN: 2538-225X (electronic) http://aot-math.org POSITIVE MAP AS DIFFERENCE OF TWO COMPLETELY POSITIVE OR SUPER-POSITIVE MAPS

More information

Algebra C Numerical Linear Algebra Sample Exam Problems

Algebra C Numerical Linear Algebra Sample Exam Problems Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric

More information

On best rank one approximation of tensors

On best rank one approximation of tensors NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2013; 00:1 14 Published online in Wiley InterScience (www.interscience.wiley.com). On best rank one approximation of tensors S. Friedland

More information

Lecture Note 5: Semidefinite Programming for Stability Analysis

Lecture Note 5: Semidefinite Programming for Stability Analysis ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State

More information

Chapter 7. Extremal Problems. 7.1 Extrema and Local Extrema

Chapter 7. Extremal Problems. 7.1 Extrema and Local Extrema Chapter 7 Extremal Problems No matter in theoretical context or in applications many problems can be formulated as problems of finding the maximum or minimum of a function. Whenever this is the case, advanced

More information

Nonnegative and spectral matrix theory Lecture notes

Nonnegative and spectral matrix theory Lecture notes Nonnegative and spectral matrix theory Lecture notes Dario Fasino, University of Udine (Italy) Lecture notes for the first part of the course Nonnegative and spectral matrix theory with applications to

More information

Spectral radius, symmetric and positive matrices

Spectral radius, symmetric and positive matrices Spectral radius, symmetric and positive matrices Zdeněk Dvořák April 28, 2016 1 Spectral radius Definition 1. The spectral radius of a square matrix A is ρ(a) = max{ λ : λ is an eigenvalue of A}. For an

More information

Symmetric matrices and dot products

Symmetric matrices and dot products Symmetric matrices and dot products Proposition An n n matrix A is symmetric iff, for all x, y in R n, (Ax) y = x (Ay). Proof. If A is symmetric, then (Ax) y = x T A T y = x T Ay = x (Ay). If equality

More information

MATH36001 Perron Frobenius Theory 2015

MATH36001 Perron Frobenius Theory 2015 MATH361 Perron Frobenius Theory 215 In addition to saying something useful, the Perron Frobenius theory is elegant. It is a testament to the fact that beautiful mathematics eventually tends to be useful,

More information

DETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY

DETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY DETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY SFI FINANCIAL ALGEBRA PROJECT AT UCC: BH, AM & EO S 1. Definitions and basics In this working paper we have n currencies, labeled 1 through n inclusive and

More information

A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES

A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES Journal of Mathematical Sciences: Advances and Applications Volume, Number 2, 2008, Pages 3-322 A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES Department of Mathematics Taiyuan Normal University

More information

Geometric Mapping Properties of Semipositive Matrices

Geometric Mapping Properties of Semipositive Matrices Geometric Mapping Properties of Semipositive Matrices M. J. Tsatsomeros Mathematics Department Washington State University Pullman, WA 99164 (tsat@wsu.edu) July 14, 2015 Abstract Semipositive matrices

More information

System theory and system identification of compartmental systems Hof, Jacoba Marchiena van den

System theory and system identification of compartmental systems Hof, Jacoba Marchiena van den University of Groningen System theory and system identification of compartmental systems Hof, Jacoba Marchiena van den IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF)

More information

Tensors. Notes by Mateusz Michalek and Bernd Sturmfels for the lecture on June 5, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra

Tensors. Notes by Mateusz Michalek and Bernd Sturmfels for the lecture on June 5, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra Tensors Notes by Mateusz Michalek and Bernd Sturmfels for the lecture on June 5, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra This lecture is divided into two parts. The first part,

More information