MESSAGE
| DATE | 2015-03-16 |
| FROM | Ruben
|
| SUBJECT | Subject: [NYLXS - HANGOUT] Fwd: Gaussian Elimination and the Inner Product
|
-------- Forwarded Message --------
Subject: Gaussian Elimination and the Inner Product
Date: Mon, 16 Mar 2015 13:03:27 +0000
From: Coding the Matrix: Linear Algebra through Computer Science
Applications Course Team
To: Ruben Safir
Ruben Safir,
The latest information from Coding the Matrix: Linear Algebra through
Computer Science Applications
by Brown University
on Coursera.
In this part of the course, we develop the algorithmic ideas that enable us
to solve computational problems, some that have occupied our minds for
quite a while, and some new ones.
This week there are four assignments, but they are each quite small, so the
Statement of Accomplishment requirements are somewhat relaxed. For this
week, you are graded not on your score on each assignment separately, but
on all the assignments combined together. There are eighteen
problems/tasks being assigned this week, so you should aim for successfully
completing at least 60% of them--or about 11 problems/tasks--to meet the
requirements. (Same idea for distinction.)
This week comprises two units, Gaussian Elimination and The Inner Product.
For each, there is a short problem set: Gaussian_Elimination_problems and
The_Inner_Product_problems.
There are two labs this week, but neither is very complicated. The
Secret-Sharing Lab can be done before the lectures since it does not depend
conceptually on the new material---it builds on the idea of dimension and
matrix invertibility--but the module it uses, independence, is written
using the algorithmic ideas outlined in Gaussian Elimination. The
Factoring Lab does explicitly use a module, echelon, that we develop in
Gaussian Elimination, and I outline the ideas for factoring at the end of
the lectures on Gaussian Elimination, but you can in principle carry out
this lab before mastering the concepts in Gaussian Elimination. This second
lab involves some tricky ideas---after all, the problem of integer
factoring has been known for over two hundred years and you're learning the
rudiments of an algorithm (Dixon's) that was only published in 1981---but
we guide you through these ideas with an example.
There will be a lab next week that builds on The Inner Product.
Have fun! Those of you with lots of compute power and RAM and patience can
try factoring some integers that are considerably larger than the ones
given in the Lab Assignment--or pose challenges to your fellow students.
Visit the course to start learning
Go to Class
[facebook]
[twitter]
[blog]
[blog]
Unsubscribe
• Visit support
• Discuss the course in class forums
• Please do not reply directly to this email
Copyright (c) 2015 Coursera, Inc | 381 E. Evelyn Avenue, Mountain View, CA
94041 USA
|
|
