Publicação
A tree combinatorial structure on the solution of a delay differential equation: a generating function approach
| Resumo: | 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). |
|---|---|
| Autores principais: | Fabião, Maria de Fátima |
| Outros Autores: | Brito, Paulo; St. Aubyn, António |
| Assunto: | Delay Differential Equations Method Step Algorithm Generating Functions |
| Ano: | 2008 |
| País: | Portugal |
| Tipo de documento: | documento de conferência |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade de Lisboa |
| Idioma: | inglês |
| Origem: | Repositório da Universidade de Lisboa |
| Resumo: | 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). |
|---|