ASKSAGE: Sage Q&A Forum - RSS feedhttps://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Tue, 19 Jan 2021 16:29:07 +0100"Affine diagonalization algorithm" in n-dimensions?https://ask.sagemath.org/question/55345/affine-diagonalization-algorithm-in-n-dimensions/Does Sage have a general implementation of the "affine diagonalization algorithm"
for n-dimensional vector spaces?
I found some pseudo-code, see page 15 (in section 3 "affine diagonalization" which begins on page 12) of
- [Lecture 21: Surfaces](https://cs.nyu.edu/yap/bks/egc/09/21Surfaces.pdf) in [Robust geometric computation](https://cs.nyu.edu/yap/bks/egc/)
Searching online led me also to this answer from 2008 where someone does it with Maple:
- [Maple primes: Normal forms for quadratic functions](https://www.mapleprimes.com/posts/38766-Normal-Forms-For-Quadratic-Functions)
but unfortunately, I cannot open the `.mws` file (I get an error message concerning the version number).
Thank you very much for the help.Mon, 18 Jan 2021 19:59:25 +0100https://ask.sagemath.org/question/55345/affine-diagonalization-algorithm-in-n-dimensions/Comment by slelievre for <p>Does Sage have a general implementation of the "affine diagonalization algorithm"
for n-dimensional vector spaces?</p>
<p>I found some pseudo-code, see page 15 (in section 3 "affine diagonalization" which begins on page 12) of</p>
<ul>
<li><a href="https://cs.nyu.edu/yap/bks/egc/09/21Surfaces.pdf">Lecture 21: Surfaces</a> in <a href="https://cs.nyu.edu/yap/bks/egc/">Robust geometric computation</a></li>
</ul>
<p>Searching online led me also to this answer from 2008 where someone does it with Maple:</p>
<ul>
<li><a href="https://www.mapleprimes.com/posts/38766-Normal-Forms-For-Quadratic-Functions">Maple primes: Normal forms for quadratic functions</a></li>
</ul>
<p>but unfortunately, I cannot open the <code>.mws</code> file (I get an error message concerning the version number).</p>
<p>Thank you very much for the help.</p>
https://ask.sagemath.org/question/55345/affine-diagonalization-algorithm-in-n-dimensions/?comment=55346#post-id-55346The `.mws` file is really a text file, you can open it with a text editor
and sort of make sense of it.Mon, 18 Jan 2021 21:57:47 +0100https://ask.sagemath.org/question/55345/affine-diagonalization-algorithm-in-n-dimensions/?comment=55346#post-id-55346Comment by Bern for <p>Does Sage have a general implementation of the "affine diagonalization algorithm"
for n-dimensional vector spaces?</p>
<p>I found some pseudo-code, see page 15 (in section 3 "affine diagonalization" which begins on page 12) of</p>
<ul>
<li><a href="https://cs.nyu.edu/yap/bks/egc/09/21Surfaces.pdf">Lecture 21: Surfaces</a> in <a href="https://cs.nyu.edu/yap/bks/egc/">Robust geometric computation</a></li>
</ul>
<p>Searching online led me also to this answer from 2008 where someone does it with Maple:</p>
<ul>
<li><a href="https://www.mapleprimes.com/posts/38766-Normal-Forms-For-Quadratic-Functions">Maple primes: Normal forms for quadratic functions</a></li>
</ul>
<p>but unfortunately, I cannot open the <code>.mws</code> file (I get an error message concerning the version number).</p>
<p>Thank you very much for the help.</p>
https://ask.sagemath.org/question/55345/affine-diagonalization-algorithm-in-n-dimensions/?comment=55358#post-id-55358Ok, thank you very much. With the grafical user interface with Maple it worked...but not with the terminal version...sorry...Of course, I am still interested, if SAGE also has something similar implemented.Tue, 19 Jan 2021 16:29:07 +0100https://ask.sagemath.org/question/55345/affine-diagonalization-algorithm-in-n-dimensions/?comment=55358#post-id-55358