Row Echelon Form(s)

\(M=~\)

Stack Identity-Mat:

e.g., [[2, 5], [4, 5], [-3, 4]] or 2 5; 4 5; -3 4;
or [[2*x^3-3, x^2],[-x, 3*x+1]] or 2*x^3-3 x^2; -x 3*x+1; (no spaces within the polynomials)

The matrix is defined over:

The polynomial ring \(k[x]\) for \(k=\)

The finite field \(\mathbb{F}_{p}\) for the prime number \(p=\)

Starting leading coefficient position:

Apply algorithm only to the first \(c\) columns: \(c\) =

Default value is \(-1\) means the algorithm will be applied to all columns.

Reduction type:

Use each leading coefficient to reduce elements only in the first \(r\) rows above it: \(r\) =

The default value is \(-1\) means each leading coefficient will be used to reduce elements in all rows above it.