Changeset 91 for doc/latex/classbilinfn.tex
- Timestamp:
- 04/30/08 15:20:07 (17 years ago)
- Files:
-
- 1 modified
Legend:
- Unmodified
- Added
- Removed
-
doc/latex/classbilinfn.tex
r33 r91 1 1 \section{bilinfn Class Reference} 2 2 \label{classbilinfn}\index{bilinfn@{bilinfn}} 3 Class representing function \$f(x,u) = Ax+Bu\$.3 Class representing function $f(x,u) = Ax+Bu$. 4 4 5 5 … … 10 10 \begin{center} 11 11 \leavevmode 12 \includegraphics[width=4 7pt]{classbilinfn__inherit__graph}12 \includegraphics[width=44pt]{classbilinfn__inherit__graph} 13 13 \end{center} 14 14 \end{figure} … … 25 25 vec {\bf eval} (const vec \&x0, const vec \&u0)\label{classbilinfn_e36a16e72e7f9fedf3cb18d2d5505a24} 26 26 27 \begin{CompactList}\small\item\em Evaluates \$f(x0,u0)\$. \item\end{CompactList}\item27 \begin{CompactList}\small\item\em Evaluates $f(x0,u0)$. \item\end{CompactList}\item 28 28 {\bf bilinfn} (const {\bf RV} \&rvx0, const {\bf RV} \&rvu0)\label{classbilinfn_af9f36282730d910a41b95f4d1fb8221} 29 29 … … 38 38 vec {\bf eval} (const vec \&cond)\label{classdiffbifn_ad7673e16aa1a046b131b24c731c4632} 39 39 40 \begin{CompactList}\small\item\em Evaluates \$f(x0,u0)\$ (VS: Do we really need common eval? ). \item\end{CompactList}\item40 \begin{CompactList}\small\item\em Evaluates $f(x0,u0)$ (VS: Do we really need common eval? ). \item\end{CompactList}\item 41 41 int {\bf \_\-dimx} () const \label{classdiffbifn_436de7a7301ea9eac7d6081b893bbf57} 42 42 … … 69 69 70 70 \subsection{Detailed Description} 71 Class representing function \$f(x,u) = Ax+Bu\$.71 Class representing function $f(x,u) = Ax+Bu$. 72 72 73 73 \subsection{Member Function Documentation} 74 \index{bilinfn@{bilinfn}!dfdx _cond@{dfdx\_\-cond}}75 \index{dfdx _cond@{dfdx\_\-cond}!bilinfn@{bilinfn}}76 \subsubsection{\setlength{\rightskip}{0pt plus 5cm}void bilinfn::dfdx\_\-cond (const vec \& {\em x0}, const vec \& {\em u0}, mat \& {\em A},bool {\em full})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classbilinfn_79c022de8dbe2b054bb9cc49345f3ef5}74 \index{bilinfn@{bilinfn}!dfdx\_\-cond@{dfdx\_\-cond}} 75 \index{dfdx\_\-cond@{dfdx\_\-cond}!bilinfn@{bilinfn}} 76 \subsubsection{\setlength{\rightskip}{0pt plus 5cm}void bilinfn::dfdx\_\-cond (const vec \& {\em x0}, \/ const vec \& {\em u0}, \/ mat \& {\em A}, \/ bool {\em full})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classbilinfn_79c022de8dbe2b054bb9cc49345f3ef5} 77 77 78 78 … … 82 82 \item[Parameters:] 83 83 \begin{description} 84 \item[{\em full}]denotes that even unchanged entries are to be rewritten. When, false only the changed elements are computed. \item[{\em x0}]numeric value of \$x\$, \item[{\em u0}]numeric value of \$u\$ \item[{\em A}]a place where the result will be stored. \end{description}84 \item[{\em full}]denotes that even unchanged entries are to be rewritten. When, false only the changed elements are computed. \item[{\em x0}]numeric value of $x$, \item[{\em u0}]numeric value of $u$ \item[{\em A}]a place where the result will be stored. \end{description} 85 85 \end{Desc} 86 86 87 87 88 Reimplemented from {\bf diffbifn} \doxyref{}{p.}{classdiffbifn_6d217a02d4fa13931258d4bebdd0feb4}.\index{bilinfn@{bilinfn}!dfdu _cond@{dfdu\_\-cond}}89 \index{dfdu _cond@{dfdu\_\-cond}!bilinfn@{bilinfn}}90 \subsubsection{\setlength{\rightskip}{0pt plus 5cm}void bilinfn::dfdu\_\-cond (const vec \& {\em x0}, const vec \& {\em u0}, mat \& {\em A},bool {\em full} = {\tt true})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classbilinfn_90f2b15612b14883d6ed2b0e295cb82b}88 Reimplemented from {\bf diffbifn} \doxyref{}{p.}{classdiffbifn_6d217a02d4fa13931258d4bebdd0feb4}.\index{bilinfn@{bilinfn}!dfdu\_\-cond@{dfdu\_\-cond}} 89 \index{dfdu\_\-cond@{dfdu\_\-cond}!bilinfn@{bilinfn}} 90 \subsubsection{\setlength{\rightskip}{0pt plus 5cm}void bilinfn::dfdu\_\-cond (const vec \& {\em x0}, \/ const vec \& {\em u0}, \/ mat \& {\em A}, \/ bool {\em full} = {\tt true})\hspace{0.3cm}{\tt [inline, virtual]}}\label{classbilinfn_90f2b15612b14883d6ed2b0e295cb82b} 91 91 92 92 … … 96 96 \item[Parameters:] 97 97 \begin{description} 98 \item[{\em full}]denotes that even unchanged entries are to be rewritten. When, false only the changed elements are computed. \item[{\em x0}]numeric value of \$x\$, \item[{\em u0}]numeric value of \$u\$ \item[{\em A}]a place where the result will be stored. \end{description}98 \item[{\em full}]denotes that even unchanged entries are to be rewritten. When, false only the changed elements are computed. \item[{\em x0}]numeric value of $x$, \item[{\em u0}]numeric value of $u$ \item[{\em A}]a place where the result will be stored. \end{description} 99 99 \end{Desc} 100 100