Jump to content

Talk:Discretization error

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ahmedlasheen (talk | contribs) at 11:14, 1 October 2008 (Difference between Discretization Errors and Quantization Errors: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Stub‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

when we define the derivative of f(x) as f'(x) = lim h->0 [f(x+h)-f(x)]/h or f'(x) is approximately equal to [f(x+h)-f(x)]/h, where h is a finitely small number. The difference between the first formula and this approximation is known as discretization error.

Rk158903 (talk) 16:16, 29 September 2008 (UTC)[reply]

Difference between Discretization Errors and Quantization Errors

Discretization Error
Real number has an important property called density property that says that between any two real number there is a another real number .and so on to infinity if a and b are two real number then there exist another real number c which is equal to .and also there exist another real number d which equal to and so on to infinity. this is in mathematics but in computation it is different we cannot say that there is a line we theoretically contains an infinite number of steps instead we have a something called grid or lattice or mesh .
Quantization Errors
It is errors arises due the limitation of floating point representation , it is two types truncation error and round off error.