English
Related papers

Related papers: Composition of stochastic B-series with applicatio…

200 papers

We use the linear scalar SDE as a test problem to show that it is possible to construct almost sure stable first-order weak balanced schemes based on the addition of stabilizing functions to the drift terms. Then, we design balanced schemes…

Probability · Mathematics 2014-08-26 H. A. Mardones , C. M. Mora

We introduce a bt-algebra of type B. We define this algebra doing the natural analogy with the original construction of the bt-algebra. Notably we find a basis for it, a faithful tensorial representation, and we prove that it supports a…

Rings and Algebras · Mathematics 2017-03-28 Marcelo Flores

The aim of this paper is to establish various factorization results and then to derive estimates for linear functionals through the use of a generalized Taylor theorem. Additionally, several error bounds are established including…

Classical Analysis and ODEs · Mathematics 2024-12-10 Ali Hasan Ali , Zsolt Páles

The B-series composition theorem has been an important topic in numerical analysis of ordinary differential equations for the past-half century. Traditional proofs of this theorem rely on labelled trees, whereas recent developments in…

Numerical Analysis · Mathematics 2024-09-16 John C. Butcher , Taketomo Mitsui , Yuto Miyatake , Shun Sato

Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…

Rings and Algebras · Mathematics 2025-06-17 Hiroki Aoki , Hiraku Kawanoue

In [5] the authors suggested a new algorithm for the numerical approximation of a BSDE by merging the cubature method with the first order discretization developed by [3] and [16]. Though the algorithm presented in [5] compared…

Probability · Mathematics 2010-12-30 Dan Crisan , Konstantinos Manolarakis

In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…

Computational Complexity · Computer Science 2019-01-01 Laurent Lyaudet

The key difficulty to develop efficient high-order methods for integrating stochastic differential equations lies in the calculations of the multiple stochastic integrals. This letter suggests a scheme to compute the stochastic integrals…

Chemical Physics · Physics 2019-09-30 Shuanglin Sun , Yun-An Yan

It is well-known that extending the Hilbert axiomatic system for first-order intuitionistic logic with an exclusion operator, that is dual to implication, collapses the domains of models into a constant domain. This makes it an interesting…

Logic in Computer Science · Computer Science 2024-11-20 Tim S. Lyon , Ian Shillito , Alwen Tiu

Partial orders may be used for modeling and summarising ranking data when the underlying order relations are less strict than a total order. They are a natural choice when the data are lists recording individuals' positions in queues in…

Methodology · Statistics 2024-08-28 Chuxuan , Jiang , Geoff K. Nicholls

We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…

Combinatorics · Mathematics 2007-09-10 Dillon Mayhew

We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…

Logic in Computer Science · Computer Science 2023-02-10 Martin Svatoš , Peter Jung , Jan Tóth , Yuyi Wang , Ondřej Kuželka

This talk describes how a combination of symbolic computation techniques with first-order theorem proving can be used for solving some challenges of automating program analysis, in particular for generating and proving properties about the…

Programming Languages · Computer Science 2017-04-17 Laura Kovacs

In this paper, a centred universal high-order finite volume method for solving hyperbolic balance laws is presented. The scheme belongs to the family of ADER methods where the Generalized Riemann Problems (GRP) is a building block. The…

Numerical Analysis · Mathematics 2021-07-28 Gino I. Montecinos

This paper studies the low-rank property of the inverse of a class of large-scale structured matrices in the tensor-train (TT) format, which is typically discretized from differential operators. An interesting question that we are concerned…

Numerical Analysis · Mathematics 2025-01-14 Chuanfu Xiao , Kejun Tang , Zhitao Zhu

We construct a zero curvature formulation, in superspace, for the sTB-B hierarchy which naturally reduces to the zero curvature condition in terms of components, thus solving one of the puzzling features of this model. This analysis,…

solv-int · Physics 2009-10-30 J. C. Brunelli , Ashok Das

There are several ways to formally represent families of data, such as lambda terms, in a type theory such as the dependent type theory of Coq. Mathematical representations are very compact ones and usually rely on the use of dependent…

Logic in Computer Science · Computer Science 2022-12-21 Catherine Dubois , Nicolas Magaud , Alain Giorgetti

The emphasis of this paper is to investigate the high-order approximation of a class of SPDEs with cubic nonlinearity driven by multiplicative noise with the help of the amplitude equations. The highlight of our work is that we improve the…

Probability · Mathematics 2023-08-31 Shiduo Qu , Hongjun Gao

In this paper, we give a method to construct "good" exponential families systematically by representation theory. More precisely, we consider a homogeneous space $G/H$ as a sample space and construct an exponential family invariant under…

Statistics Theory · Mathematics 2022-10-14 Koichi Tojo , Taro Yoshino

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

Mathematical Physics · Physics 2007-05-23 A. N. Leznov