Mesh selection for stiff two-point boundary value problems

This paper is concerned with the mesh selection algorithm of COLSYS, a well known collocation code for solving systems of boundary value problems. COLSYS was originally designed to solve non-stiff and mildly stiff problems only. In this paper we show that its performance for solving extremely stiff problems can be considerably improved by modifying its error estimation and mesh selection algorithms. Numerical examples indicate the superiority of the modified algorithm.Dedicated to John Butcher on the occasion of his sixtieth birthday     

π π andK¯K channel coupling

We investigate the origin of the attraction in theK¯K channel around the threshold by introducing an additional channel to theππ andK¯K channels in a separable potential formalism assuming, in general, no direct interaction in theK¯K channel. To reproduce the features of the data, we find that the threshold of the additional channel is much above thef ₀(975) meson position. We show that this three-channel problem can be reduced to an effective two-channel problem where thef ₀(975) behaves as if it were aK¯K molecule bound by the coupling to the exotic channel. This picture is also supported by the fact that a single pole only, in the complexK¯K momentum plane, is associated to thef ₀(975) meson. Various physical observables, like the decay branching ratio and theK¯K scattering length, are then discussed in an effective two-channel framework.     

Group valued measures with the lyapunoff property

Dopo aver dato una definizione di parte convessa di un gruppo topologico, si stabilisce una condizione affinchè il condominio di una misura sia convesso.     

Entropy estimate for high-dimensional monotonic functions

We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of d-dimensional bounded monotonic functions under L^p norms. It is interesting to see that both the metric entropy and bracketing entropy have different behaviors for p<d/(d-1) and p>d/(d-1). We apply the new bounds for bracketing entropy to establish a global rate of convergence of the MLE of a d-dimensional monotone density.     

Case study: problem formulation and solution for a real-world sports scheduling problem

This case study paper describes a problem faced every year by the Devon Cricket League in England. Every league match requires two officiating umpires. There are various preferences relating to the deployment of umpires that fall short of being definite constraints. The requirement was to produce a computer system that would allocate umpires in a satisfactory manner without the need for human interaction, since the users of the system will be unqualified amateurs. This necessitated the construction of a very complex objective function, using imprecise and ill-defined information. The biggest challenge was thus one of problem formulation; the solution technique was relatively straightforward. The system has been put into successful use and it is expected that its use will continue indefinitely. The work raises ethical issues regarding work done for customers who are inexperienced amateurs.     

An algorithm for computing Jordan chains and inverting analytic matrix functions

We present an efficient algorithm for obtaining a canonical system of Jordan chains for an n × n regular analytic matrix function A(λ) that is singular at the origin. For any analytic vector function b(λ), we show that each term in the Laurent expansion of A(λ)⁻¹b(λ) may be obtained from the previous terms by solving an (n + d) × (n+d) linear system, where d is the order of the zero of det A(λ) at λ = 0. The matrix representing this linear system contains A(0) as a principal submatrix, which can be useful if A(0) is sparse. The last several iterations can be eliminated if left Jordan chains are computed in addition to right Jordan chains. The performance of the algorithm in floating point and exact (rational) arithmetic is reported for several test cases. The method is shown to be forward stable in floating point arithmetic.     

An invariance of geometric mean with respect to Lagrangian means

The invariance of the geometric mean G with respect to the Lagrangian mean-type mapping (Lf,Lg), i.e. the equation G○(Lf,Lg)=G, is considered. We show that the functions f and g must be of high class regularity. This fact allows to reduce the problem to a differential equation and determine the second derivatives of the generators f and g.     

Monotonic solutions of a quadratic integral equation of fractional order

In the paper we indicate an error made in the proof of the main result of the paper [M.A. Darwish, On quadratic integral equation of fractional orders, J. Math. Anal. Appl. 311 (2005) 112-119]. Moreover, we provide correct proof of a slightly modified version of the mentioned result. The main tool used in our proof is the technique associated with the Hausdorff measure of noncompactness.     

Nonlinear second-order equations with functional implicit impulses and nonlinear functional boundary conditions

In this paper we deal with nonlinear second-order boundary value problems with impulses. The impulsive functions depend implicitly on the different considered variables and the boundary value conditions are nonlinear. In both cases functional dependence on the solution is allowed. The existence results follow from the existence of a pair of well-ordered lower and upper solutions.