Huang, Y.Q., Li, Ruo, Liu, Wenbin (2007) Preconditioned descent algorithms for p-Laplacian. Journal of Scientific Computing, 32 (2). pp. 343-371. ISSN 0885-7474. (doi:10.1007/s10915-007-9134-z) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:2059)
| The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
| Official URL: http://dx.doi.org/10.1007/s10915-007-9134-z |
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 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.
| Item Type: | Article |
|---|---|
| DOI/Identification number: | 10.1007/s10915-007-9134-z |
| Uncontrolled keywords: | highly degenerate p-Laplacian; finite element approximation; preconditioned steepest descent algorithms; variational inequalities |
| Subjects: | H Social Sciences > HA Statistics > HA33 Management Science |
| Divisions: | Divisions > Kent Business School - Division > Department of Marketing, Entrepreneurship and International Business |
| Depositing User: | Stephen Holland |
| Date Deposited: | 19 Dec 2007 19:25 UTC |
| Last Modified: | 05 Nov 2024 09:32 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/2059 (The current URI for this page, for reference purposes) |
University of Kent Author Information
Liu, Wenbin.
| Creator's ORCID: |
 https://orcid.org/0000-0001-5966-6235
|
|---|---|
| CReDIT Contributor Roles: |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
