一个奇摄动燃烧反应扩散问题

本文讨论了一个奇摄动燃烧反应扩散Ｒｏｂｉｎ问题,利用微分不等式理论,证明了问题解的存在性,并得到了解的渐近估计。     

一类双参数非线性高阶反应扩散方程的摄动解法

研究了一类两参数非线性反应扩散奇摄动问题的模型.利用奇摄动方法,对该问题解的结构在两个小参数相互关联的情形下作了讨论.首先,构造问题的外部解; 之后在区域的边界邻域构造局部坐标系,再在该邻域中引入多尺度变量,得到问题解的边界层校正项; 然后引入伸长变量,构造初始层校正项,并得到问题解的形式渐近展开式;最后建立了微分不等式理论,并由此证明了问题的解的一致有效的渐近展开式.用上述方法得到的各次近似解,具有便于求解、精度高等特点.     

蒋氏生存模型及其在剂量反应关系分析中的应用

生存分析是近年来蓬勃发展的一个统计方法,已产生了许多统计模型,比如寿命表,Weibull分布模型,Cox模型等,由此可分析大量的实际问题,但是,仍然存在很多实际问题无法用已有的模型来分析。蒋庆琅提出了一个新的生存分析参数统计模型,现将此模型基本原理作简要叙述,并用此分析接尘时间和发病之间的关系。一、模型的生物学基础与导出     

一类两参数非线性反应扩散方程奇摄动问题的广义解

利用奇异摄动方法讨论了一类两参数广义奇摄动反应扩散方程问题.首先,在适当的条件下,对两个小参数进行幂级数展开,构造了问题的形式外部解.其次,在区域边界邻近,建立局部坐标系,利用多重尺度变量方法分别构造了问题解的第一、第二边界层校正项.最后,利用合成展开理论,得到了问题广义解的渐近表示式,并用泛函分析不动点原理,估计了渐近展开式的精度.该文得到问题的广义解在重叠区域内具有两个不同厚度的校正函数.它们分别对边界条件起着校正的作用,扩展了问题研究范围,同时还提供了构造这类在重叠区域上不同厚度的校正项的方法,因此具有广泛的研究前景.     

非线性非局部反应扩散方程奇摄动问题

研究了一类具有非线性非局部反应扩散方程奇摄动Robin初始边值问题。在适当的条件下,首先求出了原问题的外部解,然后利用伸长变量、合成展开法和幂级数展开理论构造出解的初始层项,并由此得到解的形式渐近展开式。最后利用微分不等式理论,讨论了问题解的渐近性态并导出了几个有关的不等式,讨论了原问题解的存在唯一性和解的一致有效的渐近估计式。     

一类具有边界摄动的非线性非局部反应扩散方程奇摄动问题

研究了一类具有边界摄动的非线性非局部反应扩散方程奇摄动Robin初始边值问题．在适当的条件下,首先求出了原问题的外部解,然后利用伸长变量、合成展开法和幂级数展开理论构造出解的初始层项,并由此得到解的形式渐近展开式．最后利用微分不等式理论,讨论了问题解的渐近性态并导出了几个有关的不等式,讨论了原问题解的存在唯一性和解的一致有效的渐近估计式．     

一类燃烧奇摄动问题的渐近估计

讨论了一类燃烧问题.利用微分不等式理论,证明了问题解的存在性,并得到了解的渐近估计.     

反应扩散方程奇摄动Robin问题的渐近解

本文讨论了一类奇摄动反应扩散方程Robin问题,在适当的条件下,研究了问题渐近解的存在,唯一性及其渐近性态.     

两参数非局部非线性反应扩散Robin问题的渐近解

研究了一类两参数非局部反应扩散奇摄动Robin问题.利用奇摄动方法,对该问题解的结构在两个小参数相互关联的情形下作了讨论.得到了该问题的渐近解.     

非线性反应扩散问题的激波解(英文)

本文研究了一类非线性反应扩散问题.利用微分不等式理论,得到了具有激波层的问题解的渐近表示式.     

Nash Equilibria for the Multiobjective Control of Linear Partial Differential Equations

This article is concerned with the numerical solution of multiobjective control problems associated with linear partial differential equations. More precisely, for such problems, we look for the Nash equilibrium, which is the solution to a noncooperative game. First, we study the continuous case. Then, to compute the solution of the problem, we combine finite-difference methods for the time discretization, finite-element methods for the space discretization, and conjugate-gradient algorithms for the iterative solution of the discrete control problems. Finally, we apply the above methodology to the solution of several tests problems.     

The rights egalitarian solution for NTU sharing problems

The purpose of this paper is to extend the rights egalitarian solution (Herrero et al. in Math Soc Sci 37:59–77, 1999) to the context of non-transferable utility sharing problems. Such an extension is not unique. Depending on the kind of properties we want to preserve we obtain two different generalizations. One is the “proportional solution”, that corresponds to the Kalai–Smorodinsky solution for surplus sharing problems and the solution in Herrero (Soc Choice Welf 15:113–119, 1998) for rationing problems. The other is the “Nash solution”, that corresponds to the standard Nash bargaining solution for surplus sharing problems and the Nash rationing solution (Mariotti and Villar in Int J Game Theory 33:367–377, 2005) for the case of rationing problems.     

Iterative processes of Fejér type in ill-posed problems with a priori information

In the latter thirty years, the solution of ill-posed problems with a priori information formed a separate field of research in the theory of ill-posed problems. We mean the class of problems, where along with the basic equation one has some additional data on the desired solution. Namely, one states some relations and constraints which contain important information on the object under consideration. As a rule, taking into account these data in a solution algorithm, one can essentially increase its accuracy for solving ill-posed (unstable) problems. It is especially important in the solution of applied problems in the case when a solution is not unique, because this approach allows one to choose a solution that meets the reality. In this paper we survey the methods for solving such problems. We briefly describe all relevant approaches (known to us), but we pay the main attention to the method proposed by us. This technique is based on the application of iterative processes of Fejér type which admit a flexible and effective realization for a wide class of a priori constraints.     

A FEASIBLE DIRECTION ALGORITHM WITHOUT LINE SEARCH FOR SOLVING MAX-BISECTION PROBLEMS

This paper concerns the solution of the NP-hard max-bisection problems. NCP func-tions are employed to convert max-bisection problems into continuous nonlinear program-ming problems. Solving the resulting continuous nonlinear programming problem generatesa solution that gives an upper bound on the optimal value of the max-bisection problem.From the solution, the greedy strategy is used to generate a satisfactory approximate so-lution of the max-bisection problem. A feasible direction method without line searches isproposed to solve the resulting continuous nonlinear programming, and the convergenceof the algorithm to KKT point of the resulting problem is proved. Numerical experimentsand comparisons on well-known test problems, and on randomly generated test problemsshow that the proposed method is robust, and very efficient.     

Efficient solutions schemes for interface problems

A computationally efficient two-level iterative scheme is proposed for the solution of the interface problems with Lagrange multipliers, where the oscillatory part of the solution is resolved by means off smoothing using a new, efficient preconditioner whereas the smooth component of the solution is captured by the collocation-based problem on the auxilliary grid, that is solved directly using a sparse direct solver. A simple adaptive feature is built into the proposed solution method in order to guarantee convergence for ill-conditioned problems. Nmerical results presented for example problems including that of a Boeing crown panel show that the proposed tww-level solution technique outperfrmsnce the standard, single level iterative and direect solvers.     

Mathematical programming via the least-squares method

The least-squares method is used to obtain a stable algorithm for a system of linear inequalities as well as linear and nonlinear programming. For these problems the solution with minimal norm for a system of linear inequalities is found by solving the non-negative least-squares (NNLS) problem. Approximate and exact solutions of these problems are discussed. Attention is mainly paid to finding the initial solution to an LP problem. For this purpose an NNLS problem is formulated, enabling finding the initial solution to the primal or dual problem, which may turn out to be optimal. The presented methods are primarily suitable for ill-conditioned and degenerate problems, as well as for LP problems for which the initial solution is not known. The algorithms are illustrated using some test problems.     

具强制条件的向量均衡问题

研究锥伪单调、锥拟凸和上锥连续映射在某种强制性条件下的向量均衡问题解集的特征,建立强制性条件与向量均衡问题解集的关系,得到对偶向量均衡问题局部解集含于向量均衡问题解集的性质和向量均衡问题解集的非空性条件,给出在锥伪单调、锥拟凸和上锥连续映射条件下向量均衡问题解集的非空有界性与强制性条件的等价性．     

On exact and approximate boundary controllabilities for the heat equation: A numerical approach

The present article is concerned with the numerical implementation of the Hilbert uniqueness method for solving exact and approximate boundary controllability problems for the heat equation. Using convex duality, we reduce the solution of the boundary control problems to the solution of identification problems for the initial data of an adjoint heat equation. To solve these identification problems, we use a combination of finite difference methods for the time discretization, finite element methods for the space discretization, and of conjugate gradient and operator splitting methods for the iterative solution of the discrete control problems. We apply then the above methodology to the solution of exact and approximate boundary controllability test problems in two space dimensions. The numerical results validate the methods discussed in this article and clearly show the computational advantage of using second-order accurate time discretization methods to approximate the control problems.     

圆环壳在一般荷载下的轴对称问题

本文推广Новжилов变换,对圆环壳在任意荷载作用下的轴对称问题进行了成功地简化,得到了问题的H.Новжилов型复变量方程.求得了方程的特解,结合钱伟长的齐次方程一般解,给出了环壳一般轴对称问题的一般解答.讨论了常见载荷和闭合环壳情形.     

A SUCCESSIVE LEAST SQUARES METHOD FOR STRUCTURED TOTAL LEAST SQUARES

A new method for Total Least Squares (TLS) problems is presented. It differs from previous approaches and is based on the solution of successive Least Squares problems.The method is quite suitable for Structured TLS (STLS) problems. We study mostly the case of Toeplitz matrices in this paper. The numerical tests illustrate that the method converges to the solution fast for Toeplitz STLS problems. Since the method is designed for general TLS problems, other structured problems can be treated similarly.