期刊文献+

Efficient algorithm for principal eigenpair of discrete p-Laplacian

Efficient algorithm for principal eigenpair of discrete p-Laplacian
原文传递
导出
摘要 This paper is a continuation of the author's previous papers [Front. Math. China, 2016, 11(6): 1379-1418; 2017, 12(5): 1023-1043], where the linear case was studied. A shifted inverse iteration algorithm is introduced, as an acceleration of the inverse iteration which is often used in the non-linear context (the p-Laplacian operators for instance). Even though the algorithm is formally similar to the Rayleigh quotient iteration which is well-known in the linear situation, but they are essentially different. The point is that the standard Rayleigh quotient cannot be used as a shift in the non-linear setup. We have to employ a different quantity which has been obtained only recently. As a surprised gift, the explicit formulas for the algorithm restricted to the linear case (p = 2) is obtained, which improves the author's approximating procedure for the leading eigenvalues in different context, appeared in a group of publications. The paper begins with p-Laplacian, and is closed by the non-linear operators corresponding to the well-known Hardy-type inequalities. This paper is a continuation of the author's previous papers [Front. Math. China, 2016, 11(6): 1379-1418; 2017, 12(5): 1023-1043], where the linear case was studied. A shifted inverse iteration algorithm is introduced, as an acceleration of the inverse iteration which is often used in the non-linear context (the p-Laplacian operators for instance). Even though the algorithm is formally similar to the Rayleigh quotient iteration which is well-known in the linear situation, but they are essentially different. The point is that the standard Rayleigh quotient cannot be used as a shift in the non-linear setup. We have to employ a different quantity which has been obtained only recently. As a surprised gift, the explicit formulas for the algorithm restricted to the linear case (p = 2) is obtained, which improves the author's approximating procedure for the leading eigenvalues in different context, appeared in a group of publications. The paper begins with p-Laplacian, and is closed by the non-linear operators corresponding to the well-known Hardy-type inequalities.
作者 Mu-Fa CHEN
出处 《Frontiers of Mathematics in China》 SCIE CSCD 2018年第3期509-524,共16页 中国高等学校学术文摘·数学(英文)
基金 Acknowledgements The author thanks Yue-Shuang Li's contribution in the earlier stage of looking for the new algorithm, especially a lot of work on computer checking. Thanks are also given to Zhong-Wei Liao for his corrections on the earlier version of the paper. The author acknowledges the referees for their careful comments and corrections. This work was supported in part by the National Natural Science Foundation of China (Grant Nos. 11626245, 11771046), the Project from the Ministry of Education in China, and the Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions.
关键词 Discrete p-Laplacian principal eigenpair shifted inverse iteration approximating procedure Discrete p-Laplacian principal eigenpair shifted inverse iteration approximating procedure
  • 相关文献

参考文献4

二级参考文献7

共引文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部