Two positive nontrivial solutions for a class of semilinear elliptic variational systems

We obtain existence and localization results of positive nontrivial solutions for a class of semilinear elliptic variational systems. The proof is based on variants of Schechter's localized critical point theorems for Hilbert spaces not identified to their duals and on the technique of inverse-positive matrices. The Leray-Schauder boundary condition is also involved.     

A filtering method for the interval eigenvalue problem

We consider the general problem of computing intervals that contain the real eigenvalues of interval matrices. Given an outer approximation (superset) of the real eigenvalue set of an interval matrix, we propose a filtering method that iteratively improves the approximation. Even though our method is based on a sufficient regularity condition, it is very efficient in practice and our experimental results suggest that it improves, in general, significantly the initial outer approximation. The proposed method works for general, as well as for symmetric interval matrices.     

On the solution of a mixed nonlinear integral equation

In this paper, we consider a mixed nonlinear integral equation of the second kind in position and time. The existence of a unique solution of this equation is discussed and proved. A numerical method is used to obtain a system of Harmmerstein integral equations of the second kind in position. Then the modified Toeplitz matrix method, as a numerical method, is used to obtain a nonlinear algebraic system. Many important theorems related to the existence and uniqueness solution to the produced nonlinear algebraic system are derived. The rate of convergence of the total error is discussed. Finally, numerical examples when the kernel of position takes a logarithmic and Carleman forms, are presented and the error estimate, in each case, is calculated.     

Cholesky decomposition of a positive semidefinite matrix with known kernel

The Cholesky decomposition of a symmetric positive semidefinite matrix A is a useful tool for solving the related consistent system of linear equations or evaluating the action of a generalized inverse, especially when A is relatively large and sparse. To use the Cholesky decomposition effectively, it is necessary to identify reliably the positions of zero rows or columns of the factors and to choose these positions so that the nonsingular submatrix of A of the maximal rank is reasonably conditioned. The point of this note is to show how to exploit information about the kernel of A to accomplish both tasks. The results are illustrated by numerical experiments.     

Finding the shortest paths by node combination

By repeatedly combining the source node’s nearest neighbor, we propose a node combination (NC) method to implement the Dijkstra’s algorithm. The NC algorithm finds the shortest paths with three simple iterative steps: find the nearest neighbor of the source node, combine that node with the source node, and modify the weights on edges that connect to the nearest neighbor. The NC algorithm is more comprehensible and convenient for programming as there is no need to maintain a set with the nodes’ distances. Experimental evaluations on various networks reveal that the NC algorithm is as efficient as Dijkstra’s algorithm. As the whole process of the NC algorithm can be implemented with vectors, we also show how to find the shortest paths on a weight matrix.     

Extremal graph characterization from the bounds of the spectral radius of weighted graphs

We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of its adjacency matrix. We obtain a lower bound and an upper bound on the spectral radius of the adjacency matrix of weighted graphs and characterize graphs for which the bounds are attained.     

Explicit solution of the finite time L2-norm polynomial approximation problem

The aim of this paper is to present a new approach to the finite time L₂-norm polynomial approximation problem. A new formulation of this problem leads to an equivalent linear system whose solution can be investigated analytically. Such a solution is then specialized for a polynomial expressed in terms of Laguerre and Bernstein basis.     

Design of controller for Lur’e systems guaranteeing dichotomy

In this paper, the problem of controller design for Lur’e systems guaranteeing dichotomy is investigated. On the basis of Kalman-Yakubovich-Popov (KYP) lemma and two frequency equalities, a new methodology for the dichotomy analysis of the Lur’e systems is proposed. A linear matrix inequality (LMI) based criterion is derived, which is equivalent to the Leonov’s frequency-domain one, while for the dichotomy analysis and synthesis which is more straightforward than the frequency-domain one. In virtue of this result, a dynamic output feedback controller ensuring the dichotomy property for Lur’e systems is designed. Finally a numerical example is included to demonstrate the validity and the applicability of the proposed approach.