Graphs whose critical groups have larger rank

The critical group C(G) of a graph G is a refinement of the number of spanning trees of the graph and is closely connected with the Laplacian matrix. Let r(G) be the minimum number of generators (i.e., the rank) of the group C(G) and β(G) be the number of independent cycles of G. In this paper, some forbidden induced subgraphs are given for r(G) = n − 3 and all graphs with r(G) = β(G) = n − 3 are characterized.     

一个矩阵分解算法的推广及应用

对样本相关系数矩阵等行和分解算法作了简化和推广,使算法不仅可以应用在基于正态总体非独立样本的假设检验问题,也可以有效地运用在最优化算法中牛顿法等与二次函数极小化有关的问题上.     

线性不确定系统的鲁棒D型迭代学习控制

研究一类线性不确定系统的鲁棒D型迭代学习控制问题.首先针对一类线性标称控制对象,建立其迭代学习控制的二维模型;然后基于获得的二维模型,利用二维系统稳定性理论,获得系统在迭代初态与期望初态一致和不一致两种情形下的D型迭代学习控制律的存在条件和设计方法;进一步,将所得结果推广至控制对象包含不确定性的情形.所得结果以线性矩阵不等式(LMI)的形式给出,可以方便地利用Matlab中的LMI工具箱求解.最后,数值仿真实例验证了本文所提方法的有效性.     

单一成本目标数据处理服务外包业务工艺规划研究

本文对数据处理服务外包业务工艺规划所涉及的要素——成品数据要求、工艺方法、工序排序和设备工具进行了分析,结合数据处理业务流程特点,采用数学规划方法建立了非线性优化模型。在综合比较各类求解非线性规划的方法的基础上,鉴于遗传算法具有编码容易、搜索速度快以及鲁棒性等优点,选择遗传算法求解单目标优化问题。通过选取实际企业数据,利用MATLAB编程求解,验证了本文结果的适用性。     

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.     

On general summability factor theorem of infinite series

A lower triangular matrix with nonzero principal diagonal entries is called a triangle. In this paper we obtain the sufficient conditions for ∑a_nλ_n to be summable ∣A∣_k whenever ∑a_n is summable ∣T∣_k for a triangle T.     

An alternating projected gradient algorithm for nonnegative matrix factorization

Due to the extensive applications of nonnegative matrix factorizations (NMFs) of nonnegative matrices, such as in image processing, text mining, spectral data analysis, speech processing, etc., algorithms for NMF have been studied for years. In this paper, we propose a new algorithm for NMF, which is based on an alternating projected gradient (APG) approach. In particular, no zero entries appear in denominators in our algorithm which implies no breakdown occurs, and even if some zero entries appear in numerators new updates can always be improved in our algorithm. It is shown that the effect of our algorithm is better than that of Lee and Seung’s algorithm when we do numerical experiments on two known facial databases and one iris database.     

An improved method for the computation of the Moore-Penrose inverse matrix

In this article we provide a fast computational method in order to calculate the Moore-Penrose inverse of singular square matrices and of rectangular matrices. The proposed method proves to be much faster and has significantly better accuracy than the already proposed methods, while works for full and sparse matrices.     

Condensed Cramer rule for some restricted quaternion linear equations

In this paper, we derive an alternative more condensed Cramer rule for the unique solution of some restricted left and right systems of quaternion linear equations. The findings of this paper extend some known results in the literature.