2,494 research outputs found
Transformation Method for Solving Hamilton-Jacobi-Bellman Equation for Constrained Dynamic Stochastic Optimal Allocation Problem
In this paper we propose and analyze a method based on the Riccati
transformation for solving the evolutionary Hamilton-Jacobi-Bellman equation
arising from the stochastic dynamic optimal allocation problem. We show how the
fully nonlinear Hamilton-Jacobi-Bellman equation can be transformed into a
quasi-linear parabolic equation whose diffusion function is obtained as the
value function of certain parametric convex optimization problem. Although the
diffusion function need not be sufficiently smooth, we are able to prove
existence, uniqueness and derive useful bounds of classical H\"older smooth
solutions. We furthermore construct a fully implicit iterative numerical scheme
based on finite volume approximation of the governing equation. A numerical
solution is compared to a semi-explicit traveling wave solution by means of the
convergence ratio of the method. We compute optimal strategies for a portfolio
investment problem motivated by the German DAX 30 Index as an example of
application of the method
Nonlinear Parabolic Equations arising in Mathematical Finance
This survey paper is focused on qualitative and numerical analyses of fully
nonlinear partial differential equations of parabolic type arising in financial
mathematics. The main purpose is to review various non-linear extensions of the
classical Black-Scholes theory for pricing financial instruments, as well as
models of stochastic dynamic portfolio optimization leading to the
Hamilton-Jacobi-Bellman (HJB) equation. After suitable transformations, both
problems can be represented by solutions to nonlinear parabolic equations.
Qualitative analysis will be focused on issues concerning the existence and
uniqueness of solutions. In the numerical part we discuss a stable
finite-volume and finite difference schemes for solving fully nonlinear
parabolic equations.Comment: arXiv admin note: substantial text overlap with arXiv:1603.0387
Numerical Solutions of Matrix Differential Models using Cubic Matrix Splines II
This paper presents the non-linear generalization of a previous work on
matrix differential models. It focusses on the construction of approximate
solutions of first-order matrix differential equations Y'(x)=f(x,Y(x)) using
matrix-cubic splines. An estimation of the approximation error, an algorithm
for its implementation and illustrative examples for Sylvester and Riccati
matrix differential equations are given.Comment: 14 pages; submitted to Math. Comp. Modellin
A numerical comparison of solvers for large-scale, continuous-time algebraic Riccati equations and LQR problems
In this paper, we discuss numerical methods for solving large-scale
continuous-time algebraic Riccati equations. These methods have been the focus
of intensive research in recent years, and significant progress has been made
in both the theoretical understanding and efficient implementation of various
competing algorithms. There are several goals of this manuscript: first, to
gather in one place an overview of different approaches for solving large-scale
Riccati equations, and to point to the recent advances in each of them. Second,
to analyze and compare the main computational ingredients of these algorithms,
to detect their strong points and their potential bottlenecks. And finally, to
compare the effective implementations of all methods on a set of relevant
benchmark examples, giving an indication of their relative performance
Order reduction methods for solving large-scale differential matrix Riccati equations
We consider the numerical solution of large-scale symmetric differential
matrix Riccati equations. Under certain hypotheses on the data, reduced order
methods have recently arisen as a promising class of solution strategies, by
forming low-rank approximations to the sought after solution at selected
timesteps. We show that great computational and memory savings are obtained by
a reduction process onto rational Krylov subspaces, as opposed to current
approaches. By specifically addressing the solution of the reduced differential
equation and reliable stopping criteria, we are able to obtain accurate final
approximations at low memory and computational requirements. This is obtained
by employing a two-phase strategy that separately enhances the accuracy of the
algebraic approximation and the time integration. The new method allows us to
numerically solve much larger problems than in the current literature.
Numerical experiments on benchmark problems illustrate the effectiveness of the
procedure with respect to existing solvers
- …