Efficient algorithm for principal eigenpair of discrete p-Laplacian

DOI10.1007/S11464-018-0697-9MaRDI QIDQ1787112zbMATH OpenOpenAlexFDO

Authors Mu-Fa Chen

Publication date 4 October 2018

Published in Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11464-018-0697-9

zbMATH Keywords

discrete \(p\)-Laplacianapproximating procedureshifted inverse iterationprincipal eigenpair

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Discrete version of topics in analysis (39A12)

Recommendations

• Numerical Methods for Computing Nonlinear Eigenpairs: Part I. Iso-Homogeneous Cases
• Computing the first eigenpair of the \(p\)-Laplacian via inverse iteration of sublinear supersolutions
• Convergence of inverse power method for first eigenvalue of \(p\)-Laplace operator
• Approximation theorem for principle eigenvalue of discrete \(p\)-Laplacian
• Computing the first eigenvalue of the \(p\)-Laplacian via the inverse power method

Cites work

• Computing the first eigenvalue of the \(p\)-Laplacian via the inverse power method
• Discrete weighted Hardy inequalities with different kinds of boundary conditions
• Efficient initials for computing maximal eigenpair
• Global algorithms for maximal eigenpair
• Mixed eigenvalues of discrete \(p\)-Laplacian
• Speed of stability for birth-death processes
• The optimal constant in Hardy-type inequalities

Cited in

(4)

• Approximation theorem for principle eigenvalue of discrete \(p\)-Laplacian
• Efficient $\widetilde{O}(n/\epsilon)$ Spectral Sketches for the Laplacian and its Pseudoinverse
• Fast Estimation of Principal Eigenspace Using Lanczos Algorithm
• The first mixed eigenvalues of \(p\)-Laplacian on trees

This page was built for publication: Efficient algorithm for principal eigenpair of discrete \(p\)-Laplacian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1787112)