X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Feja%2FDESIGN;h=248af84883c27d9e9fa9a4f6e9502b535126d313;hb=3c7644ecfe369b6f83aa707b87d7a1f9aa246e27;hp=4e34946cb96fea452599ebe844da7895f9e98010;hpb=82b107e485298c004c17a1aae01134decc179439;p=sage.d.git

diff --git a/mjo/eja/DESIGN b/mjo/eja/DESIGN
index 4e34946..248af84 100644
--- a/mjo/eja/DESIGN
+++ b/mjo/eja/DESIGN
@@ -31,20 +31,3 @@ need to know how to undo the process. If we run Gram-Schmidt on the
 basis matrix ourselves, then we can save the matrix that undoes the
 process. And by undoing the process, we can get to a basis where
 computations are fast again.
-
-Question: what's the best way to construct these algebras? We'll
-usually know,
-
-  * the multiplication function
-  * the inner-product function
-  * a basis in either vector or matrix format
-
-and want:
-
-  * an orthonormalized copy of the basis, in long-vector format
-  * the reverse gram-schmidt matrix that deorthonormalizes that
-    long-vector basis
-  * a multiplication matrix (for speed) w.r.t. the orthonormal basis
-  * an inner-product matrix (for speed) w.r.t. the orthonormal basis
-  * a way to turn those two matrices into multiplication and inner-
-    product matrices for the deorthonormalized basis.