We study a one-step method for delay differential equations, which is equivalent to an implicit Runge-Kutta method. It approximates the solution in the whole interval with a piecewise polynomial of fixed degree n. For an appropiate choice of the mesh points, it provides uniform convergence 0(hn+1) and the superconvergence 0(h2n) at the nodes.
A one-step subregion method for delay differential equations
VERMIGLIO, Rossana
1985-01-01
Abstract
We study a one-step method for delay differential equations, which is equivalent to an implicit Runge-Kutta method. It approximates the solution in the whole interval with a piecewise polynomial of fixed degree n. For an appropiate choice of the mesh points, it provides uniform convergence 0(hn+1) and the superconvergence 0(h2n) at the nodes.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
art%3A10.1007%2FBF02575897.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
Non pubblico
Dimensione
667.91 kB
Formato
Adobe PDF
|
667.91 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
