Furtivity and Masking Problems in Time-Dependent Electromagnetic Obstacle Scattering

In this paper, we consider furtivity and masking problems in time-dependent three-dimensional electromagnetic obstacle scattering. That is, we propose a criterion based on a merit function to minimize or to mask the electromagnetic field scattered by a bounded obstacle when hit by an incoming electromagnetic field and, with respect to this criterion, we drive the optimal strategy. These problems are natural generalizations to the context of electromagnetic scattering of the furtivity problem in time-dependent acoustic obstacle scattering presented in Ref. 1. We propose mathematical models of the furtivity and masking time-dependent three-dimensional electromagnetic scattering problems that consist in optimal control problems for systems of partial differential equations derived from the Maxwell equations. These control problems are approached using the Pontryagin maximum principle. We formulate the first-order optimality conditions for the control problems considered as exterior problems defined outside the obstacle for systems of partial differential equations. Moreover, the first-order optimality conditions derived are solved numerically with a highly parallelizable numerical method based on a perturbative series of the type considered in Refs. 2–3. Finally, we assess and validate the mathematical models and the numerical method proposed analyzing the numerical results obtained with a parallel implementation of the numerical method in several experiments on test problems. Impressive speedup factors are obtained executing the algorithms on a parallel machine when the number of processors used in the computation ranges between 1 and 100. Some virtual reality applications and some animations relative to the numerical experiments can be found in the website http://www.econ.unian.it/recchioni/w10/.     

On the Solution of Discontinuous IVPs by Adaptive Runge–Kutta Codes

In this paper an automatic technique for handling discontinuous IVPs when they are solved by means of adaptive Runge–Kutta codes is proposed. This technique detects, accurately locates and passes the discontinuities in the solution of IVPs by using the information generated by the code along the numerical integration together with a continuous interpolant of the discrete solution. A remarkable feature is that it does not require additional information on the location of the discontinuities. Some numerical experiments are presented to illustrate the reliability and efficiency of the proposed algorithms.     

Numerical analysis of reversible A B C reaction-diffusion systems

We develop an effective numerical method of studying large-time properties of reversible reaction-diffusion systems of type A + B ↔ C with initially separated reactants. Using it we find that there are three types of asymptotic reaction zones. In particular we show that the reaction rate can be locally negative and concentrations of species A and B can be nonmonotonic functions of the space coordinate x, locally significantly exceeding their initial values. Received 6 June 2002 / Received in final form 20 January 2003 Published online 7 May 2003     

一类二阶非线性常微分方程非线性边界条件的两点边值问题

本文讨论了一类二阶非线性常微分方程之具有线性边界条件的和具有非线性边界条件的两点边值问题解的存在性.     

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS）

Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O（n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented.     

Some Remarks on Left-Definite Hamiltonian Systems in the Regular Case

In the paper, a new method of constructing asymptotic solutions of differential equations on manifolds with singularities is presented. This method allows not only to widen essentially the space of asymptotics but also to obtain explicit formulas for asymptotic expansions, in particular, in the case when in a neighborhood of a singular point there exist strata of different dimensions.     

Generalized Equilibrium Problems and Generalized Complementarity Problems

From a general minimax inequality or an abstract lopsided saddle-point theorem, we deduce general Karamardian-type equilibrium theorems and generalized complementarity theorems. Our new results extend a number of well-known earlier works of many authors.     

双障碍问题阻尼牛顿法的二阶收敛性

本文研究由双障碍问题导出的一类B可微函数的性质，并在一定条件下证明了求解相应的B可微方程阻尼牛顿法的全局收效性和二阶收效性．数值例子表明这一算法是有效的．     

The dynamics of a two-component fluid in the presence of capillary forces

In the present paper we study the qualitative behavior ast→∞ of the solution of the Cauchy problem for a system of equations describing a dynamics of a two-component viscous fluid. The model under consideration takes into account the mutual diffusion of the fluid components as well as their capillary interaction. We describe the ω-limit set of trajectories of the dynamical system generated by the problem. It is proved that the stationary solution of the problem, is a homogeneous stationary distribution of one of the components, is asymptotically stable. Any other stationary solution is not asymptotically stable and is even unstable if there are no close stationary solutions corresponding to a smaller energy level. Translated fromMatematicheskie Zametki, Vol. 62, No. 2, pp. 293–305, August, 1997. Translated by A. M. Chebotarev     

Rational approximation in the complex plane using a τ-method and computer algebra

Numerous versions of the Lanczos τ-methods have been extensively used to produce polynomial approximations for functions verifying a linear differential equation with polynomial coefficients. In the case of an initial-value problem, an adapted τ-method based on Chebyshev series and the use of symbolic computation lead to a rational approximation of the solution on a region of the complex plane. Numerical examples show that the simplicity of the method does not prevent a high accuracy of results. This revised version was published online in June 2006 with corrections to the Cover Date.