Substructuring domain decomposition scheme for unsteady problems

Computer Science – Numerical Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Domain decomposition methods are used for approximate solving boundary problems for partial differential equations on parallel computing systems. Specific features of unsteady problems are taken into account in the most complete way in iteration-free schemes of domain decomposition. Regionally-additive schemes are based on different classes of splitting schemes. In this paper we highlight a class of domain decomposition schemes which is based on the partition of the initial domain into subdomains with common boundary nodes. Using the partition of unit we have constructed and studied unconditionally stable schemes of domain decomposition based on two-component splitting: the problem within subdomain and the problem at their boundaries. As an example there is considered the Cauchy problem for evolutionary equations of first and second order with non-negative self-adjoint operator in a finite Hilbert space. The theoretical consideration is supplemented with numerical solving a model problem for the two-dimensional parabolic equation.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Substructuring domain decomposition scheme for unsteady problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Substructuring domain decomposition scheme for unsteady problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Substructuring domain decomposition scheme for unsteady problems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-727968

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.