Scattered and track data interpolation using an efficient strip searching procedure

A new local algorithm for bivariate interpolation of large sets of scattered and track data is presented. The method, which changes partially depending on the kind of data, is based on the partition of the interpolation domain in a suitable number of parallel strips, and, starting from these, on the construction for any data point of a square neighbourhood containing a convenient number of data points. Then, the well-known modified Shepard’s formula for surface interpolation is applied with some effective improvements. The proposed algorithm is very fast, owing to the optimal nearest neighbour searching, and achieves good accuracy. Computational cost and storage requirements are analyzed. Moreover, the efficiency and reliability of the algorithm are shown by several numerical tests, also performed by Renka’s algorithm for a comparison.     

A smoothing Newton method for NCPs with the P0-property

In this paper, we first investigate a two-parametric class of smoothing functions which contains the penalized smoothing Fischer-Burmeister function and the penalized smoothing CHKS function as special cases. Then we present a smoothing Newton method for the nonlinear complementarity problem based on the class of smoothing functions. Issues such as line search rule, boundedness of the level set, global and quadratic convergence are studied. In particular, we give a line search rule containing the common used Armijo-type line search rule as a special case. Also without requiring strict complementarity assumption at the P₀-NCP solution or the nonemptyness and boundedness of the solution set, the proposed algorithm is proved to be globally convergent. Preliminary numerical results show the efficiency of the algorithm and provide efficient domains of the two parameters for the complementarity problems.     

Solving quadratic convex bilevel programming problems using a smoothing method

In this paper, we present a smoothing sequential quadratic programming to compute a solution of a quadratic convex bilevel programming problem. We use the Karush-Kuhn-Tucker optimality conditions of the lower level problem to obtain a nonsmooth optimization problem known to be a mathematical program with equilibrium constraints; the complementary conditions of the lower level problem are then appended to the upper level objective function with a classical penalty. These complementarity conditions are not relaxed from the constraints and they are reformulated as a system of smooth equations by mean of semismooth equations using Fisher-Burmeister functional. Then, using a quadratic sequential programming method, we solve a series of smooth, regular problems that progressively approximate the nonsmooth problem. Some preliminary computational results are reported, showing that our approach is efficient.     

Closure properties of operators on the Ma-Minda type starlike and convex functions

A normalized univalent function f is called Ma-Minda starlike or convex if zf^′(z)/f(z)?φ(z) or 1+zf^″(z)/f^′(z)?φ(z) where φ is a convex univalent function with φ(0)=1. The class of Ma-Minda convex functions is shown to be closed under certain operators that are generalizations of previously studied operators. Analogous inclusion results are also obtained for subclasses of starlike and close-to-convex functions. Connections with various earlier works are made.     

Weighted composition operators between weighted spaces of vector-valued holomorphic functions on Banach spaces

Let B(E, F) be the Banach Space of all continuous linear operators from a Banach Space E into a Banach space F. Let U_X and U_Y be balanced open subsets of Banach spaces X and Y, respectively. Let V and W be two Nachbin families of continuous weights on U_X and U_Y, respectively. Let HV(U_X, E) (or HV₀(U_X, E)) and HW(U_Y, F) (or HW₀(U_Y, F)) be the weighted spaces of vector-valued holomorphic functions. In this paper, we investigate the holomorphic mappings ? : U_Y → U_X and ψ : U_Y → B(E, F) which generate weighted composition operators between these weighted spaces.     

Almost periodic and pseudo-almost periodic solutions to fractional differential and integro-differential equations

We study the existence of almost periodic (resp., pseudo-almost periodic) mild solutions for fractional differential and integro-differential equations in the case when the forcing term belongs to the class of Stepanov almost (resp., Stepanov-like pseudo-almost) periodic functions.     

New inequalities for subspace arrangements

For each positive integer n?4, we give an inequality satisfied by rank functions of arrangements of n subspaces. When n=4 we recover Ingleton's inequality; for higher n the inequalities are all new. These inequalities can be thought of as a hierarchy of necessary conditions for a (poly)matroid to be realizable. Some related open questions about the “cone of realizable polymatroids” are also presented.     

Integrals containing products of Airy functions and planar photon propagation in a magnetic field

We derive a number of new results on integrals of products of Airy functions, using various integral transform techniques. As an application, we deduce a compact integral representation, suitable for numerical integration, of the one‐loop photon propagator in a magnetic field in 2 + 1 dimensional scalar quantum electrodynamics. Copyright © 2011 John Wiley & Sons, Ltd.     

Spatial pseudoanalytic functions arising from the factorization of linear second order elliptic operators

Biquaternionic Vekua‐type equations arising from the factorization of linear second order elliptic operators are studied. Some concepts from classical pseudoanalytic function theory are generalized onto the considered spatial case. The derivative and antiderivative of a spatial pseudoanalytic function are introduced and their applications to the second order elliptic equations are considered. Copyright © 2011 John Wiley & Sons, Ltd.