.png){kind=icon}
返回
TWO-GRID AND MULTIPLE-GRID ARNOLDI FOR EIGENVALUES
.png){kind=icon}
PRE
AI
DOI：10.1137/16M1062260.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new approach is given for computing eigenvalues and eigenvectors of large matrices. Multiple grids are combined with the Arnoldi method in order to solve difficult problems. First, a two-grid method computes eigenvectors on a coarse grid and improves them on the fine grid. On the fine grid, an Arnoldi-type method is used that, unlike standard Arnoldi methods, can accept initial approximate eigenvectors. This two-grid approach can vastly improve Krylov computations. It also succeeds for problems that regular multigrid cannot handle. Analysis is given to explain why fine grid convergence rates can sometimes unexpectedly match that of regular Arnoldi on the fine grid in spite of having many initial guess vectors. Near-Krylov theory is developed for this. Finally, this new method is generalized for more grid levels to produce a multiple-grid Arnoldi method.
Keyword:
eigenvalues
Arnoldi
multigrid
Krylov
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Theory of inexact Krylov subspace methods and applications to scientific computing不精确Krylov子空间方法的理论及其在科学计算中的应用
PREAI
分享收藏Collembola populations in an organic crop rotation: Population dynamics and metabolism after conversion from clover-grass ley to spring barley.png)
Pedobiologia
PedobiologiaIF0
PREAI
分享收藏Synthesis and characterization of screen -coated nickel selenide films for semiconductor device applicationOptik
OptikIF0
PREAI
分享收藏
查看更多内容