scientific article; zbMATH DE number 1534435

From MaRDI portal
Publication:4517232





The authors develop and generalize, to the three-dimensional case, the results by \textit{V.~V.~Shajdurov} [Multigrid methods for finite elements (Russian), Nauka, Moscow (1989; Zbl 0682.65065)] on constructing the so-called domain decomposition. The aim is, first, to translate the results to the case of a three-dimensional bounded domain with smooth curvilinear boundary and, then, to prove asymptotic stability of the triangulation algorithm. The algorithm starts with a given coarse triangulation. The subsequent triangulations are recurrently constructed using the tetrahedral refinement of the previous level into eight parts with correction of the location vertices near the original boundary to approximate this boundary. To evaluate the quality of the triangulation constructed, the authors expose a quantitative criterion and prove that a successful (in the sense of this criterion) initial triangulation guarantees a good quality of the subsequent finer triangulations under an arbitrary number of recurrent implementations of the tetrahedral refinement.











This page was built for publication:

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