Asymptotic and boundary integral formulae for the computational reconstruction of small conductivity imperfections

In this paper we investigate the electrostatic problem of determining conductivity profiles from the knowledge of boundary currents and voltages. We obtain an improved estimate for the voltage potential of a two-dimensional conductor having finitely many circular inclusions and piecewise constant conductivity profile. We derive an asymptotic expansion for the voltage potential in terms of the reference voltage potential and the location, size, and conductivity of the inhomogeneities. This representation is used to formulate the nonlinear least squares problem for estimating the location and size of the inhomogeneities. Required boundary data for the voltage potential are generated numerically by solving a system of integral equations. Computational experiments are presented to demonstrate the effectiveness of our identification procedure.     

Lifetime study of high-spin states in 104,105In

In the neutron deficient isotopes _104,105In lifetimes of high spin states in the range from 0.5 ps to 600 ps have been measured in a coincidence recoil distance Doppler shift (RDDS) experiment. By combining the Doppler shift attenuation (DSA) and RDDS methods at few μm flight distances, the problem of delayed feeding has been avoided and very short lifetimes in the range 0.5–0.8 ps have been determined. Shell model calculations with strong restrictions for the neutron orbitals reveal good agreement with experimental level energies and still fair agreement for most measured B(M1) and B(E2) values. Received: 30 June 1998     

Kreĭn–Saakyan and Trace Formulas for a Pair of Canonical Differential Operators

An analog of the Kreĭn–Saakyan formula is derived for any pair of relatively prime self-adjoint extensions of a minimal symmetric canonical differential operator. This allows us to deduce a trace formula in the matrix case. I am grateful to Sh. Saakyan for his interest in this work and lively discussion. Received: December 8, 2006. Accepted: December 30, 2006.     

On solving energy-dependent partitioned eigenvalue problem by genetic algorithm: The case of real symmetric Hamiltonian matrices

An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of genetic algorithm. The proposed method is tested with matrices of different sizes (30 × 30 to 1000 × 1000). Comparison is made with Löwdin’s strategy for solving the problem. The relative advantages and disadvantages of the GA-based method are analyzed     

Exact solutions to linear programming problems

The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutions, taking advantage of the speed of floating-point calculations and attempting to minimize the operations performed in rational arithmetic. Extensive computational results are presented.     

A large deviation principle for 2D stochastic Navier–Stokes equation

In this paper one specifies the ergodic behavior of the 2D-stochastic Navier–Stokes equation by giving a Large Deviation Principle for the occupation measure for large time. It describes the exact rate of exponential convergence. The considered random force is non-degenerate and compatible with the strong Feller property.     

A non-isothermal Ginzburg–Landau model in superconductivity: Existence,uniqueness and asymptotic behaviour

In this paper we study a Ginzburg–Landau model which describes the behaviour of a superconducting material including thermal effects. We extend the traditional formulation of the problem, by introducing the temperature as an additional state variable. Accordingly, together with the Gor’kov–Eliashberg system, we introduce an evolution equation for the absolute temperature. We examine in detail the case which allows only variations of the concentration of superconducting electrons and of the temperature, neglecting the electromagnetic field. For this problem existence and uniqueness of the solution are shown. Finally we analyze the asymptotic behaviour of the solutions, proving that the system possesses a global attractor.     

Fire containment in grids of dimension three and higher

We consider a deterministic discrete-time model of fire spread introduced by Hartnell [Firefighter! an application of domination, Presentation, in: 20th Conference on Numerical Mathematics and Computing, University of Manitoba in Winnipeg, Canada, September 1995] and the problem of minimizing the number of burnt vertices when a fixed number of vertices can be defended by firefighters per time step. While only two firefighters per time step are needed in the two-dimensional lattice to contain any outbreak, we prove a conjecture of Wang and Moeller [Fire control on graphs, J. Combin. Math. Combin. Comput. 41 (2002) 19-34] that 2d-1 firefighters per time step are needed to contain a fire outbreak starting at a single vertex in the d-dimensional square lattice for d?3; we also prove that in the d-dimensional lattice, d?3, for each positive integer f there is some outbreak of fire such that f firefighters per time step are insufficient to contain the outbreak. We prove another conjecture of Wang and Moeller that the proportion of elements in the three-dimensional grid P_n×P_n×P_n which can be saved with one firefighter per time step when an outbreak starts at one vertex goes to 0 as n gets large. Finally, we use integer programming to prove results about the minimum number of time steps needed and minimum number of burnt vertices when containing a fire outbreak in the two-dimensional square lattice with two firefighters per time step.     

Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.     

Second order evolution equations with time-dependent subdifferentials

We study an abstract second order nonlinear evolution equation in a real Hilbert space. We consider time-dependent convex functions and their subdifferentials operating on the first derivative of the unknown function. Introducing appropriate assumptions on the convex functions and other data, we prove the existence and uniqueness of a strong solution, and give some applications of the abstract theorem to hyperbolic variational inequalities with time-dependent constraints.