A domain decomposition procedure for parabolic equations is described. In this procedure, the computational domain is divided into nonoverlapping subdomains. The equation is discretized by finite differences in time, and in space, a Galerkin finite element method is used on each subdomain. Subdomain solutions are related by an explicit flux calculation on the interfaces between subdomains. The interface fluxes are calculated in a stable and accurate manner, thus no iterations between the interface and subdomains are required. The method has been implemented on an Intel iPSC/860 Hypercube, and comparisons between domain decomposition solutions and a fully implicit Galerkin solution are presented for a set of test problems
The numerical solution of a parabolic partial differential equation is usually calculated by a times...
Abstract: To solve the heat equation on parallel computers, a high-order finite difference domain de...
156 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.A parallel algorithm for the ...
Two parallel non-overlapping domain decomposition algorithms for solving parabolic partial different...
Several domain decomposition methods for approximating solutions of parabolic problems are given. Th...
Domain decomposition procedures for solving parabolic equations are considered. The underlying discr...
Domain decomposition algorithms for parallel numerical solution of parabolic equations are studied f...
We present three parallel solvers for parabolic equation. The solution methods, which are based on n...
AbstractThis paper deals with an iterative algorithm for domain decomposition applied to solving of ...
AbstractIn this note, we present an improved stability condition of a finite difference domain decom...
AbstractTwo parallel domain decomposition procedures for solving initial-boundary value problems of ...
A three-dimensional, nonsymmetric, domain decomposition algorithm is developed. The algorithm is bas...
Abstract In this paper, a new parallel algorithm for solving parabolic equations is proposed. The ne...
AbstractA dynamic grid modification and domain decomposition method is given and analyzed for parabo...
AbstractExplicit–implicit domain decomposition (EIDD) is a class of globally non-iterative, non-over...
The numerical solution of a parabolic partial differential equation is usually calculated by a times...
Abstract: To solve the heat equation on parallel computers, a high-order finite difference domain de...
156 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.A parallel algorithm for the ...
Two parallel non-overlapping domain decomposition algorithms for solving parabolic partial different...
Several domain decomposition methods for approximating solutions of parabolic problems are given. Th...
Domain decomposition procedures for solving parabolic equations are considered. The underlying discr...
Domain decomposition algorithms for parallel numerical solution of parabolic equations are studied f...
We present three parallel solvers for parabolic equation. The solution methods, which are based on n...
AbstractThis paper deals with an iterative algorithm for domain decomposition applied to solving of ...
AbstractIn this note, we present an improved stability condition of a finite difference domain decom...
AbstractTwo parallel domain decomposition procedures for solving initial-boundary value problems of ...
A three-dimensional, nonsymmetric, domain decomposition algorithm is developed. The algorithm is bas...
Abstract In this paper, a new parallel algorithm for solving parabolic equations is proposed. The ne...
AbstractA dynamic grid modification and domain decomposition method is given and analyzed for parabo...
AbstractExplicit–implicit domain decomposition (EIDD) is a class of globally non-iterative, non-over...
The numerical solution of a parabolic partial differential equation is usually calculated by a times...
Abstract: To solve the heat equation on parallel computers, a high-order finite difference domain de...
156 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.A parallel algorithm for the ...