On the Spectra of Striped Sign Patterns

Sign patterns consisting of some positive and some negative columns, with at least one of each kind, are shown to allow any self-conjugate spectrum, and thus to allow any inertia. In the case of the n × n sign pattern with all columns positive, given any self-conjugate multiset consisting of n m 1 complex numbers supplemented by a sufficiently large positive number, it is shown how to construct a positive normal matrix whose spectrum is this multiset. Thus, the positive sign pattern allows any inertia with at least one positive eigenvalue.     

Construction of nonnegative matrices and the inverse eigenvalue problem

This article presents a technique for combining two matrices, an n?×?n matrix M and an m?×?m matrix B, with known spectra to create an (n?+?m???p)?×?(n?+?m???p) matrix N whose spectrum consists of the spectrum of the matrix M and m???p eigenvalues of the matrix B. Conditions are given when the matrix N obtained in this construction is nonnegative. Finally, these observations are used to obtain several results on how to construct a realizable list of n?+?1 complex numbers (λ₁,λ₂,λ₃,σ) from a given realizable list of n complex numbers (c ₁,c ₂,σ), where c ₁ is the Perron eigenvalue, c ₂ is a real number and σ is a list of n???2 complex numbers.     

Nonnegative solution for singular nonlinear fractional differential equation with coefficient that changes sign

In this paper, we consider the existence of nonnegative solutions of initial value problem for singular nonlinear fractional differential equation

GC-MS分析大蒜中的挥发油和大蒜精油

采用气相色谱—质谱法,分析比较大蒜中的挥发油以及大蒜精油的化学成分,通过非负矩阵因子分解(NMF)方法解析色谱重叠峰,并用峰面积百分比法计算各化学成分的峰面积相对百分含量。确定了大蒜中37种化学成分,其中含硫化合物34种,大蒜精油中的32种化学成分,含硫化合物28种。     

广义严格对角占优矩阵新的判定准则

In this paper we provide the new criteria for a strictly generalized diagonally dominant matrix, and it proves by an example that the results of this paper extend the results in[6]. In addition, we obtain the criteria of the nonsingular M-matrix.     

Global stability of a class of delay differential systems

This paper is concerned with a class of systems of delay differential equations which are defined on the nonnegative function space. Under proper conditions, we employ a novel proof to establish several criteria of the global stability of positive equilibrium. Moreover, we give two examples to illustrate our main results.     

渐近线性椭圆方程组的非负解

本文讨论了如下一类渐近线性椭圆方程组{-Δu-μΔv=g(x,v),-Δv-λΔu=f(x,u),x∈Ω,u=v=0,x∈(e)Ω在H10(Ω)×H10(Ω)中至少存在一个非负非平凡的解对(u,v),其中Ω是RN中的一个光滑有界区域,f(x,t)和g(x,t)是Ω×R上的连续函数并且在无穷远处渐近线性.     

Positive eigenvalue-eigenvector of nonlinear positive mappings

We show that an （eventually） strongly increasing and positively homogeneous mapping T defined on a Banach space can be turned into an Edelstein contraction with respect to Hilbert＇s projective metric. By applying the Edelstein contraction theorem, a nonlinear version of the famous Krein- Rutman theorem is presented, and a simple iteration process {T^kx/｜｜T^kx｜｜} （ x ∈ P^＋） is given for finding a positive eigenvector with positive eigenvalue of T. In particular, the eigenvalue problem of a nonnegative tensor A can be viewed as the fixed point problem of the Edelstein contraction with respect to Hilbert＇s projective metric. As a result, the nonlinear Perron-Frobenius property of a nonnegative tensor A is reached easily.     

Maximizing the Product of Two Linear Functions In 0-1 Variables

We study both the continuous and discrete problems of maximizing the product of two linear functions subject to all variables being between 0 and 1. We first give linear and low-order polynomial algorithms for the solution of the continuous problem. In addition, we describe penalties that help to fix variables in the discrete problem. Extensive computational tests demonstrate the effectiveness of these results.     

An extension of proximal methods for quasiconvex minimization on the nonnegative orthant

In this paper we propose an extension of proximal methods to solve minimization problems with quasiconvex objective functions on the nonnegative orthant. Assuming that the function is bounded from below and lower semicontinuous and using a general proximal distance, it is proved that the iterations given by our algorithm are well defined and stay in the positive orthant. If the objective function is quasiconvex we obtain the convergence of the iterates to a certain set which contains the set of optimal solutions and convergence to a KKT point if the function is continuously differentiable and the proximal parameters are bounded. Furthermore, we introduce a sufficient condition on the proximal distance such that the sequence converges to an optimal solution of the problem.