Author： Huang Y. Li Ruo Liu Wenbin
Publisher： Springer Publishing Company
ISSN： 0885-7474
Source： Journal of Scientific Computing, Vol.32, Iss.2, 2007-08, pp. : 343-371
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In this paper, we examine some computational issues on finite element discretization of the p-Laplacian. We introduced a class of descent methods with multi-grid finite element preconditioners, and carried out convergence analysis. We showed that their convergence rate is mesh-independent. We studied the behavior of the algorithms with large
Related content
Access to resources
Recommend
The Robustness of the p -Norm Algorithms
Machine Learning, Vol. 53, Iss. 3, 2003-01 ,pp. :
HEURISTIC ALGORITHMS FOR SURVIVABLE P2P MULTICASTING
Applied Artificial Intelligence, Vol. 27, Iss. 4, 2013-04 ,pp. :