A posteriori error estimates for the Crank-Nicolson method for parabolic equations
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:13Z | |
dc.date.available | 2015-11-24T17:01:13Z | |
dc.identifier.issn | 0025-5718 | - |
dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10890 | |
dc.rights | Default Licence | - |
dc.subject | parabolic equations | en |
dc.subject | crank-nicolson method | en |
dc.subject | crank-nicolson galerkin method | en |
dc.subject | crank-nicolson reconstruction | en |
dc.subject | crank-nicolson-galerkin reconstruction | en |
dc.subject | a posteriori error analysis | en |
dc.subject | finite-element methods | en |
dc.subject | schrodinger-equation | en |
dc.subject | heat-equation | en |
dc.subject | time | en |
dc.subject | discretizations | en |
dc.subject | space | en |
dc.title | A posteriori error estimates for the Crank-Nicolson method for parabolic equations | en |
heal.abstract | We derive optimal order a posteriori error estimates for time discretizations by both the Crank-Nicolson and the Crank-Nicolson-Galerkin methods for linear and nonlinear parabolic equations. We examine both smooth and rough initial data. Our basic tool for deriving a posteriori estimates are second-order Crank-Nicolson reconstructions of the piecewise linear approximate solutions. These functions satisfy two fundamental properties: (i) they are explicitly computable and thus their difference to the numerical solution is controlled a posteriori, and (ii) they lead to optimal order residuals as well as to appropriate pointwise representations of the error equation of the same form as the underlying evolution equation. The resulting estimators are shown to be of optimal order by deriving upper and lower bounds for them depending only on the discretization parameters and the data of our problem. As a consequence we provide alternative proofs for known a priori rates of convergence for the Crank-Nicolson method. | en |
heal.access | campus | - |
heal.fullTextAvailability | TRUE | - |
heal.journalName | Mathematics of Computation | en |
heal.journalType | peer reviewed | - |
heal.language | en | - |
heal.publicationDate | 2006 | - |
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
- Περιγραφή: