<pPlease to =chapBib#"ht22homalg/> .Most the for strongclass""Gauss>package there. project, strongclass"">GaussForHomalgchapBib>Gr08a/>package which,just < class""><strong<="chapBibhtmlbiBRingsForHomalg"[]/a externalRingsserves strong=pkg<strongandclasspkg<strongstrong=pkghomalg delegatetasks< =pkgGauss/>thispackage strong""homalg'scapabilities todense overfields ringsof the form ℤ⟨ ^
<p>For those unfamiliar with the <strong class="pkg">homalg</strong> project let me explain a couple of points. As outlined in <a href="chapBib.html#biBBR">[BR08]</a> by D. Robertz and M. Barakat homological computations can be reduced to three basic tasks:</p>
<ul>
<li><p>Computing
<li>
<li><p>Reducing java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
</li>
<li><p>Compute the relations between
</li><pReducing withbasis (code="">DecideZeroRowscode>./p>
</ul
<pIn to tasks easy for are, ranging addition multiplicationto the rows . Howevertoreduce need communication might helpfulto supply strong=pkg</strong> some advanced./>
<p>While the above tasks can be quite difficult when><pCompute relations module (code="">yzygiesGeneratorsOfRows>)./>
<p/
<div>Inaddition to tasksonly easy matrix needed from multiplication finding rows a . However reduce for it be to < class"homalg/> advancedprocedures
<tr>
<td
<td <p>While tasks quite when, example in rings the classpkg</> case can be long can aReduced Echelon. This for =code>asisOfRowModulecode,as rows RREF matrix a of . code=""EchelonMat>(a =chap4html>span=RefLink.-<span> is to , on < classpkg</stronginternal <code="">SemiEchelonMatcode Row .</p
</tr>
<tr>
<
<tdpLets at pointbasic < class="code>ecideZeroRows/code:When youfacethetaskreducing a spanc=SimpleMath">A</span> with a given basis <span class="SimpleMath">B</span>, you can compute the RREF of the following block matrix:</p>
</tr>
</table><br />
</div>
<p>By computing the RREF <div ="">table="GAPDocTable">
<p>Note: When<r>
<pThe third procedure code="">SygygiesGeneratorsOfRows/code,is with relationsbetween rows amatrix rowrepresenting element a field these are exactlythe ofthe. One be bytaking amatrix</>
<div class="pcenter"><table class="GAPDocTable">
<tr>
<td class="table> /
<td
</<>By RREF(notice important "Gaussing upwards" is here) <span class="SimpleMath">A</span> is reduced with<span class"SimpleMath>B/span.However, left side of the matrix just serves the oftricking the Gaussian algorithms doingwhat want., was a logical steptoimplementcodeclass"">ReduceMat/code < ="chap4#">span class="RefLink">4.2-3), which does the same thing but without needing unneccessary columns.
</tablebr >
<java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
<p>and computing its Row Echelon Form. Then the row relations are generated
<p>Approaching this problem led to>
<pThesyzygy computation over<span="SimpleMath"ℤ p />was basiswithzero-divisingheadIffor < class""> =0,.,,,,..*,h≠,/spanthere <span class=""> ≠ 0</span thatspanclass"">⋅ =0span < classSimpleMath>g⋅v/span>isregardedasan rowvector has be and be . some thisallowed theimplementationofcodeclass"func">KernelMat<code <a href"chap4.htmlX78E97A0E7F1ED8AA"><span class="RefLink">4.2-5</span></a>) for matrices over <span class="SimpleMath">ℤ / ⟨ p^n ⟩</span>.</p>
<pjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
<hr />
<p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
</body>
</html>
tyle='color:red'>td
<td class="tdcenter">-</td>
<td class="tdcenter">+</td>
<td class="tdcenter">++</td>
<td="tdcenter">+/td>
</tr>
<tr>
<td class="tdcenter">KernelMat< class="tdcenter">+</djava.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 28
<td class=/table><r >
<td class="tdcenter">-</td>
<tdtd class"tdcenter">+/td
<td
<td class
</tr>
</table><br />
</div>
<p>As you can see, the development of hermite algorithms was not continued for dense matrices. There are two reasons for that: <strong class="pkg">GAP</strong> already has very good algorithms for ℤ, and for small matrices the disadvantage of computing over ℤ, potentially leading to coefficient explosion, is marginal.</p>
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.