Abstract | ||
---|---|---|
We describe a domain decomposition algorithm for use in the parallel adaptive meshing paradigm of Bank and Holst SIAM J. Sci. Comput., 22 (2000), pp. 1411--1443; SIAM Rev., 45 (2003), pp. 291--323]. Our algorithm has low communication, makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. Numerical examples illustrate the effectiveness of the procedure. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1137/S1064827503428096 | SIAM J. Scientific Computing |
Keywords | Field | DocType |
domain decomposition | Computer science,Parallel computing,Solver,Domain decomposition methods | Journal |
Volume | Issue | ISSN |
26 | 1 | 1064-8275 |
Citations | PageRank | References |
7 | 0.83 | 15 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Randolph E. Bank | 1 | 238 | 27.87 |
Shaoying Lu | 2 | 8 | 1.23 |