As a fundamental problem in image processing, image deblurring has still attracted a lot of research attention. Due to the large computational cost, especially for high-resolution images, it becomes challenging to solve the deblurring minimization problem and the underlying partial differential equations. The domain decomposition method (DD), as one of themost efficient algorithms for solving l...

Pallalel GPGPU computing for lattice QCD simulations has a bottleneck on the GPU to GPU data communication due to the lack of the direct data exchanging facility. In this work we investigate the performance of quark solver using the restricted additive Schwarz (RAS) preconditioner on a low cost GPU cluster. We expect that the RAS preconditioner with appropriate domaindecomposition and task dist...

This paper describes the parallel finite element analysis of large scale problem for a nonsteady heat conductive problem using domain decomposition method. In order to solve the issue of scalability of a domain decomposition method, the developed system employs the balancing domain decomposition method and hierarchical data management technique among the parallel processors. The present system ...

Diffuse optical tomography is modelled as an optimization problem to find the absorption and scattering coefficients that minimize the error between the measured photon density function and the approximated one computed using the coefficients. The problem is composed of two steps: the forward solver to compute the photon density function and its Jacobian (with respect to the coefficients), and ...

Domain decomposition methods are widely used to solve the parabolic partial differential equations with Dirichlet, Neumann, or mixed boundary conditions. Modified implicit prediction (MIP) algorithm is unconditionally stable domain decomposition method. In this paper, the SOR iterative technique is applied to the MIP algorithm and the optimum over-relaxation parameter is provided.

In this paper we present a hybrid domain decomposition approach for the parallel solution of linear systems arising from a discontinuous Galerkin (DG) finite element approximation of initial boundary value problems. This approach allows a general decomposition of the space–time cylinder into finite elements, and is therefore applicable for adaptive refinements in space and time. 1 A Space–Time ...

A mesoscopic/macroscopic model for self-consistent charged transport under high field scaling conditions corresponding to drift-collisions balance was derived by Cercignani, Gamba, and Levermore in [4]. The model was summarized in relationship to semiconductors in [2]. In [3], a conceptual domain decomposition method was implemented, based upon use of the drift-diffusion model in highly-doped r...

results for error analysis of finite element method We consider the following four problems: 1: (E)w: Find u ∈ V such that a(u, v) = (f, v) for all v ∈ V . 2: (Eh)w: Find uh ∈ Vh such that a(uh, vh) = (f, vh) for all vh ∈ Vh. 3: (E)w: Find u ∈ V such that a (u , v) = (f, v) for all v ∈ V . DDM APPLIED TO RADIATION PROBLEMS 389 4: (Eh )w: Find u N h ∈ Vh such that a (uh , vh) = (f, vh) for all v...

The balancing domain decomposition method for mixed finite elements by Cowsar, Mandel, and Wheeler is extended to the case of mortar mixed finite elements on non-matching multiblock grids. The algorithm involves an iterative solution of a mortar interface problem with one local Dirichlet solve and one local Neumann solve per subdomain on each iteration. A coarse solve is used to guarantee that ...