Displaying similar documents to “A spectral characterization of the behavior of discrete time AR–representations over a finite time interval”

Falseness of the finiteness property of the spectral subradius

Adam Czornik, Piotr Jurgas (2007)

International Journal of Applied Mathematics and Computer Science

Similarity:

We prove that there exist infinitely may values of the real parameter α for which the exact value of the spectral subradius of the set of two matrices (one matrix with ones above and on the diagonal and zeros elsewhere, and one matrix with α below and on the diagonal and zeros elsewhere, both matrices having two rows and two columns) cannot be calculated in a finite number of steps. Our proof uses only elementary facts from the theory of formal languages and from linear algebra, but...

The minimum, diagonal element of a positive matrix

M. Smyth, T. West (1998)

Studia Mathematica

Similarity:

Properties of the minimum diagonal element of a positive matrix are exploited to obtain new bounds on the eigenvalues thus exhibiting a spectral bias along the positive real axis familiar in Perron-Frobenius theory.

A new bound for the spectral radius of Brualdi-Li matrices

Xiaogen Chen (2015)

Special Matrices

Similarity:

Let B2m denote the Brualdi-Li matrix of order 2m, and let ρ2m = ρ(B2m ) denote the spectral radius of the Brualdi-Li Matrix. Then [...] . where m > 2, e = 2.71828 · · · , [...] and [...] .

Numerical solution of boundary value problems for selfadjoint differential equations of 2 n th order

Jiří Taufer (2004)

Applications of Mathematics

Similarity:

The paper is devoted to solving boundary value problems for self-adjoint linear differential equations of 2 n th order in the case that the corresponding differential operator is self-adjoint and positive semidefinite. The method proposed consists in transforming the original problem to solving several initial value problems for certain systems of first order ODEs. Even if this approach may be used for quite general linear boundary value problems, the new algorithms described here exploit...