一类非线性延迟微分方程数值解的振动性分析

本文考虑一类非线性延迟微分方程-带有单峰造血率的造血模型数值解的振动性及非振动性。运用线性化理论,把非线性差分方程的振动性转化为其对应的线性差分方程的振动性,通过判断线性方程的特征方程根的情况,得到了非线性差分方程振动和存在非振动解的充分条件。对于非振动的数值解,证明了非振动的数值解最终都趋于方程的平衡解。为了更有力的说明我们的结果给出了相应的算例.     

关于红细胞模型数值解的振动性分析

主要考虑了一类红细胞模型数值解的振动性,通过振动性的理论将非线性延迟微分方程转化为相应的线性延迟微分方程,再利用线性θ-方法,得到相应的差分方程,从而得到数值解振动的条件以及非振动解的渐近性质.为了更好的说明结果,最后给出了一些算例.     

一类非线性延迟微分方程θ-方法的数值解振动分析

该文考虑一类非线性延迟微分方程数值解的振动性.通过振动性的理论将这个非线性延迟微分方程的振动性转化为相应的线性延迟微分方程的振动性,再利用线性θ-方法的相关内容得到相应数值解的形式,从而得到数值解振动的条件以及非振动解的一些性质.为了更有力说明结果,最后给出了相应的算例.     

种群动力系统的数值解的振动性分析

本文主要研究下面动力系统的非线性延迟微分方程x't(t)+αVmx(t)p(t-τ)/βp+xp(t-τ)=λ,t≥0 数值解的振动性.这是由Mackey和Glass[1]提出来的关于动力系统疾病的方程.本文得到了数值方法振动的条件.同时对非振动的数值解的性质也做了研究,为了验证得到的结果,给出了数值算例.     

一类非线性延迟微分方程数值解的振动性分析

本文考虑一类非线性延迟微分方程-带有单调造血率的造血模型数值解的振动性.通过研究特征方程根的情况得到数值解振动的条件并且讨论了非振动的数值解的一些性质.为了更有力的说明我们的结果,最后给出了相应的算例.     

食物受限人口模型中非线性延迟微分方程数值解的振动性

本文讨论食物受限人口模型中的一个非线性延迟微分方程数值解的振动性.通过应用两种θ-方法,即线性θ-方法和单腿θ-方法,构造指数θ-方法,得到数值解振动的条件,进一步考虑非振动解的渐近行为,最后给出两个数值算例.     

一类二阶非线性微分方程解的渐近性状

引言本文研究二阶非线性方程的解之渐近性状——有界性、单调性、振动性和振动解振幅的性质.关于线性方程+p(t)x=0的上述性质之研究,已经有许多工作(见书[1,2]).关于非线性方程     

混合型脉冲微分方程的数值振动性分析

该文主要研究θ-方法的自变量分段连续混合型脉冲微分方程的数值解的振动性,获得了θ-方法保持自变量分段连续混合型脉冲微分方程振动与非振动的条件.最后给出了一些算例来验证所获理论成果的正确性.     

脉冲时滞微分方程解的整体存在唯一性、振动性与非振动性

本文讨论脉冲时滞微分方程X’(t)=f(t,x(t-T_1(t)),…,x(t-T_n(t))),x(t_k)-x(t_k~-)=I_k(x(t_k~- )).获得了方程(E) 解的一个整体存在唯一性定理.当(E)是线性方程时,给出了由时滞微分方程解的振动性或非振动性刻划出相应的脉冲时滞微分方程的同样性质的一般性脉冲条件.     

一类含有分数阶导数的二自由度耦合系统

研究了一类含有小扰动具有分数阶导数的二自由度耦合振子的振动问题.首先对含有由Riemann Liouville定义的分数阶导数的振动方程组构造渐近解,利用多重尺度法,得到振动问题的可解性条件.然后在可解性条件下,得到分数阶指数、系数及小参数对振动的影响,并求得渐近解.最后研究了该解的稳定性,发现定常解都是稳定的     

Estimation of the number of components of finite mixtures of multivariate distributions

An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.     

Eigenvector p-Bases of Rings of Constants of Derivations

Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing A^p.     

Galois Structure of K-Groups of Rings of Integers

N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。     

On Sums of Coefficients of Products of Polynomials

We study the nilpotency of the sums of all coefficients of some sorts of products of polynomials over reversible, IFP, and NI rings, and introduce an SCN ring as a generalization. We characterize SCN rings in relation with related ring properties, and also provide several useful properties and ring extensions of SCN rings.     

Convergence of sequences of sets of associated primes

It is a well-known result of M. Brodmann that if is an ideal of a commutative Noetherian ring , then the set of associated primes of the -th power of is constant for all large . This paper is concerned with the following question: given a prime ideal of which is known to be in for all large integers , can one identify a term of the sequence beyond which will subsequently be an ever-present? This paper presents some results about convergence of sequences of sets of associated primes of graded components of finitely generated graded modules over a standard positively graded commutative Noetherian ring; those results are then applied to the above question.

     

Rates of Convergence of Means of Euclidean Functionals

Let L be the Euclidean functional with p-th power-weighted edges. Examples include the sum of the p-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the works of Steele, Redmond and Yukich (Ann. Appl. Probab. 4, 1057–1073, 1994, Stoch. Process. Appl. 61, 289–304, 1996) have shown that for n i.i.d. sample points {X ₁,…,X _n } from [0,1] ^d , L({X ₁,…,X _n })/n ^(d−p)/d converges a.s. to a finite constant. Here we bound the rate of convergence of EL({X ₁,…,X _n })/n ^(d−p)/d . Y. Koo supported by the BK21 project of the Department of Mathematics, Sungkyunkwan University. S. Lee supported by the BK21 project of the Department of Mathematics, Yonsei University.     

Number of connected components of groups of real points of adjoint groups

We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².