Notes/UNB/Year 5/Semester 1/CS3113/Midterm 1 Review.md

# Definitions and Concepts
- Floating point number
- Convergence, conditioning, complexity
- Why is it important? We make the numerical methods to approximate the real answer (Convergence). For condition, when an approximation is made, when we make minor modifications to the input, we expect not a lot of variance in the in output. Complexity is the amount of time (CPU?) that a computer will need to use a method (Big O?)
- Main components of a floating point number?
	- 
- Machine epsilon
- Loss of significant bit. Truncation

Methods of root finding

| Bisection | Final point   | Newton        | Secant        |
| --------- | ------------- | ------------- | ------------- |
| Guarentee | Not Guarentee | Not guarentee | Not guarentee |
| Linear    | linear        | quatdratic    | super linear  |
| Slow      |               | Fast          | Fast          |
2024-10-11 08:53:21 2024-10-11 08:53:21 -03:00			`# Definitions and Concepts`
			`- Floating point number`
			`- Convergence, conditioning, complexity`
			`- Why is it important? We make the numerical methods to approximate the real answer (Convergence). For condition, when an approximation is made, when we make minor modifications to the input, we expect not a lot of variance in the in output. Complexity is the amount of time (CPU?) that a computer will need to use a method (Big O?)`
			`- Main components of a floating point number?`
			`-`
			`- Machine epsilon`
2024-10-11 09:06:45 2024-10-11 09:06:46 -03:00			`- Loss of significant bit. Truncation`

			`Methods of root finding`

			`\| Bisection \| Final point \| Newton \| Secant \|`
			`\| --------- \| ------------- \| ------------- \| ------------- \|`
			`\| Guarentee \| Not Guarentee \| Not guarentee \| Not guarentee \|`
			`\| Linear \| linear \| quatdratic \| super linear \|`
			`\| Slow \| \| Fast \| Fast \|`