NASA NTRS · 19970012919
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.
Keep this discovery
Explore connections, maps & timelines
LeTallec, Patrick, Tidriri, Moulay D.. 1996-07-01. Maximum Principles and Application to the Analysis of An Explicit Time Marching Algorithm. https://ntrs.nasa.gov/citations/19970012919
Cite the original work for its findings. Save a collection to share your selection of sources.