Abstract | ||
---|---|---|
In this work the alternant theta-method and its application is investigated. We analyze the local approximation error and the convergence of the method on the non-equidistant mesh. We define the order of convergence, as well. The main idea of this approach is the approximation of the solution of the Cauchy problems by using different numerical schemes (implicit, explicit, IMEX, one-step, multi-step etc.) with varying step-sizes. Benefits of such approximations are shown for the problems with non-smooth solutions. We show that the convergence and the error estimation can be given relatively easily for the classical theta-method in case both equidistant and non-equidistant time/space discretizations. We analyze the connection of this approach to the classical discrete Gronwall lemma. We show that the extended discrete Gronwall lemma can be successfully applied to the estimation of the convergence's rate of the alternant theta(i) method. We show numerical examples for some non-linear time dependent differential equations, which have non-continuous or strongly oscillated solutions. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1007/978-3-319-57099-0_6 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Alternant theta method,Stability constant,Gronwall lemma | Equidistant,Convergence (routing),Differential equation,Applied mathematics,Cauchy distribution,Rate of convergence,Approximation error,Mathematics,Gronwall's inequality | Conference |
Volume | ISSN | Citations |
10187 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
István Faragó | 1 | 62 | 21.50 |
Z. Farkas | 2 | 0 | 0.68 |