doc/manual/manual.aux

\relax
\@writefile{toc}{\contentsline {section}{Abstract}{1}}
\citation{MPI:book}
\citation{MPI:standard}
\citation{jp:pcolor}
\citation{jp:super}
\citation{jp:bell_prize}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{2}}
\newlabel{sec:intro}{{1}{2}}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Effective use of total memory by \BS }}{2}}
\newlabel{tab:mem}{{1}{2}}
\citation{jp:super}
\citation{jp:olaf}
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces Efficient use of different processor architectures by \BS }}{3}}
\newlabel{tab:perf}{{2}{3}}
\citation{petsc}
\citation{template}
\citation{chaco2}
\@writefile{toc}{\contentsline {section}{\numberline {2}Algorithm Descriptions}{4}}
\newlabel{sec:algorithms}{{2}{4}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Processor Performance}{4}}
\citation{jp:pcolor}
\citation{jp:scalable}
\citation{jp:bell_prize}
\citation{jp:copper}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Multicolor Ordering}{5}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces A subgraph generated by a two-dimensional, bilinear finite-element model with three degrees of freedom per discretization point. The geometric partition shown by the dotted lines yields an assignment of the vertices in the enclosed subregion to one processor. The upper right figure shows one possible decomposition of the graph into local cliques, and the lower figure shows the corresponding clique (or supernode) graph. }}{6}}
\newlabel{fig:inode}{{1}{6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.3}Communication Efficiency}{6}}
\@writefile{toc}{\contentsline {section}{\numberline {3}The {\it  BlockSolve95}\ Computing Environment}{8}}
\newlabel{sec:context}{{3}{8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Initializing and Finalizing the {\it  BlockSolve95}\ Environment}{8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}The {\it  BlockSolve95}\ Context {\tt  BSprocinfo}}{8}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.1}Parallel Environment Options}{8}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.2}Factorization Options}{9}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.3}Solver Options}{11}}
\citation{template}
\@writefile{toc}{\contentsline {section}{\numberline {4}The User Matrix Data Structure {\tt  BSspmat}}{12}}
\newlabel{sec:data}{{4}{12}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}The Easy Way to Convert Your Data to {\tt  BSspmat}}{12}}
\newlabel{eqn:crs}{{1}{12}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces The values of the arrays $rp$, $cval$, and $aval$ for the matrix given in equation\penalty \@M \ {1\hbox {}}. The matrix is partitioned so that processor $0$ is assigned rows $0$ and $1$ and processor $1$ has rows $2$ and $3$. Note that indexing of the arrays and the matrices rows and columns begins with 0.}}{13}}
\newlabel{fig:crs}{{2}{13}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}The Advanced Way to Convert Matrix Data to {\tt  BSspmat}}{13}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Manipulating and Solving Sparse Systems}{16}}
\newlabel{sec:main}{{5}{16}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.1}Manipulation and Setup}{16}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.1.1}Symmetric and Nonsymmetric Matrices}{16}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.1.2}Fast Reorderings for Different Matrix Nonzero Values}{16}}
\@writefile{lot}{\contentsline {table}{\numberline {3}{\ignorespaces Consequences of choosing incomplete Cholesky or incomplete LU for symmetric or nonsymmetric matrices}}{17}}
\newlabel{tab:sym}{{3}{17}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.1.3}Diagonal Scaling of the Linear System}{17}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.1.4}The Communication Data Structure {\tt  BScomm}}{17}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.1.5}Computing an Incomplete Factorization}{18}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.1.6}What to Do If the Factorization Fails}{18}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.2}Solving the Linear System}{19}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.3}Freeing Matrices}{20}}
\@writefile{toc}{\contentsline {section}{\numberline {6}Error Checking, Flop Counting, Message Passing, and the BLAS}{21}}
\newlabel{sec:misc}{{6}{21}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.1}Error Checking within {\it  BlockSolve95}}{21}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.2}Flop Counting}{21}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.3}Matrix Statistics}{22}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.4}Blocking and Nonblocking Messages}{22}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.5}MPI Communicators and Message Number Conflicts}{22}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.6}Inline Macros for the BLAS}{23}}
\@writefile{lot}{\contentsline {table}{\numberline {4}{\ignorespaces Comparison of the single-processor performance of {\it  BlockSolve95}\ conjugate gradient and GMRES iterations, with vendor-supplied, Level-2 BLAS (GEMV and TRMV) and the new inline macros. The symmetric systems are solved with the conjugate gradient method; the nonsymmetric systems are solved with GMRES.}}{23}}
\newlabel{tab:blas}{{4}{23}}
\citation{petsc}
\@writefile{toc}{\contentsline {section}{\numberline {7}Installation}{24}}
\newlabel{sec:install}{{7}{24}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.1}Other Libraries}{24}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.2}UNIX {\tt  man} Pages}{24}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.3}Availability of {\it  BlockSolve95}}{24}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.4}Differences between Previous {\em  BlockSolve} Versions}{25}}
\@writefile{toc}{\contentsline {section}{\numberline {8}Example Programs}{26}}
\newlabel{sec:examples}{{8}{26}}
\citation{gjp:balanced}
\@writefile{toc}{\contentsline {section}{\numberline {9}Limitations and Future Plans}{29}}
\newlabel{sec:plans}{{9}{29}}
\citation{petsc}
\citation{jp:refine}
\@writefile{toc}{\contentsline {section}{\numberline {10}Related Software}{30}}
\newlabel{sec:related}{{10}{30}}
\@writefile{toc}{\contentsline {section}{Acknowledgments}{31}}
\bibstyle{siam}
\bibdata{blocksolve}
\bibcite{petsc}{1}
\bibcite{template}{2}
\bibcite{gjp:balanced}{3}
\bibcite{MPI:book}{4}
\bibcite{chaco2}{5}
\bibcite{jp:copper}{6}
\bibcite{jp:bell_prize}{7}
\bibcite{jp:super}{8}
\bibcite{jp:pcolor}{9}
\bibcite{jp:olaf}{10}
\bibcite{jp:scalable}{11}
\bibcite{jp:refine}{12}
\bibcite{MPI:standard}{13}
\@writefile{toc}{\contentsline {section}{References}{32}}
\@writefile{toc}{\contentsline {section}{Subject Index}{32}}
\@input{sindex.aux}
\@input{findex.aux}
\@writefile{toc}{\contentsline {section}{Function Index}{34}}