\HeaderA{mwd.object}{Multiple wavelet decomposition object (1D)}{mwd.object}
\keyword{classes}{mwd.object}
\begin{Description}\relax
These are objects of class 

\code{mwd}

They represent a decomposition of a function with respect to a multiple wavelet basis.
\end{Description}
\begin{Details}\relax
To retain your sanity the C and D coefficients should be extracted by the \code{\LinkA{accessC}{accessC}} and \code{\LinkA{accessD}{accessD}} functions and put using the \code{\LinkA{putC}{putC}} and \code{\LinkA{putD}{putD}} functions, rather than by the `$' operator.
\end{Details}
\begin{Value}
The following components must be included in a legitimate `mwd' object. 
\begin{ldescription}
\item[\code{C}] a matrix containing each level's smoothed data, each column corresponding to one coefficient vector. The wavelet transform works by applying both a smoothing filter and a bandpass filter to the previous level's smoothed data. The top level contains data at the highest resolution level. Each of these levels are stored one after the other in this matrix. The matrix `\code{fl.dbase\$first.last.c}' determines exactly which columns in the matrix, store each level.
\item[\code{D}] wavelet coefficient matrix. If you were to write down the discrete wavelet transform of a function then columns of D would be the vector coefficients of the wavelet basis function s. Like the C, they are also formed in a pyramidal manner, but stored in a linear matrix. The storage details are to be found in `\code{fl.dbase\$first.last.d}'.
\item[\code{nlevels}] The number of levels in the pyramidal decomposition that produces the coefficients. The precise number of levels depends on the number of different wavelet functions used and the preprocessing method used, as well as the number of data points used.
\item[\code{fl.dbase}] The first last database associated with this decomposition. This is a list consisting of 2 integers, and 2 matrices. The matrices detail how the coefficients are stored in the C and D components of the `mwd.object'. See the help on \code{\LinkA{mfirst.last}{mfirst.last}} for more information.
\item[\code{filter}] a list containing the details of the filter that did the decomposition. See \code{\LinkA{mfilter.select}{mfilter.select}}.
\item[\code{type}] either \code{"wavelet"} indicating that the ordinary multiple wavelet transform was performed or \code{"station"} indicating that the non-decimated multiple wavelet transform was done.
\item[\code{prefilter}] Type of preprocessing or prefilter used. This will be specigic for the type of multiple wavelet used.
\item[\code{date}] The date that the transform was performed or the mwd object was last modified.
\item[\code{bc}] how the boundaries were handled
\end{ldescription}
\end{Value}
\begin{Section}{GENERATION}
This class of objects is returned from the \code{\LinkA{mwd}{mwd}} function to represent a multiple wavelet decomposition of a function. Many other functions return an object of class mwd.
\end{Section}
\begin{Section}{METHODS}
The mwd class of objects has methods for the following generic functions: \code{\LinkA{accessC}{accessC}}, \code{\LinkA{accessD}{accessD}}, \code{\LinkA{draw}{draw}}, \code{\LinkA{plot}{plot}}, \code{\LinkA{print}{print}}, \code{\LinkA{putC}{putC}}, \code{\LinkA{putD}{putD}}, \code{\LinkA{summary}{summary}}, \code{\LinkA{threshold}{threshold}}, \code{\LinkA{wr.mwd}{wr.mwd}}.
\end{Section}
\begin{Section}{RELEASE}
Version 3.9.6 (Although Copyright Tim Downie, 1995-6).
\end{Section}
\begin{SeeAlso}\relax
\code{\LinkA{accessC.mwd}{accessC.mwd}}, \code{\LinkA{accessD.mwd}{accessD.mwd}}, \code{\LinkA{draw.mwd}{draw.mwd}}, \code{\LinkA{mfirst.last}{mfirst.last}}, \code{\LinkA{mfilter.select}{mfilter.select}}, \code{\LinkA{mwd.object}{mwd.object}}, \code{\LinkA{mwr}{mwr}}, \code{\LinkA{plot.mwd}{plot.mwd}},\code{\LinkA{print.mwd}{print.mwd}}, \code{\LinkA{putC.mwd}{putC.mwd}}, \code{\LinkA{putD.mwd}{putD.mwd}}, \code{\LinkA{summary.mwd}{summary.mwd}}, \code{\LinkA{threshold.mwd}{threshold.mwd}}, \code{\LinkA{wd}{wd}}, \code{\LinkA{wr.mwd}{wr.mwd}}.
\end{SeeAlso}

