浅析数学建模

数学建模在数学和其他学科的发展过程中具有重要的意义.数学建模有助于学生感受数学在解决实际问题中的价值和作用,体验综合运用知识和方法解决实际问题的过程;有助于激发学生学习数学的兴趣,培养学生的创新意识和实践能力.数学建模竞赛的开展有力地推动了高等院校数学教学体系、教学内容和教学方式的改革.     

极大代数上线性系统的3维最小实现的研究

研究了极大代数上线性系统的3维最小实现问题,给出了特征方程为λ<'3> c<,0>λ<'0>=c<,2>λ<'2> c<,1>λ,当c<,1>=c<'2><,2>,c<,0>=C<,1>C<,2>时,无穷序列{g<,2>}<,0><'∞>存在3维最小实现的充要条件.     

极大代数上多输入多输出线性系统的最小实现

研究了极大代数上无穷阵序列{Gi}0∞的实现问题.首先给出了周期阵序列的概念,得到了1-阶和2-阶周期阵序列{Gi}0∞元素之间的关系,并得到多输入多输出情况下线性系统存在1维和2维最小实现的充要条件.     

一类极大代数上线性系统的3维最小实现

讨论了极大代数上线性系统的3维最小实现问题.给出了特征方程为λ~3⊕c_0λ~0=c_2λ~2⊕c_1λ的一类无穷序列{gi}_0~∞存在3维最小实现的充要条件,彻底解决了存在3维最小实现的充要条件问题.     

Boussinesq方程解的部分正则性

本文考虑Boussinesq方程一类合适弱解的部分正则性.我们先运用广义能量不等式和奇异积分理论得到一些无维量的估计;再通过合适弱解满足的等式,运用迭代技巧,推导出温度场的小性估计;最后由尺度分析(scaling arguments)得到了一类合适弱解的部分正则性.     

一类椭圆型随机偏微分方程弱解的存在性

设$D$是$R^N$ ($N>1$)中有界开集,$(\Omega, {\cal F}, P)$是一个完备的概率空间.该文研究了下列随机边值问题弱解的存在性问题\[\left\{\begin{array}{ll}-{\rm div} A(x,\omega,u, \nabla u)=f(x,\omega, u),\,\, &;(x,\omega)\in D\times \Omega,\\u=0, &;(x,\omega)\in \partial D\times \Omega,\end{array}\right.\]其中, div与 $\nabla $ 表示仅对 $x$求微分. 首先,作者引入了弱解的概念; 然后,作者转化随机问题为高维确定性问题;最后,作者证明了该问题弱解的存在性.     

一类有理分式积分的解法

将求有理分式积分的传统待定常数法推广到待定函数法,给出有理分式积分中求部分分式的公式解法,此法可解决一类有理函数的积分问题．     

On the Convergence of Formal Solutions of a System of Partial Differential Equations

We study a version of the classical problem on the convergence of formal solutions of systems of partial differential equations. A necessary and sufficient condition for the convergence of a given formal solution (found by any method) is proved. This convergence criterion applies to systems of partial differential equations (possibly, nonlinear) solved for the highest-order derivatives or, which is most important, “almost solved for the highest-order derivatives.”     

Exact Solutions of the Wick-typ e KdV-Burgers Equation

In this paper, we consider the wick-type KdV-Burgers equation with variable coe?cients. By using Tanh method with the aid of Hermite transformation, we deduce the exact solutions which include hyperbolic-exponential, trigonometric-exponential and expo-nential function solutions for the considered equation.     

Global Meromorphic Solutions of Partial Differential Equations

In this paper, we survey some recent progress on analytic theory of partial differential equations.     

关于矩阵的Sharp序、*序和减序

给出短阵sharp序的一个新的刻画，由此得到(半)正定短阵sharp序与其平方矩阵sharp序之间的关系．我们还讨论正规矩阵的*序与减序之间的关系，推广了关于Hermmite矩阵的相应结果．     

Restrictions of Self-Adjoint Partial Isometries

Periodica Mathematica Hungarica -     

Solutions of stochastic partial differential equations as extremals of convex functionals

Summary Stochastic evolution equations with monotone operators in Banach spaces are considered. The solutions are characterized as minimizers of certain convex functionals. The method of monotonicity is interpreted as a method of constructing minimizers to these functionals, and in this way solutions are constructed via Euler-Galerkin approximations.     

关于模的最大有理扩张

ｉ）设Ｍ_ｉ为一族左Ｒ－模,记Ｍ_ｉ为Ｍ_ｉ的最大有理扩张,本文首先考察了∑⊕Ｍ_ｉ和∑⊕Ｍ_ｉ之间的关系,并证明了如对环Ｒ上任何一族模上述两者相等的充要条件是环Ｒ上每一个模都有理完全．ｉ）利用ｉ）研究了无零因子环上模的最大有理扩张,得到了一些结果．     

On the Existence of Optimal Solutions to an Optimal Control Problem

In this paper, some results concerning the existence of optimal solutions to an optimal control problem are derived. The problem involves a quasilinear hyperbolic differential equation with boundary condition and a nonlinear integral functional of action. The assumption of convexity, under which the main theorem is proved, is not connected directly with the convexity of the functional of action. In the proof, the implicit function theorem for multimappings is used.Communicated by L. D. Berkovitz     

Genetic Algorithm for the Jump Number Scheduling Problem

This paper introduces genetic algorithms for the jump number scheduling problem. Given a set of tasks subject to precedence constraints, the problem is to construct a schedule to minimize the number of jumps. We show that genetic algorithms outperform the previously known Knuth and Szwarcfiter's exhaustive search algorithm when applied to some classes of orders in which no polynomial time algorithms exist in solving the jump number problem. Values for various parameters of genetic jump number algorithms are tested and results are discussed.     

Exact Solution to an Extremal Problem on Graphic Sequences with a Realization Containing Every 2-Tree on k Vertices

A simple graph G is a 2-tree if G=K_3,or G has a vertex v of degree 2,whose neighbors are adjacent,and G-v is a 2-tree.Clearly,if G is a 2-tree on n vertices,then |E(G)|=2 n-3.A non-increasing sequence π=(d_1,...,d_n) of nonnegative integers is a graphic sequence if it is realizable by a simple graph G on n vertices.[Acta Math.Sin.Engl.Ser.,25,795-802(2009)] proved that if k≥2,n≥9/2 k~2+19/2 k and π=(d_1,...,d_n) is a graphic sequence with∑_(i=1)~n di(k-2)n,then π has a realization containing every 1-tree(the usual tree) on k vertices.Moreover,the lower bound(k-2)_n is the best possible.This is a variation of a conjecture due to Erdos and Sos.In this paper,we investigate an analogue problem for 2-trees and prove that if k≥3 is an integer with k≡i(mod 3),n≥ 20[k/3] ~2+31[k/3]+12 and π=(d_1,...,d_n) is a graphic sequence with ∑_(i=1)~n d_imax{k-1)(n-1), 2 [2 k/3] n-2 n-[2 k/3] ~2+[2 k/3]+1-(-1)~i}, then π has a realization containing every 2-tree on k vertices.Moreover,the lower bound max{(k-1)(n-1), 2[2 k/3]n-2 n-[2 k/3] ~2+[2 k/3]+1-(-1)~i}is the best possible.This result implies a conjecture due to [Discrete Math.Theor.Comput.Sci.,17(3),315-326(2016)].     

浅析对数学史教育的认识与实施

数学史教育在大学数学教育中具有重要的意义.有助于学生理解数学知识的本质,培养学生的思维能力.有必要开设数学史课程或在专业课教学中渗透数学史知识;有适合学生的专门数学史教材;进行数学史教育要联系学生的数学知识,要深入浅出;要注意数学精神的宣传.     

一类高阶偏微分方程的亚纯解

利用多复变值分布理论,我们将Steinmetz的代数微分方程的Malmqiust型定理推广到复偏微分方程中．     

On V-Extremal Solutions of the Moment Problem

We study the density problem for a set of polynomials in the space , where is a measure with finite moments. The approach to this problem is based on methods of the theory of moments, which allows one to formulate sufficient conditions in terms of Nevanlinna functions.