Non-Linear Dynamics of Accretion Disks with Stochastic Viscosity

We present a non-linear numerical model for a geometrically thin accretion disk with the addition of stochastic non-linear fluctuations in the viscous parameter. These numerical realizations attempt to study the stochastic effects on the disk angular momentum transport. We show that this simple model is capable of reproducing several observed phenomenologies of accretion driven systems. The most notable of these is the observed linear rms-flux relationship in the disk luminosity. This feature is not formally captured by the linearized disk equations used in previous work. A Fourier analysis of the dissipation and mass accretion rates across disk radii show coherence for frequencies below the local viscous frequency. This is consistent with the coherence behavior observed in astrophysical sources such as Cygnus X-1.

Polymonadic Programming

Monads are a popular tool for the working functional programmer to structure effectful computations. This paper presents polymonads, a generalization of monads. Polymonads give the familiar monadic bind the more general type forall a,b. L a -> (a -> M b) -> N b, to compose computations with three different kinds of effects, rather than just one. Polymonads subsume monads and parameterized monads, and can express other constructions, including precise type-and-effect systems and information flow tracking; more generally, polymonads correspond to Tates productoid semantic model. We show how to equip a core language (called lambda-PM) with syntactic support for programming with polymonads. Type inference and elaboration in lambda-PM allows programmers to write polymonadic code directly in an ML-like syntax--our algorithms compute principal types and produce elaborated programs wherein the binds appear explicitly. Furthermore, we prove that the elaboration is coherent: no matter which (type-correct) binds are chosen, the elaborated programs semantics will be the same. Pleasingly, the inferred types are easy to read: the polymonad laws justify (sometimes dramatic) simplifications, but with no effect on a types generality.