相对论Euler方程组二维活塞问题激波解的局部存在性

考虑二维轴对称相对论Euler方程组的活塞问题.利用轴对称的特点,使用适当的变量先将原问题转化为一维问题,然后通过Taylor展开的方法构造原问题的一个N阶近似解,再利用对相应线性问题所作的能量估计,用Newton迭代法,最终证明其活塞问题激波解的局部存在性.     

块二级迭代法的近似最优内迭代次数

本文讨论线性方程组定常块二级迭代法内迭代次数的选择.对于单调矩阵,证明了块Jacobi矩阵的谱半径ρp(T)为非定常块二级迭代法R_1-因子的下界.对于M-矩阵,用某个单调范数给出了ρ(T_p)的关于p单调下降且收敛于ρ(T)的上界.于是,当系数矩阵为M-矩阵时,我们定义了定常块二级迭代法的近似最优内迭代次数.所定义的近似最优值与模型问题数值计算的实际最优值非常吻合.本文分析表明,实际计算中应该把内迭代次数控制在较小的数目.     

均布载荷作用下开顶扁球壳的非线性稳定问题

本文利用修正迭代法研究了具有硬中心的开顶扁球壳在均布载荷作用下的轴对称非线性稳定问题,得到了临界载荷的二次近似解析公式.     

连续型动态规划的新算法研究

提出了求解一维连续型动态规划问题的自创算法----离散近似迭代法,并结合双收敛方法求解多维连续型动态规划问题. 该算法的基本思路为：在给定其它状态向
量序列的基础上,每次对一个状态变量序列进行离散近似迭代,并找出该状态变量的最优序列,直到所有状态向量序列都检查完.当模型为非凸非凹动态规划时,
证明了该算法的收敛性.当模型为凸动态规划时,证明了该算法的线性收敛性. 最后,以一个具体算例验证了该模型和算法的有效性.     

稀疏近似逆预处理求解一类矩阵方程

本文给出一类矩阵方程的基于F-范数最小化的稀疏近似逆预处理方法.首先,运用基于F-范数最小化的稀疏近似逆技术寻求一个有效的预处理子M.然后,将得到的预处理子运用到正交投影迭代法中,得到新的算法,并证明算法的收敛性.最后,通过数值实例来验证预处理方法的有效性.     

变厚度圆薄板在均布载荷下大挠度问题

本文首先给出变厚度圆薄板大挠度方程,用小参数方法和修正迭代法联合求解此问题,得到三次近似解;给出特征曲线同线性理论进行了比较.     

修正迭代法在薄圆板非线性后屈曲分析中的应用

本文进一步将修正迭代法推广到薄圆板轴对称后屈曲分析中,由此获得该问题的一种新的近似解析解.作者期望将此方法应用于更为复杂结构的板的后屈曲分析中去.     

时间分数阶Fisher型非线性种群扩散模型的近似解

利用新的一致时间分数阶微积分理论和方法并结合变分迭代法及同伦扰动法,对一维空间时间分数阶种群扩散模型进行近似求解,得到时间分数阶模型问题的近似解的表达式,并通过与相应整数阶精确解对比验证模型的合理性和准确性.     

碟形扁壳在均布载荷下的非线性稳定分析*

本文对碟形扁壳的非线性稳定问题进行了分析.用修正迭代法得到了弹性特征的二次近似表达式,给出了一组算例,并讨论了参数β和k对稳定特性的影响.     

集中载荷作用下开顶扁球壳的非线性稳定问题

本文使用修正迭代法研究了具有硬中心的边缘固定的开顶扁球壳在中心集中载荷作用下的轴对称非线性稳定问题,得到了决定上、下临界载荷的二次近似解析公式.     

Invariant properties of representations under cleft extensions

The main aim of this paper is to give the invariant properties of representations of algebras under cleft extensions over a semisimple Hopf algebra. Firstly, we explain the concept of the cleft extension and give a relation between the cleft extension and the crossed product which is the approach we depend upon. Then, by making use of them, we prove that over an algebraically closed field k, for a finite dimensional Hopf algebra H which is semisimple as well as its dual H*, the representation type of an algebra is an invariant property under a finite dimensional H-cleft extension . In the other part, we still show that over an arbitrary field k, the Nakayama property of a k-algebra is also an invariant property under an H -cleft extension when the radical of the algebra is H-stable.     

An approach for solving of a moving boundary problem

In this paper we shall study moving boundary problems, and we introduce an approach for solving a wide range of them by using calculus of variations and optimization. First, we transform the problem equivalently into an optimal control problem by defining an objective function and artificial control functions. By using measure theory, the new problem is modified into one consisting of the minimization of a linear functional over a set of Radon measures; then we obtain an optimal measure which is then approximated by a finite combination of atomic measures and the problem converted to an infinite-dimensional linear programming. We approximate the infinite linear programming to a finite-dimensional linear programming. Then by using the solution of the latter problem we obtain an approximate solution for moving boundary function on specific time. Furthermore, we show the path of moving boundary from initial state to final state.     

A five-dimensional Riemannian manifold with an irreducible SO(3)-structure as a model of abstract statistical manifold

In the present paper, we consider a five-dimensional Riemannian manifold with an irreducible SO(3)-structure as an example of an abstract statistical manifold. We prove that if a five-dimensional Riemannian manifold with an irreducible SO(3)-structure is a statistical manifold of constant curvature, then the metric of the Riemannian manifold is an Einstein metric. In addition, we show that a five-dimensional Euclidean sphere with an irreducible SO(3)-structure cannot be a conjugate symmetric statistical manifold. Finally, we show some results for a five-dimensional Riemannian manifold with a nearly integrable SO(3)-structure. For example, we prove that the structure tensor of a nearly integrable SO(3)-structure on a five-dimensional Riemannian manifold is a harmonic symmetric tensor and it defines the first integral of third order of the equations of geodesics. Moreover, we consider some topological properties of five-dimensional compact and conformally flat Riemannian manifolds with irreducible SO(3)-structure.     

Asymptotical feedback controllability of continuous-time probabilistic logic control networks

In this article, we study the controllability of continuous-time probabilistic logic control networks (CT-PLCNs) under sampled-data feedback controls (SDFCs). First, we demonstrate that the concept of finite-time controllability with probability one for discrete-time probabilistic logic control networks cannot be generalized to CT-PLCNs. Then, we propose the concepts of asymptotical feedback reachability and asymptotical feedback controllability for CT-PLCNs. Based on the invariant subsets, we prove that a target state is asymptotically feedback reachable if and only if the target state is a control equilibrium point and any initial state has an admissible path to the target state. Moreover, we introduce the concept of reachability matrix and propose an easily verifiable criterion for asymptotical feedback reachability expressed in terms of the reachability matrix. Based on these, we prove that a CT-PLCN is asymptotically feedback controllable if and only if every state is a control equilibrium point and there is an admissible path between any pair of initial and target states. The relation between controllability and stabilizability is also discussed. We prove that a CT-PLCN is asymptotically feedback controllable if and only if every state is asymptotically feedback stabilizable. For a controllable CT-PLCN, we propose an algorithm of designing a stabilizing SDFC for any given target state. Additionally, we discuss the asymptotical feedback controllability of CT-PLCNs under time-varying nonuniform SDFCs. Finally, an illustrative example is presented to explain the proposed methods and verify the controllability criteria.     

On essential sets and essential components of efficient solutions for vector optimization problems

In this paper, we first introduce the notions of an essential set and an essential component of the set of efficient solutions for continuous vector optimizations on a nonempty compact subset of a metric space. Then we show that for each of these vector optimizations, each set of all efficient solutions corresponding to the same optimal values is essential. Basing on this result, we give full characterizations of an essential point, an essential set and an essential component, respectively. As an application, we prove that for continuous quasiconvex vector optimization problems on a nonempty compact subset of a metric vector space, each component of the set of efficient solutions is essential even though the efficient solution set is not connected.     

Solving Internal Habit Formation Models Through Dynamic Programming in Infinite Dimension

In this paper, we study an economic model, where internal habits play a role. Their formation is described by a more general functional form than is usually assumed in the literature, because a finite memory effect is allowed. Indeed, the problem becomes the optimal control of a standard ordinary differential equation, with the past of the control entering both the objective function and an inequality constraint. Therefore, the problem is intrinsically infinite dimensional. To solve this model, we apply the dynamic programming approach and we find an explicit solution for the associated Hamilton–Jacobi–Bellman equation, which lets us write the optimal strategies in feedback form. Therefore, we contribute to the existing literature in two ways. Firstly, we fully develop the dynamic programming approach to a type of problem not studied in previous contributions. Secondly, we use this result to unveil the global dynamics of an economy characterized by generic internal habits.     

紧度量空间上的连续在上映射是粘合映射

本文讨论了有关粘合映射的一个问题 ,证明了 ,如果X是紧致度量空间 ,Y是度量空间 ,则由X到Y的连续在上映射是粘合映射 .并给出了一个反例 ,说明 :如果去掉紧致性条件 ,则定理的结论不再成立 .     

On the complexity of the word problem for automaton semigroups and automaton groups

In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are generated by partial, yet invertible automata. We show that there is an automaton-inverse semigroup and, thus, an automaton semigroup with a PSpace-complete word problem. We also show that there is an automaton group for which the word problem with a single rational constraint is PSpace-complete. Additionally, we provide simpler constructions for the uniform word problems of these classes. For the uniform word problem for automaton groups (without rational constraints), we show NL-hardness. Finally, we investigate a question asked by Cain about a better upper bound for the length of a word on which two distinct elements of an automaton semigroup must act differently.A detailed listing of the contributions of this paper can be found at the end of this paper.     

Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree

In this paper we consider a numerical enclosure method for multiple eigenvalues of an Hermitian matrix whose graph is a tree. If an Hermitian matrix A whose graph is a tree has multiple eigenvalues, it has the property that matrices which are associated with some branches in the undirected graph of A have the same eigenvalues. By using this property and interlacing inequalities for Hermitian matrices, we show an enclosure method for multiple eigenvalues of an Hermitian matrix whose graph is a tree. Since we do not generally know whether a given matrix has exactly a multiple eigenvalue from approximate computations, we use the property of interlacing inequalities to enclose some eigenvalues including multiplicities.In this process, we only use the enclosure of simple eigenvalues to enclose a multiple eigenvalue by using a computer and interval arithmetic.     

求参数置信限的一种方法

本文介绍一种找参数精确置信限和置信区间的一般方法,关键想法是在样本空间中定义一个序。本文主要考虑单参数统计模型，对序的优良性（即相应的置信限的优良性）作了讨论，指出应以得分函数的大小为依据在样本空间中定义序。还证明了用最大似然估计定义序得到的置信限是一个单调函数的唯一零点，从而通过解方程算出置信限。