Preconditioned Hybrid Conjugate Gradient Algorithm for P-Laplacian

Preconditioned Hybrid Conjugate Gradient Algorithm for P-Laplacian

Year:    2005

Author:    G. Zhou, Y. Huang, C. Feng

International Journal of Numerical Analysis and Modeling, Vol. 2 (2005), Online First : pp. 123–130

Abstract

In this paper, a hybrid conjugate gradient algorithm with weighted preconditioner is proposed. The algorithm can efficiently solve the minimizing problem of general function deriving from finite element discretization of the p-Laplacian. The algorithm is efficient, and its convergence rate is mesh-independent. Numerical experiments show that the hybrid conjugate gradient direction of the algorithm is superior to the steepest descent one when $p$ is large.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/2005-IJNAM-952

International Journal of Numerical Analysis and Modeling, Vol. 2 (2005), Online First : pp. 123–130

Published online:    2005-01

AMS Subject Headings:    Global Science Press

Copyright:    COPYRIGHT: © Global Science Press

Pages:    8

Keywords:   

Author Details

G. Zhou

Y. Huang

C. Feng