{"id":205,"date":"2017-08-23T09:59:03","date_gmt":"2017-08-23T09:59:03","guid":{"rendered":"http:\/\/americanboard.org\/Subjects\/mathematics\/?page_id=205"},"modified":"2017-09-18T19:28:17","modified_gmt":"2017-09-18T19:28:17","slug":"matrices-for-systems-of-equations","status":"publish","type":"page","link":"https:\/\/americanboard.org\/Subjects\/mathematics\/matrices-for-systems-of-equations\/","title":{"rendered":"Matrices for Systems of Equations"},"content":{"rendered":"<div class=\"twelve columns\" style=\"margin-top: 10%;\">\n<div class=\"advance\"><a class=\"button button-primary\" href=\"http:\/\/americanboard.org\/Subjects\/mathematics\/matrices-operations-and-inverses\">\u2b05 Previous Lesson<\/a>\u00a0<a class=\"button\" href=\"http:\/\/americanboard.org\/Subjects\/mathematics\/measurement-and-linear-algebra\">Workshop Index<\/a>\u00a0<a class=\"button button-primary\" href=\"http:\/\/americanboard.org\/Subjects\/mathematics\/geometric-interpretations\">Next Lesson \u27a1<\/a><\/div>\n<p><!-- CONTENT BEGINS HERE --><\/p>\n<h1 id=\"title\">Matrices for Systems of Equations<\/h1>\n<h4>Objective<\/h4>\n<p>In this lesson, you will solve systems of linear equations using both the reduced row-echelon method and the\u00a0Gauss-Jordan elimination method.<\/p>\n<section>\n<h3><em><span style=\"text-decoration: none;\">W<\/span><\/em><span style=\"text-decoration: none;\">ha<\/span>t\u00a0is reduced row-echelon form?<\/h3>\n<p><abbr title=\"the form of a matrix in which: Any row with all zeros is at the bottom of the matrix. Any row that has an entry other than zero has 1 as the first nonzero entry. Any row that has 1 as the first nonzero entry has that entry further to the right than the first nonzero entry of the row above. \">Reduced\u00a0row-echelon form<\/abbr> of a matrix is the form of a matrix in which:<\/p>\n<ol>\n<li>any row with all zeros is at the bottom of the matrix.<\/li>\n<li>any row that has an entry other than zero has one as the first non-zero entry.<\/li>\n<li>any row that has one as the first non-zero entry has that\u00a0entry further to the right than the first non-zero entry of the\u00a0row above.<\/li>\n<\/ol>\n<h3>How do you change a matrix into reduced row-echelon form?<\/h3>\n<p>There are a number of moves that can change a matrix into\u00a0reduced row-echelon form. But before we learn these moves, we will\u00a0first examine the connections between matrices and linear\u00a0equations.<\/p>\n<p>For example, a school band decides to purchase xylophones and\u00a0zithers. If xylophones cost $30.00, and zithers cost $40.00, how\u00a0many of each should they buy in order to purchase exactly 254\u00a0instruments and spend their entire budget of $8,500?<\/p>\n<p>&nbsp;<\/p>\n<p class=\"white_lesson_header\" align=\"CENTER\">Two Perspectives on the Solution<\/p>\n<p align=\"CENTER\"><span style=\"text-decoration: none;\">Let <\/span><em><span style=\"text-decoration: none;\">x\u00a0<\/span><\/em><span style=\"text-decoration: none;\">= the number of xylophones. <\/span><\/p>\n<p align=\"CENTER\"><span style=\"text-decoration: none;\">Let <\/span><em><span style=\"text-decoration: none;\">z\u00a0<\/span><\/em><span style=\"text-decoration: none;\">= the number of zithers. <\/span><\/p>\n<p align=\"CENTER\"><em>x<\/em> + <em>z<\/em> = 254<\/p>\n<p align=\"CENTER\">30<em>x<\/em> + 40<em>z <\/em>= 8,500<\/p>\n<p align=\"CENTER\">Standard Elimination Method<\/p>\n<p align=\"CENTER\">Matrix Method<\/p>\n<p align=\"CENTER\"><em>x<\/em> + <em>z<\/em> = 254<\/p>\n<p align=\"CENTER\">30<em>x<\/em> + 40<em>z <\/em>= 8,500<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p1_clip_image009.gif\" width=\"153\" height=\"49\" name=\"graphics2\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<p>The above equation can also be represented<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p1_clip_image012.gif\" width=\"161\" height=\"49\" name=\"graphics3\" align=\"BOTTOM\" border=\"0\" \/>.<\/p>\n<p>In order to solve the system using matrices, we use moves\u00a0(called row operations) similar to those on the left. The\u00a0following row operations are acceptable:<\/p>\n<ul>\n<li>switching one row for another<\/li>\n<li>multiplying any row by a constant<\/li>\n<li>adding two rows together<\/li>\n<\/ul>\n<p>These row operations may be used in combination.<\/p>\n<p>The amount of writing is reduced by committing the variables to\u00a0memory, removing the variables from the matrix, and writing the\u00a0matrix equation in augmented form as shown below.<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p1_clip_image015.gif\" width=\"112\" height=\"48\" name=\"graphics4\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<p>The row operations used to maneuver the matrix into reduced\u00a0echelon form are described below.<\/p>\n<ul>\n<li>Multiply the first equation by \u201330 and add it to the second.<\/li>\n<\/ul>\n<p align=\"CENTER\">\u201330<em>x<\/em> \u2013 30<em>z<\/em> = \u20137,620<\/p>\n<p align=\"CENTER\">30<em>x<\/em> + 40<em>z<\/em> = 8,500<\/p>\n<p align=\"CENTER\">10<em>z<\/em> = 880<\/p>\n<ul>\n<li>Multiply row 1 by \u201330 and add it to row 2. This new\u00a0row becomes row 2.<\/li>\n<\/ul>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p1_clip_image018.gif\" width=\"95\" height=\"48\" name=\"graphics5\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<ul>\n<li>Multiply the resulting equation by 0.1.<\/li>\n<\/ul>\n<p align=\"CENTER\"><em><span style=\"text-decoration: none;\">z<\/span><\/em><span style=\"text-decoration: none;\"><br \/>\n= 8<\/span>8<\/p>\n<ul>\n<li>Multiply row 2 by 0.1.<\/li>\n<\/ul>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p1_clip_image021.gif\" width=\"85\" height=\"48\" name=\"graphics6\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<p>This augmented matrix represents<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p1_clip_image024.gif\" width=\"124\" height=\"48\" name=\"graphics7\" align=\"BOTTOM\" border=\"0\" \/>,<\/p>\n<p align=\"CENTER\"><span style=\"text-decoration: none;\">meaning <em>x\u00a0+ z\u00a0= 254,<\/em><br \/>\n<\/span><span style=\"text-decoration: none;\"><br \/>\n<\/span><\/p>\n<div class=\"callout\">\n<h4>In order to solve a matrix using reduced row-echelon form:<\/h4>\n<p align=\"LEFT\">Use row operations and:<\/p>\n<ul>\n<li>First, focus on getting the initial entry in row 1 to be the number 1.<\/li>\n<li>Then work on getting the other entries in the first column to be 0.<\/li>\n<li>Next, work on\u00a0getting the second entry in row 2 to be the number 1, and follow\u00a0with getting the entries in column 2 that are under the initial 1\u00a0of row 2 to be 0. (Ignore the entries in column 2 that are above\u00a0the initial 1 in row 2.)<\/li>\n<li>Next work on getting\u00a0the third entry in row 3 to be the number 1 and follow with\u00a0getting the entries in column 3 under the initial 1 to be 0.\u00a0(Ignore the entries in column 3 that are above the initial 1 in<br \/>\nrow 3.)<\/li>\n<li>Continue in a similar manner through all the rows of the matrix.<\/li>\n<\/ul>\n<p align=\"LEFT\">When all rows are completed, use back-substitution\u00a0to determine the value of each variable.<\/p>\n<\/div>\n<h3>What is the Gauss-Jordan Elimination Method?<\/h3>\n<p>Reduced row-echelon form works well, but the Gauss-Jordan\u00a0method is better for those who do not like to do\u00a0back-substitution.<\/p>\n<p>The <abbr title=\"a method for simplifying a matrix in order to determine a solution to a matrix equation. \">Gauss-Jordan\u00a0elimination method<\/abbr> is similar to the reduced row-echelon\u00a0method, but avoids back-substitution by continuing the row\u00a0operations until the left side of the matrix has a diagonal (in a\u00a0negative slope) with entries of 1 and all other entries of 0. The\u00a0entries on the right side of the matrix may or may not be 0.<\/p>\n<p>The matrix below has been subjected to the Gauss-Jordan\u00a0elimination method. Notice how easy it is to read the solution to\u00a0this system of four equations.<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p2_clip_image003.gif\" width=\"129\" height=\"107\" name=\"graphics3\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<p align=\"CENTER\">The first variable is equal to \u20132.<\/p>\n<p align=\"CENTER\">The second variable is equal to 0.<\/p>\n<p align=\"CENTER\">The third variable is equal to 6.<\/p>\n<p align=\"CENTER\">The fourth variable is equal to<br \/>\n<img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p2_clip_image006.gif\" width=\"15\" height=\"41\" name=\"graphics4\" align=\"ABSMIDDLE\" border=\"0\" \/>.<\/p>\n<h3>How do you perform the Gauss-Jordan Elimination Method?<\/h3>\n<p>The approach is to start in the reduced row-echelon method\u00a0form, but instead of back-substitution, continue row operations.\u00a0The idea is to first focus on the column above the last initial\u00a0entry of 1. When all the entries in that row are 0, then do the\u00a0same on the column to the left. Continue moving to the left until\u00a0the final form is achieved.<\/p>\n<p>Let\u2019s look at the former example.<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p2_clip_image009.gif\" width=\"85\" height=\"48\" name=\"graphics5\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<p>For us to convert this matrix to the Gauss-Jordan elimination\u00a0final form, the only thing we need to do is make the second entry\u00a0in row 1 into a 0. We can achieve this by multiplying row 2 by \u20131\u00a0and adding it to row 1, thus replacing row 1.<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p2_clip_image012.gif\" width=\"87\" height=\"48\" name=\"graphics6\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<p align=\"CENTER\">This matrix can also be viewed as<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p2_clip_image015.gif\" width=\"124\" height=\"48\" name=\"graphics7\" align=\"BOTTOM\" border=\"0\" \/>.<\/p>\n<p align=\"CENTER\">Notice how easy it is to identify the solutions <em>x\u00a0= 166 and z = 88.<\/em><\/p>\n<h3>Let\u2019s try a more complicated example.<\/h3>\n<p>Solve the following system of equations using the Gauss-Jordan\u00a0elimination method.<\/p>\n<p align=\"CENTER\">2<em>a<\/em> + <em>b<\/em> + <em>c <\/em>= 5<\/p>\n<p align=\"CENTER\">2<em>a<\/em> + <em>b<\/em> \u2013 3<em>c<\/em> = 9<\/p>\n<p align=\"CENTER\">3<em>a<\/em> + 2<em>b<\/em> + 5<em>c<\/em> = 2<\/p>\n<p align=\"CENTER\">The matrix equation is<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p3_clip_image003.gif\" width=\"145\" height=\"75\" name=\"graphics3\" align=\"BOTTOM\" border=\"0\" \/>.<\/p>\n<p align=\"CENTER\">The augmented matrix is<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p3_clip_image006.gif\" width=\"107\" height=\"75\" name=\"graphics4\" align=\"BOTTOM\" border=\"0\" \/>.<\/p>\n<ul>\n<li>Use row operations to create 1 in the initial position of\u00a0row 1.<\/li>\n<\/ul>\n<p align=\"CENTER\">(Row 3 \u2013 row 1 becomes row 1.)<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p3_clip_image009.gif\" width=\"117\" height=\"75\" name=\"graphics5\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<ul>\n<li>Use row operations to create 0 in the first column, moving\u00a0down.<\/li>\n<\/ul>\n<p align=\"CENTER\">(\u20132 times row 1 + row 2 becomes row 2.)<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p3_clip_image012.gif\" width=\"132\" height=\"75\" name=\"graphics6\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<p align=\"CENTER\">(\u20133 times row 1 + row 3 becomes row 3.)<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p3_clip_image015.gif\" width=\"132\" height=\"75\" name=\"graphics7\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<p align=\"CENTER\">After the first row is complete, the second entry<br \/>\nin row 2 needs to become 1.<\/p>\n<p align=\"CENTER\">(\u20131 times row 2 becomes row 2.)<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p3_clip_image018.gif\" width=\"135\" height=\"75\" name=\"graphics8\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<ul>\n<li>Work to get 0 under the 1 in row 2.<\/li>\n<\/ul>\n<p align=\"CENTER\">(Row 2 + row 3 becomes row 3.)<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p3_clip_image021.gif\" width=\"119\" height=\"75\" name=\"graphics9\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<ul>\n<li>Next, make the third entry in row 3 into a 1.<\/li>\n<\/ul>\n<p align=\"CENTER\">(Multiply row 3 by 0.25.)<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p3_clip_image024.gif\" width=\"119\" height=\"75\" name=\"graphics10\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<ul>\n<li>The above matrix is in reduced echelon form. We continue\u00a0when using the Gauss-Jordan method. The task is to convert the\u00a0other positions on the left side of the matrix to zeroes,\u00a0beginning by moving up in column 3.<\/li>\n<\/ul>\n<p align=\"CENTER\">(\u201311 times row 3 + row 2 becomes row 2.)<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p3_clip_image027.gif\" width=\"107\" height=\"75\" name=\"graphics11\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<p align=\"CENTER\">(\u20134 times row 3 + row 1 becomes row 1.)<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p3_clip_image030.gif\" width=\"107\" height=\"75\" name=\"graphics12\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<ul>\n<li>By moving a column to the left, the entries above the\u00a0lowest 1 become 0.<\/li>\n<\/ul>\n<p align=\"CENTER\">(Row 1 \u2013 row 2 becomes row 1.)<\/p>\n<p align=\"CENTER\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/americanboard.org\/Subjects\/Images\/math\/5\/images\/s6_p3_clip_image033.gif\" width=\"107\" height=\"75\" name=\"graphics13\" align=\"BOTTOM\" border=\"0\" \/><\/p>\n<ul>\n<li>The solutions to the system of equations can be read from\u00a0this final form of the augmented matrix.<\/li>\n<\/ul>\n<p align=\"CENTER\"><em>a<\/em> = 5<\/p>\n<p align=\"CENTER\"><em>b<\/em> = \u20134<\/p>\n<p align=\"CENTER\"><em>c<\/em> = \u20131<\/p>\n<h3>Review of New Vocabulary and Concepts<\/h3>\n<ul>\n<li>The <em><strong>reduced\u00a0row-echelon form<\/strong><\/em>, also known as the row reduced\u00a0echelon form, of a matrix equation requires back-substitution in\u00a0order to develop the solution to the equation.<\/li>\n<li>The <em><strong>Gauss-Jordan\u00a0elimination method,<\/strong><\/em> while more complex and\u00a0time-consuming than reduced row-echelon method, develops a form\u00a0in which the solution is easy to identify and does not require\u00a0back-substitution.<\/li>\n<li>Both methods are ways to solve systems of linear\u00a0equations.<\/li>\n<\/ul>\n<\/section>\n<p><!-- CONTENT ENDS HERE --><\/p>\n<div class=\"advance\"><a class=\"button button-primary\" href=\"http:\/\/americanboard.org\/Subjects\/mathematics\/matrices-operations-and-inverses\">\u2b05 Previous Lesson<\/a>\u00a0<a class=\"button\" href=\"http:\/\/americanboard.org\/Subjects\/mathematics\/measurement-and-linear-algebra\">Workshop Index<\/a>\u00a0<a class=\"button button-primary\" href=\"http:\/\/americanboard.org\/Subjects\/mathematics\/geometric-interpretations\">Next Lesson \u27a1<\/a><\/div>\n<p><a class=\"backtotop\" href=\"#title\">Back to Top<\/a><\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>\u2b05 Previous Lesson\u00a0Workshop Index\u00a0Next Lesson \u27a1 Matrices for Systems of Equations Objective In this lesson, you will solve systems of linear equations using both the reduced row-echelon method and the\u00a0Gauss-Jordan elimination method. What\u00a0is reduced row-echelon form? Reduced\u00a0row-echelon form of a matrix is the form of a matrix in which: any row with all zeros is [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-205","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/americanboard.org\/Subjects\/mathematics\/wp-json\/wp\/v2\/pages\/205","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/americanboard.org\/Subjects\/mathematics\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/americanboard.org\/Subjects\/mathematics\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/americanboard.org\/Subjects\/mathematics\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/americanboard.org\/Subjects\/mathematics\/wp-json\/wp\/v2\/comments?post=205"}],"version-history":[{"count":9,"href":"https:\/\/americanboard.org\/Subjects\/mathematics\/wp-json\/wp\/v2\/pages\/205\/revisions"}],"predecessor-version":[{"id":770,"href":"https:\/\/americanboard.org\/Subjects\/mathematics\/wp-json\/wp\/v2\/pages\/205\/revisions\/770"}],"wp:attachment":[{"href":"https:\/\/americanboard.org\/Subjects\/mathematics\/wp-json\/wp\/v2\/media?parent=205"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}