Journals / New Trends in Mathematical Sciences / 2014 / Cilt: 2 Sayı: 3

Accelerating convergence for backward Euler and trapezoid time discretization schemes

Osman Rasit Isik1and Tarkan ¨Oner2

Pages
214–220
Publication Date
2014-12-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Numerical results overlap with the theoretical results

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, we introduce two algorithms to numerically solve any initial value problem (IVP).
📊
Key Findings & Data:Undersome conditions, the first algorithm increases the order of convergence from one to two and the second one increases the order fromtwo to three.
💡
Conclusion & Impact:Numerical results overlap with the theoretical results
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Relaxation model · backward Euler method · accelerating convergence

Abstract

In this study, we introduce two algorithms to numerically solve any initial value problem (IVP). These algorithms dependon time relaxation model (TRM) which is obtained adding a time relaxation term into IVP. Discretizing TRM by using backward Euler(BE) method gives the first algorithm. Similarly, the second algorithm is followed by using trapezoid (TR) time stepping scheme . Undersome conditions, the first algorithm increases the order of convergence from one to two and the second one increases the order fromtwo to three. Thus, more accurate results can be obtained. To verify the accuracy of the methods, they are applied to some numericalexamples. Numerical results overlap with the theoretical results

🔖

Cite This Article

Işık, O. R., Öner, T. (2014). Accelerating convergence for backward Euler and trapezoid time discretization schemes. New Trends in Mathematical Sciences, Cilt: 2 Sayı: 3, 214–220. https://ajindex.com/articles/1003928

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (7)

  1. N.A. Adams and S. Stolz, Deconvolution methods for subgrid-scale approximation in LES, Modern Simulation Strategies for Turbulent Flow, R. T. Edwards, 2001.
  2. V.J. Ervin, W. Layton and M. Neda, Numerical analysis of a higher order time relaxation model of fluids, Int. J. Numer. Anal. Mod., 4 (2007) 648–670.
  3. O.R. Isik, Spin up problem and accelerating convergence to steady state, Appl. Math. Modell. (2013) 3242-3253.
  4. W. Layton and M. Neda, Truncation of scales by time relaxation, J. Math. Anal. Appl,325 ( 2007) 788–807.
  5. W. Layton, C. David Pruett and L. G. Rebholz, Temporally regularized direct numerical simulation, Appl. Math. Comp. 216 (2010) 3728–3738.
  6. M. Neda, Discontinuous Time Relaxation Method for the Time-Dependent Navier-Stokes Equations, Adv. Numer. Anal., Volume 2010, doi:10.1155/2010/419021.
  7. C.D. Pruett, T.B. Gatski, C.E. Grosch and W.D. Thacker, The temporally filtered Navier–Stokes equations: properties of the residual- stress, Phys. Fluids, 15 (2003) 2127–2140.