arrow
返回

Expokit

delete1998-03-01
delete0
delete
OA
AI
DOI:10.1145/285861.285868delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Expokit provides a set of routines aimed at computing matrix exponentials. More precisely, it computes either a small matrix exponential in full, the action of a large sparse matrix exponential on an operand vector, or the solution of a system of linear OBEs with constant inhomogeneity. The backbone of the sparse routines consists of matrix-free Krylov subspace projection methods (Arnoldi and Lanczos processes), and that is why the toolkit is capable of coping with sparse matrices of large dimension. The software handles real and complex matrices and provides specific routines for symmetric and Hermitian matrices. The computation of matrix exponentials is a numerical issue of critical importance in the area of Markov chains and furthermore, the computed solution is subject to probabilistic constraints. In addition to addressing general matrix exponentials, a distinct attention is assigned to the computation of transient states of Markov chains.

期刊

暂无期刊信息

机构

暂无机构信息
引用论文

引用论文

暂无论文信息