Name
Abstract | ||
|---|---|---|
Some numerical algorithms for elliptic eigenvalue problems are proposed, analyzed, and numerically tested. The methods combine advantages of the two-grid algorithm (Xu and Zhou in Math Comput 70(233):17---25, 2001), the two-space method (Racheva and Andreev in Comput Methods Appl Math 2:171---185, 2002), the shifted inverse power method (Hu and Cheng in Math Comput 80:1287---1301, 2011; Yang and Bi in SIAM J Numer Anal 49:1602---1624, 2011), and the polynomial preserving recovery enhancing technique (Naga et al. in SIAM J Sci Comput 28:1289---1300, 2006). Our new algorithms compare favorably with some existing methods and enjoy superconvergence property. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s10915-016-0245-2 | J. Sci. Comput. |
Keywords | DocType | Volume |
Eigenvalue problems, Two-grid method, Gradient recovery, Superconvergence, Polynomial preserving, Adaptive, 65N15, 65N25, 65N30 | Journal | 70 |
Issue | ISSN | Citations |
1 | 1573-7691 | 6 |
PageRank | References | Authors |
0.48 | 18 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| hailong guo | 1 | 19 | 3.49 |
| Z. Zhang | 2 | 240 | 39.29 |
| Ren Zhao | 3 | 48 | 15.88 |