三维种群生态动力系统的参数识别

研究具有反应一扩散现象的三维种群生态动力系统的参数识别问题，依该系统正问题解的性质，建立了参数识别的数学模型；论证了系统正问题解关于待识别参数的连续依赖性与参数识别问题最优解的存在性。     

一类弱耦合动力系统的参数识别问题

研究一类弱耦合反应－扩散动力系统的参数识别问题。通过构造上下解，证明了反应－扩散方程组解的存在惟一性；给出了求解参数识别问题的最优化系，从而可以选取适当的梯度法或者共轭梯度法，实现对系统参数的识别。     

一种偏微分方程间断点的反演方法

本文研究了一种抛物型方程间断参数的识别问题.利用未知间断点作为反演点和遗传算法优化参数,获得了间断点和反演解.数值实验结果表明反演解和真实解非常接近.     

动力学系统参数辨识问题最优控制解的理论与方法(Ⅰ)--基本概念及确定性系统参数辨识

本文基于动力学系统参数辨识问题最优控制解的概念和确定性动力学系统的最优控制理论,建立了参数辨识研究与最优控制理论的对应关系.将最优控制的数学理论和算法应用于参数辨识问题的研究.依据Hamilton-Jacobi-Bellman (HJB)方程解的理论阐述了动力学系统参数辨识最优控制解的存在唯一性问题,并据此得到了解决确定性系统参数辨识问题的具体算法步骤.     

微生物批式流加发酵脉冲系统的参数辨识及稳定性

针对微生物批式流加发酵生产1,3-丙二醇的非线性脉冲系统,建立敏感参数的优化辨识模型(PDP),论述了模型解的性质、解与参量的关系以及辨识问题最优解的存在性.通过构造算法求得辨识问题最优解,并讨论了新参数下脉冲系统解的稳定性.     

热传导(对流-扩散)方程源项识别的粒子群优化算法

提出了利用粒子群优化(PSO)算法反演热传导方程与对流-扩散方程源项的一种新方法,在已有文献方法的基础上,求解出这两类方程正问题的解析解,再把源项识别问题转化为最优化问题,结合粒子群优化算法寻优求解.通过数值模拟与统计检验,结果表明,此方法可快速有效地实现热传导方程与对流-扩散方程源项的识别,并可推广应用到其它数学物理方程的源项或参数的反演识别.     

动力学系统参数辨识问题最优控制解的理论与方法（I）—基本概 …

本文基于动力学系统参数辨识问题最优控制解的概念和确定性动力学系统的最优控制理论,建立了参数辨识研究与最优控制理论的对应关系。将最优控制的数学理论和算法应用于参数辨识问题的研究。依据Ｈａｍｉｌｔｏｎ－Ｊａｃｏｂｉ－Ｂｅｌｌｍａｎ（ＨＪＢ）方程解的理论阐述了动力学参数辨识最优控制解的存在唯一性问题,并据此得到了解决确定性系统参数辨识问题的具体算法步骤。     

动力学方程组中参数识别模型及其优化性质

本文建立了动力学方程组中参数优化识别的数学模型.这是个含有动态约束的泛函极小化问题.应用线性算子的连续性,证明了该问题最优解的存在性,即参数的可识别性.最后依据弱Gateaux微分,给出并证明达到最优解的一个必要条件.     

多时滞环状神经网络的稳定性

本文针对—个带自反馈的多时滞环状神经网络系统,给出了系统平凡解稳定与不稳定的条件,讨论了平凡解对应特征方程在不同参数条件下的正实部根的个数以及正实部根个数随参数变动的变化规律.     

参数依赖时滞的Nicholson生态模型的稳定性和分支

研究了参数依赖时滞的Nicholson生态模型的稳定性和分支问题.利用几何分析方法和摄动法,给出了系统唯一正平衡态的稳定性和Hopf分支存在条件,得到了分支周期解的近似解析表达式和周期解稳定性判别式,通过若干实例验证了理论分析和数值计算的一致性.     

Study of the blow-up of solutions of systems of equations of hydrodynamic type

Mathematical Notes - We study the initial boundary-value problem for three-dimensional systems of equations of pseudoparabolic type. The system is similar to the Oskolkov system, but differs from...     

Distribution of types of symmetry of tensors of high degree

The asymptotic distribution of tensors of degree N in symmetry types is studied in this paper.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 155, pp. 181–186, 1986.     

Axiomatizability of reducts of algebras of relations

In this paper, we prove that any subreduct of the class of representable relation algebras whose similarity type includes intersection, relation composition and converse is a non-finitely axiomatizable quasivariety and that its equational theory is not finitely based. We show the same result for subreducts of the class of representable cylindric algebras of dimension at least three whose similarity types include intersection and cylindrifications. A similar result is proved for subreducts of the class of representable sequential algebras. Received October 7, 1998; accepted in final form September 10, 1999.     

Characterization of types of asymptotic discernibility of families of hypotheses

We give a characterization of the types of asymptotic discernibility of families of hypotheses in the case of hypothetical measures that are not, in general, mutually absolutely continuous. The case when the logarithm of the likelihood ratio admits an asymptotic expansion of the type of an expansion with local asymptotic normality is examined in detail. Examples are studied.Translated fromTeoriya Sluchainykh Protsessov, Vol. 15, pp. 64–71, 1987.     

Lengths of periods of continued fractions of square roots of integers

Empirical study of the period’s length T of the continued fractions of $\sqrt{Q}$ (for growing integers Q) shows several strange asymptotical results, for instance, $T\leq C\sqrt{Q}\ln{Q}$ . These results show important differences between the statistics of the elements of the continued fractions of random real numbers and of square roots of random integers.