\resetsteps % Reset all the commands to create a blank worksheet % Define the operation to be computed \renewcommand{\routinename}{ \alpha \becomes \hat{\alpha} + x^T y } % Step 3: Loop-guard \renewcommand{\guard}{ m( x_T ) < m( x ) } % Step 4: Initialize \renewcommand{\partitionings}{ $ x \rightarrow \FlaTwoByOne{x_{T}} {x_{B}} $ , $ y \rightarrow \FlaTwoByOne{y_{T}} {y_{B}} $ } \renewcommand{\partitionsizes}{ $ x_{T} $ and $ y_{T} $ have $ 0 $ elements } % Step 5a: Repartition the operands \renewcommand{\repartitionings}{ $ \FlaTwoByOne{ x_T } { x_B } \rightarrow \FlaThreeByOneB{x_0} {\chi_1} {x_2} $ , $ \FlaTwoByOne{ y_T } { y_B } \rightarrow \FlaThreeByOneB{y_0} {\psi_1} {y_2} $ } \renewcommand{\repartitionsizes}{ $ \chi_1 $ and $ \psi_1 $ are scalars} % Step 5b: Move the double lines \renewcommand{\moveboundaries}{ $ \FlaTwoByOne{ x_T } { x_B } \leftarrow \FlaThreeByOneT{x_0} {\chi_1} {x_2} $ , $ \FlaTwoByOne{ y_T } { y_B } \leftarrow \FlaThreeByOneT{y_0} {\psi_1} {y_2} $ } % Step 8: Insert the updates required to change the % state from that given in Step 6 to that given in Step 7 % Note: The below needs editing!!! \renewcommand{\update}{ $ \begin{array}{l} \alpha \becomes \chi_1 \psi_1 + \alpha \end{array} $ } \footnotesize \FlaAlgorithmNarrow % this command generates the algorithm

LinearAlgebraWiki: Algorithms/ApdotUnbVar1 (last edited 2008-05-19 03:33:24 by MarthaGanser)