Changeset 356 for trunk/doc/pslib/psLibADD.tex

Timestamp:

Mar 31, 2004, 10:29:31 PM (22 years ago)

Author:

eugene

Message:

cleaned up the cover pages

File:

• trunk/doc/pslib/psLibADD.tex (modified) (39 diffs)

trunk/doc/pslib/psLibADD.tex

@@ -1 @@
-%%% $Id: psLibADD.tex,v 1.9 2004-04-01 04:40:14 eugene Exp $
+%%% $Id: psLibADD.tex,v 1.10 2004-04-01 08:29:31 eugene Exp $
 \documentclass[panstarrs]{panstarrs}
 
@@ -18 +18 @@
 \maketitle
 
-
 % -- Revision History --
 % provide explicit values for the old versions
@@ -28 +27 @@
 \RevisionsEnd
 
-\pagebreak
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\DocumentsInternal
+PSCD-430-xxx  &   PS-1 Design Reference Mission \\ \hline
+PSCD-430-004  &   Pan-STARRS IPP C Code Conventions \\ \hline
+PSCD-430-005  &   Pan-STARRS IPP SRS \\ \hline
+PSCD-430-006  &   Pan-STARRS IPP ADD \\ \hline
+PSCD-430-008  &   Pan-STARRS IPP Architecture SDR \\ 
+\DocumentsExternal
+Posix Standard & Open Group Based Specifications Issue 6, IEEE Std 1003.1, 2003 \\
+\DocumentsEnd
+
 \tableofcontents
-
 \pagebreak 
 \pagenumbering{arabic}
 
-\section{PanSTARRS Library PSLib}
+\section{Pan-STARRS Library PSLib}
 
 \subsection{Math Utilities}
 
-\subsection{Sorting}
+\subsubsection{Sorting}
 
 A variety of sorting algorithms exist, with a wide range in speed for
@@ -61 +70 @@
 function \code{psSortIndex} shall return an integer index to the
 sequence of the input array without overwriting the input array.
-Given the following line of code, \code{out = psSortIndex (NULL,
-&in);}, the elements of the array \code{out} are in the sequence
-\code{in.arr[out->arr[0]]} to \code{in.arr[out->arr[in.n - 1]]}. 
-
-\subsection{Smoothing: Boxcar and Gaussian}
+Given the following line of code:
+\begin{verbatim}
+out = psSortIndex (NULL,&in);}
+\end{verbatim}
+the elements of the array \code{out} are in the sequence
+\code{in.arr[out->arr[0]]} to \code{in.arr[out->arr[in.n - 1]]}.
+
+\subsubsection{Smoothing: Boxcar and Gaussian}
 \label{smooth}
 
@@ -92 +104 @@
 \end{equation}
 
-\subsection{Statistics}
+\subsubsection{Statistics}
 
 The general statistics function \code{psStats} performs a variety of
@@ -105 +117 @@
 sample and robust estimators.
 
-\subsubsection{Sample Statistics}
+\paragraph{Sample Statistics}
 
 We define the following statistical terms, assuming there is a set of
 data elements $x_i$.
 
-\paragraph{Mean}
+\subparagraph{Mean}
 
 The mean is defined as:
@@ -117 +129 @@
 \end{equation}
 
-\paragraph{Median}
+\subparagraph{Median}
 
 The median is defined as the value for which 50\% of the data values
@@ -127 +139 @@
 robust median is quicker and more accurate.  
 
-\paragraph{Upper and Lower Quartiles}
+\subparagraph{Upper and Lower Quartiles}
 
 The upper and lower quartiles ($U_{\frac{1}{4}}$ and
@@ -141 +153 @@
 are quicker and more accurate.
 
-\paragraph{Standard Deviation}
+\subparagraph{Standard Deviation}
 
 The standard deviation of the sample is given by:
@@ -156 +168 @@
 \end{equation}
 
-\subsubsection{Clipped Statistics}
+\paragraph{Clipped Statistics}
 
 The clipped statistics are used to determine the mean and standard
@@ -186 +198 @@
 \end{enumerate}
 
-\subsubsection{Robust Statistics}
+\paragraph{Robust Statistics}
 
 The robust version of the statistics provides estimators of basic
@@ -232 +244 @@
 
 
-\subsection{Matrix Operations}
+\subsubsection{Matrix Operations}
 
 In this section, we define the linear algebra operations performed on
@@ -251 +263 @@
 \code{gsl_linalg_LU_decomp}.
 
-\subsubsection{LU Decomposition}
+\paragraph{LU Decomposition}
 \label{LUdecomp}
 
@@ -292 +304 @@
 \end{equation}
 
-\subsubsection{Calculate a matrix determinant}
+\paragraph{Calculate a matrix determinant}
 
 The determinant $D$ of a matrix $a_{ij}$ is calculated from the
@@ -308 +320 @@
 shall be used.
 
-\subsubsection{Solving a Linear Equation}
+\paragraph{Solving a Linear Equation}
 
 The LU decomposition of a matrix may be used to solve the
@@ -328 +340 @@
 \end{eqnarray}
 
-\subsubsection{Invert a matrix}
+\paragraph{Invert a matrix}
 
 Inversion of a matrix using the LU decomposition is performed by
@@ -337 +349 @@
 operation shall be implemented using the GSL function \code{gsl_linalg_LU_invert}.
 
-\subsubsection{Perform matrix addition, subtraction and multiplication}
+\paragraph{Perform matrix addition, subtraction and multiplication}
 
 Matrix binary arithmetic operations differ from image binary
@@ -361 +373 @@
 \times$.
 
-\subsubsection{Transpose a matrix}
+\paragraph{Transpose a matrix}
 
 The transpose of a matrix is simply the reorganization of the matrix
@@ -374 +386 @@
 where $M_{ij}$ is the matrix to be transposed.
 
-\subsubsection{Convert a matrix to a vector}
+\paragraph{Convert a matrix to a vector}
 
 Matrix-to-vector conversion is only defined for a matrix that has a
@@ -383 +395 @@
 matrix is converted to a \code{PS_DIMEN_TRANV}-type vector.
 
-\subsection{Fitting}
-
-\subsubsection{Chi-squared}
+\subsubsection{Fitting}
+
+\paragraph{Chi-squared}
 \label{chisq}
 
@@ -396 +408 @@
 \end{equation}
 
-\subsubsection{General Polynomial Fitting}
+\paragraph{General Polynomial Fitting}
 
 Given a set of data values $y_i$ with errors $\sigma_i$, related to
@@ -421 +433 @@
 (section~\ref{LUdecomp}).
 
-\subsubsection{Non-linear Fitting: Levenberg-Marquardt Method}
+\paragraph{Non-linear Fitting: Levenberg-Marquardt Method}
 
 \TBD{describe LMM for psMinimize and psMinimizeChi2}
@@ -497 +509 @@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
-\subsection{Polynomials}
+\subsubsection{Polynomials}
 
 We will employ Chebyshev polynomials (NR \S 5.8) to approximate functions:
@@ -534 +546 @@
 $-1 < x < 1$.
 
-\subsubsection{Multi-dimensional polynomials}
+\paragraph{Multi-dimensional polynomials}
 
 Multi-dimensional polynomials shall be composed of multiplications of
@@ -540 +552 @@
 the appropriate rank.
 
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-\subsection{(Fast) Fourier Transforms}
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\subsubsection{(Fast) Fourier Transforms}
 
 (Fast) Fourier Transforms (FFTs) shall be implemented using the
@@ -549 +560 @@
 library}.
 
-\subsubsection{FFTW Plans}
+\paragraph{FFTW Plans}
 
 FFTW requires the user to create a ``plan'' for each transform size,
@@ -566 +577 @@
 saved at the conclusion (\code{psFFTDone()}).
 
-\subsubsection{Function mapping}
+\paragraph{Function mapping}
 
 The forward and reverse transforms call the corresponding
@@ -583 +594 @@
 place to avoid the need to pad the input array to hold the output.
 
-\subsubsection{More Complicated Functions}
+\paragraph{More Complicated Functions}
 
 The \code{psFFTFilter()} and \code{psFFTFilterComplex()} functions provide
@@ -665 +676 @@
 \end{eqnarray}
 
-\subsubsubsection{Gnomonic}
+\paragraph{Gnomonic}
 
 The Gnomonic projection (``TAN'') is a zenithal projection.
@@ -674 +685 @@
 \end{eqnarray}
 
-\subsubsubsection{Orthographic}
+\paragraph{Orthographic}
 
 The Orthographic projection (``SIN'') is a zenithal projection.
@@ -683 +694 @@
 \end{eqnarray}
 
-\subsubsubsection{Cartesian}
+\paragraph{Cartesian}
 
 The Cartesian projection (``CAR'') is a very simple cylindrical projection.
@@ -692 +703 @@
 \end{eqnarray}
 
-\subsubsubsection{Mercator}
+\paragraph{Mercator}
 
 The Mercator projection (``MER'') is a cylindrical projection.
@@ -702 +713 @@
 \end{eqnarray}
 
-\subsubsubsection{Hammer-Aitoff}
+\paragraph{Hammer-Aitoff}
 
 The Hammer-Aitoff projection is a general projection, and is defined:
@@ -722 +733 @@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
-\subsection{Tangent Plane to Sky}
+\subsubsection{Tangent Plane to Sky}
 
 Mappings between the tangent plane and the sky will be implemented
@@ -755 +766 @@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
-\subsection{The One-to-Many Problem with Mosaic Cameras}
+\subsubsection{The One-to-Many Problem with Mosaic Cameras}
 
 The \PS{} focal plane consists of several chips, so we will often want
@@ -777 +788 @@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
-\subsection{General Astronomy Functions}
+\subsubsection{General Astronomy Functions}
 
 The airmass is calculated using the SLALIB function \code{sla_AIRMAS}.
@@ -807 +818 @@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
-\subsection{Positions of Major Solar System Objects}
+\subsubsection{Positions of Major Solar System Objects}
 
 The SLALIB function \code{SLA_RDPLAN} returns the apparent position of
@@ -818 +829 @@
 \rightarrow \alpha + 12 {\rm hrs}$ and $\delta \rightarrow -\delta$).
 
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
-\subsection{Offsets}
-
-
-
-
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\subsubsection{Offsets}
+
+
+
+
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+
+\end{document}
 
 \section{Modules}
@@ -866 +879 @@
 \section{Architectual Components}
 
-\end{document}