On concentrators and related approximation constants

Pippenger [Pi77] showed the existence of (6m,4m,3m,6)-concentrator for each positive integer m using a probabilistic method. We generalize his approach and prove existence of (6m,4m,3m,5.05)-concentrator (which is no longer regular, but has fewer edges). We apply this result to improve the constant of approximation of almost additive set functions by additive set functions from 44.5 (established by Kalton and Roberts in [KaRo83] to 39. We show a more direct connection of the latter problem to the Whitney type estimate for approximation of continuous functions on a cube in &b&R&/b&&sup&d&/sup& by linear functions, and improve the estimate of this Whitney constant from 802 (proved by Brudnyi and Kalton in [BrKa00] to 73.

Nuclear relaxation contribution to static and dynamic (infinite frequency approximation) nonlinear optical properties by means of electrical property expansions: Application to HF, CH4, CF4, and SF6

Electrical property derivative expressions are presented for the nuclear relaxation contribution to static and dynamic (infinite frequency approximation) nonlinear optical properties. For CF4 and SF6, as opposed to HF and CH4, a term that is quadratic in the vibrational anharmonicity (and not previously evaluated for any molecule) makes an important contribution to the static second vibrational hyperpolarizability of CF4 and SF6. A comparison between calculated and experimental values for the difference between the (anisotropic) Kerr effect and electric field induced second-harmonic generation shows that, at the Hartree-Fock level, the nuclear relaxation/infinite frequency approximation gives the correct trend (in the series CH4, CF4, SF6) but is of the order of 50% too small

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

Equivalence of piecewise-linear approximation and Lagrangian relaxation for network revenue management

The network revenue management (RM) problem arises in airline, hotel, media,and other industries where the sale products use multiple resources. It can be formulatedas a stochastic dynamic program but the dynamic program is computationallyintractable because of an exponentially large state space, and a number of heuristicshave been proposed to approximate it. Notable amongst these -both for their revenueperformance, as well as their theoretically sound basis- are approximate dynamic programmingmethods that approximate the value function by basis functions (both affinefunctions as well as piecewise-linear functions have been proposed for network RM)and decomposition methods that relax the constraints of the dynamic program to solvesimpler dynamic programs (such as the Lagrangian relaxation methods). In this paperwe show that these two seemingly distinct approaches coincide for the network RMdynamic program, i.e., the piecewise-linear approximation method and the Lagrangianrelaxation method are one and the same.

Calibration of stochastic volatility models via second order approximation: the Heston model case

Using a suitable Hull and White type formula we develop a methodology to obtain asecond order approximation to the implied volatility for very short maturities. Using thisapproximation we accurately calibrate the full set of parameters of the Heston model. Oneof the reasons that makes our calibration for short maturities so accurate is that we alsotake into account the term-structure for large maturities. We may say that calibration isnot "memoryless", in the sense that the option's behavior far away from maturity doesinfluence calibration when the option gets close to expiration. Our results provide a wayto perform a quick calibration of a closed-form approximation to vanilla options that canthen be used to price exotic derivatives. The methodology is simple, accurate, fast, andit requires a minimal computational cost.

On the closed-form approximation of short-time random strike options

In this paper we propose a general technique to develop first and second order closed-form approximation formulas for short-time options withrandom strikes. Our method is based on Malliavin calculus techniques andallows us to obtain simple closed-form approximation formulas dependingon the derivative operator. The numerical analysis shows that these formulas are extremely accurate and improve some previous approaches ontwo-assets and three-assets spread options as Kirk's formula or the decomposition mehod presented in Alòs, Eydeland and Laurence (2011).

Approximation of quadratic irrationals and their pierce expansions

In this article two aims are pursued: on the one hand, to present arapidly converging algorithm for the approximation of square roots; on theother hand and based on the previous algorithm, to find the Pierce expansionsof a certain class of quadratic irrationals as an alternative way to themethod presented in 1984 by J.O. Shallit; we extend the method to findalso the Pierce expansions of quadratic irrationals of the form $2 (p-1)(p - \sqrt{p^2 - 1})$ which are not covered in Shallit's work.

A generalization of Hull and White formula and applications to option pricing approximation

By means of Malliavin Calculus we see that the classical Hull and White formulafor option pricing can be extended to the case where the noise driving thevolatility process is correlated with the noise driving the stock prices. Thisextension will allow us to construct option pricing approximation formulas.Numerical examples are presented.

A decomposition formula for option prices in the Heston model and applications to option pricing approximation

By means of classical Itô's calculus we decompose option prices asthe sum of the classical Black-Scholes formula with volatility parameterequal to the root-mean-square future average volatility plus a term dueby correlation and a term due to the volatility of the volatility. Thisdecomposition allows us to develop first and second-order approximationformulas for option prices and implied volatilities in the Heston volatilityframework, as well as to study their accuracy. Numerical examples aregiven.

Comparison of the polynomial model against explicit measurements of noise components for different mammography systems.

Given the adverse impact of image noise on the perception of important clinical details in digital mammography, routine quality control measurements should include an evaluation of noise. The European Guidelines, for example, employ a second-order polynomial fit of pixel variance as a function of detector air kerma (DAK) to decompose noise into quantum, electronic and fixed pattern (FP) components and assess the DAK range where quantum noise dominates. This work examines the robustness of the polynomial method against an explicit noise decomposition method. The two methods were applied to variance and noise power spectrum (NPS) data from six digital mammography units. Twenty homogeneously exposed images were acquired with PMMA blocks for target DAKs ranging from 6.25 to 1600 µGy. Both methods were explored for the effects of data weighting and squared fit coefficients during the curve fitting, the influence of the additional filter material (2 mm Al versus 40 mm PMMA) and noise de-trending. Finally, spatial stationarity of noise was assessed.Data weighting improved noise model fitting over large DAK ranges, especially at low detector exposures. The polynomial and explicit decompositions generally agreed for quantum and electronic noise but FP noise fraction was consistently underestimated by the polynomial method. Noise decomposition as a function of position in the image showed limited noise stationarity, especially for FP noise; thus the position of the region of interest (ROI) used for noise decomposition may influence fractional noise composition. The ROI area and position used in the Guidelines offer an acceptable estimation of noise components. While there are limitations to the polynomial model, when used with care and with appropriate data weighting, the method offers a simple and robust means of examining the detector noise components as a function of detector exposure.

Incremental neural networks for function approximation

A new strategy for incremental building of multilayer feedforward neural networks is proposed in the context of approximation of functions from R-p to R-q using noisy data. A stopping criterion based on the properties of the noise is also proposed. Experimental results for both artificial and real data are performed and two alternatives of the proposed construction strategy are compared.

Genetic parameters for growth traits in pigs estimated using third degree polynomial functions

Selostus: Sian kasvuominaisuuksien perinnölliset tunnusluvut arvioituna kolmannen asteen polynomifunktion avulla

A fully adaptive numerical approximation for a two-dimensional epidemic model with nonlinear cross-diffusion

An epidemic model is formulated by a reactionâeuro"diffusion system where the spatial pattern formation is driven by cross-diffusion. The reaction terms describe the local dynamics of susceptible and infected species, whereas the diffusion terms account for the spatial distribution dynamics. For both self-diffusion and cross-diffusion, nonlinear constitutive assumptions are suggested. To simulate the pattern formation two finite volume formulations are proposed, which employ a conservative and a non-conservative discretization, respectively. An efficient simulation is obtained by a fully adaptive multiresolution strategy. Numerical examples illustrate the impact of the cross-diffusion on the pattern formation.