Parallel algorithms and domain decomposition techniques for solving three-dimensional boundary value problems on quasi-structured grids
Tóm tắt
A new approach to the decomposition of a three-dimensional computational domain into subdomains matched without overlapping is proposed. It is based on direct approximation of the Poincare–Steklov equation at the interface. Parallel algorithms and techniques for solving threedimensional boundary value problems on quasi-structured grids are presented. Experimental evaluation of parallel efficiency is done by solving a model problem with quasi-structured parallelepipedal matching and non-matching grids as an example.
Tài liệu tham khảo
Agoshkov, V. and Ovtchinnikov, E., Projection Decomposition Method, Math.Mod. Met. Appl. Sci., 1994, vol. 4, pp. 773–794.
Gervasio, P., Ovtchinnikov, E., and Quarteroni, A., The Spectral Projection DecompositionMethod for Elliptic Equations in Two Dimensions, SIAM J. Numer. An., 1997, vol. 34, no. 4, pp. 1616–1639.
Sveshnikov, V.M., Construction of Direct and Iterative Decomposition Methods, Sib. Zh. Vych. Mat., 2009, vol. 12, no. 3, pp. 99–109.
Sveshnikov, V.M. and Belyaev, D.O., Construction of Quasi-Structured Locally Modified Grids to Solve Problems of High-Current Electronics, Vestnik YuUrGU, Ser. MMP, 2012, no. 40(299), iss. 14, pp. 130–140.
Sveshnikov, V.M. and Rybdylov, B.D., Parallel Solving of Boundary Value Problems on Quasi-Structured Grids, Vestnik YuUrGU, Ser. VMI, 2013, vol. 2, no. 3, pp. 63–72.
Il’in, V.P., Metody konechnykh raznostei i konechnykh ob″emov dlya ellipticheskikh uravnenii (Finite Difference and Finite Volume Methods for Elliptic Equations), Novosibirsk: Publ. House of ICM&MG SB RAS, 2001.