矩阵方程X＋A^TX^—1A=Q存在可稳定化解的充分必要条件

１引言一般的时离散代数Ｒｉｃｃａｔｉ方程具有下面的形式：这里如果方程（１）中的系数矩阵满足：（ｎ＝ｍ）则方程（１）变为当Ｑ＝ＱＴ＞０时,Ｅｎｇｗｅｒｄａ,詹兴致等人研究了方程（２）存在正定解的充分必要条件［１］［２］［３］．本章利用方程（２）与（１）的关系,从另一角度讨论了Ｑ为对称矩阵时,方程（２）存在可稳定化解的充分必要条件．２基本概念与记号首先我们简单回顾一下以前的概念与记号．矩阵束Ｍ—Ｎ,Ｍ,Ｎ为正则的,也就是说ｄｅｔ（λＭ－Ｎ）＝０;如果λ０为ｄｅｔ（λＭ－Ｎ）的ｋ重根,则称λ０为它的ｋ…     

求解线性矩阵方程的初等变换法

求解线性矩阵方程的初等变换法杨兴东（南京气象学院基科系，南京２１００４４）杨兴洲（南京大学成人教育学院，南京２１００９３）文［１］给出了线性矩阵方程ＡＸＢ＝Ｃ有解的简单判别法则，本文则应用初等变换，给出矩阵方程ＡＸＢ＝Ｃ（１）的简便解法．引理１［２］...     

非线性抛物型积分微分方程有限元方法的插值后处理技术

本文以两类非线性抛物型积分微分方程为例，首次尝试将插值后处理思想［１］应用到非线性发展型方程上，获得了半离散和全离散有限元解，经插值后处理之后在Ｌ∞（Ｈ１）；Ｌ∞（Ｌ２）模意义下，整体超收敛１阶的高精度，并且计算量没有因此而增加．本文引进并证明较文［２］更广泛的一类椭圆Ｈ１－Ｖｏｌｔｅｒｒａ投影的Ｈ１；Ｌ２，Ｈ－１模最优估计．本文的分析方法可在各类发展型微分及积分微分方程上面通用．     

一类自适应的单块法及其变步长实现方案

１．引言解 Ｓｔｉｆｆ ＯＤＥｓ初值问题的自开始型单块法已为 ［４, ５］所研究．这里, ｅ＝（１,１,……,１）Ｔ为单位矩阵,当 时见 ［４］,当 ０＜ ａ１＜ ａ２＜…＜ ａｒ＝ ｒ时见［５］。 众所周知,解（１．１）的有效方法通常是隐的．仅当有效地解决了其变步长计算问题并具有有效的迭代法求其解时,这样的方法才能有效地用于实际计算．后者是不言而喻的,前者是由于定步长计算或者往往带来精度的严重损失,或者会带来计算量的严重增加（当存在（ｔ０,Ｔ］的两个子区间,该两区间上的合理积分步长相差悬殊时,就会出现这种…     

有理样条不可约解的行列式表示

１引言在文［１］中,对于剖分ａ＝ｘ０＜ｘ１＜…＜ｍｎ＝ｂ及给定的ｙ０,ｙ１,…,　…,Ｌ＋Ｍ－１,我们构造了有理样条Ｓ［Ｌ,Ｍ（ｘ）Ｑ［Ｌ,Ｍ］为次数不超过ｍ的多项式全体．在［１］中,已经讨论了Ｓ［Ｌ,Ｍ］（ｘ）的存在性,并指出：若问题（１）（２）（３）可解,则解唯一这里总假设问题（１）（２）（３）可解．２有理样条解不可约的充要条件由Ｓ［Ｌ,Ｍ］（ｘ）的依区间递推算法（见［１］）,我们只需讨论［ｘ０,ｘ１］上的情形．当［Ｘ０,ｘ１］时,将Ｓ［Ｌ,Ｍ］　（ｘ）,Ｐ［Ｌ,Ｍ］　（ｘ）和Ｑ［Ｌ,Ｍ］（…     

复数方程

复数方程高修惠，胡正锋（江苏省邳州中学２２１３００）［基本概念］１．复数集内的方程统称为复数方程；求复数方程的解的过程，叫做解复数方程．２．对一元二次方程ａｘ‘十ｂｘ＋ｃ—０（ａ一０）有下述结论：（１）若ａ，ｂ，ｃ∈Ｒ，则当△＞０时，方程有两个不相等...     

一类Toeplitz矩阵的群逆

Ｔｏｅｐｌｉｔｚ矩阵Ｔｎ＝（ｔｉ－ｊ）ｎｉ，ｊ＝０在信号处理、系统理论、逼近论、正交多项式、积分方程数值解等许多领域常常遇到．易知，Ｔｏｅｐｌｉｔｚ矩阵Ｔｎ的逆矩阵一般不再是Ｔｏｅｐｌｉｔｚ矩阵．１９７２年，Ｇｏｈｂｅｒｇ和Ｓｅｍｅｎｃｕｌ［１］给出...     

关于一种循环类预条件方程组的快速求解

１引言考虑下列Ｎ阶线性方程组其中Ｃ１＝,Ｃ２＝０≤ｉ,ｊ≤Ｎ－１,是Ｎ阶循环矩阵,Ｊ１＝（Ｊ）是Ｎ阶置换矩阵,其元素分别满足１９９３年,Ｔ,Ｋ．Ｋｕ,Ｃ．Ｃ．Ｊ．Ｋｕｏ在［１］中取Ｃ１,Ｃ２为实对称循环矩阵,而Ｃ１＋Ｊ１Ｃ２作为预条件矩阵来求解在数字信号处理中有一定应用的Ｔｏｅｐｌｉｔｚ加Ｈａｎｋｅｌ线性方程组［２］,得到了一种高效的预处理其轭梯度算法．当Ｔｏｅｅｌｉｔｚ与Ｈａｎｋｅｌ矩阵之和为正定矩阵且条件数适中时,所需运算量可达到０（Ｎｌｏｇ２Ｎ）,比原有算法［２,３,４］的运算量０（Ｎ２）…     

T(t)积分半群

本文引入Ｔ（ｔ）积分半群的概念，它是ｎ次积分半群［１］及α次积分半群［２］的推广．我们给出Ｔ（ｔ）积分半群的定义、生成定理，并讨论相应的一类积分型抽象Ｃａｕｃｈｙ问题解的存在唯一性．     

任意体上的矩阵方程［X_（nn）A_（ns），X_（nn）B_（nt）］＝［A_

本文研究了任意体上的矩阵方程［Ｘ（ｎｎ）Ａ（ｎｓ），Ｘ（ｎｎ）Ｂ（ｎｔ）］＝［Ａ（ｎｓ），０］（１）给出了（１）相容的充要条件、通解的表达式、解的性质及其实用解法．     

A REPRESENTATION FORMULA RELATED TO SCHR(O)DINGER OPERATORS

Schr(o)dinger operator is a central subject in the mathematical study of quantum mechanics.Consider the Schrodinger operator H = -△ V on R, where △ = d2/dx2 and the potential function V is real valued. In Fourier analysis, it is well-known that a square integrable function admits an expansion with exponentials as eigenfunctions of -△. A natural conjecture is that an L2 function admits a similar expansion in terms of "eigenfunctions" of H, a perturbation of the Laplacian (see [7], Ch. Ⅺ and the notes), under certain condition on V.     

Qualitative Analysis of Bifurcating Solutions in the Lengyel-Epstein Model

One of the most fundamental problems in theoretical biology is to explain the mechanisms by which patterns and forms are created in the＇living world. In his seminal paper ＂The Chemical Basis of Morphogenesis＂, Turing showed that a system of coupled reaction-diffusion equations can be used to describe patterns and forms in biological systems. However, the first experimental evidence to the Turing patterns was observed by De Kepper and her associates（1990） on the CIMA reaction in an open unstirred reactor, almost 40 years after Turing＇s prediction. Lengyel and Epstein characterized this famous experiment using a system of reaction-diffusion equations. The Lengyel-Epstein model is in the form as follows     

On a class of self-similar processes with stationary increments in higher order Wiener chaoses

We study a class of self-similar processes with stationary increments belonging to higher order Wiener chaoses which are similar to Hermite processes. We obtain an almost sure wavelet-like expansion of these processes. This allows us to compute the pointwise and local Hölder regularity of sample paths and to analyse their behaviour at infinity. We also provide some results on the Hausdorff dimension of the range and graphs of multidimensional anisotropic self-similar processes with stationary increments defined by multiple Wiener–Itô integrals.     

(0,1 ;0)-INTERPOLATION ON INFINITE INTERVAL (-∞, +∞)

In this paper, we study the explicit representation and convergence of (0, 1; 0)-interpolation on infinite interval, which means to determine a polynomial of degree ≤ 3n - 2 when the function values are prescribed at two set of points namely the zeros of Hn(x) and H′n(x) and the first derivatives at the zeros of H′n(x).     

On a class of Riemann surfaces

It is considered the class of Riemann surfaces with dimT1 = 0, where T1 is a subclass of exact harmonic forms which is one of the factors in the orthogonal decomposition of the spaceΩH of harmonic forms of the surface, namely The surfaces in the class OHD and the class of planar surfaces satisfy dimT1 = 0. A.Pfluger posed the question whether there might exist other surfaces outside those two classes. Here it is shown that in the case of finite genus g, we should look for a surface S with dimT1 = 0 among the surfaces of the form Sg\K , where Sg is a closed surface of genus g and K a compact set of positive harmonic measure with perfect components and very irregular boundary.     

CONTENTS OF VOLUME 30

正~~     

Instructions for contributions

正Applied Mathematics-A Journal of Chinese Universities,Series B(Appl.Math.J.Chinese Univ.,Ser.B)is a comprehensive applied mathematics journal jointly sponsored by Zhejiang University,China Society for Industrial and Applied Mathematics,and Springer-Verlag.It is a quarterly journal with     

Journal of Mathematical Research with Applications Guide for Authors

正Journal overview:Journal of Mathematical Research with Applications(JMRA),formerly Journal of Mathematical Research and Exposition(JMRE)created in 1981,one of the transactions of China Society for Industrial and Applied Mathematics,is a home for original research papers of the highest quality in all areas of mathematics with applications.The target audience comprises:pure and applied mathematicians,graduate students in broad fields of sciences and technology,scientists and engineers interested in mathematics.     

Staircase transportation problems with superadditive rewards and cumulative capacities

A cumulative-capacitated transportation problem is studied. The supply nodes and demand nodes are each chains. Shipments from a supply node to a demand node are possible only if the pair lies in a sublattice, or equivalently, in a staircase disjoint union of rectangles, of the product of the two chains. There are (lattice) superadditive upper bounds on the cumulative flows in all leading subrectangles of each rectangle. It is shown that there is a greatest cumulative flow formed by the natural generalization of the South-West Corner Rule that respects cumulative-flow capacities; it has maximum reward when the rewards are (lattice) superadditive; it is integer if the supplies, demands and capacities are integer; and it can be calculated myopically in linear time. The result is specialized to earlier work of Hoeffding (1940), Fréchet (1951), Lorentz (1953), Hoffman (1963) and Barnes and Hoffman (1985). Applications are given to extreme constrained bivariate distributions, optimal distribution with limited one-way product substitution and, generalizing results of Derman and Klein (1958), optimal sales with age-dependent rewards and capacities.To our friend, Philip Wolfe, with admiration and affection, on the occasion of his 65th birthday.Research was supported respectively by the IBM T.J. Watson and IBM Almaden Research Centers and is a minor revision of the IBM Research Report [6].