OPERATOR METHODS, ABELIAN PROCESSES AND DYNAMIC CONDITIONING

A mathematical framework for Continuous Time Finance based on operator algebraic methods oers a new direct and entirely constructive perspective on the field. It also leads to new numerical analysis techniques which can take advantage of the emerging massively parallel GPU architectures which are uniquely suited to execute large matrix manipulations. This is partly a review paper as it covers and expands on the mathematical framework underlying a series of more applied articles. In addition, this article also presents a few key new theorems that make the treatment self-contained. Stochastic processes with continuous time and continuous space variables are defined constructively by establishing new convergence estimates for Markov chains on simplicial sequences. We emphasize high precision computability by numerical linear algebra methods as opposed to the ability of arriving to analytically closed form expressions in terms of special functions. Path dependent processes adapted to a given Markov filtration are associated to an operator algebra. If this algebra is commutative, the corresponding process is named Abelian, a concept which provides a far reaching extension of the notion of stochastic integral. We recover the classic Cameron-Dyson-Feynman-Girsanov-Ito-Kac-Martin theorem as a particular case of a broadly general block-diagonalization algorithm. This technique has many applications ranging from the problem of pricing cliquets to target-redemption-notes and volatility derivatives. Non-Abelian processes are also relevant and appear in several important applications to for instance snowballs and soft calls. We show that in these cases one can eectively use block-factorization algorithms. Finally, we discuss the method of dynamic conditioning that allows one to dynamically correlate over possibly even hundreds of processes in a numerically noiseless framework while preserving marginal distributions

OPERATOR METHODS, ABELIAN PROCESSES AND DYNAMIC CONDITIONING

A mathematical framework for Continuous Time Finance based on operator algebraic methods oers a new direct and entirely constructive perspective on the field. It also leads to new numerical analysis techniques which can take advantage of the emerging massively parallel GPU architectures which are uniquely suited to execute large matrix manipulations. This is partly a review paper as it covers and expands on the mathematical framework underlying a series of more applied articles. In addition, this article also presents a few key new theorems that make the treatment self-contained. Stochastic processes with continuous time and continuous space variables are defined constructively by establishing new convergence estimates for Markov chains on simplicial sequences. We emphasize high precision computability by numerical linear algebra methods as opposed to the ability of arriving to analytically closed form expressions in terms of special functions. Path dependent processes adapted to a given Markov filtration are associated to an operator algebra. If this algebra is commutative, the corresponding process is named Abelian, a concept which provides a far reaching extension of the notion of stochastic integral. We recover the classic Cameron-Dyson-Feynman-Girsanov-Ito-Kac-Martin theorem as a particular case of a broadly general block-diagonalization algorithm. This technique has many applications ranging from the problem of pricing cliquets to target-redemption-notes and volatility derivatives. Non-Abelian processes are also relevant and appear in several important applications to for instance snowballs and soft calls. We show that in these cases one can eectively use block-factorization algorithms. Finally, we discuss the method of dynamic conditioning that allows one to dynamically correlate over possibly even hundreds of processes in a numerically noiseless framework while preserving marginal distributions.Operator methods; financial derivatives; path-dependent derivatives; correlation derivatives

CALLABLE SWAPS, SNOWBALLS AND VIDEOGAMES

Although economically more meaningful than the alternatives, short rate models have been dismissed for financial engineering applications in favor of market models as the latter are more flexible and best suited to cluster computing implementations. In this paper, we argue that the paradigm shift toward GPU architectures currently taking place in the high performance computing world can potentially change the situation and tilt the balance back in favor of a new generation of short rate models. We find that operator methods provide a natural mathematical framework for the implementation of realistic short rate models that match features of the historical process such as stochastic monetary policy, calibrate well to liquid derivatives and provide new insights on complex structures. In this paper, we show that callable swaps, callable range accruals, target redemption notes (TARNs) and various flavors of snowballs and snowblades can be priced with methods numerically as precise, fast and stable as the ones based on analytic closed form solutions by means of BLAS level-3 methods on massively parallel GPU architectures.Interest Rate Derivatives; stochastic monetary policy; callable swaps; snowballs; GPU programming; operator methods

Lichnerowicz-type equations with sign-changing nonlinearities on complete manifolds with boundary

We prove an existence theorem for positive solutions to Lichnerowicz-type equations on complete manifolds with boundary and nonlinear Neumann conditions. This kind of nonlinear problems arise quite naturally in the study of solutions for the Einstein-scalar field equations of General Relativity in the framework of the so called Conformal Method

Lichnerowicz-type equations on complete manifolds

Under appropriate spectral assumptions we prove two existence results for positive solutions of Lichnerowicz-type equations on complete manifolds. We also give a priori bounds and a comparison result that immediately yields uniqueness for certain classes of solutions. No curvature assumptions are involved in our analysis.Comment: 33 pages, submitte