A Fast Iterative Algorithm for Elliptic Interface Problems

From MaRDI portal





The paper deals with an elliptic interface problem for the elliptic equation \(\nabla(\beta(x,y)\nabla u)= f(x,y)\) in a rectangle. The solution and its normal derivative across the interface may be discontinuous. The author states that the use of a jump condition for \([u_n]\) instead of \([\beta u_n]\) leads to a problem which is much easier to solve via difference approximations on rectangular grids and two-stage iterations for systems with the Schur complement matrix if fast Poisson solvers can be applied. Such solvers need special geometry of interfaces, and the use of them should be specified. The same applies to the use of multigrid methods as inner iterations. Numerical examples are presented but many theoretical questions remain open. It should be noted that certain theoretical results for related problems can be found in the reviewer's works [Optimization in solving elliptic problems, Boca Raton/Florida: CRC Press (1996; Zbl 0852.65087); Vestnik Moscow State Univ., Comp. Math. Cybernetics, 3-9, No. 4 (1998)].




Cited in
(only showing first 100 items - show all)








This page was built for publication: A Fast Iterative Algorithm for Elliptic Interface Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389123)