On a synchronization queue with two finite buffers

In this paper, we consider a synchronization queue (or synchronization node) consisting of two buffers with finite capacities. One stream of tokens arriving at the system forms a Poisson process and the other forms a PH-renewal process. The tokens are held in the buffers until one is available from each flow, and then a group-token is instantaneously released as a synchronized departure. We show that the output stream of a synchronization queue is a Markov renewal process, and that the time between consecutive departures has a phase type distribution. Thus, we obtain the throughput of this synchronization queue and the loss probabilities of each type of tokens. Moreover, we consider an extended synchronization model with two Poisson streams where a departing group-token consists of several tokens in each buffer. This revised version was published online in June 2006 with corrections to the Cover Date.     

Matrix Continued Fraction for the Resolvent Function of the Band Operator

The aim of this paper is the expansion of a matrix function in terms of a matrix-continued fraction as defined by Sorokin and Van Iseghem. The function under study is the Weyl function or resolvent function of an operator, given in the standard basis by a bi-infinite band matrix, with p subdiagonals and q superdiagonals, where the p + q – 1 intermediate diagonals are zero. The main goal of this paper is to find, for the moments, an explicit form in terms of the coefficients of the continued fraction, called genetic sums, which lead to a generalization of the notion of a Stieltjes continued fraction. These results are extension of some results already found for the vector case (p = 1) and are a step in the direction towards the solution of the direct and inverse spectral problem. The actual computation of the approximants of the given function as the convergents of the continued fraction is shown to be effective. Some possible extensions are considered.     

Matrix Transformations Between Some Vector-Valued Sequence Spaces

In this paper, we give necessary and sufficient conditions for infinite matrices mapping from the Nakano vector-valued sequence space (X, p) into any BK-space, and by using this result, we obtain the matrix characterizations from (X, p) into the sequence spaces (Y), c₀(Y, q), c(Y), _s(Y), E_r(Y), and F_r(Y), where p = (p_k) and q = (q_k) are bounded sequences of positive real numbers such that p_k 1 for all k N, r 0, and s 1.AMS Subject Classification (2000): 46A45     

A QR Decomposition for Matrix Pencils

This paper describes an efficient and numerically stable modification of the QR decomposition for solving a parametric set of linear least squares problems with a parametric matrix A + B for several values of the parameter . The method is demonstrated on a typical application.     

Invariant Core Theorems for Double Sequences

The definition for the convergence of a double sequence was presented by A. Pringsheim [9]. Recently, the definitions of limit inferior, limit superior, and the core of a double sequence are presented. By using these definitions and the notion of regularity for four-dimensional matrices, an invariant core theorem for double sequences is presented.AMS Subject Classification (2000) primary 40B05 secondary 40C05     

HBa(D)空间的内插定理

研究了一类由H^p空间构成的Ba空间的内插性质,给出了H^Ba(D)空间的三个内插定理。     

多项式矩阵方程及线性控制系统

给出了求解多项式矩阵方程的一种新方法—矩阵序列结构算法.并讨论了它在线性控制的动态补偿器设计中的应用.     

求解矩阵方程组的ABS算法

本文基于一类线性空间(Rn,n)n,n,建立求解( )X=B形式的矩阵方程组的ABS算法.讨论基本的ABS算法和两个特殊的ABS算法及其性质.并将其中的Huang算法用于求解带有各种约束(包括对称和稀疏约束)的拟牛顿方程.     

D[X2m]的下界估计与X2m矩阵的快速构造

本文利用有向图理论研究了Xn矩阵的特性,给出了X2m矩阵类的快速构造方法,证明了拉丁方矩阵D[X2m]数目的下界估计是：2m(2m)! ∑^mi=2[(2m)!]^2/П^ij=1Kj!П^rj=1bj!。     

本原分式 Artin 的 Exchange 环上矩阵环

文章证明了：如果Ｒ或要为本原Ａｒｔｉｎ的Ｅｘｃｈａｎｇｅ环,则Ｍｎ（Ｒ）≌（Ｓ）当且仅当Ｒ≌Ｓ。