1.1-1.2, due on September 8

Difficulty
I completed the reading. It's still difficult for me to see how to design values of N to show that a function is little-oh of another function. I see how it reduces the algebra later, but I have a hard time coming up with it on my own. In 1.2, the discussion of the convergence of the Gregory-Leibniz formula was hard to understand. I got lost where it began treating error at odd and even values of k.

Reflection
Something I thought was interesting from the text was Proposition 1.1.8. That, coupled with Example 1.1.5 (vi), made it clear to me how to understand the order of functions with respect to big and little oh. If a function is little oh to another, I feel like that means I can find a smaller function to compare it to. If the quotient of the two functions approaches infinity, I know the function grows too quickly for the function we're comparing it to. Basically, the comparison makes a lot more sense now.

Comments

Post a Comment

Popular posts from this blog

8.7, due on December 11

I see the graphs of the Daubechies db2 scaling function, but I really don't understand how to use it since there's no definition that I can easily look at. We'll need to talk about that in class in order for me to understand it. Also, the proof for 8.7.5(iv) was long and I couldn't follow the algebra very well. The idea that you can use any version of the wavelets you want to reproduce the function you're looking at is very powerful. It's interesting to see such a complicated function like the Daubechies function be used. I'd like to know more about how to choose a function that works well for different types of data.
Read more

Finals preparation, due on December 13

The most important things I learned in this course were big-Oh notation, the Master Theorem, the various algorithm styles available, and probability theory. To review for the test I'll make a list of important theorems and definitions to memorize, and practice proving simple facts about each of them. I'll also go over past tests and make sure I could get 100% on them. In class tomorrow I'd like to go over an example of Monte Carlo integration. I feel like in this class I've learned how to apply the mathematics I've learned to real-world problems, more than in any other class I've taken. I feel that way because I'm most interested in using computers to solve problems, and the principles we've talked about this semester have been foundational to my understanding of how to do that.
Read more

8.4, due on December 4

Now I know what antialiasing is in computer graphics! It makes so much sense now. It's cool to see how something as simple as the Nyquist value can tell you so much about the parameters of a given problem. The methods for antialiasing are intuitive as well, kind of in the same way as least-square solutions were in Volume 1. It would be nice to get some intuition for why the Nyquist rate is twice the Nyquist value, and why the function becomes uniquely determined at that point and not before. Also, I'd like to run through a full example in class of how we can sample from a function, find the DFS, and perform ant-aliasing. That would help me understand the process a little better than before.
Read more