\documentclass[11pt]{article}
\usepackage[letterpaper, left=1in, top=1in, bottom=1in, right=1in]{geometry}
\usepackage{verbatim}
\setlength{\parindent}{0in}
\pagestyle{empty}
\begin{document}
\vspace{\fill}
\begin{center}\LARGE
\textsc{Numerical Analysis and Scientific Computing}
\par
\textsc{Seminar}
\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textit{Signal Processing Approach To Obtain A Direct Multi-grid Solver}
\end{center}
\vspace{\fill}
\begin{center}\Large
Pablo Navarrete\par
University of Chile, Department of Electrical Engineering
\end{center}
\vspace{\fill}
\textbf{Abstract:} Modifications of the conventional muti-grid algorithm are explored to
avoid the use of smoothing iterations. In the full multi-grid algorithm,
classical smoothing iterations (e.g. Gauss-Seidel) reduce high-frequency
components of the error and a coarse-grid approach reduces the
low-frequency components of the error. The problem here is that two
methods with different structures are being combined, which introduces
additional complexity in the convergence analysis of multi-grid methods.
Then, the idea is to avoid the use of smoothing iterations by using
different inter-grid configurations. In an analogy with perfect
reconstruction filters, a configuration of inter-grid operators is found
such that the approximation error is completely cancelled after one
iteration of the algorithm. The main assumption for this configuration
to work is a particular aliasing pattern in the eigen-vectors of the
linear system. Examples and simulations are presented to evaluate the
performance of the new algorithm.\vspace{\fill}
\begin{center}\Large
Friday, March 20, 2009, 3:00 pm\par
Mathematics and Science Center: W306
\end{center}
\vspace{\fill}
\begin{center}\Large

\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textsc{Mathematics and Computer Science}\par
\textsc{Emory University}
\end{center}
\end{document}