A domain partitioning algorithm without subdomain overlap for solving parabolic equations
type: Item
instance of: scholarly article
title: A domain partitioning algorithm without subdomain overlap for solving parabolic equations
zbMATH Open document ID: 0791.65073
published in: Computational Mathematics and Mathematical Physics
publication date: 1994-03-03T00:00:00Z
review text: A non-iterative domain partitioning algorithm in which subdomains do not overlap is considered for solving multi-dimensional parabolic problems. The algorithm is similar in structure to the method of alternating directions. Error estimates are obtained for the approximate solution in the case of the Dirichlet and Neumann problems.
Mathematics Subject Classification ID: 65M55
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65M15
Mathematics Subject Classification ID: 35K15
zbMATH DE Number: 486838
zbMATH Keywords: error estimates
zbMATH Keywords: Dirichlet problems
zbMATH Keywords: non-iterative domain partitioning algorithm
zbMATH Keywords: parabolic problems
zbMATH Keywords: method of alternating directions
zbMATH Keywords: Neumann problems
author: Y. M. Laevsky
reviewed by: Zongyi Hou
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 486838