Search

A nonoverlapping domain decomposition technique applied to a finite difference method is presented for the numerical solution of the forward backward heat equation in the case of one-dimension. While the previous at tempts in dealing with this problem have been based on an iterative domain decomposition scheme, the current work avoids iterations. Also a physical matching condition is suggested to avoid difficulties caused by the interface boundary nodes. Furthermore, we obtain a square system of equations. In addition, the convergence and stability of the proposed method are investi gated. Some numerical experiments are given to show the effectiveness of the proposed method.

In this paper, a bioheat model of temperature distribution in the human eye is studied, the mathematical formulation of this model is described using adequate mathematical tools. The existence and the uniqueness of the solution of this problem is proven and four algorithms based on finite element method approximation and domain decomposition methods are presented in details. The validation of all algorithm is done using a numerical application for an example where the analytical solution is known. The properties and parameters reported in the open literature for the human eye are used to approximate numerically the temperature for bioheat model by finite element approximation and nonoverlapping domain decomposition method. The obtained results that are verified using the experimental results recorded in the literature revealed a better accuracy by the use of algorithm proposed. [ABSTRACT FROM AUTHOR]

We consider optimal control problems for gas flow in pipeline networks. The equations of motion are taken to be represented by a first-order system of hyperbolic semilinear equations derived from the fully nonlinear isothermal Euler gas equations. We formulate an optimal control problem on a network and introduce a tailored time discretization thereof. In order to further reduce the complexity, we consider an instantaneous control strategy. The main part of the paper is concerned with a nonoverlapping domain decomposition of the optimal control problem on the graph into local problems on smaller sub-graphs--ultimately on single edges. We prove convergence of the domain decomposition method on networks and study the wellposedness of the corresponding time-discrete optimal control problems. The point of the paper is that we establish virtual control problems on the decomposed subgraphs such that the corresponding optimality systems are in fact equal to the systems obtained via the domain decomposition of the entire optimality system. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we demonstrate a local convergence of an adaptive scalar solver which is practical for strongly diagonal dominant Jacobian problems such as in some systems of nonlinear equations arising from the application of a nonoverlapping domain decomposition method. The method is tested to a nonlinear interface problem of a multichip heat conduction problem. The numerical results show that the method performs slightly better than a Newton–Krylov method. [Copyright &y& Elsevier]

In recent years, a nonoverlapping Robin-type domain decomposition method (DDM) for the finite element discretization systems of the second order elliptic equations, which is based on using Robin-type boundary conditions as information transmission conditions on the subdomain interfaces, has been developed and analyzed since it was first proposed by P. L. Lions in [On the Schwarz alternating method III: A variant for nonoverlapping subdomains, in Proceedings of the 3rd International Symposium on Domain Decomposition Methods for Partial Differential Equations, SIAM, Philadelphia, PA, 1990, pp. 202-223]. However, the convergence rate of this DDM with many subdomains remains open when the lower term of equations vanishes. This open problem will be considered in this paper. The convergence rate is almost 1 — O(h¹/²H-1/²) in certain cases—for example, the case of a small number of subdomains, where h is the mesh size and H is the size of subdomain. In order to get the desirous convergence results, two mathematics skills are introduced in this paper; one is complexification of real linear space and the other is the spectral radius formula. [ABSTRACT FROM AUTHOR]

A class of corrected explicit-implicit domain decomposition (CEIDD) methods is investigated for the parallel approximation of linear heat equations. Explicit-implicit domain decomposition (EIDD) methods are computationally and communicationally efficient for each time step but always suffer from small time step size restrictions. By adding an interface correction step to Kuznetsov's EIDD, the one-dimensional CEIDD procedure achieves unconditional stability without discarding the time-stepwise efficiency of the EIDD method. In order to maintain the virtues of the CEIDD method and improve the flexibility in domain partitioning, for solving multidimensional problems, special zigzag-shaped interfaces are suggested in the CEIDD method. Based on non-crossover and crossover types of zigzag interfaces, the resulting CEIDD-ZI algorithms are studied for two strategies of subdomain partition. By the energy method, it shows that the proposed algorithms, including their degenerate cases—the corrected explicit hopscotch schemes-are convergent in the discrete H¹ seminorm and L² norm. Numerical experiments confirm the results in our analysis. [ABSTRACT FROM AUTHOR]

This paper deals with discrete monotone iterative algorithms for solving a nonlinear singularly perturbed reaction–diffusion problem. Firstly, the monotone method (known as the method of lower and upper solutions) is applied to computing a nonlinear difference scheme obtained after discretisation of the continuous problem. Secondly, a monotone domain decomposition algorithm based on a modification of the Schwarz alternating method is constructed. This monotone algorithm solves only linear discrete systems at each iterative step of the iterative process. The rate of convergence of the monotone Schwarz method is estimated. Numerical experiments are presented. [Copyright &y& Elsevier]

In this paper, we propose a nonoverlapping domain decomposition method for solving the three-dimensional Maxwell equations, based on the edge element discretization. For the Schur complement system on the interface, we construct an efficient preconditioner by introducing two special coarse subspaces defined on the nonoverlapping sub domains. It is shown that the condition number of the preconditioned system grows only polylogarithmically with the ratio between the subdomain diameter and the finite element mesh size but possibly depends on the jumps of the coefficients. [ABSTRACT FROM AUTHOR]

A nonoverlapping domain decomposition approach is used on uniform and matching grids to first define and then to compute the orthogonal spline collocation solution of the Dirichlet boundary value problem for Poisson's equation on an L-shaped region. We prove existence and uniqueness of the collocation solution and derive optimal order Hs-norm error bounds for s = 0, 1, 2. The collocation solution on two interfaces is computed using the preconditioned conjugate gradient method, and the collocation solution on three squares is computed by a matrix decomposition method that uses fast Fourier transforms. The total cost of the algorithm is O(N² log N), where the number of unknowns in the collocation solution is O(N²). [ABSTRACT FROM AUTHOR]