Related papers: The Peano-Baker series
Exact solutions of some popular nonlinear ordinary differential equations are analyzed taking their Laurent series into account. Using the Laurent series for solutions of nonlinear ordinary differential equations we discuss the nature of…
In this note we discuss some formal properties of universal linearization operator, relate this to brackets of non-linear differential operators and discuss application to the calculus of auxiliary integrals, used in compatibility…
The Onsager Lie algebra $O$ is often used to study integrable lattice models. The universal enveloping algebra of $O$ admits a $q$-deformation $O_q$ called the $q$-Onsager algebra. Recently, an algebra $\mathcal O_q$ was introduced called…
A novel method, connecting the space of solutions of a linear differential equation, of arbitrary order, to the space of monomials, is used for exploring the algebraic structure of the solution space. Apart from yielding new expressions for…
In this short note, we establish an operator theoretic version of the Wiener-Ikehara tauberian theorem, and point out how this leads to a new proof of the Prime number theorem that should be accessible to anyone with a basic knowledge of…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
Solving partial differential equations (PDEs) using an annealing-based approach involves solving generalized eigenvalue problems. Discretizing a PDE yields a system of linear equations (SLE). Solving an SLE can be formulated as a general…
Replicator equations (RE) are among the basic tools in mathematical theory of selection and evolution. We develop a method for reducing a wide class of the RE, which in general are systems of differential equations in Banach space to escort…
In this work, we introduce a method based on piecewise polynomial interpolation to enclose rigorously solutions of nonlinear ODEs. Using a technique which we call a priori bootstrap, we transform the problem of solving the ODE into one of…
We introduce the concept of $\D$-operators associated to a sequence of polynomials $(p_n)_n$ and an algebra $\A$ of operators acting in the linear space of polynomials. In this paper, we show that this concept is a powerful tool to generate…
The secant method, as an important approach for solving nonlinear equations, is introduced in nearly all numerical analysis textbooks. However, most textbooks only briefly address the Q-order of convergence of this method, with few…
A classical question of propositional logic is one of the shortest proof of a tautology. A related fundamental problem is to determine the relative efficiency of standard proof systems, where the relative complexity is measured using the…
Cyclic proof systems for Heyting and Peano arithmetic eschew induction axioms by accepting proofs which are finite graphs rather than trees. Proving that such a cyclic proof system coincides with its more conventional variants is often…
Neural ordinary differential equations (Neural ODEs) propose the idea that a sequence of layers in a neural network is just a discretisation of an ODE, and thus can instead be directly modelled by a parameterised ODE. This idea has had…
An efficient approximate version of implicit Taylor methods for initial-value problems of systems of ordinary differential equations (ODEs) is introduced. The approach, based on an approximate formulation of Taylor methods, produces a…
Various problems of mathematical physics consider octonions and split-octonions as a mathematical structure, which underpins the eight-dimensional nature of these problems. Therefore, it is not surprising that octonionic analysis has become…
The present article introduces ptarithmetic (short for "polynomial time arithmetic") -- a formal number theory similar to the well known Peano arithmetic, but based on the recently born computability logic (see…
A matrix approach to continuous iteration is proposed for general formal series. It leads, in particular, to an order{to{order iteration of the exponential function, and consequently to an algorithmic approach to tetration. Lower{order…
An error analysis for some Newton-Cotes quadrature formulae is presented. Peano-like error bounds are obtained. They are generally, but not always, better than the usual Peano bounds.
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…