AngouriMath
LinearSystemSolver
Description
Summary
A linear system with fewer equations than unknowns, answered as the family of all its
solutions: the unknowns a row reduction leaves free become parameters, and the rest are
written in terms of them.
#212
solutions: the unknowns a row reduction leaves free become parameters, and the rest are
written in terms of them.
#212
Remarks
infinitely many solutions and one degree of freedom, so the answer is a single row
the caller did not name.
row of Matrix whose i-th entry is the i-th unknown's value, and nothing
says those entries may not mention a variable. The same device already carries the
constant of integration out of the ODE solver, and
InSolveSystem(System.Collections.Generic.List{AngouriMath.Entity},System.ReadOnlySpan{AngouriMath.Entity.Variable},AngouriMath.Entity,AngouriMath.Core.Budgets.BudgetLedger) already mints one
where its recursion bottoms out unconstrained
(#550).
at all —
reaching any elimination. A square system that is rank-deficient is left to the
eliminator, which already answers it; taking those here as well would change answers that
are not wrong.
a convenience. Row reduction has to decide whether a pivot is zero, and the general
test available here is structural —
than no answer. Over the rationals the question is decidable, so it is asked there. The
constant term is under no such restriction: it is never a pivot, so
Members
Reduce(PeterO.Numbers.ERational[][],AngouriMath.Entity[],System.Int32,System.Int32[])
Method
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online