Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices

被引:0
|
作者
N. Mastronardi
E. Van Camp
M. Van Barel
机构
[1] sez. Bari Consiglio Nazionale delle Ricerche,Istituto per le Applicazioni del Calcolo, “M. Picone”
[2] Katholieke Universiteit Leuven,Department of Computer Science
来源
Numerical Algorithms | 2005年 / 39卷
关键词
semiseparable matrix; fast algorithms; stable algorithms; eigendecomposition;
D O I
暂无
中图分类号
学科分类号
摘要
Three fast and stable divide and conquer algorithms to compute the eigendecomposition of symmetric diagonal-plus-semiseparable matrices are considered.
引用
收藏
页码:379 / 398
页数:19
相关论文
共 38 条