SearcharxivSearch

arXiv · 1707.02804

Compositionality of the Runge-Kutta Method

Abstract

In Spivak's work, dynamical systems are described in terms of their inputs and outputs in a pictorial way using an operad of wiring diagrams. Each dynamical system is a box with certain inputs and outputs, and multiple dynamical systems are linked together using wiring diagrams, which describe how the outputs of one dynamical system to the inputs of another. By describing dynamical systems in this way, we can decompose a large dynamical system as a collection of smaller, simpler dynamical systems linked together. Of course, this decomposition is only useful if we can work with these smaller, simpler dynamical systems instead of the larger one. In his paper, Spivak shows that we can perform Euler's method on these smaller systems and still get the same results as working on the larger one. In this paper, we extend his results to prove that we can do something similar with the Runge-Kutta method. However, we need to modify the framework used in Spivak's paper to account for the fact that the Runge-Kutta method requires multiple steps, unlike Euler's method. To better describe these systems, we define wiring diagrams as objects of a double-category and dynamical systems in terms of double functors, giving a categorical description of this approximation method.

Explore related subjects

Keep this discovery

BibTeXRIS

Timothy Ngotiaoco. 2017-07-10. Compositionality of the Runge-Kutta Method. https://arxiv.org/abs/1707.02804

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A model structure for cartesian 2-fibrations

Cartesian 2-fibrations provide a way to understand indexed categories, but their classical ``straightening'' construction requires several layers of weak coherence data. This paper develops a homotopical framework that replaces much of this bookkeeping with a fully strict model. By using marked 2-categories to record the cartesian morphisms and 2-cells, we construct a model structure whose fibrant objects are precisely the cartesian 2-fibrations over a fixed 2-category $\mathcal{C}$. We then show that the marked Grothendieck construction identifies these 2-fibrations, up to weak equivalence, with strict 2-functors from $\mathcal{C}$ into $2\mathrm{Cat}$. As an additional contribution, we construct localizations of 2-categories that simultaneously invert selected morphisms and 2-cells.

math.CT

A Natural Fuzzy Order on Fuzzy Numbers

This paper introduces a natural fuzzy order on fuzzy numbers that extends the natural orders on real numbers and interval numbers. We investigate its completeness properties and show that the space of uniformly bounded fuzzy numbers is conically complete and conically cocomplete, and that it is complete if and only if the underlying continuous t-norm is the G\"odel t-norm. Moreover, it is proved that this space constitutes a \([0,1]\)-enriched domain if and only if the underlying continuous t-norm satisfies the (S) condition. These results provide a foundation for ordering fuzzy numbers.

math.CT

Noetherian forms of free non-symmetric operads

In this paper, we study certain categories of labeled finite rooted ordered trees over a fixed set of labels where each label is equipped with an arity: a fixed number of children that the vertex with the given label must have. Equivalently, these are expression trees for operations in a free non-symmetric operad. A morphism between these trees matches a pruning of one tree (a prefix) with an entire subtree of another (a suffix). We characterize such categories, up to isomorphism, in terms of suitable exactness properties. It turns out that these categories exhibit strong algebraic behavior, in the sense that every such category, when appended with a strict initial object, has a particularly nice noetherian form.

math.CT