===firstname:
Ben, S.
===firstname3:

===affil6:

===lastname3:

===email:
ben.southworth@colorado.edu
===keyword_other2:
Smoothed aggregation
===lastname6:

===affil5:

===lastname4:

===lastname7:

===affil7:

===postal:
2805 Olson Dr. 
Boulder, CO 80303
===ABSTRACT:
Currently, interpolation operators, P, in root-node smoothed aggregation are formed through an energy minimization process over the columns of P. Constraining P to exactly interpolate known near null-space candidate(s) is a row-wise constraint, which together leads to an expensive, global minimization process. In this talk, a new method to form P is proposed by minimizing the L^2 error in interpolation. When combined with near null-space constraints, the result is a local minimization process for each row of P.  A theoretical framework and two-level results are discussed, motivating the next steps in achieving convergence rates of current root-node at a much lower cost. 
===affil3:

===title:
A new look at interpolation in root-node smoothed aggregation
===affil2:
University of Colorado at Boulder
===lastname2:
Manteuffel
===firstname4:

===keyword1:
Optimization of Complex Problems/Systems (PDE-constrained optimization, optimization under uncertainty, and simulation-based optimization)>Optimization of Complex Problems/Systems
===workshop:
no
===lastname:
Southworth
===firstname5:

===keyword2:
NOT_SPECIFIED
===otherauths:

===affil4:

===competition:
no
===firstname7:

===firstname6:

===keyword_other1:
Multigrid methods
===lastname5:

===affilother:

===firstname2:
Tom