Efficient algorithm for principal eigenpair of discrete p-Laplacian
Front. Math. China. 2018, 13 (3): 509-524.
Related Articles |
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.