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.Mon, 02 Nov 2020 14:34:26 +0100Determinant of large sparse symbolic matriceshttps://ask.sagemath.org/question/54004/determinant-of-large-sparse-symbolic-matrices/ I am working on a symbolic circuit simulation program for electronic circuits (SLiCAP). I have a matlab (MuPAD) and a python version available.
The key task of such a program is the calculation of the determinant of sparse matrices with symbolic entries. The MuPAD (MATLAB symbolic toolbox) version calculates the determinant of a sparse matrix (dim = 52x52) with one symbolic variable (the Laplace variable) in about one minute (minor expansion, algorithm unknown). The Python version uses maxima and the newdet method (Gentleman-Johnson algorithm). This method is limited to dim=50x50, but I had to reduce the size to (30x30) because of memory paging errors reported by Lisp.
Now I would like to try SageMath with the "df" algorithm for this purpose, but its running more then 30 minutes ...
I know the Gentleman-Johnson method is included in PyNAC but it doesn't seem to be included in the sage wrapper.
My questions:
1. Can SageMath be forced to use the Gentleman-Johnson algorithm included in PyNAC?
2. If not can a wrapper be build to do this?
3. If so, can someone help we with this?
Thanks in advance for repying!
written so that it can be used?
Thu, 22 Oct 2020 15:55:53 +0200https://ask.sagemath.org/question/54004/determinant-of-large-sparse-symbolic-matrices/Comment by fredrik for <p>I am working on a symbolic circuit simulation program for electronic circuits (SLiCAP). I have a matlab (MuPAD) and a python version available. </p>
<p>The key task of such a program is the calculation of the determinant of sparse matrices with symbolic entries. The MuPAD (MATLAB symbolic toolbox) version calculates the determinant of a sparse matrix (dim = 52x52) with one symbolic variable (the Laplace variable) in about one minute (minor expansion, algorithm unknown). The Python version uses maxima and the newdet method (Gentleman-Johnson algorithm). This method is limited to dim=50x50, but I had to reduce the size to (30x30) because of memory paging errors reported by Lisp.</p>
<p>Now I would like to try SageMath with the "df" algorithm for this purpose, but its running more then 30 minutes ...
I know the Gentleman-Johnson method is included in PyNAC but it doesn't seem to be included in the sage wrapper.</p>
<p>My questions:</p>
<ol>
<li>Can SageMath be forced to use the Gentleman-Johnson algorithm included in PyNAC?</li>
<li>If not can a wrapper be build to do this?</li>
<li>If so, can someone help we with this?</li>
</ol>
<p>Thanks in advance for repying!</p>
<pre><code>written so that it can be used?
</code></pre>
https://ask.sagemath.org/question/54004/determinant-of-large-sparse-symbolic-matrices/?comment=54103#post-id-54103Can you share an example matrix?Mon, 02 Nov 2020 14:34:26 +0100https://ask.sagemath.org/question/54004/determinant-of-large-sparse-symbolic-matrices/?comment=54103#post-id-54103