Inverse iteration method for higher eigenvalues of the $p$-Laplacian
By: Vladimir Bobkov, Timur Galimov
Potential Business Impact:
Finds hidden patterns in complex data.
We propose a characterization of a $p$-Laplace higher eigenvalue based on the inverse iteration method with balancing the Rayleigh quotients of the positive and negative parts of solutions to consecutive $p$-Poisson equations. The approach relies on the second eigenvalue's minimax properties, but the actual limiting eigenvalue depends on the choice of initial function. The well-posedness and convergence of the iterative scheme are proved. Moreover, we provide the corresponding numerical computations. As auxiliary results, which also have an independent interest, we provide several properties of certain $p$-Poisson problems.
Similar Papers
Computing the $p$-Laplacian eigenpairs of signed graphs
Numerical Analysis
Solves hard math problems for computer networks.
Adaptive Crouzeix-Raviart finite elements for the first eigenpair of $p$-Laplacian
Numerical Analysis
Finds the best way to solve hard math problems.
Eigen-inference by Marchenko-Pastur inversion
Statistics Theory
Finds hidden patterns in big, messy data.