نتایج جستجو برای: sign real spectral radius

تعداد نتایج: 778355  

Journal: :Proyecciones (Antofagasta) 2012

Journal: :Mathematische Zeitschrift 1994

Journal: :Linear Algebra and its Applications 2012

Journal: :Advances in Computational Mathematics 2021

Abstract In this paper we construct a family of ternary interpolatory Hermite subdivision schemes order 1 with small support and ${\mathscr{H}}\mathcal {C}^{2}$ H C 2 -smoothness. Indeed, leaving the binary domain, it is possible ...

2008
STEVEN P. LALLEY

It is proved that the Green’s function of the simple random walk on a surface group of large genus decays exponentially in distance at the (inverse) spectral radius. It is also shown that Ancona’s inequalities extend to the spectral radius R, and therefore that the Martin boundary for R−potentials coincides with the natural geometric boundary S. This implies that the Green’s function obeys a po...

2010
JOEL E. COHEN

We relate some minimax functions of matrices to some spectral functions of matrices. If A is a nonnegative n X n matrix, v(A) is the gametheoretic value of A, and p(A) is the spectral radius of A, then v(A) < p(A). Necessary and sufficient conditions for v(A) = p(A) are given. It follows that if A is nonnegative and irreducible and n > 1, then v(A) < p(A). Also, if, for a real matrix A and a po...

2005
Boris S. Pavlov Vladimir I. Kruglov VLADIMIR I. KRUGLOV

F. Berezin and L. Faddeev have interpreted the Fermi zero-range model as a self-adjoint extension of the Laplacian. Various modifications of this model possess rich spectral properties, but unavoidably have negative effective radius and contain numerous parameters which do not have a direct physical meaning. We suggest, for spherically-symmetric scattering, a generalization of the Fermi zero-ra...

2003
Huiqing Liu Mei Lu Feng Tian

We study the spectral radius of graphs with n vertices and k cut edges. In this paper, we show that of all the connected graphs with n vertices and k cut edges, the maximal spectral radius is obtained uniquely at Kk n , where K k n is a graph obtained by joining k independent vertices to one vertex of Kn−k . We also discuss the limit point of the maximal spectral radius. © 2004 Elsevier Inc. Al...

2011
P. J. McBride K. S. Schmidt D. E. Wolfe

We introduce a new spectral method for the retrieval of optical thickness and effective radius from cloud transmittance that relies on the spectral slope of the normalized transmittance between 1565 nm and 1634 nm, and on cloud transmittance at a visible wavelength. The standard dual-wavelength technique, which is traditionally used in reflectance-based retrievals, is ill-suited for transmittan...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید