Q. Dinh, R. Glowinski, and J. P' eriaux, Solving elliptic problems by domain decomposition methods with applications., Elliptic Problem Solvers II, Academic Press, (1982).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....rate is related to the size of overlap of the subdomains. This can be easily seen by either maximum principle or variational interpretation. see [20] 13] 14] Recently many new variants of classical SAM have been proposed for domain decomposition method with or without overlap. see [3], 1] 4] 16] Our paper is motivated by the new modified SAM method, proposed by P.L.Lions ( 15] in which there are exchanges of a convex combination of Neumann and Dirichlet data at the artificial boundaries. Convergence was proved in a very general setting with no overlap. The 2 proof is ....

Q. Dinh, R. Glowinski, and J. P' eriaux, Solving elliptic problems by domain decomposition methods with applications., Elliptic Problem Solvers II, Academic Press, (1982).

....compared to some more classical ones. 1 Introduction Distributed memory parallel computing provides access to extremely large amounts of CPU and memory resources. Thus, in the recent years, applying domain decomposition techniques has allowed to handle nite element analysis of large 3D problems [2, 4, 9, 12]. But such analyses require the generation and handling of large irregular data structures the nite element meshes prior to the parallel computation. Classically, nite element meshes are generated sequentially then split a posteriori. Frequently, when dealing with large 3D problems, the mesh ....

Q. Dinh, R. Glowinski, and J. P#riaux. Solving elliptic problems by domain decomposition methods with applications. In G. Birkhooe and A. Schoenstadt, editors, Elliptic Problem Solvers II, pages 395426. Academic Press, New York, 1984.

....balancing preconditioner T given by (6.25) satisfies #(T b S) # log 2 h 0 h . Additional bibliography remarks. The methods studied in this section, often known as Neumann Neumann type algorithms, can be traced back to the work by Dinh, 896 JINCHAO XU AND JUN ZOU Glowinski, and Periaux [33] and Glowinski and Wheeler [46] Thereafter there are a few extensions in the theory and algorithms. We refer to Bourgat et al. 7] Roeck and Le Tallec [67] Le Tallec, Roeck, and Vidrascu [76] Mandel and Brezina [58, 59] and Dryja and Widlund [40] For extension of the approach for mixed ....

Q. Dinh, R. Glowinski, and J. P eriaux, Solving elliptic problems by domain decomposition methods with applications, in Elliptic Problem Solvers II, G. Birkho# and A. Schoenstadt, eds., Academic Press, New York, 1984, pp. 395--426.

....algorithms available allows the user to switch between them when one of them gets entrapped in a local extremum. Optimized mesh partitions have usually smooth interfaces and therefore are suitable for variational domain decomposition methods that are popular in both computational fluid dynamics [13] and solid mechanics [14] problems. 5. Real time evaluators As we have said earlier, defining what exactly constitutes an efficient partition is both problem and machine dependent. Therefore, only the analyst interested in running a specific application using a well defined computational ....

Q. V. Dihn, R. Glowinski and J. Periaux, Solving elliptic problems by domain decomposition methods with applications, in: A. Schoenstadt, ed., Elliptic Problem Solvers II, Academic Press, (1984).

....= 2) of Omega i . Then the balancing preconditioner T given by (6.25) satisfies (T b S) log 2 h 0 h : Additional bibliography remarks. The methods studied in this section, often known as Neumann Neumann type of algorithms, can be traced back to the work by Dinh, Glowinski, and P eriaux [28] and Glowinski, Wheeler[41] Thereafter there are a few extensions in the theory and algorithms. We refer to Bourgat, Glowinski, Le Tallec, and Vidrascu[5] Roeck, Le Tallec [58] Le Tallec, Roeck, and Vidrascu [67] Mandel [51, 52] and Dryja and Widlund [35] For extension of the approach for ....

Q. Dinh, R. Glowinski, and J. P'eriaux. Solving elliptic problems by domain decomposition methods with applications. In G. Birkhoff and A. Schoenstadt, editors, Elliptic Problem Solvers II, pages 395--426, New York, 1984. Academic Press.

....(H 1=2 00 ( Gamma) 0 . This problem has a unique solution [19] which is the solution of the problem (Q 1 Q 2 ) R 2 f 2 Gamma R 1 f 1 This is the equation (2. 6) It shows that solving the Lagrange multiplier formulation is equivalent to finding Neumann interface data on Gamma (cf. [18]) The paper [19] uses the Lagrange formulation to introduce finite element spaces of Lagrangians of small dimension per interface for regular meshes. This can reduce the size of the problem substantially, but it is restricted to regular meshes. The space of Lagrangians can be chosen as the ....

Q. V. Dinh, R. Glowinski, and J. P'eriaux. Solving elliptic problems by domain decomposition methods with applications. In G. Birkhoff and A. Schoenstadt, editors, Elliptic Problem Solvers II. Academic Press, 1984.

....Angeles, CA 900951555, engquist math.ucla.edu y Department of Mathematics, University of California at Los Angeles, Los Angeles, CA 900951555, hzhao math.ucla.edu Recently many new variants of classical SAM have been proposed for domain decomposition method with or without overlap. see [5], 1] 6] 13] Our paper is motivated by the new modified SAM method, proposed by P.L.Lions ( 12] which exchanges a convex combination of Neumann and Dirichlet data at the artificial boundary. It has been proved to be convergent in very general setting even with no overlap. The proof is based on ....

Q. Dinh, R. Glowinski, and J. P' eriaux, Solving elliptic problems by domain decomposition methods with applications., Elliptic Problem Solvers II, Academic Press, (1982).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC