Module linsolve 

Contains linsolve::LinSolveRing for rings over which we can solve linear systems.

Additionally contains most of the algorithms for actually solving linear systems over various rings, including partial smith normal forms.

Modules

extension

Contains the algorithm for solving linear systems over free ring extensions.

gauss

Contains algorithms related to Gaussian elimination. Note that standard functionality relating to solving linear systems is provided by LinSolveRing instead.

smith

Contains the algorithm to compute the “pre-smith” form of a matrix, which is sufficient for solving linear systems. Works over all principal ideal rings.

Enums

SolveResult

Result of trying to solve a linear system.

Traits

LinSolveRing

Class for rings over which we can solve linear systems.

LinSolveRingStore

RingStore corresponding to LinSolveRing.