More backwards functions: Unevaluating polynomials

Re:More backwards functions: Unevaluating polynomials by eliteraspberrie on Wednesday September 25, 2013 @12:18PM (#6445456)

Great article, very useful for someone learning Scala like myself. If I understood correctly this is an example of polynomial interpolation. One method of solving is Neville's algorithm.

[ Parent | on HN ]

Re:More backwards functions: Unevaluating polynomials by pm90 on Wednesday September 25, 2013 @01:54PM (#6446147)

Polynomial Interpolation:

Input: a set of points

Output: polynomial that passes through all points of Input

Here, since the input are just two numbers, I don't think it is polynomial interpolation.

[ Parent | on HN ]

Re:More backwards functions: Unevaluating polynomials by gohrt on Wednesday September 25, 2013 @05:44PM (#6447483)

2 numbers, plus the assumption that the cooefficients are smaller than some amount, plus luck. It is interpolation with an underconstrained solution

[ Parent | on HN ]

Re:More backwards functions: Unevaluating polynomials by brianpgordon on Wednesday September 25, 2013 @09:18PM (#6448350)

With the constraint that none of the coefficients are negative there's no element of luck.

[ Parent | on HN ]

Re:More backwards functions: Unevaluating polynomials by gohrt on Tuesday October 01, 2013 @01:51PM (#6477810)

    f(x) = x^2 + 11x

OR f(x) = x

    f(10) = 110

     = 1 * 10^2 +  1 * 10^1
     = 0 * 10^2 + 11 * 10^1

    f(0) = 0
     = 1 * 0^2 +  1 * 0^1
     = 1 * 0^2 + 11 * 0^1

[ Parent | on HN ]