Approximation theorem for principle eigenvalue of discrete <i>p</i>-Laplacian

doi:10.1007/s11464-018-0717-9

Front. Math. China

2018, Vol. 13

Issue (5) : 1045-1061 https://doi.org/10.1007/s11464-018-0717-9

RESEARCH ARTICLE

Approximation theorem for principle eigenvalue of discrete p-Laplacian

Yueshuang LI(

)

School of Mathematical Sciences, Beijing Normal University, Beijing 100875, China

Download: PDF(293 KB)
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks

Abstract

For the principle eigenvalue of discrete weighted p-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the monotonicity of an approximation sequence is also checked. To illustrate these results, some examples are presented.

Keywords Principle eigenvalue weighted p-Laplacian inverse iteration approximation theorem

Corresponding Author(s): Yueshuang LI

Issue Date: 29 October 2018

Cite this article:

Yueshuang LI. Approximation theorem for principle eigenvalue of discrete p-Laplacian[J]. Front. Math. China, 2018, 13(5): 1045-1061.

URL:

https://academic.hep.com.cn/fmc/EN/10.1007/s11464-018-0717-9
https://academic.hep.com.cn/fmc/EN/Y2018/V13/I5/1045

1	Biezuner R J, Ercole G, Martins E M. Computing the first eigenvalue of the p-Laplacian via the inverse power method. J Funct Anal, 2009, 257: 243–270 https://doi.org/10.1016/j.jfa.2009.01.023
2	Chen M F. Variational formulas and approximation theorems for the first eigenvalue in dimension one. Sci China Ser A, 2001, 44(4): 409–418 https://doi.org/10.1007/BF02881877
3	Chen M F. Speed of stability for birth–death processes. Front Math China, 2010, 5(3): 379–515 https://doi.org/10.1007/s11464-010-0068-7
4	Chen M F. Efficient initials for computing the maximal eigenpair. Front Math China, 2016, 11(6): 1379–1418. A package based on the paper is available onA MatLab package see Chen’s homepage https://doi.org/10.1007/s11464-016-0573-4
5	Chen M F. Efficient algorithm for principal eigenpair of discrete p-Laplacian. Front Math China, 2018, 13(3): 509–524 https://doi.org/10.1007/s11464-018-0697-9
6	Chen M F, Wang L D, Zhang Y H. Mixed eigenvalues of discrete p-Laplacian. Front Math China, 2014, 9(6): 1261–1292 https://doi.org/10.1007/s11464-014-0374-6
7	Ercole G. An inverse iteration method for obtaining q-eigenpairs of the p-Laplacian in a general bounded domain. arXiv: 1510.03941
8	Hein M, Bühler T. An inverse power method for nonlinear eigenproblems with applications in 1-spectral clustering and sparse PCA. Advances in Neural Information Processing Systems, 2010, 23: 847–855
9	Hynd R, Lindgren E. Inverse iteration for p-ground states. Proc Amer Math Soc, 2016, 144(5): 2121–2131 https://doi.org/10.1090/proc/12860
10	Li Y S. The inverse iteration method for discrete weighted p-Laplacian. MS Thesis, Beijing Normal University, 2017 (in Chinese)

[1]	Mu-Fa CHEN, Yue-Shuang LI. Improved global algorithms for maximal eigenpair[J]. Front. Math. China, 2019, 14(6): 1077-1116.
[2]	Mu-Fa CHEN. Efficient algorithm for principal eigenpair of discrete p-Laplacian[J]. Front. Math. China, 2018, 13(3): 509-524.
[3]	Mu-Fa CHEN. Global algorithms for maximal eigenpair[J]. Front. Math. China, 2017, 12(5): 1023-1043.

Viewed

Full text

Abstract

Cited

Shared

Discussed