Efficient algorithm for principal eigenpair of discrete \(p\)-Laplacian

DOI10.1007/S11464-018-0697-9zbMath1398.65058OpenAlexW2801443488MaRDI QIDQ1787112

Chen Mu-Fa

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)

Related Items (1)

Approximation theorem for principle eigenvalue of discrete \(p\)-Laplacian

Cites Work

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

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