Revision #560 → #1254 · back to history
addedGaussian eliminationd066cdee8e39
addedElementary row operations5a42bffa4add
addedReduced row echelon form37cf991fe4a5
addedUniqueness of reduced row echelon form5828570cbe8b
addedGauss–Jordan elimination39aa92c6988b
addedForward elimination and back substitution73f9e83029ca
addedRow reduction as matrix decomposition413626076c35
addedLU decomposition via Frobenius matrices46fe86cb55d1
addedThree elementary row operations9639a74cb02e
addedRow operations preserve solution setdf49c0213681
addedLeading entry (pivot)4418c371be5d
addedRow echelon form6e6504a76a4f
addedMatrix in row echelon form72ce5991f9ab
addedReduced row echelon form70a523c71a60
addedSolving a system by row reduction95e48b93955c
addedEffect of row operations on determinant0fc4928df4a0
addedDeterminant via row echelon formed4e4ea81dec
addedArithmetic complexity of determinant computationdac9a0e9dafc
addedInverse via Gauss–Jordan eliminationc454cbd13e97
addedComputing a matrix inversec38e38d75c30
addedRank and basis from echelon form22cb43804b7d
addedArithmetic complexity of Gaussian elimination60030e2e609f
addedBareiss algorithm bit complexity4ec7c2a2926c
addedBareiss entries are subdeterminants64c7c28c4c8e
addedNumerical stability conditions2e00d48806bf
addedGaussian elimination over any field15cab32f84b0
addedBuchberger generalizationb28812108892
addedTensor rank is NP-hard8ecacbc29973