AMATH 301 Summer 2026 Final Exam Knowledge Checklist Flashcards

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
full-widthPodcast
1
Card Sorting

1/15

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 7:37 AM on 8/21/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

16 Terms

1
New cards

TypeError

An error message indicating that an operation or function is applied to an object of an inappropriate type, which can involve int, float, or str types.

2
New cards

Floating-point arithmetic error

Small errors introduced during numerical computations that require the application of a tolerance check when comparing values.

3
New cards

Discretization

The process of representing a continuous function f(x)f(x) for x×[a,b]x \times [a, b] using discrete parameters including aa, bb, NN, and x\triangle x.

4
New cards

np.linspace

A NumPy function used to discretize a continuous function into an array of evenly spaced points.

5
New cards

Matplotlib Figure vs. Axes

The distinction in plotting where the figure is the overall window while the axes are the specific subplots used for data representation, typically created using fig,ax=plt.subplots()fig, ax = plt.subplots().

6
New cards

Modularity

The improvement in code structure and reusability achieved by implementing Python functions.

7
New cards

Newton's Method

An iterative root-finding algorithm derived from the root of the tangent line at xkx_k, defined by the formula xk+1=xkf(xk)f(xk)x_{k+1} = x_k - \frac{f(x_k)}{f'(x_k)}.

8
New cards

Bisection Method

A root-finding algorithm that repeatedly divides an interval in half and selects the subinterval containing the root.

9
New cards

First-order forward difference

A finite difference scheme for approximating a derivative defined by f(x)×f(x+h)f(x)h+O(h)f'(x) \times \frac{f(x+h)-f(x)}{h} + O(h), which is first-order accurate.

10
New cards

First-order backward difference

A finite difference scheme for approximating a derivative defined by f(x)×f(x)f(xh)h+O(h)f'(x) \times \frac{f(x)-f(x-h)}{h} + O(h), which is first-order accurate.

11
New cards

Second-order centered difference

A finite difference scheme for approximating a derivative defined by f(x)×f(x+h)f(xh)2h+O(h2)f'(x) \times \frac{f(x+h)-f(x-h)}{2h} + O(h^2), derived from calculating the secant line between two points.

12
New cards

Truncation Error

The error introduced by approximating a continuous mathematical process with a finite one, distinct from round-off or coding errors.

13
New cards

Big-O Notation

A mathematical notation used to describe the order of accuracy of numerical schemes, such as finite difference methods.

14
New cards

Loglog plots

Plots where both axes use logarithmic scales, used to reveal the relationship between variables through the slope, specifically the order of accuracy.

15
New cards

Trapezoidal Rule

A numerical integration rule derived from averaging the left-hand and right-hand rectangle rules

16
New cards