Preconditioned Descent Algorithms for p-Laplacian

13 years 4 months ago

Download dsec.pku.edu.cn

In this paper, we examine some computational issues on ﬁnite element discretization of the p-Laplacian. We introduced a class of descent methods with multi-grid ﬁnite 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 p. Our numerical tests show that these algorithms are able to solve large scale p-Laplacian with very large p. The algorithms are then used to solve a variational inequality. Subject Classiﬁcation: 49J20, 65N30.

Y. Q. Huang, Ruo Li, Wenbin Liu

Real-time Traffic