Bounded state problem for hereditary control problems

In this paper, we characterize optimal pairs for a hereditary control problem where the state is constrained. We use relaxed controls and the technique of penalization.This research was supported by NSF Grant No. HRD-91-54077.     

半透明介质中辐射传递方程的反演计算及数值模拟

本文介绍了一侧为半透明、另一侧为非透明界面时一维半透明介质的辐射强度计算式。采用辐射与导热复合换热模型计算半透明介质内温度场。利用已知的温度场求半透明介质的辐射强度一正问题计算。将此辐射强度代入辐射反问题计算模型，引入测量误差，采用Ｃｈａｈｉｎｅ方法及演半透明介质内温度场一反问题计算。数值模拟表明，本文所采用的辐射反演法具有较高的精度及稳定性。     

A Modified Alternating Direction Method for Variational Inequality Problems

The alternating direction method is an attractive method for solving large-scale variational inequality problems whenever the subproblems can be solved efficiently. However, the subproblems are still variational inequality problems, which are as structurally difficult to solve as the original one. To overcome this disadvantage, in this paper we propose a new alternating direction method for solving a class of nonlinear monotone variational inequality problems. In each iteration the method just makes an orthogonal projection to a simple set and some function evaluations. We report some preliminary computational results to illustrate the efficiency of the method. Accepted 4 May 2001. Online publication 19 October, 2001.     

Quadratic Convergence of a Long-Step Interior-Point Method for Nonlinear Monotone Variational Inequality Problems

This paper offers an analysis on a standard long-step primal-dual interior-point method for nonlinear monotone variational inequality problems. The method has polynomial-time complexity and its q-order of convergence is two. The results are proved under mild assumptions. In particular, new conditions on the invariance of the rank and range space of certain matrices are employed, rather than restrictive assumptions like nondegeneracy.     

On interpolation with products of positive definite functions

In this paper we consider the problem of scattered data interpolation for multivariate functions. In order to solve this problem, linear combinations of products of positive definite kernel functions are used. The theory of reproducing kernels is applied. In particular, it follows from this theory that the interpolating functions are solutions of some varational problems.     

A one parameter method for the matrix inverse square root

This paper is motivated by the paper [3], where an iterative method for the computation of a matrix inverse square root was considered. We suggest a generalization of the method in [3]. We give some sufficient conditions for the convergence of this method, and its numerical stabillity property is investigated. Numerical examples showing that sometimes our generalization converges faster than the methods in [3] are presented.     

An Observation on Two Methods of Obtaining Solutions to Variational Problems

In this paper, we compare two methods for obtaining solutions for free problems in the calculus of variations. The first is due to Carathéodory (Ref. 1) and the second due to Leitmann (Ref. 2). Both methods introduce the notion of equivalent variational problems. Using either approach, an auxiliary problem is obtained for which the solution is more easily obtained. We compare both approaches by using each to solve the same class of examples. We conclude our discussion by unifying the two approaches into one and illustrating the potential of this new method through the use of an elementary example.     

三维可穿透目标远场声波反演的一种指示器样本方法

提出了用时谐声散射场的远场信息来可视化三维可穿透目标的一种指示器样本方法,它是通过析取一个指示器函数在包含可穿透目标的某个样本区域中的支集来实现这种可视化的,其中,这个指示器函数在可穿透目标的内部和外部有显著不同的取值.这个算法的一个特别吸引人的性质是不需要关于障碍物的任何几何和物理的先验信息,并且只需要散射场在某个有限孔径中若干个入射和测量方向上的远场信息,即可得到可穿透目标的一个很理想的可视化.数值算例保证了这个可视化算法是有效和实用的 关键词： 声散射 反问题 物形反演     

A Bionomic Approach to the Capacitated p-Median Problem

This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique, as an effective method to solve capacitated p-median problems (CPMP). Bionomic algorithms already proved to be an effective framework for finding good solutions to combinatorial optimization problems, when good local optimization algorithms are available. The paper also presents an effective local search technique for the CPMP. Computational results show the effectiveness of the proposed approach, when compared to the best performing heuristics so far presented in the literature.     

Integral methods for computing solutions of a class of singular two-point boundary value problems

In this paper, we establish three iteration methods to compute solutions for a class of (weakly) singular two-point boundary value problems (xy^′)^′=f(x,y), where x(0,1) and <2. We obtain the sufficient conditions for existence of a unique solution on . Finally, we given some numerical examples.