A Note on a Matrix Version of the Farkas Lemma

A linear polyomial non-negative on the non-negativity domain of finitely many linear polynomials can be expressed as their non-negative linear combination. Recently, under several additional assumptions, Helton, Klep, and McCullough extended this result to matrix polynomials. The aim of this article is to study which of these additional assumptions are really necessary.     

马尔可夫骨架过程在种群动态学中的应用

本文借助于马尔可夫骨架过程（舱妒）方法研究了种群动态学中单种群种群数量的瞬时分布，并证明单种群种群数量在时刻t的瞬时分布是某一非负线性方程的最小非负解。     

Surrogate duality for vector optimization

Using our theorems (of [12]) on separation of convex sets by linear operators, in the sense of the lexi-cographical order on Rⁿ, we prove some theorems of surrogate duality for vector optimization problems with convex constraints (but no regularity assumption), where the surrogate constraint sets are generalized half-spaces and the surrogate multipliers are linear operators, or isomorphisms, or isometries. In the cae of inequality constraints, we prove that the surrogate multipliers can be taken lexicographically non-negative isometries or non-negative (in the usual order) linear isomorphisms.     

Stability in the almost everywhere sense: A linear transfer operator approach

The problem of almost everywhere stability of a nonlinear autonomous ordinary differential equation is studied using a linear transfer operator framework. The infinitesimal generator of a linear transfer operator (Perron-Frobenius) is used to provide stability conditions of an autonomous ordinary differential equation. It is shown that almost everywhere uniform stability of a nonlinear differential equation, is equivalent to the existence of a non-negative solution for a steady state advection type linear partial differential equation. We refer to this non-negative solution, verifying almost everywhere global stability, as Lyapunov density. A numerical method using finite element techniques is used for the computation of Lyapunov density.     

New features of stability of linear systems of differential equations with constant coefficients

We consider stability of linear systems of differential equations with constant real coefficients whose matrices are off-diagonally non-negative. The results are applied to arbitrary linear systems of differential equations with constant complex coefficients.     

A revisit of numerical approach for solving linear fractional programming problem in a fuzzy environment

In the article, Veeramani and Sumathi [10] presented an interesting algorithm to solve a fully fuzzy linear fractional programming (FFLFP) problem with all parameters as well as decision variables as triangular fuzzy numbers. They transformed the FFLFP problem under consideration into a bi-objective linear programming (LP) problem, which is then converted into two crisp LP problems. In this paper, we show that they have used an inappropriate property for obtaining non-negative fuzzy optimal solution of the same problem which may lead to the erroneous results. Using a numerical example, we show that the optimal fuzzy solution derived from the existing model may not be non-negative. To overcome this shortcoming, a new constraint is added to the existing fuzzy model that ensures the fuzzy optimal solution of the same problem is a non-negative fuzzy number. Finally, the modified solution approach is extended for solving FFLFP problems with trapezoidal fuzzy parameters and illustrated with the help of a numerical example.     

Characterizations of optimal scalings of matrices

A scaling of a non-negative, square matrixA ≠ 0 is a matrix of the formDAD ^?1, whereD is a non-negative, non-singular, diagonal, square matrix. For a non-negative, rectangular matrixB ≠ 0 we define a scaling to be a matrixCBE ^?1 whereC andE are non-negative, non-singular, diagonal, square matrices of the corresponding dimension. (For square matrices the latter definition allows more scalings.) A measure of the goodness of a scalingX is the maximal ratio of non-zero elements ofX. We characterize the minimal value of this measure over the set of all scalings of a given matrix. This is obtained in terms of cyclic products associated with a graph corresponding to the matrix. Our analysis is based on converting the scaling problem into a linear program. We then characterize the extreme points of the polytope which occurs in the linear program.     

On the strong liouville property for co-compact Riemannian covers

This note discusses the existence of non-negative non-constant harmonic functions on co-compact covers with linear deck group. Conferenza tenuta da P. Bougerol il 4 ottobre 1993     

Expansion over a system of shifts of pyramidal functions with a square base

A method for approximation of functions of two variables by a linear combination of non-negative piecewise linear functions with a compact support is presented. Two quadratic pyramids are used as generating functions for the system of shifts. The accuracy of this local method is proved to have the same order as the best approximation by piecewise linear functions.     

Spectral stability of general non-negative self-adjoint operators with applications to Neumann-type operators

We prove a stability theorem for the eigenvalues of general non-negative self-adjoint linear operators with compact resolvents and by applying it we prove a sharp stability result for the dependence of the eigenvalues of second order uniformly elliptic linear operators with homogeneous Neumann boundary conditions upon domain perturbation.     

Classification of gradient steady Ricci solitons with linear curvature decay

In this paper,we study steady Ricci solitons with a linear decay of sectional curvature.In particular,we give a complete classification of 3-dimensional steady Ricci solitons and 4-dimensional K-noncollapsed steady Ricci solitons with non-negative sectional curvature under the linear curvature decay.     

Group-valued measures on coarse-grained quantum logics

In [3] it was shown that a (real) signed measure on a cyclic coarse-grained quantum logic can be extended, as a signed measure, over the entire power algebra. Later ([9]) this result was re-proved (and further improved on) and, moreover, the non-negative measures were shown to allow for extensions as non-negative measures. In both cases the proof technique used was the technique of linear algebra. In this paper we further generalize the results cited by extending group-valued measures on cyclic coarse-grained quantum logics (or non-negative group-valued measures for lattice-ordered groups). Obviously, the proof technique is entirely different from that of the preceding papers. In addition, we provide a new combinatorial argument for describing all atoms of cyclic coarse-grained quantum logics.     

Solving sparse non-negative tensor equations: algorithms and applications

We study iterative methods for solving a set of sparse non-negative tensor equations (multivariate polynomial systems) arising from data mining applications such as information retrieval by query search and community discovery in multi-dimensional networks. By making use of sparse and non-negative tensor structure, we develop Jacobi and Gauss-Seidel methods for solving tensor equations. The multiplication of tensors with vectors are required at each iteration of these iterative methods, the cost per iteration depends on the number of non-zeros in the sparse tensors. We show linear convergence of the Jacobi and Gauss-Seidel methods under suitable conditions, and therefore, the set of sparse non-negative tensor equations can be solved very efficiently. Experimental results on information retrieval by query search and community discovery in multi-dimensional networks are presented to illustrate the application of tensor equations and the effectiveness of the proposed methods.     

一类正值线性过程的参数估计

在研究水质污染问题时,文[1]提出了非负一阶自回归模型:X_t=(?)X_(t-1)+ξ_t,其中{ξ_t}为独立同分布非负随机序列,0<(?)<1.此模型中 X_t 表示在时刻 t 时净化池中的污水量,1-(?)_1表示在单位时间间隔内被净化污水的比例,ξ_t 表示在时刻 t 注入净化池中的污水量.文[1]给出了模型参数的极为简便的强相合估计和相应的模拟结果.文[2]把[1]的结果推广到二阶自回归情形,克服了本质上的困难获得相应的结果.本文提出一类更为广泛的正值线性模型     

On the existence of non-negative numerical solutions of the Boltzmann equation

The diamond difference scheme approximating the linear Boltzmann equation may provide partly negative solutions. From the physics' point of view the solutions describing the density of neutrons or photons should be non-negative. It is shown that under assumptions being satisfied by suitable physical problems the solutions are non-negative if the step size is sufficiently small. This is shown for inhomogeneous boundary problems and for eigenvalue problems of the one-dimensional Boltzmann equation. In the latter case the greatest eigenvalue is a measure of the reactivity of reactors. It is proved that this eigenvalue is real and positive.     

A fast and unconditionally positive finite-difference discretization of a multidimensional equation in nonlinear population dynamics

Departing from a nonlinear diffusion–reaction equation which describes the growth of biological films, we derive a finite-difference discretization which preserves unconditionally the positivity and the boundedness of approximations. The design of this method follows a non-traditional approach in the estimation of first-order partial derivatives, and the technique is a variable step-size and exact methodology for which the properties of existence and uniqueness of non-negative and bounded solutions hold for any initial profile which is likewise non-negative and bounded. As a consequence of the exactness, the computer implementation requires less resources and yields faster results than some linear schemes available in the literature. Qualitative comparisons against known linear and nonlinear techniques show that our method produces similar computer results in the two-dimensional case. Moreover, our scheme is also able to simulate the development of microbial films in the three-dimensional scenario. This is a feature that is not inherent to the linear methodologies considered, in view of the large amount of computational resources that such approaches require.     

A global bifurcation index for set-valued perturbations of Fredholm operators

In the paper the homotopy invariant detecting global bifurcations of solutions to multi-parameter equations involving general set-valued perturbations of linear Fredholm operators of non-negative index is introduced. Some applications to the existence problems for differential inclusions are provided.     

On computing distributions of products of non-negative independent random variables

We introduce a new functional representation of probability density functions (PDFs) of non-negative random variables via a product of a monomial factor and linear combinations of decaying exponentials with complex exponents. This approximate representation of PDFs is obtained for any finite, user-selected accuracy. Using a fast algorithm involving Hankel matrices, we develop a general numerical method for computing the PDF of the sums, products, or quotients of any number of non-negative independent random variables yielding the result in the same type of functional representation. We present several examples to demonstrate the accuracy of the approach.     

Enumerative technique for an extreme point fractional program

This paper presents a technique for solving a linear fractional functionals program whose optimum is supposed to occur at one of the extreme points of a convex polyhedron. This polyhedron is defined by a system of linear inequalities with non-negative restrictions on the variables. The approach is a dual method type in the sense that feasibility is achieved only at the optimal solution.     

Existence and uniqueness results for the non-autonomous coagulation and multiple-fragmentation equation

An initial-value problem modelling coagulation and fragmentation processes is studied. The results of earlier papers are extended to models where either one or both of the rates of coagulation and fragmentation depend on time. An abstract integral equation, involving the solution operator to the linear fragmentation part, is investigated via the contraction mapping principle. A unique global, non-negative, mass-conserving solution to this abstract equation is shown to exist. The latter solution is used to generate a global, non-negative, mass-conserving solution to the original non-autonomous coagulation and multiple-fragmentation equation. © 1998 B. G. Teubner Stuttgart–John Wiley & Sons Ltd.