圆盘定理的改进与弱连对角占优矩阵

本文对圆盘定理进行了改进，给出了特征值分布新的估计，由此引出了弱连对角占优矩阵，讨论了其基本性质，重点分析了该类矩阵的逆与分裂特征，证明了在该类矩阵条件下Ｈ－相容分裂是收敛分裂，并给出迭代矩阵谱半径的上界及ＳＯＲ算法中参数ω的选取范围。     

Non-cooperative implementation: A survey of recent results

Strategic decentralization of collective decision-making is considered when the agents' behaviour is non-cooperative. Specifically they use dominant, maximin risk-avert or sophisticated strategies. The existing results applying these equilibrium concepts are reviewed in three familiar economically meaningful contexts: ordinal (as in voting), random (as in bargaining) and quasilinear (as in public goods problems).     

On diagonal-Schur complements of block diagonally dominant matrices

It is known that the diagonal-Schur complements of strictly diagonally dominant matrices are strictly diagonally dominant matrices [J.Z. Liu, Y.Q. Huang, Some properties on Schur complements of H-matrices and diagonally dominant matrices, Linear Algebra Appl. 389 (2004) 365-380], and the same is true for nonsingular H-matrices [J.Z. Liu, J.C. Li, Z.T. Huang, X. Kong, Some properties of Schur complements and diagonal-Schur complements of diagonally dominant matrices, Linear Algebra Appl. 428 (2008) 1009-1030]. In this paper, we research the properties on diagonal-Schur complements of block diagonally dominant matrices and prove that the diagonal-Schur complements of block strictly diagonally dominant matrices are block strictly diagonally dominant matrices, and the same holds for generalized block strictly diagonally dominant matrices.     

A fast algorithm for solving a Toeplitz system

In this paper, we present a fast algorithm for solving Symmetric penta-diagonal systems. We give the feasibility and Stability analysis of the algorithm. Moreover, parallel computations can be implemented in the algorithm. The numerical examples verify the efficiency of the algorithm.     

On modified block SSOR iteration methods for linear systems from steady incompressible viscous flow problems

In order to solve the large sparse systems of linear equations arising from numerical solutions of two-dimensional steady incompressible viscous flow problems in primitive variable formulation, we present block SSOR and modified block SSOR iteration methods based on the special structures of the coefficient matrices. In each step of the block SSOR iteration, we employ the block LU factorization to solve the sub-systems of linear equations. We show that the block LU factorization is existent and stable when the coefficient matrices are block diagonally dominant of type-II by columns. Under suitable conditions, we establish convergence theorems for both block SSOR and modified block SSOR iteration methods. In addition, the block SSOR iteration and AF-ADI method are considered as preconditioners for the nonsymmetric systems of linear equations. Numerical experiments show that both block SSOR and modified block SSOR iterations are feasible iterative solvers and they are also effective for preconditioning Krylov subspace methods such as GMRES and BiCGSTAB when used to solve this class of systems of linear equations.     

病态线性方程组新的Jacobi迭代解法

给出了解病态线性方程组的一种新的Jacobi迭代算法,并证明了算法的收敛性;通过具体算例说明了算法的实用性和有效性.     

The DJL Conjecture for CP Matrices over Special Inclines

Drew, Johnson, and Loewy conjectured that for n ≥ 4, the CP-rank of every n × n completely positive real matrix is at most [n²/4]. While this conjecture has recently been disproved for completely positive real matrices, we show that this conjecture is true for n × n completely positive matrices over certain special types of inclines. In addition, we prove an incline version of Markham's theorems which gives sufficient conditions for completely positive matrices over special inclines to have triangular factorizations.     

Updating Insights into the Catalytic Domain Properties of Plant Cellulose synthase (CesA) and Cellulose synthase-like (Csl) Proteins

The wall is the last frontier of a plant cell involved in modulating growth, development and defense against biotic stresses. Cellulose and additional polysaccharides of plant cell walls are the most abundant biopolymers on earth, having increased in economic value and thereby attracted significant interest in biotechnology. Cellulose biosynthesis constitutes a highly complicated process relying on the formation of cellulose synthase complexes. Cellulose synthase (CesA) and Cellulose synthase-like (Csl) genes encode enzymes that synthesize cellulose and most hemicellulosic polysaccharides. Arabidopsis and rice are invaluable genetic models and reliable representatives of land plants to comprehend cell wall synthesis. During the past two decades, enormous research progress has been made to understand the mechanisms of cellulose synthesis and construction of the plant cell wall. A plethora of cesa and csl mutants have been characterized, providing functional insights into individual protein isoforms. Recent structural studies have uncovered the mode of CesA assembly and the dynamics of cellulose production. Genetics and structural biology have generated new knowledge and have accelerated the pace of discovery in this field, ultimately opening perspectives towards cellulose synthesis manipulation. This review provides an overview of the major breakthroughs gathering previous and recent genetic and structural advancements, focusing on the function of CesA and Csl catalytic domain in plants.     

Interference suppression for the LTE uplink

Interference cancellation is expected to have significant importance for next-generation wireless communication systems due to various co-channel deployment scenarios and denser frequency reuse. In this study, an interference cancellation receiver that exploits the unique characteristics of single-carrier frequency-division multiple access based systems is proposed. The proposed receiver suppresses the co-channel dominant interference by blanking frequency-domain samples where the desired and interfering signals overlap. In order to improve the performance, demodulation and regeneration stages can be introduced and repeated multiple times. Further enhancement is possible by initially accommodating a group of reliable symbols before the iterations. The simulation results indicate that proposed methods work particularly well for low overlap ratios compared to interference coordination and no cancellation schemes.