38 research outputs found

    Optimal Investment in Research and Development Under Uncertainty

    Get PDF
    This paper explores the optimal expenditure rate that a firm should employ to develop a new technology and pursue the registration of the related patent. Our model takes into account an economic environment with indus-trial competition among firms operating in the same sector and in presence of uncertainty in knowledge accumulation. We develop a stochastic optimal control problem with random horizon, and solve it theoretically by adopting a dynamic programming approach. An extensive numerical analysis suggests that the optimal expenditure rate is a decreasing function in time and its sen-sitivity to uncertainty depends on the stage of the race. The odds for the firm to preempt the rivals non-linearly depend on the degree of competition in the market

    Pricing methods for α-quantile and perpetual early exercise options based on Spitzer identities

    Get PDF
    We present new numerical schemes for pricing perpetual Bermudan and American options as well as α-quantile options. This includes a new direct calculation of the optimal exercise boundary for early-exercise options. Our approach is based on the Spitzer identities for general Lévy processes and on the Wiener–Hopf method. Our direct calculation of the price of α-quantile options combines for the first time the Dassios–Port–Wendel identity and the Spitzer identities for the extrema of processes. Our results show that the new pricing methods provide excellent error convergence with respect to computational time when implemented with a range of Lévy processes

    A general framework for pricing Asian options under stochastic volatility on parallel architectures

    Get PDF
    In this paper, we present a transform-based algorithm for pricing discretely monitored arithmetic Asian options with remarkable accuracy in a general stochastic volatility framework, including affine models and time-changed LĂ©vy processes. The accuracy is justified both theoretically and experimentally. In addition, to speed up the valuation process, we employ high-performance computing technologies. More specifically, we develop a parallel option pricing system that can be easily reproduced on parallel computers, also realized as a cluster of personal computers. Numerical results showing the accuracy, speed and efficiency of the procedure are reported in the paper

    Hilbert transform, spectral filters and option pricing

    Get PDF
    We show how spectral filters can improve the convergence of numerical schemes which use discrete Hilbert transforms based on a sinc function expansion, and thus ultimately on the fast Fourier transform. This is relevant, for example, for the computation of fluctuation identities, which give the distribution of the maximum or the minimum of a random path, or the joint distribution at maturity with the extrema staying below or above barriers. We use as examples the methods by Feng and Linetsky (Math Finance 18(3):337–384, 2008) and Fusai et al. (Eur J Oper Res 251(4):124–134, 2016) to price discretely monitored barrier options where the underlying asset price is modelled by an exponential Lévy process. Both methods show exponential convergence with respect to the number of grid points in most cases, but are limited to polynomial convergence under certain conditions. We relate these rates of convergence to the Gibbs phenomenon for Fourier transforms and achieve improved results with spectral filtering

    A Parallel Preconditioner for 2D Elliptic Boundary Value Problems

    Get PDF
    This work presents the implementation on a Linux Cluster of a parallel preconditioner for the solution of the linear system resulting from the finite element discretization of a 2D second order elliptic boundary value problem. The numerical method, proposed by Bramble, Pasciak and Schatz, is developed using Domain Decomposition techniques, which are based on the splitting of the computational domain into subregions of smaller size, enforcing suitable compatibility conditions. The Fortran code is implemented using PETSc: a suite of data structures and routines devoted to the scientific parallel computing and based on the MPI standard for all message-passing communications. The main interest of the paper is to investigate how the architectural aspects of the cluster influence the performance of the considered algorithm. We provide an analysis of the execution times as well as of the scalability, using as test case the classical Poisson equation with Dirichlet boundary conditions

    Fluctuation identities with continuous monitoring and their application to the pricing of barrier options

    Get PDF
    We present a numerical scheme to calculate fluctuation identities for exponential Lévy processes in the continuous monitoring case. This includes the Spitzer identities for touching a single upper or lower barrier, and the more difficult case of the two-barriers exit problem. These identities are given in the Fourier-Laplace domain and require numerical inverse transforms. Thus we cover a gap in the literature that has mainly studied the discrete monitoring case; indeed, there are no existing numerical methods that deal with the continuous case. As a motivating application we price continuously monitored barrier options with the underlying asset modelled by an exponential Lévy process. We perform a detailed error analysis of the method and develop error bounds to show how the performance is limited by the truncation error of the sinc-based fast Hilbert transform used for the Wiener–Hopf factorisation. By comparing the results for our new technique with those for the discretely monitored case (which is in the Fourier-z domain) as the monitoring time step approaches zero, we show that the error convergence with continuous monitoring represents a limit for the discretely monitored scheme

    Stability Properties of Discontinuous Galerkin Methods for Two-Dimensional Elliptic Problems

    No full text
    We address the problem of finding the necessary stabilization for a class of discontinuous Galerkin methods in mixed form for the 2D case. In particular, we present a new stabilized formulation of the (unstable) Bassi–Rebay method and a new formulation of the local discontinuous Galerkin method. The stability properties of the new formulations are studied and error estimates are derived. The theoretical results are validated in a series of numerical tests
    corecore