Reduced row echelon form: Difference between revisions

 

=={{header|Ada}}==

matrices.ads:

<lang Ada>generic

=={{header|ALGOL 68}}==

{{trans|Python}}

{{works with|ALGOL 68|Standard - no extensions to language used}}

{{works with|ALGOL 68G|Any - tested with release mk15-0.8b.fc9.i386}}

-0 -0 1 -2

</pre>

<lang csharp>using System;

 

 

=={{header|Common Lisp}}==

Direct implementation of the pseudo-code given.

<lang lisp>(defun convert-to-row-echelon-form (matrix)

(let* ((dimensions (array-dimensions matrix))

=={{header|JavaScript}}==

{{works with|SpiderMonkey}} for the <code>print()</code> function.

Extends the Matrix class defined at [[Matrix Transpose#JavaScript]]

<lang javascript>// modifies the matrix in-place

0,1,0,1.666666666666667

0,0,1,1</pre>

=={{header|Lua}}==

<lang lua>function ToReducedRowEchelonForm ( M )

 

=={{header|Octave}}==

<lang octave>A = [ 1, 2, -1, -4; 2, 3, -1, -11; -2, 0, -3, 22];

refA = rref(A);

=={{header|Perl}}==

{{trans|Python}}

Note that the function defined here takes an array reference, not an array.

<lang perl>sub rref

=={{header|Perl 6}}==

{{trans|Perl}}

{{works with|Rakudo|2010.12}}

<lang perl6>sub rref (@m is rw) {

@m or return;

 

=={{header|PHP}}==

<lang php><?php

 

=={{header|Python}}==

This closely follows the pseudocode given. If you want accurate results, use the fractions package.

<lang python>def ToReducedRowEchelonForm( M):

if not M: return

print(m)

print(rref(m))</lang>

 

=={{header|REXX}}==

0.0 1.0 0.0 1.66666666666667

0.0 0.0 1.0 1.0</pre>

=={{header|Sage}}==

{{works with|Sage|4.6.2}}

 

=={{header|TI-89 BASIC}}==

<lang ti89b>rref([1,2,–1,–4; 2,3,–1,–11; –2,0,–3,22])</lang>