We study the convergence of a proximal-like minimization algorithm using Bregman functions. We extend the convergence results by Censor and Zenios (1992) and by Chen and Teboulle (1993) by showing ...
The aim of this paper is to study the convergence properties of a time marching algorithm solving advection-diffusion problems on two domains using incompatible discretizations. The basic algorithm is ...
一些您可能无法访问的结果已被隐去。
显示无法访问的结果