The product of all xs[j] with j != k.
"""
- return product([xs[k] - xs[j] for j in range(0, len(xs)) if j != k])
+ return product( xs[k] - xs[j] for j in range(len(xs)) if j != k )
def lagrange_coefficient(k, x, xs):
A symbolic expression of one variable.
+ SETUP::
+
+ sage: from mjo.interpolation import lagrange_coefficient
+
TESTS::
sage: xs = [ -pi/2, -pi/6, 0, pi/6, pi/2 ]
def lagrange_polynomial(x, xs, ys):
"""
- Return the Lagrange form of the interpolation polynomial in `x` of
+ Return the Lagrange form of the interpolating polynomial in `x`
at the points (xs[k], ys[k]).
INPUT:
A symbolic expression (polynomial) interpolating each (xs[k], ys[k]).
+ SETUP::
+
+ sage: from mjo.interpolation import lagrange_polynomial
+
TESTS::
sage: xs = [ -pi/2, -pi/6, 0, pi/6, pi/2 ]
- sage: ys = map(sin, xs)
+ sage: ys = list(map(sin, xs))
sage: L = lagrange_polynomial(x, xs, ys)
sage: expected = 27/16*(pi - 6*x)*(pi - 2*x)*(pi + 2*x)*x/pi^4
sage: expected -= 1/8*(pi - 6*x)*(pi - 2*x)*(pi + 6*x)*x/pi^4
True
"""
- ls = [ lagrange_coefficient(k, x, xs) for k in range(0, len(xs)) ]
- sigma = sum([ ys[k] * ls[k] for k in range(0, len(xs)) ])
- return sigma
+ ls = [ lagrange_coefficient(k, x, xs) for k in range(len(xs)) ]
+ return sum( ys[k] * ls[k] for k in range(len(xs)) )
A polynomial in ``x`` which interpolates ``f`` at ``xs``.
+ SETUP::
+
+ sage: from mjo.interpolation import lagrange_interpolate
+
EXAMPLES:
We're exact on polynomials of degree `n` if we use `n+1` points::
Assuming some function `f`, compute the coefficients of the
divided difference f[xs[0], ..., xs[n]].
- TESTS:
+ SETUP::
+
+ sage: from mjo.interpolation import divided_difference_coefficients
+
+ TESTS::
sage: divided_difference_coefficients([0])
[1]
[1/2/pi^2, -1/pi^2, 1/2/pi^2]
"""
- coeffs = [ QQ(1)/lagrange_denominator(k, xs) for k in range(0, len(xs)) ]
- return coeffs
+ return [ ~lagrange_denominator(k, xs) for k in range(len(xs)) ]
def divided_difference(xs, ys):
The (possibly symbolic) divided difference function.
+ SETUP::
+
+ sage: from mjo.interpolation import divided_difference
+
TESTS::
sage: xs = [0]
- sage: ys = map(sin, xs)
+ sage: ys = list(map(sin, xs))
sage: divided_difference(xs, ys)
0
sage: xs = [0, pi]
- sage: ys = map(sin, xs)
+ sage: ys = list(map(sin, xs))
sage: divided_difference(xs, ys)
0
sage: xs = [0, pi, 2*pi]
- sage: ys = map(sin, xs)
+ sage: ys = list(map(sin, xs))
sage: divided_difference(xs, ys)
0
We try something entirely symbolic::
- sage: f = function('f', x)
+ sage: f = function('f')(x)
sage: divided_difference([x], [f(x=x)])
f(x)
sage: x1,x2 = SR.var('x1,x2')
A symbolic expression.
- TESTS:
+ SETUP::
+
+ sage: from mjo.interpolation import lagrange_polynomial, newton_polynomial
+
+ TESTS::
sage: xs = [ -pi/2, -pi/6, 0, pi/6, pi/2 ]
- sage: ys = map(sin, xs)
+ sage: ys = list(map(sin, xs))
sage: L = lagrange_polynomial(x, xs, ys)
sage: N = newton_polynomial(x, xs, ys)
sage: bool(N == L)
True
"""
- degree = len(xs) - 1
-
- N = SR(0)
-
- for k in range(0, degree+1):
- term = divided_difference(xs[:k+1], ys[:k+1])
- term *= lagrange_psi(x, xs[:k])
- N += term
-
- return N
+ return sum( divided_difference(xs[:k+1], ys[:k+1])*lagrange_psi(x, xs[:k])
+ for k in range(len(xs)) )
def hermite_coefficient(k, x, xs):
A symbolic expression.
- TESTS:
+ SETUP::
+
+ sage: from mjo.interpolation import hermite_interpolant
+
+ TESTS::
sage: xs = [ 0, pi/6, pi/2 ]
- sage: ys = map(sin, xs)
- sage: y_primes = map(cos, xs)
+ sage: ys = list(map(sin, xs))
+ sage: y_primes = list(map(cos, xs))
sage: H = hermite_interpolant(x, xs, ys, y_primes)
sage: expected = -27/4*(pi - 6*x)*(pi - 2*x)^2*sqrt(3)*x^2/pi^4
sage: expected += (5*(pi - 2*x)/pi + 1)*(pi - 6*x)^2*x^2/pi^4
True
"""
- s1 = sum([ ys[k] * hermite_coefficient(k, x, xs)
- for k in range(0, len(xs)) ])
+ s1 = sum( ys[k] * hermite_coefficient(k, x, xs)
+ for k in range(len(xs)) )
- s2 = sum([ y_primes[k] * hermite_deriv_coefficient(k, x, xs)
- for k in range(0, len(xs)) ])
+ s2 = sum( y_primes[k] * hermite_deriv_coefficient(k, x, xs)
+ for k in range(len(xs)) )
return (s1 + s2)
"""
- return product([ (x - xj) for xj in xs ])
+ return product( (x - xj) for xj in xs )