AngouriMath

Navigation

Home Quick start Wiki Almanac Research What's new Try Use Angouri.org GitHub Report a bug Donate Contacts

← Back to list of members

TrySolveLinear

 Method with 2 overloads

• TrySolveLinear​(AngouriMath.​Entity[][],​AngouriMath.​Entity[],​AngouriMath.​Entity[]@)

  Summary

  Gaussian elimination on a system of any shape whose entries may be symbols: a row
  that reduces to 0 = c with c not decidably zero declines the system,
  and an unknown no row pivots on is set to zero. A pivot is a number that is not zero
  where a column has one, and otherwise an entry that does not simplify to zero — a
  judgement, which is why every caller checks what it builds from the answer.
  

• TrySolveLinear​(AngouriMath.​Entity[][],​AngouriMath.​Entity[],​System.​Boolean,​AngouriMath.​Entity[]@)

  Summary

  TrySolveLinearUnbounded(AngouriMath.Entity[][],AngouriMath.Entity[],System.Boolean,AngouriMath.Entity[]@) with its values bounded by
  LargestDecompositionHandedOn together: the eliminations over the
  symbols hand back quotients of determinants, which grow as determinants do, and
  past the bound the values are declined here rather than substituted, checked and
  simplified downstream -- writing an atom back into nine values of ten million
  nodes each is where `acoth(c x) ln(1 - c^2 x^2)` ran out of memory.