TY - JOUR
T1 - Preconditioned Hybrid Conjugate Gradient Algorithm for P-Laplacian
AU - Zhou , G.
AU - Huang , Y.
AU - Feng , C.
JO - International Journal of Numerical Analysis and Modeling
VL - 0
SP - 123
EP - 130
PY - 2005
DA - 2005/11
SN - 2
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/ijnam/952.html
KW - 
AB - <p style="text-align: justify;">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.</p>