N—解析函数的Riemamm—Hilbert问题

在N-解析函数类中,对于无穷直线上的Riemann-Hilbert边值问题,通过轴的对称扩张法将其转化为在附加条件下相应的Riemann边值问题,从而建立了其齐次和非齐次问题的可解性理论。     

一般周期Riemann边值问题关于跳跃曲线的稳定性

本文研究了一般周期Riemann边值问题关于跳跃曲线的稳定性.利用解析函数边值理论和不等式分析理论,获得了一般周期Riemann边值问题的解及其关于跳跃曲线的误差估计.     

单准周期的Riemann边值问题

本文研究了光滑封闭曲线情况下的加法与乘法单准周期Riemann边值问题,运用保角变换的方法,获得了单准周期函数的一些性质,并且对解在无穷远处作适当要求下给出了单准周期边值问题的解法.     

Koch曲线上的齐次Riemann边值问题

当L为典型的分形曲线一Koch曲线时,提出了Riemann边值问题,但在一般情况下,在Koch曲线上所做的Cauchy型积分无意义.当对已知函数G(z),g(z)增加一定的解析条件,同时利用一列Cauchy型积分的极限函数,对定义在Koch曲线上的齐次Riemann边值问题进行了讨论,并得到与经典解析函数边值问题相类似的结果.     

边界过原点的任意半平面中的Hilbert边值问题

给出了边界过原点的任意半平面中的Hilbert边值问题的提法,定义了函数的一种对称扩张,并利用这种对称扩张将此Hilbert边值问题转化为无穷直线上的Riemann边值问题,得到了该问题的一般解和可解性定理.     

具x/ζ型卷积核的奇异积分方程的求解

讨论了具x/ζ型卷积核的奇异积分方程的求解问题.通过Fourier积分变换,将所讨论的积分方程转化成在一定可解条件下与其同解意义下等价的Riemann边值问题.利用Riemann边值问题理论,分别讨论了在正则和非正则两种情况下的Riemann边值问题,进而得到相对应的x/ζ变量比型卷积核的积分方程一般解及可解条件.     

实轴上的双解析函数Riemann边值逆问题

提出了一类实轴上的双解析函数Riemann边值逆问题.先消去参变未知函数,再采用易于推广的矩阵形式记法,可把问题转化为两个实轴上的解析函数Riemann边值问题.利用经典的Riemann边值问题理论,讨论了该问题正则型情况的解法,得到了它的可解性定理.     

关于实轴上多解析函数Riemann边值问题的可解性

本文研究了实轴上具有不同因子的多解析函数的Riemann边值问题的可解性．利用所谓的转化法．建立了Riemann问题的可解性与其相联问题的解之间的关系。该结果推广了解析函数的相应理论。     

一类广义解析函数的Riemann边值逆问题

本文给出了一类有关广义解析函数Riemann边值逆问题的数学提法．在将此边值逆问题转化为边值问题的基础上，借助于广义解析函数边值问题的相关理论，分别获得了此边值逆问题在正则型和非正则型情况下的解．     

单位圆周上多解析函数的Riemann边值问题(英文)

本文研究了单位圆周上具不同回子的Riemann边值问题的可解性.利用转化法,得到了可解条件和解的表达式,将现有的相同冈了的情况作为特例.     

三种新变形的全一问题

该文研究三种新变形的全一问题及最小全一问题. 原始的全一问题可被形象的称为顶点点亮顶点问题, 而这三类新问题则分别被称为顶点点亮边问题,边点亮顶点问题,边点亮边问题. 顶点点亮顶点问题已经得到了广泛的研究. 比如,解的存在性问题和求解的有效算法已经被解决,一般图上的最小顶点点亮顶点问题已经被证明是NP- 完备的,树、单圈图和双圈图上的最小顶点点亮顶点问题的线性时间最优算法也已被给出等. 该文对于顶点点亮边问题,证明一个图有解当且仅当它是二部图,因此只可能有两组解和最优解. 对于边点亮顶点问题,证明一个图有解当且仅当它包含偶数个顶点,并通过将其最优问题多项式变换成最小权的完美匹配问题,得出一般图上的最小边点亮顶点问题可在多项式时间内求解. 边点亮边问题可归约成线图上的顶点点亮顶点问题.     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

A Stability Theorem for Constrained Optimal Control Problems

This paper presents the stability of difference approximations of an optimal control problem for a quasilinear parabolic equation with controls in the coefficients, boundary conditions and additional restrictions. The optimal control problem has been convered to one of the optimization problem using a penalty function technique. The difference approximations problem for the considered problem is obtained. The estimations of stability of the solution of difference approximations problem are proved. The stability estimation of the solution of difference approximations problem by the controls is obtained.     

Direct and inverse boundary value problems for models of stationary reaction–convection–diffusion

Direct and inverse boundary value problems for models of stationary reaction–convection–diffusion are investigated. The direct problem consists in finding a solution of the corresponding boundary value problem for given data on the boundary of the domain of the independent variable. The peculiarity of the direct problem consists in the inhomogeneity and irregularity of mixed boundary data. Solvability and stability conditions are specified for the direct problem. The inverse boundary value problem consists in finding some traces of the solution of the corresponding boundary value problem for given standard and additional data on a certain part of the boundary of the domain of the independent variable. The peculiarity of the inverse problem consists in its ill-posedness. Regularizing methods and solution algorithms are developed for the inverse problem.     

On optimal shape design of systems governed by mixed Dirichlet-Signorini boundary value problems

A problem for finding optimal shape for systems governed by the mixed unilateral boundary value problem of Dirichlet-Signorini-type is considered. Conditions for the solvability of the problem are stated when a variational inequality formulation and when a penalty method is used for solving the state problem in question. The asymptotic relation of design problems based on these two formulations is presented. The optimal shape design problem is discretized by means of finite element method. The convergence results for the approximation are proved. The discretized versions are then formulated as a non-linear programming problem. Results of practical computations of the problem in question are reported.     

轴对称弹塑性扭转问题的数值解

在很多自由边界问题的研究中,变分不等式是一个有力的工具,它不但可以用来研究解的存在唯一性、正则性等理论问题,而且还提供了有效的数值方法(见[1-3]).对轴对称机轴的弹塑性扭转问题,[4,5]用变分不等式研究了解的存在唯一性和正则性,在此基础上,[6]建议用有限元法求解等价的障碍问题.该法的缺点是,事先要解一个一阶非线性偏微分方程的Cauchy问题以求出障碍函数,并且此Cauchy问题的解一般不唯一.本文的方法是直接将原来的变分不等式问题作有限元离散,再将离散问题化成鞍点问题,然后采用Uzawa型算法求解.这就避免了[6]中方法的上述困难.     

A branch and bound network approach to the canonical constrained entropy problem

In this paper, we present a branch and bound algorithm for solving the constrained entropy mathematical programming problem. Unlike other methods for solving this problem, our method solves more general problems with inequality constraints. The advantage of the proposed technique is that the relaxed problem solved at each node is a singly constrained network problem. The disadvantage is that the relaxed problem has twice as many variables as the original problem. An application to regional planning is given, and an example problem is solved.     

Coefficient identification in Euler-Bernoulli equation from over-posed data

A method for solving the inverse problem for coefficient identification in the Euler-Bernoulli equation from over-posed data is presented. The original inverse problem is replaced by a minimization problem. The method is applied to the problem for identifying the coefficient in the case when it is a piece-wise polynomial function. Several examples are elaborated and the numerical results confirm that the solution of the imbedding problem coincides with the direct simulation of the original problem within the second order of approximation.     

Inverse Eigenvalue Problem in Structural Dynamics Design

1 Introduction Structural dynamics design is to design a structure subject to the dynamic characteristics re- quirement, i.e., determine physical and geometrical parameters such that the structure has the given frequencies and (or) mode shapes. This problem often arises in engineering connected with vibration. Recently, Joseph [1], Li et al. [2,3] converted the structural dynamics design to the following inverse eigenvalue problem. GIEP Let x = (x1, , xm)T , and let A(x) and B(x) be real n…     

A Convergence Proof for Constrained Finite Element Solutions

A convergence proof is given for the finite-element solutionof the infinite dimensional quadratic programming problem ofminimizing a quadratic functional subject to linear constraints.The proof for the unconstrained problem is briefly reviewed,and then extended to the constrained case. Only the first partof the proof is given, in which necessary conditions for convergenceare derived for the specific problem and its finite-elementapproximation. The final step of proving that any problem doesobey these conditions will depend on the specific problem, butit is shown that if the finite element formulation is pointwiseconvergent and the unconstrained problem is convergent, thenso too will be the constrained problem.