线性常微分方程组解的特征数的估计

复数域上线性系统ｘ＝Ａ（ｔ）ｘ，当Ａ（ｔ）＝（ａｉｊ（ｔ））ｎ×ｎ具有（ｎ，Ｎ，ｒ） 差异性质且ｒｎ时，解的特征数ｊ有估计λｊ－ｌｉｍｔ→∞１ｔ∫ｔｔ０Ｒｅａｊ（τ）ｄτｎ－１ｒ＋１－ｎｌｉｍｔ→∞１ｔ∫ｔｔ０Ａ（τ）ｄτ，ｊ＝１，２，…，ｎ，其中Ａ（ｔ）＝ｍａｘ｛｜ａｉｊ（ｔ）｜：ｉ，ｊ＝１，２，…，ｎ，ｉ≠ｊ．｝     

一台机器在加工时间相同准备时间可控时的Lmax问题

一组ｎ个工件需在一台机器上加工，工件ｊ所需的加工时间，应交工时间、准备时间分别为ｐｊ、ｄｊ、ｒｊ＾０，准备时间可压缩量为ｘｊ，０≤ａｊ≤ｒｊ＾０，压缩权因子为ωｊ由最大延误Ｊｍａｘ和压缩费用∑ωｊｘｊ可构成文中（Ｐ１）－（Ｐ３）三个排序问题，在ｄｊ＝０的条件下，引文「１」的作者证明了（Ｐ１）、（Ｐ３）为强ＮＰ－Ｃ的。本文在ｄｊ任意，ｐｊ＝ωｊ＝１的条件下，对（ｐ１）－（Ｐ３）给出了一个伪多项式时间     

厄米特矩阵的迹的几点性质

应用矩阵Ａ＝（ａｉｊ）∈Ｃｎ×ｎ的弗罗伯尼范数ＡＦ和谱范数ＡＳ，研究厄米特矩阵的迹的性质，得到几个结论：Ｔｒ（ＡＢ）＝∑ｎｉ＝１λｉ∑ｎｊ＝１ｔｉｊμｊ（λｉ，μｊ分别为Ａ，Ｂ的特征值，０≤ｔｉｊ≤１，且∑ｎｉ＝１ｔｉｊ＝１，ｊ＝１，２，…，ｎ）；Ｔｒ（ＡＢ）≤Ｔｒ（Ａ）ＢＳ；Ｔｒ（ＡＢ）Ｈ（ＡＢ）］≤Ｔｒ（ＡＨＡ）［ｍａｘ１≤ｉ≤ｎλｉ］２（λｉ是Ｂ的特征值）等．     

半群与弱椭圆算子(英)

设ｉＡｊ（１≤ｊ≤）是有界Ｃ_０群的可交换生成元,Ｐ（Ａ）＝∑_｜μ｜≤２ａ_μＡ~μ（Ａ~μ＝Ａ_１~μ…Ａ_ｎ~μｎ）如果Ｐ是弱椭圆的且其实部是上有界的,则我们证明Ｐ（Ａ）生成一个Ｃ_０半群．     

常返的随机徘徊的零集的维数

设｛Ｘｎ｝是Ｚ上的常返的随机徘徊，其均值为０，其分布属于指数为α（１＜α≤２）的稳定律吸引场．令Ａ（ω）＝｛ｎ：Ｘｎ（ω）＝０｝，则对ａ．ｓ．的ω，Ａ（ω）是一个按［５］中意义下的指数为的分形．     

一类扩展线性规划问题的推广

研究文［１］的扩展线性规划问题的更一般的情形：ｍｉｎｚ＝∑ｎｊ＝１ｃｊ｜ｘｊ｜，ｓ．ｔＡｘ＝ｂ，ｘｊ≥０，ｊ∈Ｉ｛１，２，…，ｎ｝。给出其不扩展单纯形表的单纯形算法。     

关于两类污染数据回归分析的参数估计

研究简单回归模型：ｙｊ＝ａ＋βｘｊ＋εｊ，ｊ＝１，２，…，ｎ，其中Ｅεｊ＝０，Ｅε＾２ｊ＝σ＾２ｊ；但ｙ１，ｙ２，…，ｙｎ受到另一独立同分布随机变量序列ｔ，ｔ２，…，ｔｎ两种不同方式的污染，ｔｊ与ｙｊ独立。本文给出了两种污染方式下的ａ、β和污染参数的估计。     

随机规划的弱微分性

本文将随机函数ｖ（ｘ，ω）引入随机规划问题ｚ（ｖ（ω）＝ｓｕｐｙ∈Ｙ｛Ｅｆ（ｖ（ω），ｙ）│Ｅｇｉ（Ｖ（ω），ｙ）≤０，ｊ＝１，Ｊ｝中。对相应的最优化问题的稳定性和最优值函数的可微性作了一些探讨。     

关于吸收马氏链的注记

设Ｐ０＝（Ｐｉｊ）是一个状态空间为Ｅ＝（０，１，２，．．．）的吸收马氏链，其中“０”是唯一的吸收状态，其它状态构成一个非本质类，定义一个新链Ｐ１＝（Ｐｉｊ／１－ｐｉ０）ｉ，ｊ∈Ｅ１，Ｅ１＝（１，２，．．．）。讨论了Ｐ１的状态性质（常返，正常返）与Ｐ０的吸收性质之间的关系。     

具有交互神经传递时滞的神经网络的稳定性

本文研究了具有交互神经传递时滞的神经网络模型ｘ′ｉ（ｔ）＝－ｂｉｘｉ（ｔ）＋∑ｎｊ＝１ωｉｊｆｊ（ｘｊ（ｔ－τｊ））＋ｐｉ（ｔ＞０；ｉ＝１，２，…，ｎ）平衡点的全局渐近稳定性，并获得了若干充分条件·     

A MPI PARALLEL PRECONDITIONED SPECTRAL ELEMENT METHOD FOR THE HELMHOLTZ EQUATION

Spectral element method is well known as high-order method, and has potential better parallel feature as compared with low order methods. In this paper, a parallel preconditioned conjugate gradient iterative method is proposed to solving the spectral element approximation of the Helmholtz equation. The parallel algorithm is shown to have good performance as compared to non parallel cases, especially when the stiffness matrix is not memorized. A series of numerical experiments in one dimensional case is carried out to demonstrate the efficiency of the proposed method.     

Combination method for parallel computation in ODE

In this paper, a 4th order parallel computation method with four processes for solving ODEs is discussed. This method is the Runge-Kutta method combined with a linear multistep method, which overcomes the difficulties of the 4th order parallel Runge-Kutta method discussed in [1]. The concept of critical speedup for parallel methods is also defined, and speedups of some methods are analyzed by using this concept.     

A parallel two-grid linearized method for the coupled Navier-Stokes-Darcy problem

In this paper, based on a two-grid method and a recent local and parallel finite element method, a parallel two-grid linearized method for the coupled Navier-Stokes-Darcy problem is proposed and analyzed. This method ensures that all the local subproblems on the fine grid can be solved in parallel. Optimal error bounds of the approximate solution are obtained. Finally, numerical experiments are presented to demonstrate the accuracy and effectiveness of the proposed method.     

PARALLEL CHAOTIC MULTISPLITTING ITERATIVE METHODS FOR THE LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEM

1. IntroductionWe consider the linear complementarity problem LCP(M,q): Find a z E m such thatwhere M = (mij) E boxs and q ~ (qi) 6 m are given real matriX and vector, respectively.This problem axises in various scientific computing areas such as the Nash equilibritun poillt ofa bimatrir game (e.g., Cottle and Dantzig[4] and Lelnke[12j) and the free boundary problems offluid mechedcs (e.g., Cryer[8]). There have been a lot of researches on the approximate solutionof the linear complemeat…     

一种迭代格式的有限元并行算法*

本文提出了一种求解有限元方程的迭代格式的并行算法.该方法在线性代数方程迭代解法的基础上,引进并行运算步骤;并且运用加权残数方法,通过选择适当的权函数,推导了该并行算法的有限元基本格式.该方法在西安交通大学BLXSI-6400并行计算机上程序实现.计算结果表明它能有效地提高运算速度,减少计算时间,是一种有效的求解大型结构有限元方程的并行算法.     

一类特殊矩阵方程的并行预处理变形共轭梯度算法

研究了求解一类矩阵方程AXB=C,提出了一种并行预处理变形共轭梯度法．该方法给出一种迭代法的预处理模式．首先给出的预处理矩阵是严格对角占优矩阵,构造并行迭代求解预处理矩阵方程的迭代格式,进而使用变形共轭梯度法并行求解．通过数值试验,预处理变形共轭梯度法与直接使用变形共轭梯度法相比较,该算法不仅有效提高了收敛速度,而且具有很高的并行性．     

A local parallel superconvergence method for the incompressible flow by coarsening projection

In this article, we investigate a local parallel superconvergence method by coarsening projection for the incompressible Stokes flow. The method is a combination of the local superconvergence technique and the given framework of local parallel method. For the smooth subdomains, the local superconvergence method is applied in a higher order finite dimensional space corresponding to an appropriate coarse mesh on interior domain. Moreover, a useful and flexible local parallel method is designed to obtain the local parallel superconvergence results of presented method, which offset theoretical limitation of the model without the smoothness of the exact solution and a priori regularity of the underlying problem over the whole domain. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1209–1223, 2015     

Parallel Multi-Stage & Multi-Step Method in ODEs

In this paper, the theory of parallel multi-stage and multi-step method is discussed, which is a form of combining Runge-Kutta method with linear multi-step method that can be used for parallel computation.     

Efficient implementation of Jacobi's diagonalization method on the DAP

Summary The DAP architecture brings into consideration the Jacobi method where several non-interacting rotations can be performed in parallel. However the design of the algorithm is crucial in a parallel environment. In this paper we shall consider two techniques specifically designed to reduce the organisation and the arithmetic components of the parallel Jacobi method.     

一类刚性大系统的并行组合方法

本文针对一类分解的刚性大系统提出一种并行组合方法（ＰＣＭ）,该方法将系统分割的并行化方法与并行化方法相结合,采用并行显式Ｒｕｎｇｅ－ｋｕｔｔａ（ＲＫ）方法求解非刚性子系统,采用并行Ｒｏｓｅｎｂｒｏｃｋ方法求解刚性子系统,文中讨论了方法的相容阶、并对方法的收敛性进行了分析,数值结果表明该方法对于分解的刚性大系统的求解是实用和有效的。