Talk:06-240/Classnotes For Thursday November 16 - Revision history

70.24.213.4 at 18:58, 22 November 2006

2006-11-22T18:58:24Z

← Older revision		Revision as of 14:58, 22 November 2006
Line 6:		Line 6:
	<br>		<br>
	(iii) if we see that two equations are obviously the same early on, eliminate them right away even if it is not the step prescribed by the algorithm.		(iii) if we see that two equations are obviously the same early on, eliminate them right away even if it is not the step prescribed by the algorithm.
			<br>
	Are we allowed to take these shortcuts in our assignment/exam work?		Are we allowed to take these shortcuts in our assignment/exam work?

70.24.213.4 at 18:58, 22 November 2006

2006-11-22T18:58:00Z

← Older revision		Revision as of 14:58, 22 November 2006
Line 3:		Line 3:
	(i) do multiple operations at a time, if they do not "affect" each other (i.e. eliminate all the entries below a 1 in one step),		(i) do multiple operations at a time, if they do not "affect" each other (i.e. eliminate all the entries below a 1 in one step),
	<br>		<br>
	(ii)replace a row with a multiple of the row plus a multiple of anther row--i.e. R1 := aR1+bR2 (which is simply a combination of two elementary operations), and		(ii) replace a row with a multiple of the row plus a multiple of anther row--i.e. R1 := aR1+bR2 (which is simply a combination of two elementary operations), and
	<br>		<br>
	(iii) if we see that two equations are obviously the same early on, eliminate them right away even if it is not the step prescribed by the algorithm.		(iii) if we see that two equations are obviously the same early on, eliminate them right away even if it is not the step prescribed by the algorithm.

70.24.213.4 at 18:57, 22 November 2006

2006-11-22T18:57:48Z

← Older revision		Revision as of 14:57, 22 November 2006
Line 3:		Line 3:
	(i) do multiple operations at a time, if they do not "affect" each other (i.e. eliminate all the entries below a 1 in one step),		(i) do multiple operations at a time, if they do not "affect" each other (i.e. eliminate all the entries below a 1 in one step),
	<br>		<br>
	(ii) ~~we can~~ replace a row with a multiple of the row plus a multiple of anther row--i.e. R1 := aR1+bR2 (which is simply a combination of two elementary operations), and		(ii)replace a row with a multiple of the row plus a multiple of anther row--i.e. R1 := aR1+bR2 (which is simply a combination of two elementary operations), and
	<br>		<br>
	(iii) if we see that two equations are obviously the same early on, eliminate them right away even if it is not the step prescribed by the algorithm.		(iii) if we see that two equations are obviously the same early on, eliminate them right away even if it is not the step prescribed by the algorithm.

Drorbn at 13:58, 20 November 2006

2006-11-20T13:58:57Z

← Older revision		Revision as of 09:58, 20 November 2006
Line 9:		Line 9:

	(There are probably more common sense shortcuts that I have not listed.)		(There are probably more common sense shortcuts that I have not listed.)

			Yes, these are fine. Note though that your (ii) works only if <math>a\neq 0</math>. --[[User:Drorbn\|Drorbn]] 08:58, 20 November 2006 (EST)

70.24.213.4 at 21:59, 18 November 2006

2006-11-18T21:59:23Z

← Older revision		Revision as of 17:59, 18 November 2006
Line 1:		Line 1:
			When we perform Gaussian Eliminations, sometimes, we can
⚫	~~When we perform Gaussian Eliminations, sometimes, we can (i) do multiple operations at a time, if they do not "affect" each other (i.e. eliminate all the entries below a 1 in one step), and~~ (ii) we can replace a row with a multiple of the row plus a multiple of anther row--i.e. R1 := aR1+bR2 (which is simply a combination of two elementary operations).
			<br>
			(i) do multiple operations at a time, if they do not "affect" each other (i.e. eliminate all the entries below a 1 in one step),
			<br>
		⚫	(ii) we can replace a row with a multiple of the row plus a multiple of anther row--i.e. R1 := aR1+bR2 (which is simply a combination of two elementary operations), and
			<br>
			(iii) if we see that two equations are obviously the same early on, eliminate them right away even if it is not the step prescribed by the algorithm.
	Are we allowed to take these shortcuts in our assignment/exam work?		Are we allowed to take these shortcuts in our assignment/exam work?

			(There are probably more common sense shortcuts that I have not listed.)

70.24.213.4 at 21:47, 18 November 2006

2006-11-18T21:47:30Z

New page

When we perform Gaussian Eliminations, sometimes, we can (i) do multiple operations at a time, if they do not "affect" each other (i.e. eliminate all the entries below a 1 in one step), and (ii) we can replace a row with a multiple of the row plus a multiple of anther row--i.e. R1 := aR1+bR2 (which is simply a combination of two elementary operations).
Are we allowed to take these shortcuts in our assignment/exam work?