Numerische Mathematik

, Volume 57, Issue 1, pp 205–226

Nonlinear Galerkin methods: The finite elements case

  • M. Marion
  • R. Temam
Article

DOI: 10.1007/BF01386407

Cite this article as:
Marion, M. & Temam, R. Numer. Math. (1990) 57: 205. doi:10.1007/BF01386407

Summary

With the increase in the computing power and the advent of supercomputers, the approximation of evolution equations on large intervals of time is emerging as a new type of numerical problem. In this article we consider the approximation of evolution equations on large intervals of time when the space discretization is accomplished by finite elements. The algorithm that we propose, called the nonlinear Galerkin method, stems from the theory of dynamical systems and amounts to some approximation of the attractor in the discrete (finite elements) space. Essential here is the utilization of incremental unknown which is accomplished in finite elements by using hierarchical bases. Beside a detailed description of the algorithm, the article includes some technical results on finite elements spaces, and a full study of the stability and convergence of the method.

Subject Classifications

AMS (MOS): 65N30CR: G1.8

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • M. Marion
    • 1
  • R. Temam
    • 1
  1. 1.Laboratoire d'Analyse NumériqueUniversité Paris-SudOrsayFrance