Computation of the eigenvalues of Sturm-Liouville problems with parameter dependent boundary conditions using the regularized sampling method

The purpose in this paper is to compute the eigenvalues of Sturm-Liouville problems with quite general separated boundary conditions nonlinear in the eigenvalue parameter using the regularized sampling method, an improvement on the method based on Shannon sampling theory, which does not involve any multiple integration and provides higher order estimates of the eigenvalues at a very low cost. A few examples shall be presented to illustrate the power of the method and a comparison made with the the exact eigenvalues obtained as squares of the zeros of the exact characteristic functions.

     

On fencing problems

Fencing problems regard the bisection of a convex body in a way that some geometric measures are optimized. We introduce the notion of relative diameter and study bisections of centrally symmetric planar convex bodies, bisections by straight line cuts in general planar convex bodies and also bisections by hyperplane cuts for convex bodies in higher dimensions. In the planar case we obtain the best possible lower bound for the ratio between the relative diameter and the area.     

On norms of composition operators acting on Bergman spaces

For arbitrary composition operators acting on a general Bergman space we improve the known lower bound for the norm and also generalize a related recent theorem of D.G. Pokorny and J.E. Shapiro. Next, we obtain a geometric formula for the norms of composition operators with linear fractional symbols, thus extending a result of C. Cowen and P. Hurst and revealing the meaning of their computation. Finally, we obtain a lower bound for essential norm of an arbitrary composition operator related to the well-known criterion of B. MacCluer and J.H. Shapiro. As a corollary, norms and essential norms are obtained for certain univalently induced noncompact composition operators in terms of the minimum of the angular derivative of the symbol.     

First order dynamic inclusions on time scales

In this paper, we study existence of solutions of first order dynamic inclusions on time scales with general boundary conditions. Both the ∇-derivative and Δ-derivative cases are considered. Examples are presented to illustrate that the Δ-derivative case needs more restrictive assumptions.     

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.