Results 81 to 90 of about 134,349 (198)

Diameters, distortion, and eigenvalues

European Journal of Combinatorics, 2012
We study the relation between the diameter, the first positive eigenvalue of the discrete $p$-Laplacian and the $\ell_p$-distortion of a finite graph. We prove an inequality relating these three quantities and apply it to families of Cayley and Schreier graphs.
Rostislav I. Grigorchuk, Piotr W. Nowak
openaire   +2 more sources

Eigenvalues and Perfect Matchings [PDF]

AMS classification: 05C50, 05C70, 05E30.graph;perfect matching;Laplacian matrix;eigenvalues.
Brouwer, A.E., Haemers, W.H.
core   +1 more source

Transmission eigenvalues [PDF]

, 2013
EditorialInternational audienceIn inverse scattering theory, transmission eigenvalues can be seen as the extension of the notion of resonant frequencies for impenetrable objects to the case of penetrable dielectrics.
Cakoni, Fioralba, Haddar, Houssem, Houssem Haddar, Fioralba Cakoni   +3 more
core   +1 more source

Bounds on separated pairs of subgraphs, eigenvalues and related polynomials [PDF]

We give a bound on the sizes of two sets of vertices at a given minimum distance (a separated pair of subgraphs) in a graph in terms of polynomials and the spectrum of the graph. We find properties of the polynomial optimizing the bound.
Dam, E.R. van
core   +1 more source

A quadratically convergent parallel Jacobi-process for diagonal dominant matrices with nondistinct eigenvalues [PDF]

Matrices;Eigenvalues ...
Paardekooper, M.H.C.
core   +1 more source

Truncations in the method of intermediate problems for lower bounds to eigenvalues [PDF]

, 1961
Two new procedures are developed for determining lower bounds to the eigenvalues of linear operators. The methods are based on the theory of semibounded self-adjoint operators in separable Hilbert space.
Bazley, Norman W.; Fox, David W.
core   +1 more source

Product Eigenvalue Problems [PDF]

SIAM Review, 2005
Summary: Many eigenvalue problems are most naturally viewed as product eigenvalue problems. The eigenvalues of a matrix \(A\) are wanted, but \(A\) is not given explicitly. Instead it is presented as a product of several factors: \(A = A_{k}A_{k-1}\dots A_{1}\). Usually more accurate results are obtained by working with the factors rather than forming \
openaire   +1 more source

Uniform approximation of eigenvalues in Laguerre and Hermite beta-ensembles by roots of orthogonal polynomials [PDF]

We derive strong uniform approximations for the eigenvalues in general Laguerre and Hermite beta-ensembles by showing that the maximal discrepancy between the suitably scaled eigenvalues and roots of orthogonal polynomials converges almost surely to zero
Dette, Holger, Imhof, Lorens A.
core  

On the Necessity of Dynamic Inflow [PDF]

Modeling, Identification and Control
This work explores the importance of dynamic inflow for wind turbines of varying rotor radius and also includes various coplanar multirotor setups. A parametrized model including the rotor and inflow dynamics is formulated.
Finn Matras, Morten D. Pedersen
doaj   +1 more source

Eigenvalues and expanders

Combinatorica, 1986
Let \(G=(V,E)\) be a graph. An \((n,d,c)\)-expander is any bipartite graph on the sets of vertices \(I\) (inputs) and \(O\) (outputs), where \(| I| =| O| =n\), the maximal degree of vertices is \(\underline{d}\), and \[ \operatorname{card} \{v\in V\mid vx\in E\text{ for some }x\in X\}\geq [1+c(1- \alpha /n)]\cdot \alpha, \] whenever \(X\subseteq I ...
openaire   +2 more sources