A stable divide and conquer algorithm for the unitary eigenproblem
文献类型：期刊论文
| 作者 | Gu, M; Guzzo, R; Chi, XB; Cao, XQ |
| 刊名 | Siam journal on matrix analysis and applications
 |
| 出版日期 | 2003 |
| 卷号 | 25期号:2页码:385-404 |
| 关键词 | Eigendecomposition Unitary eigenproblem Divide and conquer |
| ISSN号 | 0895-4798 |
| DOI | 10.1137/s0895479899359539 |
| 通讯作者 | Gu, m() |
| 英文摘要 | We present a divide and conquer algorithm for computing the eigendecomposition of a unitary upper hessenberg matrix h. previous divide and conquer approaches suffer a potential loss of orthogonality among the computed eigenvectors of h. using a backward stable method based on previous work by gu and eisenstat in the rank-one modi. cation of the symmetric eigenproblem, our algorithm provides a backward stable method for computing the eigenvectors. the method also compares well against the efficiency of other available methods. |
| WOS关键词 | TRIDIAGONAL EIGENPROBLEM |
| WOS研究方向 | Mathematics |
| WOS类目 | Mathematics, Applied |
| 语种 | 英语 |
| WOS记录号 | WOS:000187741800005 |
| 出版者 | SIAM PUBLICATIONS |
| URI标识 | http://www.irgrid.ac.cn/handle/1471x/2374145 |
| 专题 | 计算机网络信息中心 |
| 通讯作者 | Gu, M |
| 作者单位 | 1.Univ Calif Berkeley, Dept Math, Berkeley, CA 94720 USA 2.Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USA 3.Chinese Acad Sci, Comp Network Informat Ctr, Beijing 100080, Peoples R China 4.Huazhong Univ Sci & Technol, Dept Comp Sci, Wuhan 430074, Peoples R China |
| 推荐引用方式 GB/T 7714 | Gu, M,Guzzo, R,Chi, XB,et al. A stable divide and conquer algorithm for the unitary eigenproblem[J]. Siam journal on matrix analysis and applications,2003,25(2):385-404. |
| APA | Gu, M,Guzzo, R,Chi, XB,&Cao, XQ.(2003).A stable divide and conquer algorithm for the unitary eigenproblem.Siam journal on matrix analysis and applications,25(2),385-404. |
| MLA | Gu, M,et al."A stable divide and conquer algorithm for the unitary eigenproblem".Siam journal on matrix analysis and applications 25.2(2003):385-404. |
入库方式： iSwitch采集
来源：计算机网络信息中心
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。