نتایج جستجو برای: domain decomposition method
تعداد نتایج: 2040363 فیلتر نتایج به سال:
Submitted to the proceedings of the ninth international conference on domain decomposition methods (Bergen-Norway-1996).
In this paper we give a convergence analysis of a two-level additive Schwarz method in which the coarse mesh basis is constructed with aggregation, a method common in algebraic multigrid. This coarse mesh does not need geometric information about the subdomains and can readily be used on unstructured spatial meshes. We illustrate the performance with several computational examples.
reduced differental transform method (rdtm), which isone of the useful and effective numerical method, is applied to solve nonlinear time-dependent foam drainage equation (fde) with different initial conditions. we compare our method with the famous adomian decomposition and laplace decomposition methods. the obtained resultsdemonstrated that rdtm is a powerful tool for solving nonlinear par...
The non-overlapping domain decomposition method is an efficient approach for solving time harmonic scattering wave problems. It is used here to reduce large size systems solution to that of several systems of small size and to construct efficient procedures to couple finite element and boundary element methods. The lack of a satisfactory treatment of the so-called cross-points, nodes being shar...
A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coefficients in 2-D is considered. For this discretization, balancing domain decomposition with constraints (BDDC) algorithms are designed and analyzed as an additive Schwarz method (ASM). The coarse and local problems are defined using special partitions of unity and edge co...
among different discretization approaches, finite difference method (fdm) is widely used for acoustic and elastic full-wave form modeling. an inevitable deficit of the technique, however, is its sever requirement to computational resources. a promising solution is parallelization, where the problem is broken into several segments, and the calculations are distributed over different processors. ...
In this paper we introduce the notion of classical quasi-primary submodules that generalizes the concept of classical primary submodules. Then, we investigate decomposition and minimal decomposition into classical quasi-primary submodules. In particular, existence and uniqueness of classical quasi-primary decompositions in finitely generated modules over Noetherian rings are proved. More...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید