NOTE ON THE EVALUATION OF MATRIX POLYNOMIALS

被引:20
作者
VANLOAN, C
机构
[1] Department of Computer Science, Cornell University, Ithaca
关键词
D O I
10.1109/TAC.1979.1102005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The problem of evaluating a polynomial p(x) in a matrix A arises in many applications, e.g., the Taylor approximation of eA. The 0(√q n3) algorithm of Paterson and Stockmeyer has the drawback that it requires 0(√q n2) storage, where q is the degree of p and n is the dimension of A. An algorithm which greatly reduces this Storage requirement without undue loss of speed is presented. Copyright © 1979 by The Institute of Electrical and Electronics Engineers Inc.
引用
收藏
页码:320 / 321
页数:2
相关论文
共 2 条
[1]   19 DUBIOUS WAYS TO COMPUTE EXPONENTIAL OF A MATRIX [J].
MOLER, C ;
VANLOAN, C .
SIAM REVIEW, 1978, 20 (04) :801-836
[2]  
Paterson M. S., 1973, SIAM Journal on Computing, V2, P60, DOI 10.1137/0202007