首页> 外文期刊>Pacific jurnal of optimization >NUMERICAL METHODS FOR COMPUTING TWO KINDS OF THE BEST HANKEL TENSOR APPROXIMATIONS
【24h】

NUMERICAL METHODS FOR COMPUTING TWO KINDS OF THE BEST HANKEL TENSOR APPROXIMATIONS

机译:计算两种最佳汉克尔张量近似值的数值方法

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

摘要

Hankel tensors and their approximation problems are of particular interest in the multidimensional seismic trace interpolator problem. In this paper, we investigate the numerical methods for two kinds of the best Hankel tensor approximation problems. Based on the Vandermonde decomposition of Hankel tensors, the Hankel tensor approximation problem with missing data is transformed into an unconstrained optimization problem, and then the BFGS method is used to solve it. For the Hankel tensor approximation problems with the interval constraint and box constraint, Dykstra's algorithm and its acceleration versions are designed to solve them. Numerical examples illustrate that these methods are feasible and effective.
机译:Hankel张量及其近似问题在多维地震痕量插值问题中特别感兴趣。 在本文中,我们研究了两种最佳Hankel张量近似问题的数值方法。 基于Hankel Tensors的Vandermonde分解,Hankel Tensor近似问题缺少数据转换为无约束的优化问题,然后使用BFGS方法来解决它。 对于汉克尔张量近似问题,间隔约束和框约束问题,Dykstra的算法及其加速版本旨在解决它们。 数值示例说明这些方法是可行和有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号