Commitde89f25

authored

Merge pull request#1488 from yousvf/patch-2

Update linear-system-gauss.md

2 parents31ac655 +276b929 commitde89f25Copy full SHA for de89f25

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -42,7 +42,7 @@ Strictly speaking, the method described below should be called "Gauss-Jordan", o`
`42`	`42`
`43`	`43`	The algorithm is a`sequential elimination` of the variables in each equation, until each equation will have only one remaining variable. If $n = m$, you can think of it as transforming the matrix $A$ to identity matrix, and solve the equation in this obvious case, where solution is unique and is equal to coefficient $b_i$.
`44`	`44`
`45`		`-Gaussian elimination is based on two simpletransformation:`
	`45`	`+Gaussian elimination is based on two simpletransformations:`
`46`	`46`
`47`	`47`	`* It is possible to exchange two equations`
`48`	`48`	`* Any equation can be replaced by a linear combination of that row (with non-zero coefficient), and some other rows (with arbitrary coefficients).`

Comments

(0)