Solving Linear Systems Whose Elements Are Nonlinear Functions of Intervals

The paper addresses the problem of solving linear algebraic systems the elements of which are, in the general case, nonlinear functions of a given set of independent parameters taking on their values within prescribed intervals. Three kinds of solutions are considered: (i) outer solution, (ii) interval hull solution, and (iii) inner solution. A simple direct method for computing a tight outer solution to such systems is suggested. It reduces, essentially, to inverting a real matrix and solving a system of real linear equations whose size n is the size of the original system. The interval hull solution (which is a NP-hard problem) can be easily determined if certain monotonicity conditions are fulfilled. The resulting method involves solving n+1 interval outer solution problems as well as 2n real linear systems of size n. A simple iterative method for computing an inner solution is also given. A numerical example illustrating the applicability of the methods suggested is solved.     

On p-Extensions of Fields of Characteristic p

It is proved that a Galois extension of a field of characteristic p is completely determined by its Galois group and the endomorphism of the additive group of the group algebra that corresponds to the raising to the power p.     

Coherent States for the Legendre Oscillator

Two families of coherent states (the eigenstates of the annihilation operator and the Klauder–Gazeau temporally stable coherent states) are constructed for the Legendre oscillator defined in this paper. Bibliography: 14 titles.     

The Schwarz Inequality on the Boundary for Functions Regular in the Disk

The classical Schwarz inequality on the boundary of the disk for the functions regular in the disk is refined in various directions. Inequalities involving zeros of the function, an inequality for points mapped to symmetric points on the circle, and an inverse estimate for univalent functions are presented. Other inequalities are discussed, and the possibility of applying them to estimates of polynomials and rational functions is indicated. Bibliography: 17 titles.     

Computation of the Morse Spectrum

The Morse spectrum is a limit set of Lyapunov exponents of periodic pseudo-trajectories. This notion is especially important in the case where a dynamical system has infinitely many periodic trajectories of large period. A method for estimating the Morse spectrum was suggested by the first author in J. Math. Anal. Appl., 252 (2000). This method is based on ideas of symbolic dynamics which reduces the study of a dynamical system to the study of a certain graph, called a symbolic image. Within the framework of this method, the computation of the Morse spectrum is connected with searching simple closed paths and extracting contours with suitable characteristics. However, under iterations of the symbolic image, the number of such paths sharply increases, which leads to huge expenses of memory and time. We suggest an algorithm for constructing contours with the maximal and minimal mean values. This algorithm is based on a special version of the simplex method. Numerical tests are also described. Bibliography: 13 titles. Illustrations: 3 figures.     

A Kinematic Formula for Affine Diameters and Affine Medians of a Convex Set

For a planar convex set K with C ²-smooth boundary, the area of the set of the points lying on a given number of affine diameters of K is estimated. As a corollary, it is proved that the area of K is at most pM² /4\pi M^2 /4 , where M is the largest length of a chord of K halving the area of K. Bibliography: 2 titles.     

A two-stage parallel branch and bound algorithm for mixed integer programs

Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems.     

On the origin of irreproducible behaviour of Na1−xLixNbO3 solid solutions

The irreproducibility of electrical properties of Na_0.88Li_0.12NbO₃ solid solution on thermal cycling reported by M.A.L. Nobre and S. Lanfredi is explained by gradual decomposition of the supersaturated solid solution below ca. 800 °C.