Exercise linearalgebra.gramschmidt
Description
Gram-Schmidt
Strategy
<label name="gram-schmidt"> <let> <decl var="1"> <orelse> <sequence> <label name="iteration"> <sequence> <rule name="considernextvector"/> <label name="makevectororthogonal"> <let> <decl var="0"> <orelse> <sequence> <rule name="orthogonaltonext"/> <orelse> <rule name="makeorthogonal"/> <succeed/> </orelse> <var var="0"/> </sequence> <succeed/> </orelse> </decl> <var var="0"/> </let> </label> <label name="normalize"> <orelse> <rule name="turnintounitvector"/> <succeed/> </orelse> </label> </sequence> </label> <var var="1"/> </sequence> <succeed/> </orelse> </decl> <var var="1"/> </let> </label>
Locations
Location | Label |
[] | gram-schmidt |
[0] | ...iteration |
[0,0] | ......considernextvector |
[1,0] | ......makevectororthogonal |
[0,1,0] | .........makeorthogonal |
[2,0] | ......normalize |
[0,2,0] | .........turnintounitvector |