@Article{IJNAM-2-,
author = {Zhou, G. and Y., Huang and Feng, C.},
title = {Preconditioned Hybrid Conjugate Gradient Algorithm for P-Laplacian},
journal = {International Journal of Numerical Analysis and Modeling},
year = {2005},
volume = {2},
number = {},
pages = {123--130},
abstract = {<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>},
issn = {2617-8710},
doi = {https://doi.org/2005-IJNAM-952},
url = {https://global-sci.com/article/83878/preconditioned-hybrid-conjugate-gradient-algorithm-for-p-laplacian}
}