.png){kind=icon}
返回
On Bernoulli matrix polynomials and matrix exponential approximation
.png){kind=icon}
OA
AI
DOI：10.1016/j.cam.2020.113207.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present in this paper a new method based on Bernoulli matrix polynomials to approximate the exponential of a matrix. The developed method has given rise to two new algorithms whose efficiency and precision are compared to the most efficient implementations that currently exist. For that, a state-of-the-art test matrix battery, that allows deeply exploring the highlights and downsides of each method, has been used. Since the new algorithms proposed here do make an intensive use of matrix products, we also provide a GPUs-based implementation that allows to achieve a high performance thanks to the optimal implementation of matrix multiplication available on these devices. (c) 2020 Elsevier B.V. All rights reserved.
Keyword:
Bernoulli matrix approximation
Matrix exponential function
GPU computing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
354
被引数:
593
机构
引用论文
分享收藏分享收藏Core-shell structured Fe3O4@MnO2 nanospheres to achieve high cycling stability as electrode for supercapacitors.png)
Ionics
IonicsIF0
PREAI
分享收藏Nineteen dubious ways to compute the exponential of a matrix, twenty-five years laterSIAM REVIEW
SIAM REVIEWIF6.1
PREAI
分享收藏Competency based medical training: review * Commentary: The baby is thrown out with the bathwaterBMJOAAI
BMJIF0
OAAI分享收藏
查看更多内容