.png){kind=icon}
返回
An efficient method for computing eigenvalues of a real normal matrix
.png){kind=icon}
PRE
AI
DOI：10.1016/S0743-7315(03)00007-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Jacobi-based algorithms have attracted attention as they have a high degree of potential parallelism and may be more accurate than QR-based algorithms. In this paper we discuss how to design efficient Jacobi-like algorithms for eigenvalue decomposition of a real normal matrix. We introduce a block Jacobi-like method. This method uses only real arithmetic and orthogonal similarity transformations and achieves ultimate quadratic convergence. A theoretical analysis is conducted and some experimental results are presented. Crown Copyright (C) 2003 Published by Elsevier Science (USA). All rights reserved.
Keyword:
eigenvalue decomposition
normal matrix
Jacobi algorithm and QR algorithm
parallel computing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
Distribution of the density of states of bonded hydrogen in amorphous hydrogenated silicon.png)
Solar Cells
Solar CellsIF0
PREAI
分享收藏Interactive program for visualization and modelling of proteins, nucleic acids and small molecules
PREAI
分享收藏
查看更多内容