Estimating the Largest Eigenvalue of a Positive Definite Matrix

1979 ◽  
Vol 33 (148) ◽  
pp. 1289 ◽  
Author(s):  
Dianne P. O'Leary ◽  
G. W. Stewart ◽  
James S. Vandergraft
Keyword(s):  
Positive Definite Matrix ◽  
Positive Definite ◽  
Largest Eigenvalue ◽  
The Largest Eigenvalue

scholarly journals Estimating the largest eigenvalue of a positive definite matrix

1979 ◽  
Vol 33 (148) ◽  
pp. 1289-1289 ◽  
Author(s):  
Dianne P. O’Leary ◽  
G. W. Stewart ◽  
James S. Vandergraft
Keyword(s):  
Positive Definite Matrix ◽  
Positive Definite ◽  
Largest Eigenvalue ◽  
The Largest Eigenvalue

The Largest Eigenvalue of a Positive Definite Symmetric Matrix: 10839

2002 ◽  
Vol 109 (10) ◽  
pp. 922
Author(s):  
Beresford N. Parlett ◽  
Olaf Krafft ◽  
Martin Schaefer
Keyword(s):  
Symmetric Matrix ◽  
Positive Definite ◽  
Largest Eigenvalue ◽  
Positive Definite Symmetric Matrix ◽  
Definite Symmetric Matrix ◽  
The Largest Eigenvalue

scholarly journals Spectral Gap of the Largest Eigenvalue of the Normalized Graph Laplacian

2021 ◽  
Author(s):  
Jürgen Jost ◽  
Raffaella Mulas ◽  
Florentin Münch
Keyword(s):  
Lower Bound ◽  
Bipartite Graph ◽  
Spectral Gap ◽  
Complete Bipartite Graph ◽  
Graph Laplacian ◽  
New Method ◽  
Single Edge ◽  
Largest Eigenvalue ◽  
Complement Graph ◽  
The Largest Eigenvalue

AbstractWe offer a new method for proving that the maxima eigenvalue of the normalized graph Laplacian of a graph with n vertices is at least $$\frac{n+1}{n-1}$$ n + 1 n - 1 provided the graph is not complete and that equality is attained if and only if the complement graph is a single edge or a complete bipartite graph with both parts of size $$\frac{n-1}{2}$$ n - 1 2 . With the same method, we also prove a new lower bound to the largest eigenvalue in terms of the minimum vertex degree, provided this is at most $$\frac{n-1}{2}$$ n - 1 2 .

scholarly journals A note on a walk-based inequality for the index of a signed graph

2021 ◽  
Vol 9 (1) ◽  
pp. 19-21
Author(s):  
Zoran Stanić
Keyword(s):  
Adjacency Matrix ◽  
Signed Graph ◽  
Arbitrary Length ◽  
Largest Eigenvalue ◽  
The Largest Eigenvalue

Abstract We derive an inequality that includes the largest eigenvalue of the adjacency matrix and walks of an arbitrary length of a signed graph. We also consider certain particular cases.

scholarly journals The Laplacian Spread of Tricyclic Graphs

10.37236/169 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Yanqing Chen ◽  
Ligong Wang
Keyword(s):  
Laplacian Matrix ◽  
Largest Eigenvalue ◽  
Smallest Eigenvalue ◽  
Fixed Order ◽  
Tricyclic Graphs ◽  
The Difference ◽  
The Largest Eigenvalue

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In this paper, we investigate Laplacian spread of graphs, and prove that there exist exactly five types of tricyclic graphs with maximum Laplacian spread among all tricyclic graphs of fixed order.

scholarly journals A geometric statement of the Harnack inequality for a degenerate Kolmogorov equation with rough coefficients

2019 ◽  
Vol 21 (07) ◽  
pp. 1850057 ◽  
Author(s):  
Francesca Anceschi ◽  
Michela Eleuteri ◽  
Sergio Polidoro
Keyword(s):  
Maximum Principle ◽  
Harnack Inequality ◽  
Weak Solutions ◽  
Positive Definite Matrix ◽  
Positive Definite ◽  
Strong Maximum Principle ◽  
Kolmogorov Equation ◽  
Measurable Coefficients ◽  
Rough Coefficients ◽  
Vector Formula

We consider weak solutions of second-order partial differential equations of Kolmogorov–Fokker–Planck-type with measurable coefficients in the form [Formula: see text] where [Formula: see text] is a symmetric uniformly positive definite matrix with bounded measurable coefficients; [Formula: see text] and the components of the vector [Formula: see text] are bounded and measurable functions. We give a geometric statement of the Harnack inequality recently proved by Golse et al. As a corollary, we obtain a strong maximum principle.

Sign in / Sign up

Export Citation Format

Share Document