Superconvergent Two-grid Methods For Elliptic Eigenvalue Problems

Hailong Guo; Zhimin Zhang; Ren Zhao

Superconvergent Two-grid Methods For Elliptic Eigenvalue Problems

Numerical Analysis 2014-10-21 v2

Authors: Hailong Guo , Zhimin Zhang , Ren Zhao

Abstract

Some numerical algorithms for elliptic eigenvalue problems are proposed, analyzed, and numerically tested. The methods combine advantages of the two-grid algorithm, two-space method, the shifted inverse power method, and the polynomial preserving recovery technique . Our new algorithms compare favorably with some existing methods and enjoy superconvergence property.

Keywords

multigrid methods randomized kaczmarz algorithm matrix algorithms

Cite

@article{arxiv.1405.4641,
  title  = {Superconvergent Two-grid Methods For Elliptic Eigenvalue Problems},
  author = {Hailong Guo and Zhimin Zhang and Ren Zhao},
  journal= {arXiv preprint arXiv:1405.4641},
  year   = {2014}
}

Comments

18 pages, 9 figures

Related papers

View all related →