BIT Numerical Mathematics

, Volume 34, Issue 1, pp 129–147 | Cite as

Semi-analytic time-marching algorithms for semi-linear parabolic equations

  • Vladimir Maz'ya
  • Valdimir Karlin
Article

Abstract

New time marching algorithms for numerical solution of semi-linear parabolic equations are described. They are based on the approximation method proposed by the first author. An important feature of the algorithms is that they are both explicit and stable under mild restrictions to the time step, which come from the non-linear part of the equation.

AMS subject classifications

65M99 65D15 

Key words

numerical solution semi-linear parabolic equations time marching algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E. R. Benton and G. W. Platzman,A table of solutions of the one-dimensional Burgers equation, Quarterly of Applied Mathematics, 30, (1972) pp. 195–212.Google Scholar
  2. 2.
    D. F. Elliott and K. R. Rao,Fast Transforms. Algorithms, Analysis, Applications. 1982, Academic Press.Google Scholar
  3. 3.
    C. Hirsh,Numerical Computation of Internal and External Flows. vol. 1, 1988, vol. 2, 1990, John Wiley & Sons.Google Scholar
  4. 4.
    V. G. Maz'ya,Boundary point method. Tech. Report LiTH-MAT-R-91-44, Department of Mathematics, Linköping University.Google Scholar
  5. 5.
    V. G. Maz'ya,Approximate approximations. InProceeding of the Eighth Conference on the Mathematics of Finite Elements and Applications VIII 1993, Brunel University, London, to appear.Google Scholar
  6. 6.
    R. D. Richtmyer and K. W. Morton,Difference methods for initial-value problems. 1967, John Wiley & Sons.Google Scholar

Copyright information

© the BIT Foundation 1994

Authors and Affiliations

  • Vladimir Maz'ya
    • 1
    • 2
  • Valdimir Karlin
    • 1
    • 2
  1. 1.Department of MathematicsLinköping UniversityLinköpingSweden
  2. 2.Computational Aerodynamics DivisionKeldysh Institute of Applied MathematicsMoscowRussia

Personalised recommendations