===firstname:
Stefan
===firstname3:
Mark F.
===affil6:

===lastname3:
Adams
===email:
henneking@gatech.edu
===keyword_other2:

===lastname6:

===affil5:

===lastname4:

===lastname7:

===affil7:

===postal:
100 10th Street NW, Apt 706
Atlanta, GA 30309
===ABSTRACT:
We introduce a modified approach to evanescent data segmental refinement (SR), based on Achi Brandt's work on low-memory multi-level techniques (1977). Evanescent data SR avoids storing the entire finest grid(s) at any time during the computation and thereby drastically reduces the memory complexity of a standard full multigrid (FMG) full approximation scheme solver. Naturally, this feature also provides a way to compress an accurate fine-grid solution to a coarser grid and reproduce the fine-grid solution later. We discuss a simple one-level evanescent data scheme as well as approaches to a multi-level version; both can be applied within a sequential SR solver or as part of a parallel one. We present preliminary experimental results of a model problem for two FMG SR solvers: a vertex-centered finite difference solver and a cell-centered finite volume solver. We discuss the trade-off between storage requirements and computational complexity.
===affil3:
Lawrence Berkeley National Laboratory
===title:
Evanescent data segmental refinement multigrid: ideas and experiments
===affil2:
Georgia Institute of Technology
===lastname2:
Vuduc
===firstname4:

===keyword1:
Iterative solvers/linear algebra on high concurrency node architectures
===workshop:
no
===lastname:
Henneking
===firstname5:

===keyword2:
NOT_SPECIFIED
===otherauths:

===affil4:

===competition:
no
===firstname7:

===firstname6:

===keyword_other1:

===lastname5:

===affilother:

===firstname2:
Richard