Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: A new proof of the superiority of set oriented approaches: numerical/time serie linear interpolation

Re: A new proof of the superiority of set oriented approaches: numerical/time serie linear interpolation

From: Bob Badour <bbadour_at_pei.sympatico.ca>
Date: Thu, 03 May 2007 13:40:17 -0300
Message-ID: <463a1041$0$4045$9a566e8b@news.aliant.net>


Gene Wirchenko wrote:

> Bob Badour <bbadour_at_pei.sympatico.ca> wrote:
>
> [snip]
>
>

>>Interpolation has a number of other traps. Suppose one evaluates:
>>f(x) = (x-1)/(x-1) at x=0 and x=2. One will reach a vastly wrong 
>>conclusion if one even tries to interpolate f(1).

>
> What about if we limit it to functions? Your f is not a
> function, because 1 is not in the domain. (I am assuming a general
> (for lack of a better word) domain, such as N, Z, Q, or R.)

If 1 were not in the domain, one would have no desire to interpolate to it in the first place. That sounds like ignoring the problem by defining it out of existence. Received on Thu May 03 2007 - 11:40:17 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US