MATRIX METHODS   (15-MATH-276-001)   Winter, 2010

 

          The Class Room and Class Times are Room 800 of Swift Hall

on Mondays, Wednesdays, and Fridays at 11:00-11:50 a.m.

from Monday, January 4  through Friday, March 12 (except January 18)

with a final examination in Room 800 of Swift on March 15 at 1:30-3:30 p.m. 

 

Teacher:  Roger Chalkley

Office:   Room 822A, Old Chemistry Building 

Telephone:   (513) 556-4074

Office Hours: 11:00-11:59 a.m. on Tuesdays and Thursdays and

                        12:00-12:30 p.m. on Mondays, Wednesdays, and Fridays

 

Textbook: Matrix Methods – Applied Linear Algebra,

 by Richard Bronson and Gabriel B. Costa,  3rd Ed., Academic Press, Boston, 2009.

 

Subject matter to be covered:  See the second page

 

Testing and Grading Policy:  Grades are to be based on two 50-minute midterm examinations (Test 1, Test 2), and a two-hour final examination.

     Test 1 will be given on January 29 at 11:00-11:50 a.m.

     Test 2 will be given on February 26 at 11:00-11:50 a.m.

     The final examination is scheduled for Monday, March 15th, at 1:30-3:30 p.m.

Test 1 and Test 2 will each contribute 25% to the eventual grade; and, the final examination will account for 50% of the grade.  There will be no substitute examinations.

If you miss a single 50-minute examination, the final will count as 70% of your grade

 

Pocket calculators and other such aids are prohibited during the examinations.

 

Withdrawals:  A withdrawal with passing status (W) will be permitted till Tuesday, March 2.  After that date, withdrawal slips cannot be processed. 

_______________________________________________________________

_______________________________________________________________                                        

The University of Cincinnati desires that each person preparing a course syllabus also include the following information.

 

General Education:  This course was designed following the guidelines of the University of Cincinnati General Education Program. It satisfies, or partially satisfies the Quantitative Reasoning distribution requirement.

Academic Integrity:  The University Rules, including the Code of Conduct, and other documented policies of the department, college, and university related to academic integrity, will be enforced. Any violation of these regulations, including acts of plagiarism or cheating, will be dealt with on an individual basis according to the severity of the misconduct.

Special Needs Policy:  Students with special needs should meet with the instructor as soon as possible to arrange for reasonable provisions to ensure an equitable opportunity to meet all of the requirements of this course. At the discretion of the instructor, some accommodations may require prior approval by Disability Services.

Sections and Problems

 

Section 1.1              Problems 1 through 9

Section 1.2             Problems 1 through 27

Section 1.3             Problems 1 through 34

Section 1.4             Problems 1 through 33

Section 1.5             Problem 4

 

Section 2.1             Problems 1 through 9

Section 2.2             Problems 1 and 2

Section 2.3             Problems 1, 4, 7, 10, 13, 16, 19, 22, 25, 31

Section 2.5             Problems 1, 5, 10, 15, 20, and 24 through 32 as well as 40 through 42

Section 2.6             Problems 16, 17, 30

Section 2.7             Problems 1, 3, 5, 7, 9

Section 2.8             (no problems)

 

Section 3.1             Problems 1, 3, 5, 6, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29

Section 3.2             Problems 1, 4, 7, 10, 13, 16

Section 3.3             Problems 1, 3, 6, 12

Section 3.4             Problems 11 and 17

Section 3.6             (no problems)

 

Section 5.1             Problems 1, 5, 10, 20, 25, 27

Section 5.2             Problems 1, 4, 8, 12, 16, 20, 24

Section 5.3             Problems 1 through 13

Section 5.4             Problems 1, 3, 5, 8, 12, 13, 16, 19, 20

Section 5.5             Problems 1, 7, 10, 13, 15, 17, 18, 19

Section 5.6             Problems 1, 8, 11

Section 5.7             (no problems)

 

Section 6.1             3, 4, 7, 8

Section 6.2             1, 6, 8, 10, 19, 25, 35

Section 6.3             1, 3, 5, 8, 9, 13, 26, 27

Section 6.4             1, 3, 5, 6, 7, 8, 9, 12, 17, 19

Section 6.5             1, 4, 6, 12, 15, 17

 

(and if time is available)

Section 7.1             1, 2, 4, 5, 6, 7, 8, 9, 13, 15

Section 7.2             1, 4        

Section 7.3             1,2, 3, 4, 5, 6, 23

Section 7.4             1, 2, 3, 4, 11

Section 7.5             1, 3, 6, 13, 14, 15

Section 7.6             1, 3, 7

Section 7.7             1

Section 7.8             1

Section 7.9             1, 2

 

Section 8.4             Problem 7