0
votes
1answer
43 views

Error bound of the Euler method

I am self studying working through the book "A First Course in the Numerical Analysis of Differential Equations" and have come to a deadend on q 1.2. The linear system $y' = Ay, y(0) = y_0$, where ...
1
vote
2answers
53 views

How does big-O notation relate to the actual error involved in a numerical differentiation?

Suppose I have some position data ${x_1, x_2, ... x_n}$ that was sampled at an interval $h$. If I wanted the velocity data, I could apply a finite difference scheme: $ v_1 = \frac{x_2 - x_1}{h} + ...
2
votes
1answer
36 views

Verlet method global error

I was trying to understand the global error calculation for the verlet method on Wikipedia but it's not so clear to me when it goes from: to Shouldn't be considered the error relative to x'' too? ...
1
vote
0answers
43 views

Finite difference method - implementation and stability

I have a PDE for a function $P(r,t)$ in spherical co-ordinates of the form $P_{t} = D(P_{rr} + (2/r)P_{r}) - a\Omega\left(\frac{P}{P + k} \right) $ where subscripts denote partial derivative with ...
0
votes
0answers
68 views

Numerical Error in Computation - What Are the Students' Expected to Know?

I'm going to conduct an educational research about math undergraduates' conceptions about "numerical error." So I'm making a list of items I think someone with a BSc in mathematics is expected to know ...
1
vote
0answers
58 views

When examining global error bounds for Euler method, can I rescale the domain limits?

I'm looking at provable global error bounds of the Euler method for the first time and I was surprised to find that the bound grows exponentially in the amount of time (the domain size) propagated ...
1
vote
0answers
163 views

Problem Condition and Algorithm Stability

Consider 2 mathematical problems: $$ f_1(x) = a - x \\ f_2(x) = e^x -1 $$ The condition number for a function is defined as follows: $$ k(f) = \left| x \cdot \frac{f'}{f} \right| $$ Lets analyze ...
0
votes
1answer
666 views

Proving the relative error of division.

The problem says to show that the relative error for division on a computer is $$Rel(\frac{x_{A}}{y_{A}})=\frac{Rel(x_{A})-Rel(y_{A})}{1-Rel(y_{A})}$$ $$\approx Rel(x_{A})-Rel(y_{A})$$ provided ...
1
vote
1answer
918 views

Error analysis - Bisection algorithm

I have a brief question related to an example in my textbook. In my book, the following theorem on Bisection Method is presented: If $[a_0,b_0], [a_1,b_1],. . .,[a_n,b_n]. . .$ denote the intervals ...