Robustness and nondegenerateness for linear complementarity problems

In this paper the main focus is on a stability concept for solutions of a linear complementarity problem. A solution of such a problem is robust if it is stable against slight perturbations of the data of the problem. Relations are investigated between the robustness, the nondegenerateness and the isolatedness of solutions. It turns out that an isolated nondegenerate solution is robust and also that a robust nondegenerate solution is isolated. Since the class of linear complementarity problems with only robust solutions or only nondegenerate solutions is not an open set, attention is paid to Garcia's classG _n of linear complementarity problems. The nondegenerate problems inG _n form an open set.     

Efficient Evaluation of the Elastic Forces and the Jacobian in the Absolute Nodal Coordinate Formulation

This paper develops a new procedure for evaluating the elastic forces, the elastic energy and the jacobian of the elastic forces in the absolute nodal coordinate formulation. For this procedure, it is fundamental to use some invariant sparse matrices that are integrated in advance and have the property of transforming the evaluation of the elastic forces in a matrix multiplication process. The use of the invariant matrices avoids the integration over the volume of the element for every evaluation of the elastic forces. Great advantages can be achieved from these invariant matrices when evaluating the elastic energy and calculating the jacobian of the elastic forces as well. The exact expression of the jacobian of the differential system of equations of motion is obtained, and some advantages of using the absolute nodal coordinate formulation are pointed out. Numerical results show that there is important time saving as a result of the use of the invariant matrices.     

Linear Balanceable and Subcubic Balanceable Graphs*

In Math Program 55(1992), 129–168, Conforti and Rao conjectured that every balanced bipartite graph contains an edge that is not the unique chord of a cycle. We prove this conjecture for balanced bipartite graphs that do not contain a cycle of length 4 (also known as linear balanced bipartite graphs), and for balanced bipartite graphs whose maximum degree is at most 3. We in fact obtain results for more general classes, namely linear balanceable and subcubic balanceable graphs. Additionally, we prove that cubic balanced graphs contain a pair of twins, a result that was conjectured by Morris, Spiga, and Webb in ( Discrete Math 310(2010), 3228–3235).     

An intelligent decomposition of pairwise comparison matrices for large-scale decisions

A Pairwise Comparison Matrix (PCM) has been used to compute for relative priorities of elements and are integral components in widely applied decision making tools: the Analytic Hierarchy Process (AHP) and its generalized form, the Analytic Network Process (ANP). However, PCMs suffer from several issues limiting their applications to large-scale decision problems. These limitations can be attributed to the curse of dimensionality, that is, a large number of pairwise comparisons need to be elicited from a decision maker. This issue results to inconsistent preferences due to the limited cognitive powers of decision makers. To address these limitations, this research proposes a PCM decomposition methodology that reduces the elicited pairwise comparisons. A binary integer program is proposed to intelligently decompose a PCM into several smaller subsets using interdependence scores among elements. Since the subsets are disjoint, the most independent pivot element is identified to connect all subsets to derive the global weights of the elements from the original PCM. As a result, the number of pairwise comparison is reduced and consistency is of the comparisons is improved. The proposed decomposition methodology is applied to both AHP and ANP to demonstrate its advantages.     

Self-adjointness of unbounded tridiagonal operators and spectra of their finite truncations

This paper addresses two different but related questions regarding an unbounded symmetric tridiagonal operator: its self-adjointness and the approximation of its spectrum by the eigenvalues of its finite truncations. The sufficient conditions given in both cases improve and generalize previously known results. It turns out that, not only self-adjointness helps to study limit points of eigenvalues of truncated operators, but the analysis of such limit points is a key help to prove self-adjointness. Several examples show the advantages of these new results compared with previous ones. Besides, an application to the theory of continued fractions is pointed out.     

Schur定理的推广

通过计算及归纳的方法,得到了n×n矩阵代数中极大线性无关的反交换2-幂零矩阵的个数,推广了相关文献中的一般线性李代数gl(n)的交换子代数的最大维数这一结论.     

The α-Geometric Structures on Manifold of Positive Definite Hermite Matrices

Geometric structures of a manifold of positive definite Hermite matrices are considered from the viewpoint of information geometry.A Riemannian metric is defined and dual α-connections are introduced.Then the fact that the manifold is ±l-flat is shown.Moreover,the divergence of two points on the manifold is given through dual potential functions.Furthermore,the optimal approximation of a point onto the submanifold is gotten.Finally,some simulations are given to illustrate our results.