\documentclass{report}
\usepackage{amsmath,amssymb}
\setlength{\parindent}{0mm}
\setlength{\parskip}{1em}
\begin{document}
\begin{center}
\rule{6in}{1pt} \
{\large C. G. Baker \\
{\bf Low-Rank Incremental Methods for Computing Dominant Singular Subspaces.
}}

Florida State University \\ 
{\tt cgbaker@gmail.com}\\
K. A. Gallivan \\ %% Florida State University, gallivan@scs.fsu.edu
P. Van Dooren %% Université catholique de Louvain, paul.vandooren@uclouvain.be 
\end{center}

This paper describes a generic low-rank incremental method for computing the dominant singular
triplets of a matrix via a single pass through the matrix. This work unifies several efforts previously
described in the literature. We tie the operation of the proposed method to a particular optimization-
based eigensolver. This allows the description of mechanisms for exploiting multiple passes through the
matrix. We conclude with some numerical experiments and a discussion on possible applications of the
method. 
\end{document}
