一类非线性方程边值问题的匹配渐近解

利用匹配方法考虑了一类非线性方程边值问题的角层解.首先,由退化问题来决定问题的角层的位置.然后,构造零次近似的外部解和零次近似的内层解,并且对零次近似的外部解和零次近似的内层解进行匹配,由此便得到解的零次近似的形式合成展开式.继而构造一次近似的外部解和一次内层解,并且对一次近似的外部解和一次近似的内层解进行匹配,由此便得到解的一次近似的形式合成展开式.最后利用微分不等式理论证明了得到的一次近似的合成展开式是一致有效的渐近展开式.     

向量优化问题局部近似解的等价性

主要研究两种不同序关系下向量优化问题的近似解.一种是正锥序关系下的近似解,另一种是多面体锥序关系下的近似解.针对这两种序关系下向量优化问题的近似解,建立了局部近似最优解和μ阶严格局部近似最优解之间的等价关系,同时构建了这两种序关系下近似有效点集之间的等价关系.     

Improved Quasi-Steady-State Approximation Analysis of Stefan Problems Under 2nd-Kind Boundary Conditions北大核心CSCD

基于准稳态近似方法,从热平衡角度出发,给出了直角坐标系和圆柱坐标系中恒定热流边界条件下传导型固液相变传热问题的无量纲近似解。对于直角坐标系情形,得到的改进型准稳态近似解精度高,且解的形式为显式表达式,相比于已有的隐式近似解更便于直接使用。对于圆柱坐标系的情形,所得到的近似解是目前文献公开报道的唯一的近似解。此改进型准稳态近似解弥补了传统准稳态近似方法不考虑显热的不足,提高了准稳态近似法的精度,丰富了固液相变传热问题的求解方法,物理意义明确,可用于实际应用问题的初步分析和计算。     

一类非线性双曲型发展方程的孤子解

研究了一类非线性发展方程.首先在无扰动情形下,利用待定函数和泛函同伦映射方法得到了非扰动发展方程的孤子精确解和扰动方程的任意次近似行波孤子解.接着引入一个同伦映射,并选取初始近似函数,再用同伦映射理论,依次求出非线性双曲型发展扰动方程孤子解的各次近似解析解.再利用摄动理论举例说明了用该方法得到的近似解析解的有效性和各次近似解的近似度.最后,简述了用同伦映射方法得到的近似解的意义,指出了用上述方法得到的各次近似解具有便于求解、精度高等优点.     

无解的模糊关系方程的最优近似解

对无解的模糊关系方程给出了最优近似解的定义,证明了最优近似解的存在性,给出了求最优近似解的算法     

泊松方程及平面弹性问题有限元方法中求高阶导数的提取法

在许多有限元计算中经常在求得近似解后还要求得到近似的解的导数.如在弹性计算中,如何从计算得到的位移近似解较好地计算应力早已被研究多年.如果计算中包含直接对近似解求导数,必然会丧失部分精度,得不到满意的结果.特别,若近似解为分片常数函数,则根本无法从直接求导数得到应力的近似值.Babuska和 Miller提出了所谓“提取法”,即利用推导出来的提取公式来求解的导数的近似值,以得到与近似解本身同     

一类大气尘埃等离子体扩散模型研究

研究了一类大气非线性尘埃等离子体扩散方程初值问题.首先在无扰动情形下,利用Fourier变换方法得到了尘埃等离子体扩散方程初值问题的精确解,接着引入一个同伦映射,并选取初始近似函数,再用同伦映射理论,依次求出了非线性尘埃等离子体扰动初值问题的各次近似解析解.并引用不动点理论,指出了近似解析解的有效性和各次近似解的近似度,通过举例, 用模拟曲线和表格作了近似对照.最后,简述了用同伦映射方法得到的近似解的物理意义.简叙了用上述方法得到的各次近似解具有便于求解、精度高等优点.     

泊松方程及平面弹性问题有限元方法中求高阶导数的提取法

在许多有限元计算中经常在求得近似解后还要求得到近似的解的导数.如在弹性计算中,如何从计算得到的位移近似解较好地计算应力早已被研究多年.如果计算中包含直接对近似解求导数,必然会丧失部分精度,得不到满意的结果.特别,若近似解为分片常数函数,则根本无法从直接求导数得到应力的近似值.Babuska和 Miller提出了所谓“提取法”,即利用推导出来的提取公式来求解的导数的近似值,以得到与近似解本身同     

可渗透壁面上Falkner-Skan磁流体动力学流动的近似解

研究了可渗透壁面上Falkner-Skan磁流体动力学（MHD）边界层流动问题．利用结合了微分变换法（DTM）和Padé近似的DTM-Padé方法,得到了边界层问题的近似解和壁摩擦因数值．通过建立一个迭代程序,边界层问题的近似解被表示为幂级数的形式,而且以图和表形式对不同参数下的近似解结果与打靶法得到的数值结果进行了对比,近似解和数值解结果高度吻合,从而验证了所得问题近似解和结论的可靠性和有效性．并且,对求得的边界层问题近似解结果进行了讨论,分析了不同物理参数对边界层流动的影响．     

时滞Lokta-Volterra生态模型的同伦分析解法

研究了时滞Lolta-Volterra生态模型.利用同伦分析方法,得到了该模型解的近似展开式,并对近似解与数值解进行了比较.比较结果表明,近似解具有较高的精度,该方法用于生态模型研究可行.     

Remarks on the Uniqueness of a Solution of the Dirichlet Problem for Second-Order Elliptic Equations with Lower-Order Terms

We give an example of an incompressible diffusion equation whose solution is nonunique. It is shown that this equation has an approximation solution as well as another solution that cannot be obtained by approximation. We give sufficient conditions for the uniqueness of a solution as well as for the uniqueness of an approximation solution.     

The solution sets of infinite fuzzy relational equations with sup-conjunctor composition on complete distributive lattices

This paper deals with sup-conjunctor composition fuzzy relational equations in infinite domains and on complete distributive lattices. When its right-hand side is a continuous join-irreducible element or has an irredundant continuous join-decomposition, a necessary and sufficient condition describing an attainable solution (resp. an unattainable solution) is formulated and some properties of the attainable solution (resp. the unattainable solution) are shown. Further, the structure of solution sets is investigated.     

Approximate analytic solutions to Radulet equations for the analysis of electromagnetic transients in single-phase power transmission lines

In this work, an analytic development for a transmission line with a corona effect for simulating an electromagnetic transient is presented. The asymptotic solution for the Radulet equations in which a nonlinear term is presented is obtained. The study is carried out for a single-phase transmission line. The electrical parameters for an overhead line are defined and several formulations for their calculation are presented. The frequency dependence of the electrical parameters is considered. In the first part, the linear problem solution is found; the Fourier and Laplace transforms are applied with respect to distance and time respectively. After finding the solution in the Fourier–Laplace domain, which is expressed in terms of a Green’s function integral, an approximate analytical solution is obtained in the distance–time domain by means of asymptotic methods. Finally, the nonlinear solution is found using as a first approach the linear solution. The results obtained show an attenuation in the voltage wave due to the corona effect.     

On isolated periodic solutions of differential systems

Summary The concept of an isolated periodic solution of a periodic differential system is defined and it is proved that if the number 1 is not a characteristic multiplier of the variational system corresponding to the given periodic solution then this solution is isolated. The concept of a periodic solution with isolated path of an autonomous system is defined and it is proved that if the number 1 is a simple characteristic multiplier of the corresponding variational system then the periodic solution has an isolated path. An example is given showing that the conditions above are not necessary. Entrata in Redazione l’8 giugno 1974.     

Absolutely cooperative solution for a linear,multiplayer differential game

If the players of ann-player differential game agree to cooperate, then the solutions to the game should be confined to undominated ones. A property of an undominated or Pareto-optimal solution is that, when compared locally with any other solution, at least one player must do worse or all do the same if they use a solution other than the Pareto-optimal one.Closely related to the concept of a Pareto-optimal solution is the concept of an absolutely cooperative solution. The absolutely cooperative solution is given the property that, when compared locally with any other solution, every player will do no better if a solution other than the absolutely cooperative one is used.A set of necessary and sufficient conditions for an absolutely cooperative solution is presented in this paper. The circumstance under which the control variables may take on interior values is also included.This research was supported in part by NASA Grant No. NGR-03-002-011.     

A two-grid discretization scheme for eigenvalue problems

A two-grid discretization scheme is proposed for solving eigenvalue problems, including both partial differential equations and integral equations. With this new scheme, the solution of an eigenvalue problem on a fine grid is reduced to the solution of an eigenvalue problem on a much coarser grid, and the solution of a linear algebraic system on the fine grid and the resulting solution still maintains an asymptotically optimal accuracy.

     

Ellipsoid projection method in matrix games

A problem of calculating a solution of a zero-sum matrix game is considered in the paper The problem of search of a solution is reduced to a constrained convex minimization problem for which an ellipsoid projection algorithm is used. The algorithm generates an ?-optimal solution of the game in a polynomial time     

Lyapunov functions in justification theorems for asymptotics

A formal asymptotic solution is considered for a nonlinear system of ordinary differential equations in a neighborhood of a singular point. The problem of existence of an exact solution with such an asymptotics and the problem of stability of this solution are solved. The main tool in these studies is the Lyapunov function for a system linearized on a formal solution.     

The Cahn–Hilliard equation with time-dependent constraint

We propose an abstract variational inequality formulation of the Cahn–Hilliard equation with a time-dependent constraint. We introduce notions of strong and weak solutions, and prove that a strong solution, if it exists, is a weak solution, and that the existence of a unique weak solution holds under an appropriate time-dependence condition on the constraint. We also show that the weak solution is a strong solution under appropriate assumptions on the data. Our abstract results can be applied to various concrete problems.     

An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints

We provide an efficient computational approach to solve the mixed integer programming (MIP) model developed by Tarim and Kingsman [8] for solving a stochastic lot-sizing problem with service level constraints under the static-dynamic uncertainty strategy. The effectiveness of the proposed method hinges on three novelties: (i) the proposed relaxation is computationally efficient and provides an optimal solution most of the time, (ii) if the relaxation produces an infeasible solution, then this solution yields a tight lower bound for the optimal cost, and (iii) it can be modified easily to obtain a feasible solution, which yields an upper bound. In case of infeasibility, the relaxation approach is implemented at each node of the search tree in a branch-and-bound procedure to efficiently search for an optimal solution. Extensive numerical tests show that our method dominates the MIP solution approach and can handle real-life size problems in trivial time.