Extrapolation of weights revisited: New proofs and sharp bounds

We use an appropriate factorization of the Ap weights to give another proof of the extrapolation theorem of Rubio de Francia. It provides sharp bounds in terms of the Ap-constant of the weights. Then we extend the result to more general settings including off-diagonal and partial range extrapolation. Among the applications, we prove by iteration a multivariable extrapolation theorem and give a sharp bound for Calderón-Zygmund operators on Lp(w) for weights in Aq (q<p).     

Error bounds for linear complementarity problems of DB-matrices

Doubly B-matrices (DB-matrices), which properly contain B-matrices, are introduced by Peña (2003) [2]. In this paper we present error bounds for the linear complementarity problem when the matrix involved is a DB-matrix and a new bound for linear complementarity problem of a B-matrix. The numerical examples show that the bounds are sharp.     

A filtering method for the interval eigenvalue problem

We consider the general problem of computing intervals that contain the real eigenvalues of interval matrices. Given an outer approximation (superset) of the real eigenvalue set of an interval matrix, we propose a filtering method that iteratively improves the approximation. Even though our method is based on a sufficient regularity condition, it is very efficient in practice and our experimental results suggest that it improves, in general, significantly the initial outer approximation. The proposed method works for general, as well as for symmetric interval matrices.     

Exact maximum likelihood estimator for drift fractional Brownian motion at discrete observation

This paper deals with the problems of consistency and strong consistency of the maximum likelihood estimators of the mean and variance of the drift fractional Brownian motions observed at discrete time instants. Both the central limit theorem and the Berry-Ess′een bounds for these estimators are obtained by using the Stein’s method via Malliavin calculus.     

Note on “An efficient approach for solving the lot-sizing problem with time-varying storage capacities”

In a recent paper Gutièrrez et al. [1] show that the lot-sizing problem with inventory bounds can be solved in O(TlogT) time. In this note we show that their algorithm does not lead to an optimal solution in general.     

Coefficient bounds for biholomorphic mappings which have a parametric representation

The main purpose of this paper is to prove a collection of new fixed point theorems for so-called weakly F-contractive mappings. By analogy, we introduce also a class of strongly F-expansive mappings and we prove fixed point theorems for such mappings. We provide a few examples, which illustrate these results and, as an application, we prove an existence and uniqueness theorem for the generalized Fredholm integral equation of the second kind. Finally, in Appendix A, we apply the Mönch fixed point theorem to prove two results on the existence of approximate fixed points of some continuous mappings.     

Sharp distribution free lower bounds for spread options and the corresponding optimal subreplicating portfolios

We derive in closed form distribution free lower bounds and optimal subreplicating strategies for spread options in a one-period static arbitrage setting. In the case of a continuum of strikes, we complement the optimal lower bound for spread options obtained in [Rapuch, G., Roncalli, T., 2002. Pricing multiasset options and credit derivatives with copula, Credit Lyonnais, Working Papers] by describing its corresponding subreplicating strategy. This result is explored numerically in a Black-Scholes and in a CEV setting. In the case of discrete strikes, we solve in closed form the optimization problem in which, for each asset S₁ and S₂, forward prices and the price of one option are used as constraints on the marginal distributions of each asset. We provide a partial solution in the case where the marginal distributions are constrained by two strikes per asset. Numerical results on real NYMEX (New York Mercantile Exchange) crack spread option data show that the one discrete lower bound can be far and also very close to the traded price. In addition, the one strike closed form solution is very close to the two strike.     

Production scheduling with supply and delivery considerations to minimize the makespan

In this paper we study a scheduling model that simultaneously considers production scheduling, material supply, and product delivery. One vehicle with limited loading capacity transports unprocessed jobs from the supplier’s warehouse to the factory in a fixed travelling time. Another capacitated vehicle travels between the factory and the customer to deliver finished jobs to the customer. The objective is to minimize the arrival time of the last delivered job to the customer. We show that the problem is NP-hard in the strong sense, and propose an O(n) time heuristic with a tight performance bound of 2. We identify some polynomially solvable cases of the problem, and develop heuristics with better performance bounds for some special cases of the problem. Computational results show that all the heuristics are effective in producing optimal or near-optimal solutions quickly.     

A fitted numerical method for parabolic turning point singularly perturbed problems with an interior layer

The objective of this paper is to construct and analyze a fitted operator finite difference method (FOFDM) for the family of time‐dependent singularly perturbed parabolic convection–diffusion problems. The solution to the problems we consider exhibits an interior layer due to the presence of a turning point. We first establish sharp bounds on the solution and its derivatives. Then, we discretize the time variable using the classical Euler method. This results in a system of singularly perturbed interior layer two‐point boundary value problems. We propose a FOFDM to solve the system above. Through a rigorous error analysis, we show that the scheme is uniformly convergent of order one with respect to both time and space variables. Moreover, we apply Richardson extrapolation to enhance the accuracy and the order of convergence of the proposed scheme. Numerical investigations are carried out to demonstrate the efficacy and robustness of the scheme.     

Lower bounds in communication complexity based on factorization norms

We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory. This approach gives us access to several powerful tools from this area such as normed spaces duality and Grothendiek's inequality. This extends the arsenal of methods for deriving lower bounds in communication complexity. As we show, our method subsumes most of the previously known general approaches to lower bounds on communication complexity. Moreover, we extend all (but one) of these lower bounds to the realm of quantum communication complexity with entanglement. Our results also shed some light on the question how much communication can be saved by using entanglement. It is known that entanglement can save one of every two qubits, and examples for which this is tight are also known. It follows from our results that this bound on the saving in communication is tight almost always. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2009