Graphs and Hermitian matrices: Exact interlacing

We prove conditions for equality between the extreme eigenvalues of a matrix and its quotient. In particular, we give a lower bound on the largest singular value of a matrix and generalize a result of Finck and Grohmann about the largest eigenvalue of a graph.     

Nonnegative Trigonometric Polynomials

An extremal problem for the coefficients of sine polynomials, which are nonnegative in [0,π] , posed and discussed by Rogosinski and Szegő is under consideration. An analog of the Fejér—Riesz representation of nonnegative general trigonometric and cosine polynomials is proved for nonnegative sine polynomials. Various extremal sine polynomials for the problem of Rogosinski and Szegő are obtained explicitly. Associated cosine polynomials k _n (θ) are constructed in such a way that { k _n (θ) } are summability kernels. Thus, the L _p , pointwise and almost everywhere convergence of the corresponding convolutions, is established. April 26, 2000. Date revised: December 28, 2000. Date accepted: February 8, 2001.     

Constructive methods for spectra with three nonzero elements in the nonnegative inverse eigenvalue problem

We present and compare three constructive methods for realizing nonreal spectra with three nonzero elements in the nonnegative inverse eigenvalue problem. We also provide some necessary conditions for realizability and numerical examples. In particular, we utilize the companion matrix.     

一类随机适应序列的强收敛性

本文利用对随机变量进行截尾的方法和非负鞅的性质,证明了一类随机变量序列的强收敛性.     

Spectra of principal submatrices of nonnegative matrices

Let A be an n×n nonnegative matrix with the spectrum (λ₁,λ₂,…,λ_n) and let A₁ be an m×m principal submatrix of A with the spectrum (μ₁,μ₂,…,μ_m). In this paper we present some cases where the realizability of (μ₁,μ₂,…,μ_m,ν₁,ν₂,…,ν_s) implies the realizability of (λ₁,λ₂,…,λ_n,ν₁,ν₂,…,ν_s) and consider the question whether this holds in general. In particular, we show that the list

(λ₁,λ₂,…,λ_n,-μ₁,-μ₂,…,-μ_m)     

Construction of nonnegative symmetric matrices with given spectrum

Let σ = (λ₁, … , λ_n) be the spectrum of a nonnegative symmetric matrix A with the Perron eigenvalue λ₁, a diagonal entry c and let τ = (μ₁, … , μ_m) be the spectrum of a nonnegative symmetric matrix B with the Perron eigenvalue μ₁. We show how to construct a nonnegative symmetric matrix C with the spectrum

(λ₁+max{0,μ₁-c},λ₂,…,λ_n,μ₂,…,μ_m).     

Nonnegative solutions for nonlinear elliptic systems

In this paper, we show that the semilinear elliptic systems of the form

(0.1)     

A modified algorithm for the Perron root of a nonnegative matrix

An algorithm of diagonal transformation for the Perron root of nonnegative matrices is proposed by Duan and Zhang [F. Duan, K. Zhang, An algorithm of diagonal transformation for Perron root of nonnegative irreducible matrices, Appl. Math. Comput. 175 (2006) 762-772]. This method can be used for all nonnegative irreducible matrices. In this paper, an improved algorithm which is based on this method is proposed. The new algorithm inherits all the above-mentioned advantages of the original algorithm and has higher efficiency. It is testified by numerical testing that the efficiency of the new algorithm is improved greatly.     

The Improved LaSalle-Type Theorems for Stochastic Differential Delay Equations

The main aim of this article is to deal with the almost-sure stability of stochastic differential delay equations. Our improved theorems give better results while conditions imposed on the Lyapunov function are much weaker, thus, it is easier to find a right Lyapunov function in application.