A fractional splitting algorithm for non-overlapping domain decomposition

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we study the con vergence of the non overlapping domain decomposition for solving large linear system arising from semi discretization of two dimensionalinitial value problem with homogeneous boundary conditions, and solved by implicit time stepping using first and, two alternatives of second order FS-methods. The interface values along the artificial boundary condition line are found using explicit forward Euler's method for the first order FS-method, and for the second order FS-method to use extrapolation procedure for each spatial variable individually. The solution by the non overlapping domain decomposition with FS-method is applicable to problems that requires the solution on non uniform meshes for each spatial variables which w ill unable us to use different time stepping over different sub domains, and with the possibility of extension to three dimensional problem. © 2002 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Daoud, D. S., & Subasi, D. S. (2002). A fractional splitting algorithm for non-overlapping domain decomposition. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2329, 324–334. https://doi.org/10.1007/3-540-46043-8_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free