English
Related papers

Related papers: The Peano-Baker series

200 papers

A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.

Exactly Solvable and Integrable Systems · Physics 2009-11-11 F. Musso , A. Shabat

It is known that any rational abstract numeration system is faithfully, and effectively, represented by an N-rational series. A simple proof of this result is given which yields a representation of this series which in turn allows a simple…

Discrete Mathematics · Computer Science 2011-08-30 Pierre-Yves Angrand , Jacques Sakarovitch

These lecture notes provide an introduction to the theory and application of symmetry methods for ordinary differential equations, building on minimal prerequisites. Their primary purpose is to enable a quick and self-contained approach for…

Classical Analysis and ODEs · Mathematics 2023-04-03 Sebastian Walcher

Given an algebraic ordinary differential equation (AODE), we propose a computational method to determine when a truncated power series can be extended to a formal power series solution. If a certain regularity condition on the given AODE or…

Symbolic Computation · Computer Science 2021-07-05 Sebastian Falkensteiner , Yi Zhang , Thieu N. Vo

By setting up appropriate uniform convergence structures, we are able to reformulate the Order Completion Method of Oberguggenberger and Rosinger in a setting that more closely resembles the usual topological constructions for solving PDEs.…

General Mathematics · Mathematics 2007-06-28 Jan Harm van der Walt

We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic…

Logic in Computer Science · Computer Science 2022-07-26 Todd Schmid , Wojciech Rozowski , Alexandra Silva , Jurriaan Rot

"Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html) instead of the more traditional classical or intuitionistic logics.…

Logic in Computer Science · Computer Science 2011-08-24 Giorgi Japaridze

Continuous deep learning models, referred to as Neural Ordinary Differential Equations (Neural ODEs), have received considerable attention over the last several years. Despite their burgeoning impact, there is a lack of formal analysis…

Machine Learning · Computer Science 2022-07-15 Diego Manzanas Lopez , Patrick Musau , Nathaniel Hamilton , Taylor T. Johnson

The connection of Taylor maps and polynomial neural networks (PNN) to solve ordinary differential equations (ODEs) numerically is considered. Having the system of ODEs, it is possible to calculate weights of PNN that simulates the dynamics…

Neural and Evolutionary Computing · Computer Science 2020-08-11 Andrei Ivanov , Anna Golovkina , Uwe Iben

This survey provides an elementary introduction to operads and to their applications in homotopical algebra. The aim is to explain how the notion of an operad was prompted by the necessity to have an algebraic object which encodes higher…

Algebraic Topology · Mathematics 2012-02-16 Bruno Vallette

We show that the Poincar\'e series counting orthogeodesics of a negatively curved surface with totally geodesic boundary extends meromorphically to the whole complex plane, as well as the series counting geodesic arcs linking two points; we…

Differential Geometry · Mathematics 2024-04-18 Yann Chaubet

We study a class of linear ordinary differential equations (ODE)s with distributional coefficients. These equations are defined using an {\it intrinsic} multiplicative product of Schwartz distributions which is an extension of the…

Classical Analysis and ODEs · Mathematics 2021-11-09 Nuno Costa Dias , Cristina Jorge , Joao Nuno Prata

Here we present a new approach to deal with first order ordinary differential equations (1ODEs), presenting functions. This method is an alternative to the one we have presented in [1]. In [2], we have establish the theoretical background…

Classical Analysis and ODEs · Mathematics 2023-01-06 L. G. S. Duarte , L. A. C. P. da Mota , A. B. M. M. Queiroz

This is the first in a set of three papers providing an introduction to generalised Cesaro convergence. We start with traditional Cesaro methods for extending classical convergence and further generalise these to allow the calculation of…

General Mathematics · Mathematics 2026-04-22 Richard Stone

We introduce real induction, a proof technique analogous to mathematical induction but applicable to statements indexed by an interval on the real line. More generally we give an inductive principle applicable in any Dedekind complete…

History and Overview · Mathematics 2012-08-07 Pete L. Clark

There exist several methods for computing exact solutions of algebraic differential equations. Most of the methods, however, do not ensure existence and uniqueness of the solutions and might fail after several steps, or are restricted to…

Mathematical Software · Computer Science 2021-03-08 Francois Boulier , Jose Cano , Sebastian Falkensteiner , Rafael Sendra

A type system is introduced for a generic Object Oriented programming language in order to infer resource upper bounds. A sound andcomplete characterization of the set of polynomial time computable functions is obtained. As a consequence,…

Programming Languages · Computer Science 2018-02-20 Emmanuel Hainry , Romain Péchoux

This work investigates the application of the Newton's method for the numerical solution of a nonlinear boundary value problem formulated through an ordinary differential equation (ODE). Nonlinear ODEs arise in various mathematical modeling…

We investigate the complexity of uniform OR circuits and AND circuits of polynomial-size and depth. As their name suggests, OR circuits have OR gates as their computation gates, as well as the usual input, output and constant (0/1) gates.…

Computational Complexity · Computer Science 2013-09-06 Niall Murphy , Damien Woods

This study is devoted to the polynomial representation of the matrix $p$th root functions. The Fibonacci-H\"orner decomposition of the matrix powers and some techniques arisen from properties of generalized Fibonacci sequences, notably the…

Classical Analysis and ODEs · Mathematics 2017-10-25 Rajae Ben Taher , Youness El Khatabi , Mustapha Rachidi
‹ Prev 1 3 4 5 6 7 10 Next ›