Optimal parameters in the HSS-like methods for saddle-point problems
文献类型：期刊论文
| 作者 | Bai, Zhong-Zhi
|
| 刊名 | NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS
 |
| 出版日期 | 2009-06-01 |
| 卷号 | 16期号:6页码:447-479 |
| 关键词 | saddle-point problem Hermitian and skew-Hermitian splitting accelerated splitting iteration method preconditioning property |
| ISSN号 | 1070-5325 |
| DOI | 10.1002/nla.626 |
| 英文摘要 | For the Hermitian and skew-Hermitian splitting iteration method and its accelerated variant for solving the large sparse saddle-point problems, we compute their quasi-optimal iteration parameters and the corresponding quasi-optimal convergence factors for the more practical but more difficult case that the (1, 1)-block of the saddle-point matrix is not algebraically equivalent to the identity matrix. In addition, the algebraic behaviors and the clustering properties of the eigenvalues of the preconditioned matrices with respect to these two iterations are investigated in detail, and the formulas for computing good iteration parameters are given under certain principle for optimizing the distribution of the eigenvalues. Copyright (C) 2008 John Wiley & Sons, Ltd. |
| 语种 | 英语 |
| WOS记录号 | WOS:000267042600002 |
| 出版者 | JOHN WILEY & SONS LTD |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/7972]  |
| 专题 | 计算数学与科学工程计算研究所 |
| 通讯作者 | Bai, Zhong-Zhi |
| 作者单位 | Chinese Acad Sci, State Key Lab Sci Engn Comp, Inst Computat Math & Sci Engn Comp, Acad Math & Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Bai, Zhong-Zhi. Optimal parameters in the HSS-like methods for saddle-point problems[J]. NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS,2009,16(6):447-479. |
| APA | Bai, Zhong-Zhi.(2009).Optimal parameters in the HSS-like methods for saddle-point problems.NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS,16(6),447-479. |
| MLA | Bai, Zhong-Zhi."Optimal parameters in the HSS-like methods for saddle-point problems".NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS 16.6(2009):447-479. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。