Szczegóły publikacji
Opis bibliograficzny
Adaptive mesh point selection for the efficient solution of scalar IVPs / Bolesław KACEWICZ // Numerical Algorithms ; ISSN 1017-1398. — 2018 — vol. 77 iss. 1, s. 57–75. — Bibliogr. s. 75, Abstr. — Publikacja dostępna online od: 2017-03-08
Autor
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 111578 |
|---|---|
| Data dodania do BaDAP | 2018-01-11 |
| Tekst źródłowy | URL |
| DOI | 10.1007/s11075-017-0304-2 |
| Rok publikacji | 2018 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Numerical Algorithms |
Abstract
We discuss adaptive mesh point selection for the solution of scalar initial value problems. We consider a method that is optimal in the sense of the speed of convergence, and we aim at minimizing the local errors. Although the speed of convergence cannot be improved by using the adaptive mesh points compared to the equidistant points, we show that the factor in the error expression can be significantly reduced. We obtain formulas specifying the gain achieved in terms of the number of discretization subintervals, as well as in terms of the prescribed level of the local error. Both nonconstructive and constructive versions of the adaptive mesh selection are shown, and a numerical example is given.