Szczegóły publikacji
Opis bibliograficzny
Numerical search for algebraically stable two-step almost collocation methods / Dajana Conte, Raffaele D'Ambrosio, Zdzisław JACKIEWICZ, Beatrice Paternoster // Journal of Computational and Applied Mathematics ; ISSN 0377-0427. — 2013 — vol. 239, s. 304–321. — Bibliogr. s. 320–321, Abstr. — Zdzisław Jackiewicz – dod. afiliacja: Arizona State University
Autorzy (4)
- Conte Dajana
- D'Ambrosio Raffaele
- AGHJackiewicz Zdzisław
- Paternoster Beatrice
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 78865 |
|---|---|
| Data dodania do BaDAP | 2014-01-13 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.cam.2012.08.012 |
| Rok publikacji | 2013 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Journal of Computational and Applied Mathematics |
Abstract
We investigate algebraic stability of the new class of two-step almost collocation methods for ordinary differential equations. These continuous methods are obtained by relaxing some of the interpolation and collocation conditions to achieve strong stability properties together with uniform order of convergence on the whole interval of integration. We describe the search for algebraically stable methods using the criterion based on the Nyquist stability function proposed recently by Hill. This criterion leads to a minimization problem in one variable which is solved using the subroutine fminsearch from MATLAB. Examples of algebraically stable methods in this class are also presented. (C) 2012 Elsevier B.V. All rights reserved.