Related papers: Approximate derivations of order $n$
A classical theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to…
In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path…
Fast algorithms for approximation by rational functions exist for both barycentric and Thiele continued fraction (TCF) representations. We present the first numerically stable methods for derivative evaluation in the barycentric…
In this paper, we define an ordering relation for a set of complex numbers, and research the properties and theorems of the ordering, solve some simple complex inequalities with the ordering.
This paper presents a theorem which solves the problem of reduction of the determinant order by means of a transformation of it, into other determinant whose each element are a determinant of second order. This implies that, if the process…
We present a new aspect of the study of higher derived limits. More precisely, we introduce a complexity measure for the elements of higher derived limits over the directed set $\Omega$ of functions from $\mathbb{N}$ to $\mathbb{N}$ and…
We carry out a proof theoretic analysis of the wellfoundedness of recursive path orders in an abstract setting. We outline a very general termination principle and extract from its wellfoundedness proof subrecursive bounds on the size of…
The purpose of this paper is to show stability of order preserving/reversing transforms on the class of non-negative convex functions in ${\mathbb R}^n$, and its subclass, the class of non-negative convex functions attaining $0$ at the…
The purpose of this article is to present the theory of higher order connections on vector bundles from a viewpoint inspired by projective differential geometry.
Most of the engineering and physical systems are generally characterized by differential and difference equations based on their continuous-time and discrete-time dynamics, respectively. Moreover, these dynamical models are analyzed using…
We introduce the notion of an approximation system as a generalization of Taylor approximation, and we give some first examples. Next we develop the general theory, including error bounds and a sufficient criterion for convergence. More…
This paper derives two stabilizability theorems for a basic class of discrete-time nonlinear systems with multiple unknown parameters. First, we claim that a discrete-time multi-parameter system is stabilizable if its nonlinear growth rate…
The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].
A conjecture appears in \cite{milsteinscheme}, in the form of a remark, where it is stated that it is possible to construct, in a specified way, any high order explicit numerical schemes to approximate the solutions of SDEs with superlinear…
We present a framework for constructing a first-order hyperbolic system whose solution approximates that of a desired higher-order evolution equation. Constructions of this kind have received increasing interest in recent years, and are…
We present theory for general partial derivatives of matrix functions on the form $f(A(x))$ where $A(x)$ is a matrix path of several variables ($x=(x_1,\dots,x_j)$). Building on results by Mathias [SIAM J. Matrix Anal. Appl., 17 (1996), pp.…
Stochastic processes find applications in modelling systems in a variety of disciplines. A large number of stochastic models considered are Markovian in nature. It is often observed that higher order Markov processes can model the data…
A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…
The structure of the gaussian auxiliary field approximation in the theory of phase ordering kinetics is analysed with the aim of placing the method within the context of a systematic theory. While we are unable to do this for systems with a…
Our approach to higher order Fourier analysis is to study the ultra product of finite (or compact) Abelian groups on which a new algebraic theory appears. This theory has consequences on finite (or compact) groups usually in the form of…