Efficient algorithm for principal eigenpair of discrete \(p\)-Laplacian
type: Item
instance of: scholarly article
title: Efficient algorithm for principal eigenpair of discrete \(p\)-Laplacian
zbMATH Open document ID: 1398.65058
published in: Frontiers of Mathematics in China
publication date: 2018-10-04T00:00:00Z
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 39A12
zbMATH DE Number: 6947212
zbMATH Keywords: discrete \(p\)-Laplacian
zbMATH Keywords: principal eigenpair
zbMATH Keywords: shifted inverse iteration
zbMATH Keywords: approximating procedure
author: Mu-Fa Chen
MaRDI profile type: Publication
full work available at URL: s11464-018-0697-9
OpenAlex ID: W2801443488
cites work: Computing the first eigenvalue of the \(p\)-Laplacian via the inverse power method
cites work: Speed of stability for birth-death processes
cites work: The optimal constant in Hardy-type inequalities
cites work: Efficient initials for computing maximal eigenpair
cites work: Global algorithms for maximal eigenpair
cites work: Mixed eigenvalues of discrete \(p\)-Laplacian
cites work: Discrete weighted Hardy inequalities with different kinds of boundary conditions
DOI: 10.1007/S11464-018-0697-9
description: scientific article; zbMATH DE number 6947212