【打印本页】   【HTML】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
 ←前一篇|后一篇→ 过刊浏览    高级检索
 本文已被：浏览次   下载次 码上扫一扫！ 分享到： 微信 更多 字体:加大+|默认|缩小- 广义逆张量Padé逼近的连分式递推算法 顾传青1, 黄逸铮1, 陈之兵2 (1. 上海大学理学院，上海200444;2. 深圳大学数学与统计学院，广东深圳518052)

DOI：10.13195/j.kzyjc.2018.0019

A continued fractional recurrence algorithm for generalized inverse tensor Padé approximation
GU Chuan-qing1,HUANG Yi-zheng1,CHEN Zhi-bing2
(1. College of Sciences,Shanghai University,Shanghai200444,China;2. School of Mathematics and Statistics,Shenzhen University,Shenzhen518052,China)
Abstract:
The tensor exponential function has been widely used in cybernetics, image processing and various engineering fields. Based on the generalized matrix inverse, an effective tensor generalized inverse is defined for the first time on the scalar inner product space, thus constructing a continued fractional algorithm for the tensor Pad\$\acutee\$ approximation. On the other hand, we successfully use the tensor t- product to calculate the power of the tensor, and recursively giving the power series expansion of the tensor exponential function. Based on the previous two work, the continuous fractional algorithm designed in this paper is used to approximate the tensor exponential function. Its characteristic is that the algorithm can be programmed to implement recursive calculations, and in the calculation process, it is not necessary to calculate the product of the tensor and to calculate the inverse of the tensor. The numerical experiments of the two tensor exponential functions given in this paper show that comparing the continuous fractional algorithm with the commonly used truncation method, the proposed algorithm is effective without reducing the approximation order. If the dimension of the tensor is relatively large, a continuous fractional algorithm based on the generalized inverse of tensors will also have certain advantages.
Key words:

## 用微信扫一扫 