Richardson-Kalitkin method in abstract description
Journal: Discrete and Continuous Models and Applied Computational Science (Vol.29, No. 3)Publication Date: 2021-10-01
Authors : Ali Baddour; Mikhail Malykh;
Page : 271-284
Keywords : finite difference method; ordinary differential equations; a posteriori errors;
Abstract
An abstract description of the Richardson–Kalitkin method is given for obtaining a posteriori estimates for the proximity of the exact and found approximate solution of initial problems for ordinary differential equations (ODE). The problem Ρ{{Rho}} is considered, the solution of which results in a real number uu. To solve this problem, a numerical method is used, that is, the set H⊂ℝ{Hsubset mathbb{R}} and the mapping uh:H→ℝ{u_h:Htomathbb{R}} are given, the values of which can be calculated constructively. It is assumed that 0 is a limit point of the set HH and uh{u_h} can be expanded in a convergent series in powers of h:uh=u+c1hk+...{h:u_h=u+c_1h^k+...}. In this very general situation, the Richardson–Kalitkin method is formulated for obtaining estimates for uu and cc from two values of uh{u_h}. The question of using a larger number of uh{u_h} values to obtain such estimates is considered. Examples are given to illustrate the theory. It is shown that the Richardson–Kalitkin approach can be successfully applied to problems that are solved not only by the finite difference method.
Other Latest Articles
- Shifted Sobol points and multigrid Monte Carlo simulation
- Asymptotically accurate error estimates of exponential convergence for the trapezoidal rule
- Towards the analysis of the performance measures of heterogeneous networks by means of two-phase queuing systems
- Evaluation of firewall performance when ranging a filtration rule set
- Evaluation of the firewall influence on the session initiation by the SIP multimedia protocol
Last modified: 2021-10-01 08:20:52