A new model for sparse and low-rank matrix decomposition

The robust principal component analysis (RPCA) model is a popular method for solving problems with the nuclear norm and $\ell_1$ norm. However, it is time-consuming since in general one has to use the singular value decomposition in each iteration. In this paper, we introduce a novel model to reformulate the existed model by making use of low-rank matrix factorization to surrogate the nuclear norm for the sparse and low-rank decomposition problem. In such case we apply the Penalty Function Method (PFM) and Augmented Lagrangian Multipliers Method (ALMM) to solve this new non-convex optimization problem. Theoretically, corresponding to our methods, the convergence analysis is given respectively. Compared with classical RPCA, some practical numerical examples are simulated to show that our methods are much better than RPCA.     

Solving nonlinear ordinary differential equations using the NDM

In this research paper, we examine a novel method called the Natural Decomposition Method (NDM). We use the NDM to obtain exact solutions for three different types of nonlinear ordinary differential equations (NLODEs). The NDM is based on the Natural transform method (NTM) and the Adomian decomposition method (ADM). By using the new method, we successfully handle some class of nonlinear ordinary differential equations in a simple and elegant way. The proposed method gives exact solutions in the form of a rapid convergence series. Hence, the Natural Decomposition Method (NDM) is an excellent mathematical tool for solving linear and nonlinear differential equation. One can conclude that the NDM is efficient and easy to use.     

Khovanov homology, open books, and tight contact structures

We define the reduced Khovanov homology of an open book (S,?), and identify a distinguished “contact element” in this group which may be used to establish the tightness or non-fillability of contact structures compatible with (S,?). Our construction generalizes the relationship between the reduced Khovanov homology of a link and the Heegaard Floer homology of its branched double cover. As an application, we give combinatorial proofs of tightness for several contact structures which are not Stein-fillable. Lastly, we investigate a comultiplication structure on the reduced Khovanov homology of an open book which parallels the comultiplication on Heegaard Floer homology defined in Baldwin (2008) [4].     

Fueter's theorem: The saga continues

In this paper is extended the original theorem by Fueter-Sce (assigning an R0,m-valued monogenic function to a C-valued holomorphic function) to the higher order case. We use this result to prove Fueter's theorem with an extra monogenic factor .     

Classification of Dantzig–Wolfe reformulations for binary mixed integer programming problems

In this note, we provide a classification of Dantzig–Wolfe reformulations for Binary Mixed Integer Programming Problems. We specifically focus on modeling the binary conditions in the convexification approach to the Dantzig–Wolfe decomposition. For a general Binary Mixed Integer Programming problem, an extreme point of the overall problem does not necessarily correspond to an extreme point of the subproblem. Therefore, the binary conditions cannot in general be imposed on the new master problem variables but must be imposed on the original binary variables. In some cases, however, it is possible to impose the binary restrictions directly on the new master problem variables. The issue of imposing binary conditions on the original variables versus the master problem variables has not been discussed systematically for MIP problems in general in the literature and most of the research has been focused on the pure binary case. The classification indicates in which cases you can, and cannot, impose binary conditions on the new master problem variables.     

有一致降指数的算子

本文讨论了有拓扑一致降指数的算子的可交换拟幂零摄动:举出反例说明有拓扑一致降指数的算子在可交换拟幂零摄动下是不稳定的;得到有拓扑一致降指数的算子和它的可交换拟幂零摄动的超值域与超核之间的关系;利用这些关系,证明了左(右)Drazin可逆算子在可交换幂零摄动下是稳定的.最后还讨论了Banach空间上B-正则类BR_i(1≤i≤13)中算子的R_i型Kato分解与R_i型超Kato分解.     

The multipliers‐free domain decomposition methods

This article concludes the development and summarizes a new approach to dual‐primal domain decomposition methods (DDM), generally referred to as “the multipliers‐free dual‐primal method.” Contrary to standard approaches, these new dual‐primal methods are formulated without recourse to Lagrange‐multipliers. In this manner, simple and unified matrix‐expressions, which include the most important dual‐primal methods that exist at present are obtained, which can be effectively applied to floating subdomains, as well. The derivation of such general matrix‐formulas is independent of the partial differential equations that originate them and of the number of dimensions of the problem. This yields robust and easy‐to‐construct computer codes. In particular, 2D codes can be easily transformed into 3D codes. The systematic use of the average and jump matrices, which are introduced in this approach as generalizations of the “average” and “jump” of a function, can be effectively applied not only at internal‐boundary‐nodes but also at edges and corners. Their use yields significant advantages because of their superior algebraic and computational properties. Furthermore, it is shown that some well‐known difficulties that occur when primal nodes are introduced are efficiently handled by the multipliers‐free dual‐primal method. The concept of the Steklov–Poincaré operator for matrices is revised by our theory and a new version of it, which has clear advantages over standard definitions, is given. Extensive numerical experiments that confirm the efficiency of the multipliers‐free dual‐primal methods are also reported here. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Analytical solutions to nonlinear equations arising in heat transfer by variational iteration,homotopy perturbation,and Adomian decomposition methods

As thermal conductivity plays an important role on fin efficiency, we tried to solve heat transfer equation with thermal conductivity as a function of temperature. In this research, some new analytical methods called homotopy perturbation method, variational iteration method, and Adomian decomposition method are introduced to be applied to solve the nonlinear heat transfer equations, and also the comparison of the applied methods (together) is shown graphically. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

基于多重工作休假的成批到达离散时间排队的性能分析

研究了一个成批到达的离散时间 Geom$^{[X]}$/Geom/1 多重工作休假排队. 首先,建立了模型的二维马尔可夫链,利用矩阵分析的方法, 导出了稳态队长复杂的概率母函数. 其次, 为了展示此模型与经典无休假Geom$^{[X]}$/Geom/1排队的联系, 给出稳态队长的随机分解结果. 尤其重要的是,发现了条件负二项分布的双参数加法定理, 利用这些结论,得到了矩母函数序下的稳态等待时间的上下界. 进一步,求出了平均队长和平均等待时间的上下界. 最后,提出一些数值例子以验证结论.