Maximum Principles and Application to the Analysis of An Explicit Time Marching Algorithm.
Abstract
In this paper we develop local and global estimates for the solution of convection-diffusion problems. We then study the convergence properties of a Time Marching Algorithm solving Advection-Diffusion problems on two domains using incompatible discretizations. This study is based on a De-Giorgi-Nash maximum principle.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1996
- Accession Number
- ADA314683
Entities
People
- Moulay D. Tidriri
- Patrick Le Tallec