Sunday, 30 September 2018

Section 3.2: Tree and Tree-Based Data Structures

Difficult:
 Some of the statements seem trivial. Which makes it hard to know how to prove them. Maybe it is just that they all sound the same since it is new vocabulary.
I want to understand the calculation of the complexities better. Especially with the linked lists.


Insights:
I like that the labs are complementing the matrial in this book. I liked the visualization data as trees. Trees are undirected and rooted trees are drawn upside down so that there is no need to draw arrows. The arrows are more for the direction the tree grows and not the direction of the edges. This is my hypothesis.

Friday, 28 September 2018

Section 3.1: Theory of Graphs

Difficult:
There wasn't anything too difficult in this section. I will have to take a look at Adjacency Matrices tomorrow to understand them better. I think it is really cool how we can represent walks beween vertices.

Insightful:
I really like the graphs. They are like mathematical puzzles. I hope the application can be used through out my work becauset they are kind of fun.

Tuesday, 25 September 2018

Section 2.1: The Gamma Function and Stirling's Approximation

Difficult:
There are a lot of claims with inequalities that I don't find as obvious as the author. This was probably intentional since it is one of the exercises to prove them. This is the most intimidating section so far.

Understanding:
We are giving bounds to functions we are unsure of behavior and trying to reduce this bound as much as possible. The gamma function has very interesting properties stated in Remark 2.1.6.

I spend 5-6 hours on each homework assignment
The lectures and readings do provide the tools to solve the problems. I am very impressed by that since 341 did not feel that way.
It helps to try the problems for 30 minutes by myself then work in a group.
A goal for myself is to start the homework before the lecture.

Saturday, 22 September 2018

Section 1.10: Divide and Conquer

Difficult:
I haven't coded much with recursion so it all felt very foreign to me. I will need to code a couple of these to know what the function is doing, especially at the return. I will go back to the algorithms in the book after I code a couple of simple recursive functions.

Insightful:
The Master theorem is a method to compute the asymptotical complexity of big-O. I still don't understand the notation for complexity (T(n)).
It is interesting how more operations makes the code run faster and more efficiently.

Thursday, 20 September 2018

Section 1.9: Primes and Remainders

Importance:
Prime numbers are fascinating. I once wrote up an excel sheet with a list of natural numbers and tried to see some patter between them. 

Difficult:
Remark 1.9.8 I don't see why all those options are equal. Got it, there is a comma in between separating them. The algorithm for finding Inverses in Zn skips a lot of steps. I can't see what they do with the 31 in the last line. Potentially splitting it up and grouping part together.



Reflexive:
Substitution Rule looks like a fun one you can impress your friends with. Learned a cool new algorithm thanks to it. I had no idea mod would have so much overlap with prime numbers.

Tuesday, 18 September 2018

1.8 Division and Divisors

Importance:
I can see these methods for dividing being useful in solving problems... I still don't see which ones, but I can feel it.

Difficult:
The proof for Division Theorem will require me to go over it again in order to understand it better. I believe is just getting used to a,b,q, and r. Overall these proofs are hard to read. The lemma 1.8.14 was the hardest of them all. I don't understand why we need this new notation. 

Reflexive:
Most of this chapter was a review of 290 and concepts that I found fascinating. Like the fact that we still use the Euclidean algorithm because we still haven't found anything faster is really impressive. We have improved many methods for computing certain values, but this one is still the fastest and least computationally heavy and it was discovered 300 B.C. Remarkable.

Saturday, 15 September 2018

Section 1.7: Products and Counting

Importance:
Products can be useful for probability and shorthand to incredibly long addition. The Pascal triangle is a very useful tool that I want to understand better.

Difficult:
When choosing combinations and rearrangements, the most difficult part is knowing what to put in the denominator. As I understand it, we have any repeats on the denominator and using the factorial function on them. This is when they are not dependent on the other. When they are in sequence then you just multiply the different options which have no need of the equation but it can still be used.


Reflexive:
Taking the idea of the multiplication rule, where the product of the Cartesian product has a cardinality of the cardinality of the sets used for the product. We can know how many possible combinations of phone numbers there can be. Each spot can be a number between 0-9 inclusive. Therefore the cardinality of the different combinations inside the set of all telephone numbers is 10,000,000,000. We are not going to need to bump up an extra digit for a while.

Thursday, 13 September 2018

1.5 Nested Loops

Importance:
Most of the coding I've done to solve a wide variety of problems have involved nested loops. We can use sums to compute the complexity of these algorithms.

Difficult:
I read FLOPs like 20-30 times but I am still having a hard time remembering the system. It stands for Floating-Point Operations. This is similar to the temporal complexity then. It does all the basic arithmetic on numbers that are not necessarily integers. After writing this, I feel more confident about FLOPs.


Reflexive:
I am starting to see the importance of leading term coefficients. If there is a part of your code that runs at a degree lower than your leading term it is no longer the place you should be focusing on. I learned about LU decomposition in a numerical methods class. We did not go into the theory very much so I am looking forward to using it more and understanding it better. Very cool how changing the order of the nested loop can affect FLOPs. As well as what is inside the loops, which is not as easy to see in a nested for loop.

Tuesday, 11 September 2018

Section 1.4: REindexing and Changing Order of Summation

Importance:
At times we can facilitate a summation by changing the bounds of summation.

Difficult:
The tables took a good 10-20 minutes to convince myself that they were the same thing. This was for the last two figures. The first one was not bad. It is just difficult to keep track of the order of operations.
Practice will help me to know what can be done and how it should be done.

Reflexive:
This is a useful method when you have closed-form equation for a series but it doesn't match it exactly. In which case it would be a shortcut to having to re-calculate.
It is interesting how in order to change the summation order we have to change the indices. I am starting to think of them as a nested loop but the idea escapes me at times.
example 1.4.13 does a good job of demonstrating how changing the order of the summations can simplify the problem as stated in the chapter summary.

Saturday, 8 September 2018

Section 1.3 Summation

Importance:
The summation of complexity is important when algorithms become complex because it becomes more difficult to calculate all at once.

Difficult:
 The definition of the Difference Operator. It seems like the set up for the definition is not used at all during the definition. I am still trying to piece it together. The example in the chapter helps with the understanding of the definition but the set up is still confusing.
Right now the notation is what I am getting caught up on. I feel the same way about the fundamental theorem of finite calculus as I did for the definition of difference operator.


Reflexive:
Very cool how the difference operator represents the derivative of a function. It is a very simple math operation but it represents it well.
Looking forward to the pattern for finding the equations that represent higher order differentiation through the fundamental theorem of finite calculus.

Thursday, 6 September 2018

Sections 1.1-1.2

Starting with the difficult part of 1.2
In the algorithm 1.2.1 I don't see how one of the lists ends up being empty.

This is teaching us about the equivalence relation (~) between leading-order coefficients. As I understand it there is a way to state simply what is the difficulty of the algorithm. For example 3x^2 -3 ~ 3x^2. We don't really worry about the lower power terms.

The chapter does a good job at showing how the same outcome can be achieved by two different algorithms. It also shows that one is superior by decreasing the big O leading coefficient.

From chapter 1.1 examples 1.1.10 and 1.1.11 were the hardest to understand but the most useful for understanding how to prove these types of problems. These examples were what gave me the tools to solve the homework proof problems.

I found the proposition 1.1.3 very useful in helping undertand the concepts of big-O and little-0.

I am now realizing that I have more to understand about temporal and spatial complexity since I had difficulty explaining part b) of 1.6 and I have my doubts as to whether I understood the implementation during 1.2. I will make sure to ask more question on the subject in the days to come.

Introduction


My Name is Isaac Becker and I am studying applied computational mathematics

This is my fourth year at BYU and I am in the junior core of ACME (applied computational mathematics emphasis)

I have taken all pre-requisites to ACME which include:
Calc 2
Calc 3
Linear Algebra
Differential equations
Math 290
Theory of Analysis

I chose ACME because I want to have a foundation in mathematics before I go into the field of engineering. I am most passionate about modeling and I want to have the competitive skills that ACME is providing.

The professors that provide examples and time during class to have a final answer have had the biggest influence in my learning.

Something interesting about me is that I was on a rowing team in highschool 

Plenty of TA hours and the professor's office hours work for me!