Discrete Sturm–Liouville problems, Jacobi matrices and Lagrange interpolation series

The close relationship between discrete Sturm–Liouville problems belonging to the so-called limit-circle case, the indeterminate Hamburger moment problem and the search of self-adjoint extensions of the associated semi-infinite Jacobi matrix is well known. In this paper, all these important topics are also related with associated sampling expansions involving analytic Lagrange-type interpolation series.     

Propagation of singularities in Cauchy problems for quasilinear thermoelastic systems in three space variables

By using microlocal analysis, the propagation of weak singularities in Cauchy problems for quasilinear thermoelastic systems in three space variables are investigated. First, paradifferential operators are employed to decouple the quasilinear thermoelastic systems. Second, by investigating the decoupled hyperbolic-parabolic systems and using the classical bootstrap argument, the property of finite propagation speeds of singularities in Cauchy problems for the quasilinear thermoelastic systems is obtained. Finally, it is shown that the microlocal weak singularities for Cauchy problems of the thermoelastic systems are propagated along the null bicharacteristics of the hyperbolic operators.     

Structural properties and tractability results for linear synteny

The syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally difficult to compute and have resisted efficient approximation algorithms with non-trivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the first polynomial time algorithm exactly solving linear synteny for a non-trivial class of instances. It is based on a novel connection between the syntenic distance and a scheduling problem that has been studied in the operations research literature.     

Algorithms for Finite and Semi-Infinite Min–Max–Min Problems Using Adaptive Smoothing Techniques

We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples.     

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.     

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