...
首页> 外文期刊>RAIRO Operation Research >NUMERICAL SOLUTIONS OF THE MASS TRANSFER PROBLEM
【24h】

NUMERICAL SOLUTIONS OF THE MASS TRANSFER PROBLEM

机译:传质问题的数值解

获取原文
获取原文并翻译 | 示例
           

摘要

Let μ and ν be two probability measures on the real line and let c be a lower semicontinuous function on the plane. The mass transfer problem consists in determining a measure ξ whose marginals coincide with μ and ν, and whose total cost ∫∫ c(x,y) dξ(x,y) is minimum. In this paper we present three algorithms to solve numerically this Monge-Kantorovitch problem when the commodity being shipped is one-dimensional and not necessarily confined to a bounded interval. We illustrate these numerical methods and determine the convergence rate.
机译:令μ和ν为实线上的两个概率测度,令c为平面上的下半连续函数。传质问题在于确定度量ξ,其边际与μ和ν一致,并且总成本∫∫c(x,y)dξ(x,y)最小。在本文中,我们提出了三种算法,用数字算法解决了当商品被运输为一维且不一定限于有界区间时的Monge-Kantorovitch问题。我们说明了这些数值方法并确定了收敛速度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号