A domain decomposition algorithm for solving large elliptic problems
Description:
AN algorithm which efficiently solves large systems of equations arising from the discretization of a single second-order elliptic partial differential equation is discussed. The global domain is partitioned into not necessarily disjoint subdomains which are traversed using the Schwarz Alternating Procedure. On each subdomain the multigrid method is used to advance the solution. The algorithm has the potential to decrease solution time when data is stored across multiple levels of a memory hier…
more
Date:
January 1, 1991
Creator:
Nolan, M.P.
Item Type:
Refine your search to only
Report
Partner:
UNT Libraries Government Documents Department