AngouriMath
Navigation
Eliminate(AngouriMath.Entity.Matrix,System.Boolean)
Method (no overloads)
Summary
Gaussian elimination over the entries, to the row echelon form, or with reduced to the
reduced one, and the number of pivots it found.
reduced one, and the number of pivots it found.
Remarks
GenericTensor's elimination asked whether a pivot was the literal 0, and an entry the elimination had
itself made, likec + -c / a * a , is 0 without being written so: it was chosen and divided by, and
the reduced form of[[a, b], [c, d]] simplified to NaN and the rank of [[a, b], [2 a, 2 b]] was 2. Each entry the elimination makes is normalised, a rational function over the rationals to its
canonical quotient (RationalFunction), where being 0 is being the literal 0, and
the third row of[[a, b, c], [d, e, f], [a + d, b + e, c + f]] is 0 as it should be; anything
else is simplified when it is asked whether it is 0.
https://github.com/asc-community/AngouriMath/issues/2345
itself made, like
the reduced form of
canonical quotient (RationalFunction), where being 0 is being the literal 0, and
the third row of
else is simplified when it is asked whether it is 0.
https://github.com/asc-community/AngouriMath/issues/2345
Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 5629 pages online