TY - JOUR

T1 - Conjugate gradient type methods for semilinear elliptic problems with symmetry

AU - Chien, C. S.

AU - Lin, Wen-Wei

AU - Mei, Z.

PY - 1999/1/1

Y1 - 1999/1/1

N2 - We study block conjugate gradient methods in the context of continuation methods for bifurcation problems. By exploiting symmetry in certain semilinear elliptic differential equations, we can decompose the problems into small ones and reduce computational cost. On the other hand, the associated centered difference discretization matrices on the subdomains are nonsymmetric. We symmetrize them by using simple similarity transformations and discuss some basic properties concerning the discretization matrices. These properties allow the discrete pure mode solution paths branching from a multiple bifurcation point [0,λm,n] of the centered difference analogue of the original problem to be represented by the solution path branching from the first simple bifurcation point (0,μ1,1) of the counterpart of the reduced problem. Thus, the structure of a multiple bifurcation is preserved in discretization, while its treatment is reduced to those for simple bifurcation of problems on subdomains. In particular, we can adapt the continuation-Lanczos algorithm proposed in [1] to trace simple solution paths. Sample numerical results are reported.

AB - We study block conjugate gradient methods in the context of continuation methods for bifurcation problems. By exploiting symmetry in certain semilinear elliptic differential equations, we can decompose the problems into small ones and reduce computational cost. On the other hand, the associated centered difference discretization matrices on the subdomains are nonsymmetric. We symmetrize them by using simple similarity transformations and discuss some basic properties concerning the discretization matrices. These properties allow the discrete pure mode solution paths branching from a multiple bifurcation point [0,λm,n] of the centered difference analogue of the original problem to be represented by the solution path branching from the first simple bifurcation point (0,μ1,1) of the counterpart of the reduced problem. Thus, the structure of a multiple bifurcation is preserved in discretization, while its treatment is reduced to those for simple bifurcation of problems on subdomains. In particular, we can adapt the continuation-Lanczos algorithm proposed in [1] to trace simple solution paths. Sample numerical results are reported.

UR - http://www.scopus.com/inward/record.url?scp=0033116441&partnerID=8YFLogxK

U2 - 10.1016/S0898-1221(99)00097-8

DO - 10.1016/S0898-1221(99)00097-8

M3 - Article

AN - SCOPUS:0033116441

VL - 37

SP - 3

EP - 22

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

SN - 0898-1221

IS - 8

ER -