_remove_redundancy_svd(A, b)
An array representing the left-hand side of a system of equations
An array representing the right-hand side of a system of equations
An array representing the left-hand side of a system of equations
An array representing the right-hand side of a system of equations
An integer indicating the status of the system 0: No infeasibility identified 2: Trivially infeasible
A string descriptor of the exit status of the optimization.
Eliminates redundant equations from system of equations defined by Ax = b and identifies infeasibilities.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them