Optimal order a posteriori error estimates for a class of Runge-Kutta and Galerkin methods
dc.contributor.author | Akrivis, G. | en |
dc.contributor.author | Makridakis, C. | en |
dc.contributor.author | Nochetto, R. H. | en |
dc.date.accessioned | 2015-11-24T17:01:55Z | |
dc.date.available | 2015-11-24T17:01:55Z | |
dc.identifier.issn | 0029-599X | - |
dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10998 | |
dc.rights | Default Licence | - |
dc.subject | finite-element methods | en |
dc.subject | crank-nicolson method | en |
dc.subject | parabolic equations | en |
dc.subject | time | en |
dc.title | Optimal order a posteriori error estimates for a class of Runge-Kutta and Galerkin methods | en |
heal.abstract | We derive a posteriori error estimates, which exhibit optimal global order, for a class of time stepping methods of any order that include Runge-Kutta Collocation (RK-C) methods and the continuous Galerkin (cG) method for linear and nonlinear stiff ODEs and parabolic PDEs. The key ingredients in deriving these bounds are appropriate one-degree higher continuous reconstructions of the approximate solutions and pointwise error representations. The reconstructions are based on rather general orthogonality properties and lead to upper and lower bounds for the error regardless of the time-step; they do not hinge on asymptotics. | en |
heal.access | campus | - |
heal.fullTextAvailability | TRUE | - |
heal.identifier.primary | DOI 10.1007/s00211-009-0254-2 | - |
heal.journalName | Numerische Mathematik | en |
heal.journalType | peer reviewed | - |
heal.language | en | - |
heal.publicationDate | 2009 | - |
heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
heal.type | journalArticle | - |
heal.type.el | Άρθρο Περιοδικού | el |
heal.type.en | Journal article | en |
Αρχεία
Φάκελος/Πακέτο αδειών
1 - 1 of 1
Φόρτωση...
- Ονομα:
- license.txt
- Μέγεθος:
- 1.74 KB
- Μορφότυπο:
- Item-specific license agreed upon to submission
- Περιγραφή: