期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
The Rank of Rank-2 Modified Matrix
1
作者 盛兴平 陈果良 《Chinese Quarterly Journal of Mathematics》 CSCD 北大核心 2007年第3期352-358,共7页
In this paper, the authors discuss the relationship in detail between the rank of M in the modified matrix M = A + BC^* and the rank of matrix A. The authors do believe the results are useful tools in the modified m... In this paper, the authors discuss the relationship in detail between the rank of M in the modified matrix M = A + BC^* and the rank of matrix A. The authors do believe the results are useful tools in the modified matrices. 展开更多
关键词 modified matrices rank of matrix generalized inverse
下载PDF
THE HOMOGENEOUS DIRICHLET PROBLEM FOR QUASILINEAR ANISOTROPIC DEGENERATE PARABOLIC-HYPERBOLIC EQUATION WITH L^p INITIAL VALUE 被引量:1
2
作者 王志刚 李亚纯 《Acta Mathematica Scientia》 SCIE CSCD 2012年第5期1727-1742,共16页
The aim of this paper is to prove the well-posedness(existence and uniqueness) of the L p entropy solution to the homogeneous Dirichlet problems for the anisotropic degenerate parabolic-hyperbolic equations with L p... The aim of this paper is to prove the well-posedness(existence and uniqueness) of the L p entropy solution to the homogeneous Dirichlet problems for the anisotropic degenerate parabolic-hyperbolic equations with L p initial value.We use the device of doubling variables and some technical analysis to prove the uniqueness result.Moreover we can prove that the L p entropy solution can be obtained as the limit of solutions of the corresponding regularized equations of nondegenerate parabolic type. 展开更多
关键词 degenerate parabolic-hyperbolic equation L p entropy solution device of doubling variables vanishing viscosity method
下载PDF
A RepairableGeoX/G/1 Retrial Queue with Bernoulli Feedback and Impatient Customers 被引量:2
3
作者 Shan GAO Zai-ming LIU 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2014年第1期205-222,共18页
Abstract This paper deals with a discrete-time batch arrival retrial queue with the server subject to starting failures.Diferent from standard batch arrival retrial queues with starting failures,we assume that each cu... Abstract This paper deals with a discrete-time batch arrival retrial queue with the server subject to starting failures.Diferent from standard batch arrival retrial queues with starting failures,we assume that each customer after service either immediately returns to the orbit for another service with probabilityθor leaves the system forever with probability 1θ(0≤θ〈1).On the other hand,if the server is started unsuccessfully by a customer(external or repeated),the server is sent to repair immediately and the customer either joins the orbit with probability q or leaves the system forever with probability 1 q(0≤q〈1).Firstly,we introduce an embedded Markov chain and obtain the necessary and sufcient condition for ergodicity of this embedded Markov chain.Secondly,we derive the steady-state joint distribution of the server state and the number of customers in the system/orbit at arbitrary time.We also derive a stochastic decomposition law.In the special case of individual arrivals,we develop recursive formulae for calculating the steady-state distribution of the orbit size.Besides,we investigate the relation between our discrete-time system and its continuous counterpart.Finally,some numerical examples show the influence of the parameters on the mean orbit size. 展开更多
关键词 discrete-time queue retrial queue starting failure steady state Bernoulli feedback
原文传递
The Pos/neg-weighted 2-medians in Balanced Trees with Subtree-shaped Customers
4
作者 Chun-song BAI Li-ying KANG 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2016年第4期891-898,共8页
This paper deals with the pos/neg-weighted p-median problem on tree graphs where all customers are modeled as subtrees. We present a polynomial algorithm for the 2-median problem on an arbitrary tree. Then we improve ... This paper deals with the pos/neg-weighted p-median problem on tree graphs where all customers are modeled as subtrees. We present a polynomial algorithm for the 2-median problem on an arbitrary tree. Then we improve the time complexity to O(n logn) for the problem on a balanced tree, where n is the number of the vertices in the tree. 展开更多
关键词 Location problems subtree-shaped customers obnoxious facilities
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部