gibson:teaching:fall-2012:math445:pf1
====== Differences ====== This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
gibson:teaching:fall-2012:math445:pf1 [2012/12/05 13:02] gibson |
gibson:teaching:fall-2012:math445:pf1 [2012/12/05 13:23] (current) gibson |
||
|---|---|---|---|
| Line 40: | Line 40: | ||
| network of websites. | network of websites. | ||
| - | <network-of-links figure here> | + | {{:gibson:teaching:fall-2012:math445:network2.png?direct&300}} |
| 15. Write Matlab code that converts the connectivity matrix //C// to a | 15. Write Matlab code that converts the connectivity matrix //C// to a | ||
| Line 60: | Line 59: | ||
| {{:gibson:teaching:fall-2012:math445:fig1.png?direct&300}} | {{:gibson:teaching:fall-2012:math445:fig1.png?direct&300}} | ||
| - | Bonus: express exponential functions as powers of //e// rather than | + | |
| - | powers of 10. Use $e^{2.3}\approx 10$ to convert between the two. | + | |
| 18. How would you graph the function $y(x) = x^c$, in a way that highlights | 18. How would you graph the function $y(x) = x^c$, in a way that highlights | ||
| Line 119: | Line 117: | ||
| <latex> | <latex> | ||
| - | y_i = \sum_{j=1} A_{ij} x_j | + | y_i = \sum_{j=1}^N A_{ij} x_j |
| </latex> | </latex> | ||
| - | for each component $y_i$ of the //M// dimensional vector $y$. But don't that | + | for each component $y_i$ of the //M// dimensional vector $y$. But don't code that |
| - | formula directly! Instead start your code with | + | formula directly! Instead start your function with |
| <code> | <code> | ||
| Line 130: | Line 128: | ||
| </code> | </code> | ||
| - | and write the matrix-vector multiplication as a loop over the $K$ nonzero elements | + | and write the matrix-vector multiplication as a loop over the K nonzero elements |
| - | of $A$. | + | of A. |
gibson/teaching/fall-2012/math445/pf1.1354741334.txt.gz · Last modified: 2012/12/05 13:02 by gibson
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 3.0 Unported
