A tree combinatorial structure on the solution of a delay differential equation: a generating function approach

Fabião, Maria de Fátima; Brito, Paulo; St. Aubyn, António

http://hdl.handle.net/10400.5/30455

Utilize este identificador para referenciar este registo.

Nome:	Descrição:	Tamanho:	Formato:
PBRITO. ET AL.2008..pdf		556.71 KB	Adobe PDF	Ver/Abrir

Contacte-nos

Autores

Fabião, Maria de Fátima

Brito, Paulo

St. Aubyn, António

Resumo(s)

This paper introduces a new approach for obtaining explicit solutions for a first order linear delay differential equation with constant coefficients. We conjecture that there is a generating function defined over of a specific class of polynomials in the delay that solves the equation, and prove in the main theorem that the conjecture is valid. We also show the advantage of our method as regards the traditional Method of Step Algorithm (MSA).

Palavras-chave

Delay Differential Equations Method Step Algorithm Generating Functions

URI

http://hdl.handle.net/10400.5/30455

Editora

AIP Publishing

DOI

Fabião, Maria de Fátima; Paulo Brito and António St. Aubyn .(2008). “A tree combinatorial structure on the solution of a delay differential equation : a generating function approach”. AIP Conference Proceedings, 16–20 September 2008. Psalidi, Kos – Greece .(Search PDF in 2024).

Coleções

CEMAPRE - Documentos de Trabalho / CEMAPRE - Working Papers
UECE - Comunicações em Actas de conferências / Conference Documents

Métricas Alternativas

Ver registo completo