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: Gene Wirchenko <genew_at_ocis.net>
Date: Thu, 03 May 2007 09:13:39 -0700
Message-ID: <1c2k33htrvffkgmdjjbrn76ieujoqspc81@4ax.com>


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.)

Sincerely,

Gene Wirchenko

Computerese Irregular Verb Conjugation:

     I have preferences.
     You have biases.
     He/She has prejudices.
Received on Thu May 03 2007 - 11:13:39 CDT

Original text of this message

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