Asymptotic integration algorithms for nonhomogeneous, nonlinear, first order, ordinary differential equations

New methods for integrating systems of stiff, nonlinear, first order, ordinary differential equations are developed by casting the differential equations into integral form. Nonlinear recursive relations are obtained that allow the solution to a system of equations at time t plus delta t to be obtained in terms of the solution at time t in explicit and implicit forms. Examples of accuracy obtained with the new technique are given by considering systems of nonlinear, first order equations which arise in the study of unified models of viscoplastic behaviors, the spread of the AIDS virus, and predator-prey populations. In general, the new implicit algorithm is unconditionally stable, and has a Jacobian of smaller dimension than that which is acquired by current implicit methods, such as the Euler backward difference algorithm; yet, it gives superior accuracy. The asymptotic explicit and implicit algorithms are suitable for solutions that are of the growing and decaying exponential kinds, respectively, whilst the implicit Euler-Maclaurin algorithm is superior when the solution oscillates, i.e., when there are regions in which both growing and decaying exponential solutions exist

Single--crossover recombination in discrete time

Modelling the process of recombination leads to a large coupled nonlinear dynamical system. Here, we consider a particular case of recombination in {\em discrete} time, allowing only for {\em single crossovers}. While the analogous dynamics in {\em continuous} time admits a closed solution, this no longer works for discrete time. A more general model (i.e. without the restriction to single crossovers) has been studied before and was solved algorithmically by means of Haldane linearisation. Using the special formalism introduced by Baake and Baake (2003), we obtain further insight into the single-crossover dynamics and the particular difficulties that arise in discrete time. We then transform the equations to a solvable system in a two-step procedure: linearisation followed by diagonalisation. Still, the coefficients of the second step must be determined in a recursive manner, but once this is done for a given system, they allow for an explicit solution valid for all times.Comment: J. Math. Biol., in pres

A mathematical treatment of bank monitoring incentives

In this paper, we take up the analysis of a principal/agent model with moral hazard introduced in [17], with optimal contracting between competitive investors and an impatient bank monitoring a pool of long-term loans subject to Markovian contagion. We provide here a comprehensive mathematical formulation of the model and show using martingale arguments in the spirit of Sannikov [18] how the maximization problem with implicit constraints faced by investors can be reduced to a classical stochastic control problem. The approach has the advantage of avoiding the more general techniques based on forward-backward stochastic differential equations described in [6] and leads to a simple recursive system of Hamilton-Jacobi-Bellman equations. We provide a solution to our problem by a verification argument and give an explicit description of both the value function and the optimal contract. Finally, we study the limit case where the bank is no longer impatient

Fast global spectral methods for three-dimensional partial differential equations

Global spectral methods offer the potential to compute solutions of partial differential equations numerically to very high accuracy. In this work, we develop a novel global spectral method for linear partial differential equations on cubes by extending ideas of Chebop2 [Townsend and Olver, J. Comput. Phys., 299 (2015)] to the three-dimensional setting utilizing expansions in tensorized polynomial bases. Solving the discretized PDE involves a linear system that can be recast as a linear tensor equation. Under suitable additional assumptions, the structure of these equations admits for an efficient solution via the blocked recursive solver [Chen and Kressner, Numer. Algorithms, 84 (2020)]. In the general case, when these assumptions are not satisfied, this solver is used as a preconditioner to speed up computations

Viscel: A general purpose computer program for analysis of linear viscoelastic structures, volume 2

The VISCEL program is a general purpose computer program developed for equilibrium analysis of linear viscoelastic structures. The program is written in FORTRAN 5 language to operate on the Univac 1108 computer under the EXEC 8 operating system. The program, an extension of the linear equilibrium problem solver ELAS, is an updated and extended version of its earlier form written for the IBM 7094 computer. Finite element matrix displacement approach coupled with the synchronized material property concept, utilizing incremental time steps, was adopted for the solution presented. The step-by-step procedure involves solution of recursive equations in the time domain, which takes into account the memory of material properties. Incremental and accumulative displacements and stresses are obtained at the end of each time step. In order to minimize the extent of computations resulting from accumulative effects of material memory, the program provides an option which enables the employment of constant time steps in the logarithmic scale. Program documentation is presented

Optimal investment under multiple defaults risk: A BSDE-decomposition approach

We study an optimal investment problem under contagion risk in a financial model subject to multiple jumps and defaults. The global market information is formulated as a progressive enlargement of a default-free Brownian filtration, and the dependence of default times is modeled by a conditional density hypothesis. In this Ito-jump process model, we give a decomposition of the corresponding stochastic control problem into stochastic control problems in the default-free filtration, which are determined in a backward induction. The dynamic programming method leads to a backward recursive system of quadratic backward stochastic differential equations (BSDEs) in Brownian filtration, and our main result proves, under fairly general conditions, the existence and uniqueness of a solution to this system, which characterizes explicitly the value function and optimal strategies to the optimal investment problem. We illustrate our solutions approach with some numerical tests emphasizing the impact of default intensities, loss or gain at defaults and correlation between assets. Beyond the financial problem, our decomposition approach provides a new perspective for solving quadratic BSDEs with a finite number of jumps.Comment: Published in at http://dx.doi.org/10.1214/11-AAP829 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Maximum Principles of Markov Regime-Switching Forward–Backward Stochastic Differential Equations with Jumps and Partial Information

This paper presents three versions of maximum principle for a stochastic optimal control problem of Markov regime-switching forward–backward stochastic differential equations with jumps. First, a general sufficient maximum principle for optimal control for a system, driven by a Markov regime-switching forward–backward jump–diffusion model, is developed. In the regime-switching case, it might happen that the associated Hamiltonian is not concave and hence the classical maximum principle cannot be applied. Hence, an equivalent type maximum principle is introduced and proved. In view of solving an optimal control problem when the Hamiltonian is not concave, we use a third approach based on Malliavin calculus to derive a general stochastic maximum principle. This approach also enables us to derive an explicit solution of a control problem when the concavity assumption is not satisfied. In addition, the framework we propose allows us to apply our results to solve a recursive utility maximization problem